Journal of Applied Mathematics

Volume 2013, Article ID 715848, 6 pages

http://dx.doi.org/10.1155/2013/715848

## Exact CS Reconstruction Condition of Undersampled Spectrum-Sparse Signals

^{1}Institute of Information and Navigation, Air Force Engineering University, Xi’an 710077, China^{2}Key Laboratory for Information Science of Electromagnetic Waves, Ministry of Education, Fudan University, Shanghai 200433, China^{3}Institute of Science, Air Force Engineering University, Xi’an 710051, China

Received 15 August 2013; Accepted 18 November 2013

Academic Editor: Feng Gao

Copyright © 2013 Ying Luo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Compressive sensing (CS) reconstruction of a spectrum-sparse signal from undersampled data is, in fact, an ill-posed problem. In this paper, we mathematically prove that, in certain cases, the exact CS reconstruction of a spectrum-sparse signal from undersampled data is impossible. Then we present the exact CS reconstruction condition of undersampled spectrum-sparse signals, which is valuable for digital signal compression.

#### 1. Introduction

In digital signal processing, the Nyquist sampling theorem indicates that the sampling rate must be twice as large as the bandwidth of the analog signal at least for acquiring the intact information of the signal. Restricted by the theorem, it is a challenge to digitize ultrawide bandwidth (UWB) signals because of the unfeasible high sampling rate requirement for the analog-to-digital converter (ADC). On the other hand, the mass sampling data have to be compressed to save the storage, which means that many data are abandoned in the compression processing. Hence, why not to obtain the compressed data of signals directly rather than to sample signal with ultrahigh rate and then abandon most of the samplings?

The emerging *compressive sensing* (CS) theory [1] provides an effective approach to solve this problem, which has attracted much attention recently [2–7]. Consider a signal and assume it is sparse on an orthogonal basis with -sparse representation () as , where is an column vector with nonzero elements. Let denote a measurement matrix and let be the measurements vector of signal ; it can be expressed as , where is a matrix, denotes the number of measurements, and . Therefore, the sampling rate is reduced significantly compared with Nyquist rate. Generally, recovery of the signal from the measurements is ill-posed because [8]. However, the CS theory demonstrates that if has the *Restricted Isometry Property* (RIP), then it is indeed possible to recover the largest when is large enough [3, 9]. It is difficult to validate if a measurement matrix satisfies the RIP constraints given in [9] directly, but fortunately, the RIP is closely related to an incoherency between and , where the rows of do not provide a sparse representation of the columns of and vice versa [4]. Furthermore, to ensure exact reconstruction, two different -sparse signals may not be projected by a measurement matrix into the same sampling ensemble [1, 2, 10].

When is sparse in spectrum, the -dimensional inverse discrete Fourier transform (IDFT) matrix () can be chosen as the sparse representation matrix (). In this case, an easy way to obtain the compressed data of the signal is to undersample the signal with lower sampling rate than the Nyquist rate [2]. Therefore the measurement matrix is in fact a partial unit matrix [11]. It is important to investigate the mathematical properties of compressive sensing reconstruction for this kind of undersampled spectrum-sparse signal. In the following, we mathematically prove that the exact CS reconstruction of a spectrum-sparse signal from undersampled data is impossible under certain conditions. In order to reconstruct a spectrum-sparse signal from undersampled data exactly, the corresponding exact CS reconstruction condition is presented, which is valuable for digital signal compression.

#### 2. Inexact CS Reconstruction Cases

When a signal is sparse in spectrum, the IDFT matrix and partial unit matrix can be chosen as the sparse representation matrix and the measurement matrix, respectively. By defining the downsampling rate to be the ratio between the Nyquist rate and the undersampling rate, an inexact CS reconstruction case can be depicted as the following theorem.

Theorem 1. *Suppose with Nyquist sampling rate is -sparse in spectrum domain; is an arbitrary subset of , where is the downsampling rate, , and , is a constant and , and is the set of all natural numbers. cannot be exactly reconstructed from by CS.*

*Proof. *According to the expression of , we have
where is -sparse; is the measurement matrix with size :
(2)

Equation (1) is equivalent to
where is the -dimensional DFT matrix. Because is isometrically downsampled from , is also sparse. In (3), we define a new measurement matrix and it can be expressed as(4)

According to CS theory, if satisfies the RIP, can be exactly reconstructed. Let be the th row of ; we have
where . Because , according to *Cramer’s Rule*, the equation has unique solution; that is,

Let be the th element of ; it can be obtained

It peaks at
where is set of all nonnegative integers. Because , we have
and is a natural number; hence
where returns the round of . When does not satisfy (10), is relatively quite small. It indicates that is sparse. Similarly, it can be proved that both and are also sparse. Therefore, can be sparsely represented by the columns of ; that is, does not satisfy the RIP, and cannot be exactly reconstructed.

Figure 1 shows the values of , , and when , , , and . It is obvious that , , and are sparse and the locations of peaks agree well with the theoretical values determined by (10).

By Theorem 1 and its proof, we can also obtain the following corollary.

