Open Access

Signal Reconstruction from Nonuniformly Spaced Samples Using Evolutionary Slepian Transform-Based POCS

EURASIP Journal on Advances in Signal Processing20102010:367317

Received: 29 January 2010

Accepted: 15 June 2010

Published: 7 July 2010


We consider the reconstruction of signals from nonuniformly spaced samples using a projection onto convex sets (POCSs) implemented with the evolutionary time-frequency transform. Signals of practical interest have finite time support and are nearly band-limited, and as such can be better represented by Slepian functions than by sinc functions. The evolutionary spectral theory provides a time-frequency representation of nonstationary signals, and for deterministic signals the kernel of the evolutionary representation can be derived from a Slepian projection of the signal. The representation of low pass and band pass signals is thus efficiently done by means of the Slepian functions. Assuming the given nonuniformly spaced samples are from a signal satisfying the finite time support and the essential band-limitedness conditions with a known center frequency, imposing time and frequency limitations in the evolutionary transformation permit us to reconstruct the signal iteratively. Restricting the signal to a known finite time and frequency support, a closed convex set, the projection generated by the time-frequency transformation converges into a close approximation to the original signal. Simulation results illustrate the evolutionary Slepian-based transform in the representation and reconstruction of signals from irregularly-spaced and contiguous lost samples.

1. Introduction

The problem of signal reconstruction from Nonuniformly spaced samples is central in many practical problems in image and signal processing [111]. Nonuniform sampling is a common result of Nyquist-Shannon sampling caused by jittering in the sampler, but it is also the case when samples are missing, either according to some distribution or in segments.

Reconstruction of Nonuniformly sampled signals can be approached numerically by considering sinc basis as frames [12]. Unfortunately, it is an ill-posed problem given the characteristics of the basis. Signals in practice have finite supports and can be approximated as nearly band-limited signals, based on this in [13, 14] it is shown that a more appropriate basis for signal interpolation is the Prolate Spheroidal Wave or Slepian functions [15]. It is thus possible to develop the projection of signals of finite time support that are nearly band-limited. The representation of bandpass signals, as the modulation of baseband components, can be obtained using modulated Slepian basis. The discrete prolate spheroidal sequences (DPSSs) are the discrete form of the prolate spheroidal wave functions (PSWFs) [16] and can be used as the basis for the projection of the sampled signal. Using DPSS as an orthogonal basis [14, 17], it is shown to reduce the sampling rate and reconstruction error.

The reconstruction of finite energy signals can thus be viewed as an interpolation or an estimation problem in which projection of the observed signal minimizes an error criteria. Constraining the solution to satisfy time and frequency conditions iteratively, a close approximation to the signal, with the given samples, is obtained. This is the basic idea of the projection onto convex sets (POCSs) method. This method was introduced by [1, 2] as an iterative algorithm for signal restoration. Since then, the POCS method has been successfully used in many signal and image recovery problems [311]. Time-frequency signal representations using short-time [9] and fractional Fourier transform [10, 11] have been recently used to implement this type of reconstruction.

To obtain the POCS iterative solution, we consider that the signals of interest have a finite time support and an approximately finite frequency support. As such, the Slepian projection are used for this class of signals. To jointly consider time and frequency constraints, we develop a time-frequency representation from the Slepian projection. This can be done using the evolutionary spectral theory [18], where a signal can be represented in terms of a kernel which in turn can be obtained from the windowed signal. The magnitude square of the kernel is associated with the way the energy of the signal is distributed in time and frequency. It is also possible to obtain a similar representation, the discrete evolutionary transform (DET), for deterministic signals having components with time-varying frequency components [19]. Imposing time and frequency limitations in the DET permits us to reconstruct the signal iteratively, that is, the iterative projection generated by the time-frequency transformation converges into a close approximation to the original signal with the given Nonuniform samples.

