In compressive sensing (CS), the restricted isometry property (RIP) is an important condition on measurement matrices which guarantees the recovery of sparse signals with undersampled measurements. It has been proved in the prior works that both random (e.g., i.i.d. Gaussian, Bernoulli, ⋯) and Toeplitz matrices satisfy the RIP with high probability. However, structured matrices, such as banded Toeplitz matrices have drawn more attention since their structures have the advantage of fast matrix multiplication which may decrease the computational complexity of recovery algorithms. In this paper, we show that banded block Toeplitz matrices satisfy the RIP condition with high probability. Banded block Toeplitz matrices can be used in the sparse multi-channel source separation. The banded block Toeplitz matrices decrease the computational complexity while they have fewer number of non-zero entries in comparison to the same dimensional banded Toeplitz matrices. Furthermore, our simulation results show that banded block Toeplitz matrices outperform banded Toeplitz matrices in signal estimation. The analytical RIP bound for banded block Toeplitz matrices is provided in this paper and the RIP bound of sparse Gaussian matrices is also obtained as an upper bound for banded block Toeplitz matrices. Our simulation and analytical results show that sparse Gaussian random matrices do satisfy the RIP condition with high probability. The probability of satisfying the RIP depends on the probability of zero entries.

Additional Metadata
Keywords Banded block Toeplitz matrices, compressed sensing, restricted isometry property, sparse Gaussian random matrices
Persistent URL
Journal IEEE Transactions on Signal Processing
Dehghan, H. (Hoda), Dansereau, R, & Chan, A. (2015). Restricted Isometry Property on Banded Block Toeplitz Matrices with Application to Multi-Channel Convolutive Source Separation. IEEE Transactions on Signal Processing, 63(21), 5665–5676. doi:10.1109/TSP.2015.2457391