The intelligent reflecting surface (IRS)-assisted millimeter wave (mmWave) communication system has emerged as a promising technology for coverage extension and capacity enhancement. Prior works on IRS have mostly assumed perfect channel state information (CSI), which facilitates in deriving the upper-bound performance but is difficult to realize practice due passive elements of without signal ...

Since most components of sparse multi-path channel (SMPC) are zero, impulse response of SMPC can be recovered from a short training sequence. Though the ordinary orthogonal matching pursuit (OMP) algorithm provides a very fast implementation of SMPC estimation, it suffers from inter-atom interference (IAI), especially in the case of SMPC with a large delay spread and short training sequence. In...

We develop a framework that we call compressive rate estimation. We assume that the composite channel gain matrix (i.e. the matrix of all channel gains between all network nodes) is compressible which means it can be approximated by a sparse or low rank representation. We develop and study a novel sensing and reconstruction protocol for the estimation of achievable rates. We develop a sensing p...

A scheme of tree-based backward pilot generation for sparse channel estimation in orthogonal frequency division multiplexing (OFDM) systems is proposed. Instead of straightforward searching for the best from all possible pilot subsets, the scheme iteratively removes a subcarrier from all OFDM subcarriers in a backward manner. At each time, every subcarrier is tested by deleting it and calculati...

We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in C with respect to a random unimodular window can be recovered by Basis Pursuit with high probability provided that S ≤ Cn/ log(n). Our results are applicable to the channel estimation problem in wireless communications and they e...

We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in C with respect to a random unimodular window can be recovered by Basis Pursuit with high probability provided that S ≤ Cn/ log(n). Our results are applicable to the channel estimation problem in wireless communications and they e...