The rest of the paper is organized as follows. In Section 2, we consider the reconstruction of Nonuniformly sampled signals. In this section we show why the PSWF basis is more appropriate than the sinc basis for the reconstruction from Nonuniform samples when the signal is of finite time support and essentially band-limited. In Section 3 we propose the time-frequency discrete evolutionary transform (DET) as the projection operator for the implementation of a recursive projection onto complex sets (POCSs) to recover missing samples. Assuming that the baseband components of a bandpass signal has finite support in time and frequency, a DET based in PSWF or Slepian functions is possible. This will be presented in Section 4. In Section 5 we illustrate the Slepian-based DET, and its application in the reconstruction of signals missing samples randomly and in blocks. Conclusions follow.

2. Reconstruction of Nonuniformly Sampled Signals

The sinc interpolation obtained in the Shannon-Nyquist sampling theory [20] for finite energy signals is fundamental in signal processing. However, it has some limitations. These limitations are (i) that the signal is sampled uniformly at , for some sampling period , and (ii) that is band-limited, that is, is the maximum frequency present in the signal. Under these conditions the signal can be reconstructed from the uniform samples according to the following sinc interpolation:

where is the sinc function. Several issues of practical interest arise when numerically implementing this interpolation. Besides the infinite dimension of the problem, uniform sampling is not realistic. Moreover, band-limitedness is just an approximation to reality.

If Nonuniform samples are available, the signal reconstruction suffers from dimensionality and ill-conditioning [12]. Indeed, if the set of time-shifted sinc functions is considered a frame for , a Gramian matrix equation represents the following interpolation:

where is a matrix containing shifted sinc functions, is a vector with entries the samples of the signal, and are the expansion coefficients of the projection in terms of the sinc functions. The infinite dimension of this problem makes it unsolvable, and when the dimension is reduced the problem becomes ill-posed [12].

The problem in part is due to using shifted sinc functions as basis: these functions are not appropriate for the interpolation given that time-limited signals are of infinite frequency support according to the uncertainty principle. A more appropriate basis is given by the Prolate Spheroidal Wave functions (PSWFs) [15].

The PSWFs are real-valued functions, with finite time support , that maximize their energy in a given bandwidth. These functions are the eigenfunctions of the sinc-based integral equation
where is the eigenvalue corresponding to the eigenfunction . Given the orthogonality of the sinc functions, the above definition leads to the orthogonality of the PSWF functions, so that they, like the sinc functions, are basis for finite energy signals. Thus the sinc function , which belongs to the space of band-limited signals, can be expanded in terms of the PSWFs as
Replacing this equation in the sinc interpolation gives an interpolation in terms of the PSWFs:
with expansion coefficients
If the signal has a finite support in time and approximately finite support in frequency, the above sums become finite. In that case, the upper limit of the sum in (5) depends on the approximately maximum frequency of , and in (6) the upper limit of the sum depends on the finite support of . A sampled-version of the signal could then be

where relates to the time support, and to the frequency support of .

Thus, if is time-limited and essentially band-limited, (5) and (6) provide a reconstruction of the signal from Nonuniformly sampled signals. In [14], it is shown that in the case of jittering sampling, that is, a subset of the uniform samples is available, the signal can be reconstructed.

A discrete version of the PSWF is used in these cases. The discrete PSW functions (or discrete PSW sequences or DPSS) are parameterized by the time bandwidth product where is their length and its normalized bandwidth. Like their analog counterparts, they are defined as the solution to the eigenvalue problem

where , and . The real eigenfunctions are the DPSS, and the corresponding eigenvalues relate to the their energy concentration. The DPSS are also orthonormal.

3. Evolutionary Spectral Representation and POCS

The spectral representation of a stationary signal consists of a superposition of sinusoids, of all possible frequencies, with randomly varying amplitudes and phases. To obtain a similar representation for non-stationary signals, one can consider the Wold-Cramer representation [18] characterizing a non-stationary signal as the output of a linear time-varying system with a stationary white noise as input. Thus, a discrete non-stationary signal can be expressed as

where is an evolutionary kernel. The evolutionary spectrum of is given by .

In [19], it is shown that the above representation can be extended to deterministic signals. The discrete evolutionary transform (DET) obtained in there is a generalization of the short-time Fourier transform as the evolutionary kernel is obtained in term of the signal windowed, but the window in the DET varies with time and frequency. Thus the kernel is