Corollary 2. *Suppose with Nyquist sampling rate is -sparse in spectrum domain; is an arbitrary subset of , where is the downsampling rate, , and and is a constant and . Let be an arbitrary subset of ; then cannot be exactly reconstructed from by CS.*

*Proof. *Assume the length of is and we have
where is a partial unit matrix. Assuming the size of is , the solution set of (1) is a subset of the solution set of (11). According to Theorem 1, the solutions of (1) are not determined; therefore, in (11) cannot be determined and cannot be exactly reconstructed.

Corollary 2 indicates that, if the set of undersamplings is only a subset of the set of signals’ samplings with sampling rate lower than the Nyquist rate, the signal cannot be exactly reconstructed from these undersamplings by CS. Therefore, when designing the ADC with random sampling space, the ADC should better possess the capability with the minimum sampling space of , where is the Nyquist rate. Taken in this sense, the high sampling rate requirement for ADC is indeed not suppressed even though the CS theory is utilized.

#### 3. Exact CS Reconstruction Condition

In the following, we present the exact CS reconstruction condition of undersampled spectrum-sparse signals.

Theorem 3. *Suppose with Nyquist sampling rate is -sparse in spectrum domain; and the frequency indexes of nonzero points in spectrum are . Undersampling with rate (, , and ), respectively, all the samples consist of . The necessary and sufficient condition for exactly reconstructed from by CS is
*

*Proof. *Reconstructing from is in fact to solve the following underdetermined equation system:
where is the measurement matrix according to the undersampling rate ; is composed of the undersamplings of with rate . Assume the frequency indexes of the solution set of the th equation are ; because is the isometric downsampling from , we have

Hence, the solution set of (13) is

Only if (12) holds true, under the constraint of -sparse, it yields ; therefore, is exactly reconstructed.

Theorem 3 indicates that it is possible to reconstruct a spectrum-sparse signal exactly from its multirate downsamplings. It means that, when condition (12) is satisfied, the multirate downsampling can be used to compress the data of digital signals. The conclusion is valuable to the design of the ADC when the analog signal is a priori known sparse in spectrum.

In order to validate Theorem 3, an experiment is given as follows. In the experiment, the signal with Nyquist sampling rate is expressed as , . The sparsity of in spectrum domain is 3 and . The spectrum of is shown in Figure 2(a). Let and . Therefore, we have

Obviously, the intersection of (16) is . Hence, can be exactly reconstructed from the downsamplings. In the experiment, we choose the orthogonal matching pursuit (OMP) algorithm [12] to reconstruct from the downsamplings. The spectrum of the reconstructed signal by CS is shown in Figure 2(b), which is very close to that in Figure 2(a). The comparison of the original signal with Nyquist sampling rate and the reconstructed signal in time domain is also given in Figure 2(c). From the figure, it can be found that the reconstructed signal is close to the original signal, which validates the correctness of Theorem 3.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This research was supported in part by the National Natural Science Foundation of China under Grant 61201369 and 61172169 and in part by the Natural Science Foundation Research Program of Shaanxi Province under Grant 2013JQ8008.

#### References

- D. L. Donoho, “Compressed sensing,”
*IEEE Transactions on Information Theory*, vol. 52, no. 4, pp. 1289–1306, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,”
*IEEE Transactions on Information Theory*, vol. 52, no. 2, pp. 489–509, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: universal encoding strategies?”
*IEEE Transactions on Information Theory*, vol. 52, no. 12, pp. 5406–5425, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - R. Baraniuk and P. Steeghs, “Compressive radar imaging,” in
*IEEE Radar Conference*, pp. 128–133, Boston, Mass, USA, 2007. - M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, “Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems,”
*IEEE Journal of Selected Topics in Signal Processing*, vol. 1, no. 4, pp. 586–597, 2007. View at Google Scholar - Y. Zhang, “Theory of compressive sensing via
*ℒ*1-minimization: a non-RIP analysis and extensions,”*Journal of the Operations Research Society of China*, vol. 1, no. 1, pp. 79–105, 2013. View at Google Scholar - T. Strohmer, “Measure what should be measured: progress and challenges in compressive sensing,”
*IEEE Signal Processing Letters*, vol. 19, no. 12, pp. 887–893, 2012. View at Google Scholar - B. Adcock, A. C. Hansen, E. Herrholz, and G. Teschke, “Generalized sampling: extension to frames and inverse and ill-posed problems,”
*Inverse Problems*, vol. 29, no. 1, Article ID 015008, p. 27, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - E. J. Candès and T. Tao, “Decoding by linear programming,”
*IEEE Transactions on Information Theory*, vol. 51, no. 12, pp. 4203–4215, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, “A simple proof of the restricted isometry property for random matrices,”
*Constructive Approximation*, vol. 28, no. 3, pp. 253–263, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Luo, Q. Zhang, W. Hong, and Y.-R. Wu, “Waveform design and high-resolution imaging of cognitive radar based on compressive sensing,”
*Science China Information Sciences*, vol. 55, no. 11, pp. 2590–2603, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,”
*IEEE Transactions on Information Theory*, vol. 53, no. 12, pp. 4655–4666, 2007. View at Publisher · View at Google Scholar · View at MathSciNet