where is the window which can be expressed in nonorthogonal functions such as Gabor's, or orthogonal functions such as Malvar's [19].

The POCS framework enables an iterative recovery algorithm incorporating time and frequency constraints. A desired signal is assumed to lie in the region defined by the intersection of all the convex sets, that is,
where denotes the th closed convex set. Thus, the original signal can be restored by using the projection operators onto each convex set . The general form of the POCS reconstruction is

where is the reconstructed signal after iterations. Assuming that the signal of interest is square summable and that the DET projects a signal into another square summable signal, under joint time-frequency constraints we develop an iterative POCS algorithm to recover the signal from partial information of it.

4. Evolutionary Slepian Transform-Based POCS

A bandpass real-valued signal can be also represented in terms of baseband signals as
where and are low pass signals and is the center frequency of the Fourier transform of and . Assuming the and components have finite time support and are essentially band-limited, we can represent them using the Slepian projection presented above. In that case, the signal can be expressed as

that is, in terms of modulated Slepian functions.

The bandpass DPSS [21, 22] which have the highest energy concentration in a given passband are defined by
where the passband is . When the signal energy outside the given frequency band is very small,

the bandpass DPSS provide an efficient representation of passband signals and accurate channel estimation [21, 22]. Allowing the center frequency to vary from zero to infinity (or zero to in the discrete domain) we then have a general representation for any signal.

The general representation for a complex signal in terms of the PSWFs is given by
where can be the band-pass or the base band (when the center frequency is zero) Slepian functions. If the signal is time limited, and essentially in the frequency bands and , then (7) becomes

where, as indicated before, depends on the frequency support and on the time support.

In [14], the reconstruction of the original signal from a given set of Nonuniform samples is considered, while the effect of the distribution of the Nonuniform samples in the reconstruction is studied in [23]. Assuming that samples , are missing, then letting be the -dimensional vector of unknown samples and = we obtain from above
where is a matrix with a subset of the entries of the matrix generated by the terms in square brackets in (18) and

The missing samples are recovered if the above equation can be solved for , or if is invertible. Given the many possible ways the missing samples could be distributed, this might not be possible. However, as indicated in [12, 23] there are cases where reconstruction is possible with the sinc interpolation, and we will show later that it is also the case when we are using the Slepian POCS.

To apply joint time and frequency constraint in the POCS we develop a DET based on the Slepian representation of the signal. Suppose a discrete signal can be represented in terms of some orthogonal basis ,
where are the expansion coefficients. Rewriting as
where . The evolutionary kernel can be expressed in terms of by replacing the coefficients,
To obtain the evolutionary kernel, in particular the window , we consider the bandpass DPSS as basis for the representation of baseband and passband signals. The window is then expressed as

It is important to understand that when the signal under consideration is modulated, that is, , and we use the bandpass Slepian functions, we can obtain the spectrum of or . For a signal with bandpass characteristics, the signal can be represented by a small number of bandpass DPSS coefficients and then restored by small number of projection iteration compared to baseband DPSS based DET, which will be shown in next section.

5. Simulation

5.1. Slepian-Based DET

To illustrate the baseband and bandpass Slepian representation and theirSlepian-basedDET, consider the test signals
where  Hz is a carrier frequency, and  Hz. Discrete signals and , , are obtained from the uniform sampling on the signal and , respectively, using a sampling period and  sec. For the signal , the evolutionary Slepian spectrum using the baseband DPSS, shown in Figure 1, is illustrated in Figure 2. The evolutionary Slepian spectrum shows that the energy of the test signal is highly concentrated in and rad. As shown in Figure 2(b), the DET provides accurate representation for a nearly time-limited and band-limited signal in the time-frequency domain.
Figure 1

Baseband DPSS for , , and (note that ).

Figure 2

An example of evolutionary Slepian spectrum: (a) , (b) .

The 256-point bandpass test signal in Figure 3(a) is to be represented by the evolutionary Slepian spectrum. Its Fourier transform is shown in Figure 3(a) where the signal energy is concentrated at normalized frequency . In many practical applications, the exact frequency band of the signal is known. Therefore, if we have enough knowledge about the spectrum characteristics of the signal, we can represent the signal with small number of DPSS. Figure 3(b) shows the evolutionary Slepian spectrum for using baseband DPSS with coefficients and normalized bandwidth of . The evolutionary Slepian spectrum using bandpass DPSS is also shown in Figure 3(c) where , , and . Therefore, if we project the signal that has bandpass characteristics on the DET domain, the signal can be restored only by a small number of basis, that is, bandpass DPSS with the same accuracy obtained from baseband DPSS.
Figure 3

Comparison of evolutionary Slepian spectrum for passband test signal using baseband and bandpass DPSS. (a) and its spectrum , (b) spectrum of baseband DPSS and corresponding , and (c) spectrum of bandpass DPSS and corresponding .

5.2. Reconstruction of Irregularly Sampled Signals

In this section, we perform three different simulations to illustrate the effectiveness of DET-based POCS. We use the POCS methodology for reconstruction of nonuniformly sampled and band-limited signals.

5.2.1. Nonuniform Jittering Sampling with Known Distribution

Irregularly spaced samples are obtained from the original signal by where is the timing jitter with normal distribution and denotes the nearest integer, and is a decimation factor.

Figure 4(a) shows the irregularly spaced samples with 32-point ( ) from the test signal . In this simulation, the parameters for the baseband DPSS are , and . As shown in Figures 4(b), 4(c), and 4(d), the original signal can be recovered with very small error after iterations. Figure 5 shows the relationship between the degree of irregularity ( ) and the performance in terms of mean absolute error (MAE) and the speed of convergence. It is clear that the performance depends on the degree of irregularity. Figure 5 also suggests that, although the number of iterations should be increased according to the degree of irregularity, a nearly perfect reconstruction can be possible.
Figure 4

Restored results for the test signal (a) Irregularly spaced subsamples , , (b) restored signal, (c) error, and (d) convergence behaviour.

Figure 5

Convergence speed and MAE performance according to the degree of irregularity.

In case of nonstationary signals such as a chirp, the restored signal using bandpass DPSS-based DET is shown in Figure 6. The results clearly indicate that the reconstruction of the Nonuniformly sampled nonstationary signal can be possible with very small error.
Figure 6

Restored results for the chirp signal . (a) Irregularly-spaced subsamples ( , ), (b) restored signal by bandpass DPSS ( ) based DET, (c) error, (d) convergence behaviour.

For a speech signal, the restored results using baseband and bandpass DPSS-based DET are shown in Figure 7. Its frequency components are also shown in Figure 7(b) showing that the energy of the signal is concentrated in a normalized frequency band . Note that the bandpass DPSS-based DET projection converges faster than the baseband approach for a bandpass type signal. It is clear that the bandpass type signal can be restored only by a small number of components and the iteration, with the same MAE performance compared to baseband DPSS-based DET, converges faster. Therefore, the DET-based POCS algorithm provides a fast and accurate technique for recovering band-limited samples from the irregularly spaced subsamples.
Figure 7

Restored results for the speech signal. (a) Speech signal, (b) spectrum of speech, baseband, and bandpass DPSS, (c) irregularly spaced subsamples , , (d) convergence behaviours, (e) restored signal by baseband DPSS- ( ) based DET, and (f) restored signal by bandpass DPSS- ( ) based DET.

5.2.2. Nonuniform Jittering Sampling with Unknown Distribution

In this simulation, we consider the extreme case of irregularly spaced, that is, randomly spaced subsamples. Figure 8 shows examples of restored signal from the randomly spaced subsamples for test signal and the speech signal, given above. As shown in Figure 8, for a time-limited signal such as , the restored performance strongly depends on the sampling distribution. For the speech signal, since its energy is well distributed in the time domain, the restored signal is not sensitive to the distribution of sampling points. Note that the MAE values of the restored speech signals under 5 different random sampling patterns lie between and after convergence. This result clearly indicates that for a signal with uniformly distributed energy in the time domain, the DET based POCS algorithm is capable of signal recovery from randomly spaced subsamples. As pointed out in [23], if the gaps between missing samples due to randomly spaced are large, iterative technique such as POCS is more efficient than noniterative method.
Figure 8

Restored results for randomly-spaced subsamples. (a) Randomly spaced subsampled test and speech signals, (b) restored test signal by baseband DPSS-based DET ( ) and restored speech signal by bandpass DPSS-based DET ( ), and (c) convergence behaviours of 5 different random sampling patterns (left: test signal, right: speech signal).

5.2.3. Block or Contiguous Sample Losses

For the recovery of uniformly sampled signals with contiguous lost samples, the same projection methodology is applied in this simulation. A general assumption is that the lost data on the sampled signals compared to the total number of samples is small and that the available samples are representatives of the original signal [24]. Figure 9 shows examples of restored speech signal by bandpass DPSS- ( ) based DET from the uniformly spaced speech signal with continuous missing data. For larger values of missing samples, since the assumption does not hold due to severe loss of information on the signal, the performance of signal recovery is degraded. However, the proposed method shows very promising results as shown in Figure 9.
Figure 9

Restored results for continuous lost samples. (a) Restored speech signal from missing data after iterations and (b) restored speech signal from missing data after iterations.

6. Conclusions

In this paper, we have introduced a new discrete evolutionary Slepian transform capable of efficient representation of band-limited signals. For the evolutionary kernel window, baseband and bandpass DPSS are used for the representation of baseband and bandpass signals, respectively. The evolutionary Slepian spectrum provides an accurate representation of time-and-band limited signal in the time-frequency domain. For the reconstruction, the DET-based POCS algorithm is applied in the area of signal recovery from nonuniformly spaced subsamples. For a signal that has bandpass characteristics, the signal can be represented by a small number of bandpass DPSS coefficients with the same accuracy obtained from baseband DPSS, and then restored by small number of projection iteration with the same MAE performance compared to baseband DPSS-based DET. The DET-based POCS algorithm is shown to provide fast and accurate technique for recovering the band-limited samples from the irregularly spaced subsamples. Although there are remaining issues that need further study, for instance, the upper error bound by the number and distribution of missing samples, the proposed method shows very promising results, that is, capable of signal recovery from randomly spaced subsamples and continuous lost samples.

Authors’ Affiliations

Department of Electrical Engineering, Halla University
Department of Electrical and Computer Engineering, University of Pittsburgh


  1. Bregman LM: Finding the common point of convex sets by the method of successive projections. Doklady Akademii Nauk SSSR 1965, 162(3):487-490.MathSciNetGoogle Scholar
  2. Gubin LG, Polyak BT, Raik EV: The method of projections for finding the common point of convex sets. USSR Computational Mathematics and Mathematical Physics 1967, 7(6):1-24. 10.1016/0041-5553(67)90113-9View ArticleGoogle Scholar
  3. Yeh S, Stark H: Iterative and one-step reconstruction from nonuniform samples by convex projections. Journal of the Optical Society of America 1990, 7(3):491-499. 10.1364/JOSAA.7.000491View ArticleGoogle Scholar
  4. Stasiński R, Konrad J: POCS-based image reconstruction from irregularly-spaced samples. Proceedings of the IEEE International Conference on Image Processing (ICIP '00), September 2000 2: 315-318.View ArticleGoogle Scholar
  5. Park J, Park D-C, Marks RJ II, El-Sharkawi MA: Block loss recovery in DCT image encoding using POCS. Proceedings of the IEEE International Symposium on Circuits and Systems, September 2002 5: 245-248.View ArticleGoogle Scholar
  6. Huang H, Makur A: A new iterative reconstruction scheme for signal reconstruction. Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems (APCCAS '08), December 2008 336-339.Google Scholar
  7. Ogawa T, Haseyama M: Adaptive reconstruction method of missing texture based on projection onto convex sets. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '07), April 2007 1: 697-700.Google Scholar
  8. Chen J, Zhang L, Luo J, Zhu Y: MRI reconstruction from 2D partial k-space using POCS algorithm. Proceedings of the 3rd International Conference on Bioinformatics and Biomedical Engineering (ICBBE '09), June 2009 1-4.Google Scholar
  9. Feichtinger HG, Kozek W, Strohmer T: Reconstruction of signals from irregular samples of its short-time Fourier transform. Wavelet Applications in Signal and Image Processing III, July 1995, San Diego, Calif, USA, Proceedings of SPIE 140-150.View ArticleGoogle Scholar
  10. Guven HE, Ozaktas HM, Cetin AE, Barshan B: Signal recovery from partial fractional Fourier domain information and its applications. IET Signal Processing 2008, 2(1):15-25. 10.1049/iet-spr:20070017View ArticleGoogle Scholar
  11. Serbes A, Durak L: Optimum signal and image recovery by the method of alternating projections in fractional Fourier domains. Communications in Nonlinear Science and Numerical Simulation 2010, 15(3):675-689. 10.1016/j.cnsns.2009.05.013MathSciNetView ArticleMATHGoogle Scholar
  12. Strohmer T: Numerical analysis of the non-uniform sampling problem. Journal of Computational and Applied Mathematics 2000, 122(1):297-316. 10.1016/S0377-0427(00)00361-7MathSciNetView ArticleMATHGoogle Scholar
  13. Walters G, Shen X: Sampling with prolate spheroidal wave functions. Sampling Theory in Signal and Image Processing 2003, 2: 25-52.MathSciNetMATHGoogle Scholar
  14. Senay S, Chaparro LF, Durak L: Reconstruction of nonuniformly sampled time-limited signals using prolate spheroidal wave functions. Signal Processing 2009, 89(12):2585-2595. 10.1016/j.sigpro.2009.04.020View ArticleMATHGoogle Scholar
  15. Slepian D, Pollak HO: Prolate spheroidal wave functions, Fourier analysis and uncertainty. Bell System Technical Journal 1961, 40: 43-64.MathSciNetView ArticleMATHGoogle Scholar
  16. Slepian D: Prolate spheroidal wave functions, Fourier analysis and uncertainty. V: the discrete case. Bell System Technical Journal 1978, 57(5):1371-1430.View ArticleMATHMathSciNetGoogle Scholar
  17. Ding J-J, Pei S-C: Reducing sampling error by prolate spheroidal wave functions and fractional Fourier transform. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '05), March 2005 4: 217-220.Google Scholar
  18. Priestley MB: Non-Linear and Non-Stationary Time Series Analysis. Academic Press, London, UK; 1988.MATHGoogle Scholar
  19. Suleesathira R, Chaparro LF, Akan A: Discrete evolutionary transform for time-frequency signal analysis. Journal of the Franklin Institute 2000, 337(4):347-364. 10.1016/S0016-0032(00)00041-7MathSciNetView ArticleMATHGoogle Scholar
  20. Unser M: Sampling-50 years after Shannon. Proceedings of the IEEE 2000, 88(4):569-587. 10.1109/5.843002View ArticleGoogle Scholar
  21. Sejdić E, Luccini M, Primak S, Baddour K, Willink T: Channel estimation using DPSS based frames. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '08), March 2008 2849-2852.Google Scholar
  22. Şenay S, Chaparro LF, Akan A: Chirp channel estimation and OFDM transmission using discrete prolate spheroidal sequences. Proceedings of the 5th IASTED International Conference on Signal Processing, Pattern Recognition, and Applications (SPPRA '08), February 2008 64: 281-286.Google Scholar
  23. Ferreira PJSG: The stability of a procedure for the recovery of lost samples in band-limited signals. Signal Processing 1994, 40(2-3):195-205. 10.1016/0165-1684(94)90067-1View ArticleMATHGoogle Scholar
  24. Oliveira P: Interpolation of signals with missing data using PCA. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '06), May 2006 3: 828-831.Google Scholar


© Jinsung Oh et al. 2010

This article is published under license to BioMed Central Ltd. 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.