A unified view of the area of sparse signal processing is presented in tutorial form by bringing together various fields in which the property of sparsity has been successfully exploited. For each of these fields, various algorithms and techniques, which have been developed to leverage sparsity, are described succinctly. The common potential benefits of significant reduction in sampling rate and processing manipulations through sparse signal processing are revealed. The key application domains of sparse signal processing are sampling, coding, spectral estimation, array processing, component analysis, and multipath channel estimation. In terms of the sampling process and reconstruction algorithms, linkages are made with random sampling, compressed sensing, and rate of innovation. The redundancy introduced by channel coding in finite and real Galois fields is then related to over-sampling with similar reconstruction algorithms. The error locator polynomial (ELP) and iterative methods are shown to work quite effectively for both sampling and coding applications. The methods of Prony, Pisarenko, and MUltiple SIgnal Classification (MUSIC) are next shown to be targeted at analyzing signals with sparse frequency domain representations. Specifically, the relations of the approach of Prony to an annihilating filter in rate of innovation and ELP in coding are emphasized; the Pisarenko and MUSIC methods are further improvements of the Prony method under noisy environments. The iterative methods developed for sampling and coding applications are shown to be powerful tools in spectral estimation. Such narrowband spectral estimation is then related to multi-source location and direction of arrival estimation in array processing. Sparsity in unobservable source signals is also shown to facilitate source separation in sparse component analysis; the algorithms developed in this area such as linear programming and matching pursuit are also widely used in compressed sensing. Finally, the multipath channel estimation problem is shown to have a sparse formulation; algorithms similar to sampling and coding are used to estimate typical multicarrier communication channels.

1 Introduction

There are many applications in signal processing and communication systems where the discrete signals are sparse in some domain such as time, frequency, or space; i.e., most of the samples are zero, or alternatively, their transforms in another domain (normally called “frequency coefficients”) are sparse (see Figures 1 and 2). There are trivial sparse transformations where the sparsity is preserved in both the “time” and “frequency” domains; the identity transform matrix and its permutations are extreme examples. Wavelet transformations that preserve the local characteristics of a sparse signal can be regarded as “almost” sparse in the “frequency” domain; in general, for sparse signals, the more similar the transformation matrix is to an identity matrix, the sparser the signal is in the transform domain. In any of these scenarios, sampling and processing can be optimized using sparse signal processing. In other words, the sampling rate and the processing manipulations can be significantly reduced; hence, a combination of data compression and processing time reduction can be achieved.^{a}

Each field has developed its own tools, algorithms, and reconstruction methods for sparse signal processing. Very few authors have noticed the similarities of these fields. It is the intention of this tutorial to describe these methods in each field succinctly and show that these methods can be used in other areas and applications often with appreciable improvements. Among these fields are 1—Sampling: random sampling of bandlimited signals [1], compressed sensing (CS) [2], and sampling with finite rate of innovation [3]; 2—Coding: Galois [4, 5] and real-field error correction codes [6]; 3—Spectral Estimation[7–10]; 4—Array Processing: Multi-source location (MSL) and direction of arrival (DOA) estimation [11, 12], sparse array processing [13], and sensor networks [14]; 5—Sparse Component Analysis (SCA): blind source separation [15–17] and dictionary representation [18–20]; 6—Channel Estimation in Orthogonal Frequency Division Multiplexing (OFDM) [21–23]. The sparsity properties of these fields are summarized in Tables 1, 2, and 3.^{b} The details of most of the major applications will be discussed in the next sections but the common traits will be discussed in this introduction.

Table 1

Various topics and applications with sparsity properties: the sparsity, which may be in the time/space or “frequency” domains, consists of unknown samples/coefficients that need to be determined

0

1

2

3

4

5

6

7

8

1

Category

Topics

Sparsity

Type of

Information

Type of

Min number

Conventional

Applications

domain

sparsity

domain

sampling in

of required

reconstruction

info. domain

samples

methods

2

Sampling

Uniform

Frequency

Lowpass

Time/space

Uniform

2×BW−1

Lowpass

A/D

sampling

filtering/

Interpolation

3

Nonuniform

Frequency

Lowpass

Time/space

Missing samp-

2×BW−1

Iterative metho-

Seismic/

sampling

-les/jitter/per-

(in some cases

-ds/filter banks/

MRI/CT/

-iodic/random

even BW)

spline interp.

FM/ PPM

4

Sampling of

Frequency

Union of

Time/pace

Uniform/jit-

$2\times \sum \mathit{\text{BW}}$

Iterative metho-

Data

multiband

disjoint

-ter/periodic/

-ds/filter banks/

compression/

signals

intervals

random

interpolation

radar

5

Random

Frequency

Random

Time/space

Random/

$2\times \sum \#$

Iterative methods:

Missing samp.

sampling

uniform

coeff.

adapt. thresh.

recovery/

RDE/ELP

data comp.

6

Compressed

An arbitrary

Random

Random

Random

$c\xb7k\xb7log\left(\frac{n}{k}\right)$

Basis pursuit/

Data

sensing

orthonormal

mapping of

mixtures

matching

compression

transform

time/space

of samples

pursuit

7

Finite

Time and

Random

Filtered

Uniform

# Coeff. + 1 +

Annihilating

ECG/

rate of

polynomial

time

2·(# discont.

filter

OCT/

innovation

coeff.

domain

epochs)

(ELP)

UWB

8

Channel

Galois

Time

Random

Syndrome

Uniform

2×# errors

Berlekamp

Digital

coding

field

or

-Massey/Viterbi/

communic-

codes

random

belief prop.

-tion

9

Real

Time

Random

Transform

Uniform

2×# impulsive

Adaptive

Fault

field

domain

or

noise

thresholding

tolerant

codes

random

RDE/ELP

system

10

Spectral

Spectral

Frequency

Random

Time/

Uniform

2×# tones

MUSIC/

Military/

estimation

estimation

autocor-

−1

pisarenko/

radars

-relation

prony/MDL

11

Array

MSL/

Space

Random

Space/

Uniform

2×

MDL+

Radars/

processing

DOA

autocor-

# sources

MUSIC/

sonar/

estimation

-relation

ESPRIT

ultrasound

12

Sparse arr-

Space

Random/

Space

Peaks of

2×# desired

Optimiz-

Radars/sonar/

-ay beam-

missing

sidelobes/

array

-ation: LP/

ultrasound/

-forming

elements

[non]uniform

elements

SA/GA

MSL

13

Sensor

Space

Random

Space

Uniform

2× BW

Similar

Seismic/

networks

of random

to row 5

meteorology/

field

environmental

14

SCA

BSS

Active

Random

Time

Uniform

2×# active

ℓ_{
l
}/ℓ_{2}/

Biomedical

source/time

sources

SL0

15

SDR

Dictionary

Uniform/

Linear mix-

Random

2× # sparse

ℓ_{
l
}/ℓ_{2}/

Data compression

random

-ture of time

words

SL0

samples

16

Channel

Multipath

Time

Random

Frequency

Uniform/

2×# Spa-

ℓ_{
l
}/

Channel equaliz-

estimation

channels

or time

nonuniform

-rse channel

MIMAT

-ation/OFDM

components

The information domain consists of known samples/coefficients in the “frequency” or time/space domain (the complement of the sparse domain). A list of acronyms is given in Table 2 at the end of this section; also, a list of common notations is presented in Table 3. For definition of ESPRIT on row 11 and column 7, see the footnote on page 41.

Table 2

List of acronyms

ADSL

Asynchronous Digital Subscriber Line

AIC

Akaike Information Criterion

ARMA

Auto-Regressive Moving Average

AR

Auto-Regressive

BW

BandWidth

BSS

Blind Source Separation

CFAR

Constant False Alarm Rate

CAD

Computer Aided Design

CS

Compressed Sensing

CG

Conjugate Gradient

DAB

Digital Audio Broadcasting

CT

Computer Tomography

DCT

Discrete Cosine Transform

DC

Direct Current: Zero-Frequency Coefficient

DFT

Discrete Fourier Transform

DHT

Discrete Hartley Transform

DOA

Direction Of Arrival

DST

Discrete Sine Transform

DT

Discrete Transform

DVB

Digital Video Broadcasting

DWT

Discrete Wavelet Transform

EEG

ElectroEncephaloGraphy

ELP

Error Locator Polynomial

ESPRIT

Estimation of Signal Parameters via

FDTD

Finite-Difference Time-Domain

Rotational Invariance Techniques

FETD

Finite-Element Time-Domain

FOCUSS

FOCal Under-determined System Solver

FPE

Final Prediction Error

GPSR

Gradient Projection Sparse Reconstruction

GA

Genetic Algorithm

ICA

Independent Component Analysis

HNQ

Hannan and Quinn method

IDT

Inverse Discrete Transform

IDE

Iterative Detection and Estimation

ISTA

Iterative Shrinkage-Threshold Algorithm

IMAT

Iterative Methods with Adaptive Thresholding

KLT

Karhunen Loeve Transform

ℓ_{1}

Absolute Summable Discrete Signals

ℓ_{2}

Finite Energy Discrete Signals

LDPC

Low Density Parity Check

LP

Linear Programming

MA

Moving Average

MAP

Maximum A Posteriori probability

MDL

Minimum Description Length

ML

Maximum Likelihood

MIMAT

Modified IMAT

MSL

Multi-Source Location

MMSE

Minimum Mean Squared Error

NP

Non-Polynomial time

MUSIC

MUltiple SIgnal Classification

OFDM

Orthogonal Frequency Division Multiplex

OCT

Optical Coherence Tomography

OMP

Orthogonal Matching Pursuit

OFDMA

Orthogonal Frequency Division Multiple Access

PCA

Principle Component Analysis

OSR

Over Sampling Ratio

PHD

Pisarenko Harmonic Decomposition

PDF

Probability Density Function

PPM

Pulse-Position Modulation

POCS

Projection Onto Convex Sets

RIP

Restricted Isometry Property

RDE

Recursive Detection and Estimation

RV

Residual Variance

RS

Reed-Solomon

SCA

Sparse Component Analysis

SA

Simulated Annealing

SDFT

Sorted DFT

SDCT

Sorted DCT

SER

Symbol Error Rate

SDR

Sparse Dictionary Representation

SL0

Smoothed ℓ_{0}-norm

SI

Shift Invariant

ULA

Uniform Linear Array

SNR

Signal-to-Noise Ratio

WIMAX

Worldwide Inter-operability for Microwave Access

UWB

Ultra Wide Band

WLAN

Wireless Local Area Network

WMAN

Wireless Metropolitan Area Network

The columns of Table 1 consist of 0—category, 1—topics, 2—sparsity domain, 3—type of sparsity, 4—information domain, 5—type of sampling in information domain, 6—minimum sampling rate, 7—conventional reconstruction methods, and 8—applications. The first rows (2–7) of column 1 are on sampling techniques. The 8–9th rows are related to channel coding, row 10 is on spectral estimation and rows 11–13 are related to array processing. Rows 14–15 correspond to SCA and finally, row 16 covers multicarrier channel estimation, which is a rather new topic. As shown in column 2 of the table, depending on the topics, sparsity is defined in the time, space, or “frequency” domains. In some applications, the sparsity is defined as the number of polynomial coefficients (which in a way could be regarded as “frequency”), the number of sources (which may depend on location or time sparsity for the signal sources), or the number of “words” (signal bases) in a dictionary. The type of sparsity is shown in column 3; for sampling schemes, it is usually low-pass, band-pass, or multiband [24], while for compressed sensing, and most other applications, it is random. Column 4 represents the information domain, where the order of sparsity, locations, and amplitudes can be determined by proper sampling (column 5) in this domain. Column 7 is on traditional reconstruction methods; however, for each area, any of the reconstruction methods can be used. The other columns are self explanatory and will be discussed in more details in the following sections.

The rows 2–4 of Table 1 are related to the sampling (uniform or random) of signals that are bandlimited in the Fourier domain. Band-limitedness is a special case of sparsity where the nonzero coefficients in the frequency domain are consecutive. A better assumption in the frequency domain is to have random sparsity [25–27] as shown in row 5 and column 3. A generalization of the sparsity in the frequency domain is sparsity in any transform domain such as Discrete Cosine and Wavelet Transforms (DCT and DWT); this concept is further generalized in CS (row 6) where sampling is taken by a linear combination of time domain samples [2, 28–30]. Sampling of signals with finite rate of innovation (row 7) is related to piecewise smooth (polynomial based) signals. The positions of discontinuous points are determined by annihilating filters that are equivalent to error locator polynomials in error correction codes and the Prony’s method [10] as discussed in Sections 4 and 5, respectively.

Random errors in a Galois field (row 8) and the additive impulsive noise in real-field error correction codes (row 9) are sparse disturbances that need to be detected and removed. For erasure channels, the impulsive noise can be regarded as the negative of the missing sample value [31]; thus the missing sampling problem, which can also be regarded as a special case of nonuniform sampling, is also a special case of the error correction problem. A subclass of impulsive noise for 2-D signals is salt and pepper noise [32]. The information domain, where the sampling process occurs, is called the syndrome which is usually in a transform domain. Spectral estimation (row 10) is the dual of error correction codes, i.e., the sparsity is in the frequency domain. MSL (row 11) and multi-target detection in radars are similar to spectral estimation since targets act as spatial sparse mono-tones; each target is mapped to a specific spatial frequency regarding its line of sight direction relative to the receiver. The techniques developed for this branch of science is unique; with examples such as MUSIC [7], Prony [8], and Pisarenko [9]. We shall see that the techniques used in real-field error correction codes such as iterative methods (IMAT) can also be used in this area.

The array processing category (rows 11–13) consists of three separate topics. The first one covers MSL in radars, sonars, and DOA. The techniques developed for this field are similar to the spectral estimation methods with emphasis on the minimum description length (MDL) [33]. The second topic in the array processing category is related to the design of sparse arrays where some of the array elements are missing; the remaining nodes form a nonuniform sparse grid. In this case, one of the optimization problems is to find the sparsest array (number, locations, and weights of elements) for a given beampattern. This problem has some resemblance to the missing sampling problem but will not be discussed in this article. The third topic is on sensor networks (row 13). Distributed sampling and recovery of a physical field using an array of sparse sensors is a problem of increasing interest in environmental and seismic monitoring applications of sensor networks [34]. Sensor fields may be bandlimited or non-bandlimited. Since the power consumption is the most restricting issue in sensors, it is vital to use the lowest possible number of sensors (sparse sensor networks) with the minimum processing computation; this topic also will not be discussed in this article.

In SCA, the number of observations is much less than the number of sources (signals). However, if the sources are sparse in the time domain, then the active sources and their amplitudes can be determined; this is equivalent to error correction codes. Sparse dictionary representation (SDR) is another new area where signals are represented by the sparsest number of words (signal bases) in a dictionary of finite number of words; this sparsity may result in a tremendous amount of data compression. When the dictionary is over complete, there are many ways to represent the signal; however, we are interested in the sparsest representation. Normally, for extraction of statistically independent sources, independent component analysis (ICA) is used for a complete set of linear mixtures. In the case of a non-complete (underdetermined) set of linear mixtures, ICA can work if the sources are also sparse; for this special case, ICA analysis is synonymous with SCA.

Finally, channel estimation is shown in row 16. In mobile communication systems, multipath reflections create a channel that can be modeled by a sparse FIR filter. For proper decoding of the incoming data, the channel characteristics should be estimated before they can be equalized. For this purpose, a training sequence is inserted within the main data, which enables the receiver to obtain the output of the channel by exploiting this training sequence. The channel estimation problem becomes a deconvolution problem under noisy environments. The sparsity criterion of the channel greatly improves the channel estimation; this is where the algorithms for extraction of a sparse signal could be employed [21, 22, 35].

When sparsity is random, further signal processing is needed. In this case, there are three items that need to be considered. 1—Evaluating the number of sparse coefficients (or samples), 2—finding the positions of sparse coefficients, and 3—determining the values of these coefficients. In some applications, only the first two items are needed; e.g., in spectral estimation. However, in almost all the other cases mentioned in Table 1, all the three items should be determined. Various types of linear programming (LP) and some iterative algorithms, such as the IMAT with adaptive thresholding (IMAT), determine the number, positions, and values of sparse samples at the same time. On the other hand, the minimum description length (MDL) method, used in DOA/MSL and spectral estimation, determines the number of sparse source locations or frequencies. In the subsequent sections, we shall describe, in more detail, each algorithm for various areas and applications based on Table 1.

Finally, it should be mentioned that the signal model for each topic or application may be deterministic or stochastic. For example, in the sampling category for rows 2–4 and 7, the signal model is typically deterministic although stochastic models could also be envisioned [36]. On the other hand, for random sampling and CS (rows 5–6), the signal model is stochastic although deterministic models may also be envisioned [37]. In channel coding and estimation (rows 8–9 and 16), the signal model is normally deterministic. For Spectral and DOA estimation (rows 10–11), stochastic models are assumed, whereas for array beam-forming (row 12), deterministic models are used. In sensor networks (row 13), both deterministic and stochastic signal models are employed. Finally, in SCA (rows 14–15), statistical independence of sources may be necessary and thus stochastic models are applied.

2 Underdetermined system of linear equations

In most of the applications where sparsity constraint plays a significant role, we are dealing with under-determined system of linear equations; i.e., a sparse vector s_{n×1} is observed through a linear mixing system denoted by A_{m×n}where m<n:

Since m<n, the vector s_{n×1} cannot be uniquely recovered by observing the measurement vector x_{m×1}; however, among the infinite number of solutions to (1), the sparsest solution may be unique. For instance, if no 2k columns of A_{m×n} are linearly dependent, the null-space of A_{m×n} does not include any 2k-sparse vector (at most 2k non-zero elements) and therefore, the measurement vectors (x_{m×n}) of different k-sparse vectors are different. Thus, if s_{n×1}is sparse enough (k-sparse), the sparsest solution of (1) is unique and coincides with s_{n×1}; i.e., perfect recovery. Unfortunately, there are two obstacles here: (1) the vector x_{m×1} often includes an additive noise term, and (2) finding the sparsest solution of a linear system is an NP problem in general.

Since in the rest of the article, we are frequently dealing with the problem of reconstructing the sparsest solution of (1), we first review some of the important reconstruction methods in this section.

2.1 Greedy methods

Mallat and Zhang [38] have developed a general iterative method for approximating sparse decomposition. When the dictionary is orthogonal and the signal x is composed of k≪n atoms, the algorithm recovers the sparse decomposition exactly after n steps. The introduced method which is a greedy algorithm [39], is usually referred to as Matching Pursuit. Since the algorithm is myopic, in some certain cases, wrong atoms are chosen in the first few iterations, and thus the remaining iterations are spent on correcting the first few mistakes. The concepts of this method are the basis of other advanced greedy methods such as OMP [40] and CoSaMP [41]. The algorithms of these greedy methods (MP, OMP, and CoSaMP) are shown in Table 4.

Table 4

Greedy algorithms

1. Let $\widehat{\mathbf{s}}={\mathbf{0}}_{n\times 1},\phantom{\rule{1em}{0ex}}{\mathbf{r}}^{\left(0\right)}=\mathbf{x}$, ${\mathcal{S}}^{\left(0\right)}=\varnothing $ and i=1.

2. Evaluate c_{
j
}=〈r^{(i−1)},a_{
j
}〉for $j=1,\dots ,n$ where a_{
j
}’s are the columns of the mixing matrix A(atoms) and sort c_{
j
}’s as $\left|{c}_{{j}_{1}}\right|\ge \cdots \ge \left|{c}_{{j}_{n}}\right|$.

3. ● MP: Set ${\mathcal{S}}^{\left(i\right)}={\mathcal{S}}^{(i-1)}\cup {j}_{1}$.

● OMP: Set ${\mathcal{S}}^{\left(i\right)}={\mathcal{S}}^{(i-1)}\cup {j}_{1}$ and ${\mathbf{A}}_{m\times \left|{\mathcal{S}}^{\left(i\right)}\right|}={\left[{\mathbf{a}}_{j}\right]}_{j\in {\mathcal{S}}^{\left(i\right)}}$.

● CoSaMP: Set ${\mathcal{S}}^{\left(i\right)}={\mathcal{S}}^{(i-1)}\cup \{{j}_{1},\dots ,{j}_{2k}\}$ and ${\mathbf{A}}_{m\times \left|{\mathcal{S}}^{\left(i\right)}\right|}={\left[{\mathbf{a}}_{j}\right]}_{j\in {\mathcal{S}}^{\left(i\right)}}$.

4. ● MP: −−−

● OMP & CoSaMP: Find $\stackrel{~}{\mathbf{s}}$ that ${\mathbf{A}}^{\left(i\right)}\xb7\stackrel{~}{\mathbf{s}}=\mathbf{x}$.

5. ● MP & OMP: −−−

● CoSaMP: Sort the values of $\stackrel{~}{\mathbf{s}}$ as $\left|{\stackrel{~}{s}}_{{t}_{1}}\right|\ge \left|{\stackrel{~}{s}}_{{t}_{2}}\right|\ge \dots \phantom{\rule{0.3em}{0ex}}$ and redefine ${j}_{1},\dots ,{j}_{k}$ as the indices of the columns in A that correspond to the columns ${t}_{1},\dots ,{t}_{k}$ in A^{(i)}. Also set ${\mathcal{S}}^{\left(i\right)}=\{{j}_{1},\dots ,{j}_{k}\}$.

6. ● MP: Set ${\u015d}_{{j}_{1}}={c}_{{j}_{1}}$.

● OMP & CoSaMP: Set ${\u015d}_{{j}_{l}}={\stackrel{~}{s}}_{l}$ for $l=1,\dots ,k$ and ${\u015d}_{l}=0$ where $l\notin {\mathcal{S}}^{\left(i\right)}$.

7. Set ${\mathbf{r}}^{\left(i\right)}=\mathbf{x}-\mathbf{A}\xb7\widehat{\mathbf{s}}$.

8. Stop if $\parallel {\mathbf{r}}^{\left(i\right)}{\parallel}_{{\ell}_{2}}$ is smaller than a desired threshold or when a maximum number of iterations is reached; otherwise, increase i and go to step 2.

2.2 Basis pursuit

The mathematical representation of counting the number of sparse components is denoted by ℓ_{0}. However, ℓ_{0}is not a proper norm and is not computationally tractable. The closest convex norm to ℓ_{0} is ℓ_{1}. The ℓ_{1}optimization of an overcomplete dictionary is called Basis Pursuit. However the ℓ_{1}-norm is non-differentiable and we cannot use gradient methods for optimal solutions [42]. On the other hand, the ℓ_{1} solution is stable due to its convexity (the global optimum is the same as the local one) [20].

We now explain how the Basis Pursuit is related to LP. The standard form of LP is a constrained optimization problem defined in terms of variable $\mathbf{x}\in {\mathbb{R}}^{n}$ by:

where C^{
T
}x is the objective function, Ax=b is a set of equality constraints and ∀i: x_{
i
}≥0is a set of bounds. Table 5 shows this relationship. Thus, the solution of (2) can be obtained by solving the equivalent LP. The Interior Point methods are the main approaches to solve LP.

Table 5

Relation between LP and basis pursuit (the notation for LP is from [[43]])

The GPSR technique [44] is considered as one of the fast variations of the ℓ_{1}-minimization method and consists of solving the following minimization problem:

Note that J(s) is almost the Lagrange form of the constraint problem in (2) where the Lagrange multiplier is defined as $\frac{1}{2\tau}$, with the difference that in (4), the minimization procedure is performed exclusively on s and not on τ. Thus, the outcome of (4) coincides with that of (2) only when the proper τ is used. For a fast implementation of (4), the positive and negative elements of s are treated separately, i.e.,

Now by assuming that all the vectors and matrices are real, it is easy to check that the minimizer of the following cost function (F) corresponds to the minimizer of J(s):

In GPSR, the latter cost function is iteratively minimized by moving in the opposite direction of the gradient while respecting the condition z≥0. There step-wise explanation of the basic GPSR method is given in Table 6. In this table, (a)_{+} denotes the value max{a,0} while (a)_{+} indicates the element-wise action of the same function on the vector A. There is another adaptation of this method known as Barzilai-Borwein (BB) GPSR which is not discussed here.

Table 6

Basic GPSR algorithm

1. Initialize β∈(0,1), $\mu \in (0,\frac{1}{2})$, α_{0}and z^{(0)}. Also set i=0.

2. Choose α^{(i)}to be the largest number of the form α_{0}β^{
j
}, j≥0, such that

3. Set z^{(i + 1)}=(z^{(i)}−α^{(i)}∇F(z^{(i)}))_{+}.

4. Check the termination criterion. If neither the maximum number of iterations has passed nor a given stopping condition is fulfilled, increase i and return to the 2nd step.

Instead of using the gradient method for solving (4), it is possible to approximate the cost function. To explain this idea, let s^{(0)} be an estimate of the minimizer of (4) and let $\stackrel{~}{J}\left(\mathbf{s}\right)$ be a cost function that satisfies:

Now if s^{(1)} is the minimizer of $\stackrel{~}{J}\left(.\right)$, we should have J(s^{(1)})≤J(s^{(1)}); i.e., s^{(1)} better estimates the minimizer of J(.) than s^{(0)}. This technique is useful only when finding the minimizer of $\stackrel{~}{J}\left(.\right)$ is easier than solving the original problem. In ISTA [45], at the k th iteration and by having the estimate s^{(i)}, the following alternative cost function is used:

where β is a scalar larger than all squared singular values of A to ensure (7). By modifying the constant terms and rewriting the above cost function, one can check that the minimizer of ${\stackrel{~}{J}}_{i}\left(.\right)$ is essentially the same as

Note that the minimization problem in (9) is separable with respect to the elements of s and we just need to find the minimizer of the single-variable cost function $\frac{\beta}{2}{(s-z)}^{2}+\tau \left|s\right|$, which is the well-known shrinkage-threshold operator:

The steps of the ISTA algorithm are explained in Table 7.

Table 7

ISTA algorithm

1. Choose the scalar β larger than all the singular values of A and set i=0. Also initialize s^{(0)}, e.g, s^{(0)}=A^{+}x.

2. Set ${\mathbf{z}}^{\left(i\right)}={\mathbf{s}}^{\left(i\right)}+\frac{1}{\beta}{\mathbf{A}}^{H}(\mathbf{x}-\mathbf{A}{\mathbf{s}}^{\left(i\right)})$.

3. Apply the shrinkage-threshold operator defined in (11):

4. Check the termination criterion. If neither the maximum number of iterations has passed nor a given stopping condition is fulfilled, increase i and return to the 2nd step.

2.5 FOCal underdetermined system solver (FOCUSS)

FOCal underdetermined system solver is a non-parametric algorithm that consists of two parts [46]. It starts by finding a low resolution estimation of the sparse signal, and then pruning this solution to a sparser signal representation through several iterations. The solution at each iteration step is found by taking the pseudo-inverse of a modified weighted matrix. The pseudo-inverse of the modified weighted matrix is defined by (AW)^{+} =(AW)^{
H
}(AW·(AW)^{
H
})^{−1}. This iterative algorithm is the solution of the following optimization problem:

The idea behind this method is based on a geometrical interpretation of the sparsity. Consider the elements of vector s are i.i.d. random variables. By plotting a sample distribution of vector s, which is obtained by plotting a large number of samples in the S-space, it is observed that the points tend to concentrate first around the origin, then along the coordinate axes, and finally across the coordinate planes. The algorithm used in IDE is given in Table 9. In this table, s_{
i
}s are the inactive sources, s_{
a
}s are the active sources, A_{
i
} is the column of A corresponding to the inactive s_{
i
} and A_{
a
} is the column of A corresponding to the active s_{
a
}. Notice that IDE has some resemblances to the RDE method discussed in Section 4.1.2, IMAT mentioned in Section 4.1.2, and MIMAT explained in Section 8.1.2.

Table 9

IDE steps

● Detection Step: Find indices of inactive sources:

where the matrices and vectors are partitioned into inactive/active parts as A_{
i
},A_{
a
},s_{
i
},s_{
a
}and $\mathbf{P}={\left({\mathbf{A}}_{i}{\mathbf{A}}_{i}^{T}\right)}^{-1}$

● Stop after a fixed number of iterations.

2.7 Smoothed ℓ_{0}-norm (SL0) method

As discussed earlier, the criterion for sparsity is the ℓ_{0}-norm; thus our minimization is

The ℓ_{0}-norm has two major drawbacks: the need for a combinatorial search, and its sensitivity to noise. These problems arise from the fact that the ℓ_{0}-norm is discontinuous. The idea of SL0 is to approximate the ℓ_{0}-norm with functions of the type [47]:

For the vector s, we have $\parallel \mathbf{s}{\parallel}_{{\ell}_{0}}\approx n-{F}_{\sigma}\left(s\right)$, where ${F}_{\sigma}\left(s\right)=\sum _{i=1}^{n}{f}_{\sigma}\left({s}_{i}\right)$. Now minimizing $\parallel \mathbf{s}{\parallel}_{{\ell}_{0}}$ is equivalent to maximizing F_{
σ
}(s) for some appropriate values of σ. For small values of σ, F_{
σ
}(s)is highly non-smooth and contains many local maxima, and therefore its maximization over A·s=x may not be global. On the other hand, for larger values of σ, F_{
σ
}(s) is a smoother function and contains fewer local maxima, and its maximization may be possible (in fact there are no local maxima for large values of σ[47]). Hence we use a decreasing sequence for σ in the steepest ascent algorithm and may escape from getting trapped into local maxima and reach the actual maximum for small values of σ, which gives the minimum ℓ_{0}-norm solution. The algorithm is summarized in Table 10.

Table 10

SL0 steps

● Initialization:

1. Set ${\widehat{\mathbf{s}}}_{0}$ equal to the minimum ℓ_{2}-norm solution of As=x, obtained by pseudo-inverse of A.

2. Choose a suitable decreasing sequence for σ, $[{\sigma}_{1},\dots ,{\sigma}_{K}]$.

● For $i=1,\dots ,K$:

1. Set σ=σ_{
i
},

2. Maximize the function F_{
σ
}on the feasible set $\mathcal{S}=\left\{\mathbf{s}\right|\mathbf{A}\mathbf{s}=\mathbf{x}\}$ using L iterations of the steepest ascent algorithm (followed by projection onto the feasible set):

● Final answer is $\widehat{\mathbf{s}}={\widehat{\mathbf{s}}}_{K}$

2.8 Comparison of different techniques

The above techniques have been simulated and the results are depicted in Figure 3. In order to compare the efficiency and computational complexity of these methods, we use a fixed synthetic mixing matrix and source vectors. The elements of the mixing matrix are obtained from zero mean independent Gaussian random variables with variance σ^{2} = 1. Sparse sources have been artificially generated using a Bernoulli–Gaussian model: s_{
i
} = pN(0,σ_{
on
}) + (1−p)N(0,σ_{
off
}). We set σ_{
off
} = 0.01,σ_{
on
} = 1and p = 0.1. Then, we compute the noisy mixture vector x from x = As + ν, where ν is the noise vector. The elements of the vector ν are generated according to independent zero mean Gaussian random variables with variance ${\sigma}_{\nu}^{2}$. We use orthogonal matching pursuit (OMP) which is a variant of Matching Pursuit [38]. OMP has a better performance in estimating the source vector in comparison to Matching Pursuit. Figure 4 demonstrates the time needed for each algorithm to estimate the vector s with respect to the number of sources. This figure shows that IDE and SL0 have the lowest complexity.

Figures 5 and 6 illustrate a comparison of several sparse reconstruction methods for sparse DFT signals and sparse random transformations, respectively. In all the simulations, the block size of the sparse signal is 512 while the number of sparse signal components in the frequency domain is 20. The compression rate is 25% which leads to a selection of 128 time domain observation samples.

In Figure 5, the greedy algorithms, COSAMP and OMP, demonstrate better performances than ISTA and GPSR, especially at lower input signal SNRs. IMAT shows a better performance than all other algorithms; however its performance in the higher input signal SNRs is almost similar to OMP and COSAMP. In Figure 6, OMP and COSAMP have better performances than the other ones while ISTA, SL0, and GPSR have more or less the same performances. In sparse DFT signals, the complexity of the IMAT algorithm is less than the others while ISTA is the most complex algorithm. Similarly in Figure 6, SL0 has the least complexity.

Analog signals can be represented by finite rate discrete samples (uniform, nonuniform, or random) if the signal has some sort of redundancies such as band-limitedness, finite polynomial representation (e.g., periodic signals that are represented by a finite number of trigonometric polynomials), and nonlinear functions of such redundant functions [48, 49]. The minimum sampling rate is the Nyquist rate for uniform sampling and its generalizations for nonuniform [1] and multiband signals [50]. When a signal is discrete, the equivalent discrete representation in the “frequency” domain (DFT, DCT, DWT, Discrete Hartley Transform (DHT), Discrete Sine Transform (DST)) may be sparse, which is the discrete version of bandlimited or multiband analog signals where the locations of the bands are unknown.

For discrete signals, if the nonzero coefficients (“frequency” sparsity) are consecutive, depending on the location of the zeros, they are called lowpass, bandpass, or multiband discrete signals; if the locations of the nonzero coefficients do not follow any of these patterns, the “frequency” sparsity is random. The number of discrete time samples needed to represent a frequency-sparse signal with known sparsity pattern follows the law of algebra, i.e., the number of time samples should be equal to the number of coefficients in the “frequency” domain; since the two domains are related by a full rank transform matrix, recovery from the time samples is equivalent to solving an invertible k×k system of linear equations where k is the number of sparse coefficients. For band-limited real signals, the Fourier transform (sparsity domain) consists of similar nonzero patterns in both negative and positive frequencies where only the positive part is counted as the bandwidth; thus, the law of algebra is equivalent to the Nyquist rate, i.e., twice the bandwidth (for discrete signals with DC components it is twice the bandwidth minus one). The dual of frequency-sparsity is time-sparsity, which can happen in a burst or a random fashion. The number of “frequency” coefficients needed follows the Nyquist criterion. This will be further discussed in Section 4 for sparse additive impulsive noise channels.

3.1 Sampling of sparse signals

If the sparsity locations of a signal are known in a transform domain, then the number of samples needed in the time (space) domain should be at least equal to the number of sparse coefficients, i.e., the so-called Nyquist rate. However, depending on the type of sparsity (lowpass, bandpass, or random) and the type of sampling (uniform, periodic nonuniform, or random), the reconstruction may be unstable and the corresponding reconstruction matrix may be ill-conditioned [51, 52]. Thus in many applications discussed in Table 1, the sampling rate in column 6 is higher than the minimum (Nyquist) rate.

When the location of sparsity is not known, by the law of algebra, the number of samples needed to specify the sparsity is at least twice the number of sparse coefficients. Again for stability reasons, the actual sampling rate is higher than this minimum figure [1, 50]. To guarantee stability, instead of direct sampling of the signal, a combination of the samples can be used. Donoho has recently shown that if we take linear combinations of the samples, the minimum stable sampling rate is of the order $O(klog(\frac{n}{k}\left)\right)$, where n and k are the frame size and the sparsity order, respectively [29].

3.1.1 Reconstruction algorithms

There are many reconstruction algorithms that can be used depending on the sparsity pattern, uniform or random sampling, complexity issues, and sensitivity to quantization and additive noise [53, 54]. Among these methods are LP, lagrange interpolation [55], time varying method [56], spline interpolation [57], matrix inversion [58], error locator polynomial (ELP) [59], iterative techniques [52, 60–65], and IMAT [25, 31, 66, 67]. In the following, we will only concentrate on the last three methods as well as the first (LP) that have been proven to be effective and practical.

Iterative methods when the location of sparsity is known

The reconstruction algorithms have to recover the original sparse signal from the information domain and the type of sparsity in the transform domain. We know the samples in the information domain (both position and amplitude) and we know the location of sparsity in the transform domain. An iteration between these two domains (Figure 7 and Table 11) or consecutive Projections Onto Convex Sets (POCS) should yield the original signal [51, 61, 62, 65, 68–71].

Table 11

The iterative algorithm based on the block diagram of Figure7

1. Take the transform (e.g. the Fourier transform) of the input to the i^{
th
}iteration (x^{(i)}) and denote it as X^{(i)}; x^{(0)} is normally the initial received signal.

2. Multiply X^{(i)} by a mask (for instance a band-limiting filter).

3. Take the inverse transform of the result in step 2 to get r^{(i)}.

4. Set the new result as: x^{(i + 1)}=x^{(0)} + x^{(i)}−r^{(i)}.

5. Repeat for a given number of iterations.

6. Stop when $\parallel {\mathbf{x}}^{(i+1)}-{\mathbf{x}}^{\left(i\right)}{\parallel}_{{\ell}_{2}}<\epsilon $.

In the case of the usual assumption that the sparsity is in the “frequency” domain and for the uniform sampling case of lowpass signals, one projection (bandlimiting in the frequency domain) suffices. However, if the frequency sparsity is random, the time samples are nonuniform, or the “frequency” domain is defined in a domain other than the DFT, then we need several iterations to have a good replica of the original signal. In general, this iterative method converges if the “Nyquist” rate is satisfied, i.e., the number of samples per block is greater than or equal to the number of coefficients. Figure 8 shows the improvement in dB versus the number of iterations for a random sampling set for a bandpass signal. In this figure, besides the standard iterative method, accelerated iterations such as Chebyshev and conjugate gradient methods are also used (please see [72] for the algorithms).

Iterative methods are quite robust against quantization and additive noise. In fact, we can prove that the iterative methods approach the pseudo-inverse (least squares) solution for a noisy environment; specially, when the matrix is ill-conditioned [50].

Iterative method with adaptive threshold (IMAT) for unknown location of sparsity

As expected, when sparsity is assumed to be random, further signal processing is needed. We need to evaluate the number of sparse coefficients (or samples), the position of sparsity, and the values of the coefficients. The above iterative method cannot work since projection (the masking operation in Figure 7) onto the “frequency” domain is not possible without the knowledge of the positions of sparse coefficients. In this scenario, we need to use the knowledge of sparsity in some way. The introduction of an adaptive nonlinear threshold in the iterative method can do the trick and thus the name, IMAT; the block diagram and the pseudo-code are depicted in Figure 9 and Table 12, respectively. The algorithms in [23, 25, 31, 73] are variations of this method. Figure 9 shows that by alternate projections between information and sparsity domains (adaptively lowering or raising the threshold levels in the sparsity domain), the sparse coefficients are gradually picked up after several iterations. This method can be considered as a modified version of Matching Pursuit as described in Section 2.1; the results are shown in Figure 10. The sampling rate in the time domain is twice the number of unknown sparse coefficients. This is called the full capacity rate; this figure shows that after approximately 15 iterations, the SNR reaches its peak value. In general, the higher the sampling rate relative to the full capacity, the faster is the convergence rate and the better the SNR value.

Table 12

Generic IMAT of Figure9for any sparsity in the DT, which is typically DFT

1. Use the all-zero block as the initial value of the sparse domain signal (0^{
th
} iteration)

2. Convert the current estimate of the signal in the sparse domain into the information domain (for instance the time domain into the Fourier domain)

3. Where possible, replace the values with the known samples of the signal in the information domain.

4. Convert the signal back to the sparse domain.

5. Use adaptive hard thresholding to distinguish the original nonzero samples.

6. If neither the maximum number of iterations has past nor a given stopping condition is fulfilled, return to the 2nd step.

Matrix solutions

When the sparse nonzero locations are known, matrix approaches can be utilized to determine the values of sparse coefficients [58]. Although these methods are rather straightforward, they may not be robust against quantization or additive noise when the matrices are ill conditioned.

There are other approaches such as Spline interpolation [57], nonlinear/time varying methods [58], Lagrange interpolation [55] and error locator polynomial (ELP) [74] that will not be discussed here. However, the ELP approach will be discussed in Section 4.1; variations of this method are called the annihilating filter in sampling with finite rate of innovation (Section 3.3) and Prony’s method in spectral and DOA estimation (Section 5.1). These methods work quite well in the absence of additive noise but they may not be robust in the presence of noise. In the case of additive noise, the extensions of the Prony method (ELP) such as Pisarenko harmonic decomposition (PHD), MUSIC and Estimation of signal parameters via rotational invariance techniques (ESPRIT) will be discussed in Sections 5.2, 5.3, and 6.

3.2 Compressed sensing (CS)

The relatively new topic of CS (Compressive) for sparse signals was originally introduced in [29, 75] and further extended in [30, 76, 77]. The idea is to introduce sampling schemes with low number of required samples which uniquely represent the original sparse signal; these methods have lower computational complexities than the traditional techniques that employ oversampling and then apply compression. In other words, compression is achieved exactly at the time of sampling. Unlike the classical sampling theorem [78] based on the Fourier transform, the signals are assumed to be sparse in an arbitrary transform domain. Furthermore, there is no restricting assumption for the locations of nonzero coefficients in the sparsity domain; i.e., the locations should not follow a specific pattern such as lowpass or multiband structure. Clearly, this assumption includes a more general class of signals than the ones previously studied.

Since the concept of sparsity in a transform domain is more convenient to study for discrete signals, most of the research in this field is focused along discrete type signals [79]; however, recent results [80] show that most of the work can be generalized to continuous signals in shift-invariant subspaces (a subclass of the signals which are represented by Riesz basis).^{c} We first study discrete signals and then briefly discuss the extension to the continuous case.

3.2.1 CS mathematical modeling

Let the vector $\mathbf{x}\in {\mathbb{R}}^{n}$ be a finite length discrete signal which has to be under-sampled. We assume that x has a sparse representation in a transform domain denoted by a unitary matrix Ψ_{n×n}; i.e., we have:

where s is an n×1vector which has at most k non-zero elements (k-sparse vectors). In practical cases, s has at most k significant elements and the insignificant elements are set to zero which means s is an almost k-sparse vector. For example, x can be the pixels of an image and Ψ can be the corresponding IDCT matrix. In this case, most of the DCT coefficients are insignificant and if they are set to zero, the quality of the image will not degrade significantly. In fact, this is the main concept behind some of the lossy compression methods such as JPEG. Since the inverse transform on x yields s, the vector s can be used instead of x, which can be succinctly represented by the locations and values of the nonzero elements of s. Although this method efficiently compresses x, it initially requires all the samples of x to produce s, which undermines the whole purpose of CS.

Now let us assume that instead of samples of x, we take m linear combinations of the samples (called generalized samples). If we represent these linear combinations by the matrix Φ_{m×n} and the resultant vector of samples by y_{m×1}, we have

The question is how the matrix Φ and the size m should be chosen to ensure that these samples uniquely represent the original signal x. Obviously, the case of Φ= I_{n×n}where I_{n×n} is an n×n identity matrix yields a trivial solution (keeping all the samples of x) that does not employ the sparsity condition. We look for Φ matrices with as few rows as possible which can guarantee the invertibility, stability, and robustness of the sampling process for the class of sparse inputs.

To solve this problem, we introduce probabilistic measures; i.e., instead of exact recovery of signals, we focus on the probability that a random sparse signal (according to a given probability density function) fails to be reconstructed using its generalized samples. If the probability δ of failure can be made arbitrarily small, then the sampling scheme (the joint pair of Ψ,Φ) is successful in recovering x with probability 1−δ, i.e., with high probability.

Let us assume that Φ^{(m)}represents the submatrix formed by m random (uniform) rows of an orthonormal matrix Φ_{n×n}. It is apparent that if we use ${\left\{{\mathit{\Phi}}^{\left(m\right)}\right\}}_{m=0}^{n}$ as the sampling matrices for a given sparsity domain, the failure probabilities for Φ^{(0)} and Φ^{(n)} are, respectively, one and zero, and as the index m increases, the failure probability decreases. The important point shown in [81] is that the decreasing rate of the failure probability is exponential with respect to $\frac{m}{k}$. Therefore, we expect to reach an almost zero failure probability much earlier than m = n despite the fact that the exact rate highly depends on the mutual behavior of the two matrices Ψ,Φ. More precisely, it is shown in [81] that

where P_{failure} is the probability that the original signal cannot be recovered from the samples, c is a positive constant, and μ(Ψ,Φ) is the maximum coherence between the columns of Ψ and rows of Φ defined by [82]:

where ψ_{
a
},ϕ_{
b
} are the a^{
th
} column and the b^{
th
} row of the matrices Ψ and Φ, respectively. The above result implies that the probability of reconstruction is close to one for

The above derivation implies that the smaller the maximum coherence between the two matrices, and the lower is the number of required samples. Thus, to decrease the number of samples, we should look for matrices Φ with low coherence with Ψ. For this purpose, we use a random Φ. It is shown that the coherence of a random matrix with i.i.d. Gaussian distribution with any unitary Ψ is considerably small [29], which makes it a proper candidate for the sampling matrix. Investigation of the probability distribution has shown that the Gaussian PDF is not the only solution (for example binary Bernouli distribution and other types are considered in [83]) but may be the simplest to analyze.

For the case of random matrix with i.i.d. Gaussian distribution (or more general distributions for which the concentration inequality holds [83]), a stronger inequality compared with (20) is valid; this implies that for the reconstruction with a probability of almost one, the following condition for the number of samples m suffices [2, 79]:

Notice that the required number of samples given in (20) is for random sampling of an orthonormal basis while (21) represents the required number of samples with i.i.d. Gaussian distributed sampling matrix. Typically, the number in (21) is less than that of (20).

3.2.2 Reconstruction from compressed measurements

In this section, we consider reconstruction algorithms and the stability robustness issues. We briefly discuss the following three methods: a—geometric, b—combinatorial, and c—information theoretic. The first two methods are standard while the last one is more recent.

Geometric methods

The oldest methods for reconstruction from compressed sampling are geometric, i.e., ℓ_{1} minimization techniques for finding a k-sparse vector $\mathbf{s}\in {\mathbb{R}}^{n}$ from a set of m=O(k log(n))measurements (y_{
i
}s); see e.g., [29, 81, 84–86]. Let us assume that we have applied a suitable Φ which guarantees the invertibility of the sampling process. The reconstruction method should be a technique to recover a k-sparse vector s_{n×1} from the observed samples y_{m×1} = Φ_{m×n}·Ψ_{n×n}·s_{n×1}or possibly y_{m×1} = Φ_{m×n}·Ψ_{n×n}·s_{n×1} + ν_{m×1}, where ν denotes the noise vector. Suitability of Φ implies that s_{n×1}is the only k-sparse vector that produces the observed samples; therefore, s_{n×1} is also the sparsest solution for y = Φ·Ψ·s. Consequently, s can be found using

Good methods for the minimization of an ℓ_{0}-norm (sparsity) do not exist. The ones that are known are either computationally prohibitive or are not well behaved when the measurements are corrupted with noise. However, it is shown in [82] and later in [76, 87] that minimization of an ℓ_{1}-norm results in the same vector s for many cases:

The interesting part is that the number of required samples to replace ℓ_{0} with ℓ_{1}-minimization has the same order of magnitude as the one for the invertibility of the sampling scheme. Hence, s can be derived from (22) using ℓ_{1}-minimization. It is worthwhile to mention that replacement of ℓ_{1}-norm with ℓ_{2}-norm, which is faster to implement, does not necessarily produce reasonable solutions. However, there are greedy methods (Matching Pursuit as discussed in Section 7 on SCA [40, 88]) which iteratively approach the best solution and compete with the ℓ_{1}-norm optimization (equivalent to Basis Pursuit methods as discussed in Section 7 on SCA).

To show the performance of the BP method, we have reported the famous phase transition diagram from [89] in Figure 11; this figure characterizes the perfect reconstruction region with respect to the parameters k/m and m/n. In fact, the curve represents the points for which the BP method recovers the sparse signal measured through a Gaussian random matrix with probability 50%. The interesting point is that the transition from the high-probability region (below the curve) to the low-probability one (above the curve) is very sharp and when n→∞ the plotted curve separates the regions for probabilities 0 and 100%. The empirical results show that by deviating from the Gaussian distribution, the curve does not change while it is yet to be proved [89].

A sufficient condition for these methods to work is that the matrix Φ·Ψ must satisfy the so-called restricted isometric property (RIP) [75, 83, 90]; which will be discussed in the following section.

Restricted isometric property

It is important to note that the ℓ_{1}-minimization algorithm produces almost optimal results for signals that are not k-sparse. For example, almost sparse signals (compressible signals) are more likely to occur in applications than exactly k-sparse vectors, (e.g., the wavelet transform of an image consists mostly of small coefficients and a few large coefficients). Moreover, even exactly k-sparse signals may be corrupted by additive noise. This characteristic of ℓ_{1}-minimization algorithms is called stability. Specifically, if we let β_{
k
}(s) denote the smallest possible error (in the ℓ_{1}-norm) that can be achieved by approximating a signal s by a k-sparse vector z

then the vector $\widehat{\mathbf{s}}$ produced by the ℓ_{1}-reconstruction method is almost optimal in the sense that $\parallel \mathbf{s}-\widehat{\mathbf{s}}{\parallel}_{{\ell}_{1}}\le C{\beta}_{k}\left(\mathbf{s}\right)$ for some constant C independent of s. An implication of stability is that small perturbations in the signal caused by noise result in small distortions in the output solution. The previous result means that if s is not k-sparse, then $\widehat{\mathbf{s}}$ is close to the k-sparse vector ${\mathbf{s}}_{k}^{o}$ that has the k-largest components of s. In particular, if s is k-sparse, then sko = s. This stability property is different from the so-called robustness which is another important characteristic that we wish to have in any reconstruction algorithm. Specifically, an algorithm is robust if small perturbations in the measurements are reflected in small errors in the reconstruction. Both stability and robustness are achieved by the ℓ_{1}-minimization algorithms (after a slight modification of (22), see [83, 91]). Although the two concepts of robustness and stability can be related, they are not the same.

In compressed sensing, the degree of stability and robustness of the reconstruction is determined by the characteristics of the sampling matrix Φ. We say that the matrix Φ has RIP of order k, when for all k-sparse vectors s, we have [30, 76]:

where 0≤δ_{
k
}<1(isometry constant). The RIP is a sufficient condition that provides us with the maximum and minimum power of the samples with respect to the input power and ensures that none of the k-sparse inputs fall in the null space of the sampling matrix. The RIP property essentially states that every k columns of the matrix Φ_{m×n}must be almost orthonormal (these submatrices preserve the norm within the constants 1±δ_{
k
}). The explicit construction of a matrix with such a property is difficult for any given n,k and m≈k logn; however, the problem has been studied in some cases [37, 92]. Moreover, given such a matrix Φ, the evaluation of s (or alternatively x) via the minimization problem involves numerical methods (e.g., linear programming, GPSR, SPGL1, FPC [44, 93]) for n variables and m constraints which can be computationally expensive.

However, probabilistic methods can be used to construct m×n matrices satisfying the RIP property for a given n,k and m≈k logn. This can be achieved using Gaussian random matrices. If Φ is a sample of a Gaussian random matrix with the number of rows satisfying (20), Φ·Ψ is also a sample of a Gaussian random matrix with the same number of rows and thus it satisfies RIP with high probability. Using matrices with the appropriate RIP property in the ℓ_{1}-minimization, we guarantee exact recovery of k-sparse signals that are stable and robust against additive noise.

Without loss of generality, assume that Ψ is equal to the identity matrix I, and that instead of Φ·s, we measure Φ·s + ν, where ν represents an additive noise vector. Since Φ·s + ν may not belong to the range space of Φ over k-sparse vectors, the ℓ_{1}minimization of (25) is modified as follows:

where ε^{2}is the maximum noise power. Let us denote the result of the above minimization for y=Φ·s + ν by $\widehat{\mathbf{s}}$. With the above algorithm, it can be shown that

This shows that small perturbations in the measurements cause small perturbations in the output of the ℓ_{1}-minimization method (robustness).

Combinatorial

Another standard approach for reconstruction of compressed sampling is combinatorial. As before, without loss of generality Ψ = I. The sampling matrix Φ is found using a bipartite graph which consists of binary entries, i.e., entries that are either 1 or 0. Binary search methods are then used to find an unknown k-sparse vector $\mathbf{s}\in {\mathbb{R}}^{n}$, see, e.g., [84, 94–100] and the references therein. Typically, the binary matrix Φ has m = O(k logn) rows, and there exist fast algorithms for finding the solution x from the m measurements (typically a linear combination). However, the construction of Φ is also difficult.

Information theoretic

A more recent approach is adaptive and information theoretic [101]. In this method, the signal $\mathbf{s}\in {\mathbb{R}}^{n}$ is assumed to be an instance of a vector random variable $\mathbf{s}={({s}_{1},\dots ,{s}_{n})}^{t}$, where (.)^{
t
} denotes transpose operator, and the ith row of Φ is constructed using the value of the previous sample y_{i−1}. Tools from the theory of Huffman coding are used to develop a deterministic construction of a sequence of binary sampling vectors (i.e., their components consist of 0 or 1) in such a way as to minimize the average number of samples (rows of Φ) needed to determine a signal. In this method, the construction of the sampling vectors can always be obtained. Moreover, it is proved that the expected total cost (number of measurements and reconstruction combined) needed to sample and reconstruct a k-sparse vector in R^{
n
} is no more than k logn + 2k.

where B is the bandwidth of x(t)with the Nyquist interval T_{
s
} = 1/2B. These uniform samples can be regarded as the degrees of freedom of the signal; i.e., a lowpass signal with bandwidth B has one degree of freedom in each Nyquist interval T_{
s
}. Replacing the sinc function with other kernels in (27), we can generalize the sparsity (bandlimitedness) in the Fourier domain to a wider class of signals known as the shift invariant (SI) spaces:

Similarly, the above signals have one degree of freedom in each T_{
s
} period of time (the coefficients c_{
i
}). A more general definition for the degree of freedom is introduced in [3] and is named the Rate of Innovation. For a given signal model, if we denote the degree of freedom in the time interval of [t_{1},t_{2}] by C_{
x
}(t_{1},t_{2}), the local rate of innovation is defined by $\frac{1}{{t}_{2}-{t}_{1}}{C}_{x}({t}_{1},{t}_{2})$ and the global rate of innovation (ρ) is defined as

provided that the limit exists; in this case, we say that the signal has finite rate of innovation [3, 27, 102, 103]. As an example, for the lowpass signals with bandwidth B we have ρ = 2B, which is the same as the Nyquist rate. In fact by proper choice of the sampling process, we are extracting the innovations of the signal. Now the question that arises is whether the uniform sampling theorems can be generalized to the signals with finite rate of innovation. Answer is positive for a class of non-bandlimited signals including the SI spaces. Consider the following signals:

where ${\left\{{\phi}_{r}\right(t\left)\right\}}_{r=1}^{k}$ are arbitrary but known functions and ${\left\{{t}_{i}\right\}}_{i\in \mathbb{Z}}$ is a realization of a point process with mean μ. The free parameters of the above signal model are {c_{i,r}}and {t_{
i
}}. Therefore, for this class of signals we have $\rho =\frac{2}{\mu}$; however, the classical sampling methods cannot reconstruct these kinds of signals with the sampling rate predicted by ρ. There are many variations for the possible choices of the functions φ_{
r
}(t); nonetheless, we just describe the simplest version. Let the signal x(t)be a finite mixture of sparse Dirac functions:

where {t_{
i
}} is assumed to be an increasing sequence. For this case, since there are k unknown time instants and k unknown coefficients, we have C_{
x
}(t_{1},t_{
k
}) = 2k. We intend to show that the samples generated by proper sampling kernels φ(t)can be used to reconstruct the sparse Dirac functions. In fact, we choose the kernel φ(t) to satisfy the so called Strang-Fix condition of order 2k:

where Φ(Ω) denotes the Fourier transform of φ(t), and the superscript (r) represents the r^{
th
} derivative. It is also shown that such functions are of the form φ(t) = f(t)∗β_{2k}(t), where β_{2k}(t) is the B-spline of order 2k^{
th
}and f(t)is an arbitrary function with nonzero DC frequency [102]. Therefore, the function β_{2k}(t) is itself among the possible options for the choice of φ(t).

We can show that for the sampling kernels which satisfy the Strang-Fix condition (32), the innovations of the signal x(t) (31) can be extracted from the samples (y [j]):

In other words, we have filtered the discrete samples (y [j]) in order to obtain the values τ_{
r
}; (35) shows that these values are only a function of the innovation parameters (amplitudes c_{
i
} and time instants t_{
i
}). However, the values τ_{
r
}are nonlinearly related to the time instants and therefore, the innovations cannot be extracted from τ_{
r
} using linear algebra.^{d}However, these nonlinear equations form a well-known system which was studied by Prony in the field of spectral estimation (see Section 5.1) and its discrete version is also employed in both real and Galois field versions of Reed-Solomon codes (see Section 4.1). This method which is called the annihilating filter is as follows:

The sequence {τ_{
r
}}can be viewed as the solution of a recursive equation. In fact if we define $H\left(z\right)=\sum _{i=0}^{k}{h}_{i}{z}^{i}=\prod _{i=1}^{k}(z-{t}_{i})$, we will have (see Section 4.1 and Appendices Appendix 1, Appendix 2 for the proof of a similar theorem):

In order to find the time instants t_{
i
}, we find the polynomial H(z) (or the coefficients h_{
i
}) and we look for its roots. A recursive relation for τ_{
r
}becomes

By solving the above linear system of equations, we obtain coefficients h_{
i
} (for a discussion on invertibility of the left side matrix see [102, 104]) and consequently, by finding the roots of H(z), the time instants will be revealed. It should be mentioned that the choice of ${\tau}_{1},\dots ,{\tau}_{2k}$ in (37) can be replaced with any 2k consecutive terms of {τ_{
i
}}. After determining {t_{
i
}}, (35) becomes a linear system of equations with respect to the values {c_{
i
}} which could be easily solved.

This reconstruction method can be used for other types of signals satisfying (30) such as the signals represented by piecewise polynomials [102] (for large enough n, the n^{
th
}derivative of these signals become delta functions). An important issue in nonlinear reconstruction is the noise analysis; for the purpose of denoising and performance under additive noise the reader is encouraged to see [27].

A nice application of sampling theory and the concept of sparsity is error correction codes for real and complex numbers [105]. In the next section, we shall see that similar methods can be employed for decoding block and convolutional codes.

4 Error correction codes: Galois and real/complex fields

The relation between sampling and channel coding is the result of the fact that over-sampling creates redundancy [105]. This redundancy can be used to correct for “sparse” impulsive noise. Normally, the channel encoding is performed in finite Galois fields as opposed to real/complex fields; the reason is the simplicity of logic circuit implementation and insensitivity to the pattern of errors. On the other hand, the real/complex field implementation of error correction codes has stability problems with respect to the pattern of impulsive, quantization and additive noise [52, 59, 74, 106–109]. Nevertheless, such implementation has found applications in fault tolerant computer systems [110–114] and impulsive noise removal from 1-D and 2-D signals [31, 32]. Similar to finite Galois fields, real/complex field codes can be implemented in both block and convolutional fashions.

A discrete real-field block code is an oversampled signal with n samples such that, in the transform domain (e.g., DFT), a contiguous number of high-frequency components are zero. In general, the zeros do not have to be the high-frequency components or contiguous. However, if they are contiguous, the resultant m equations (from the syndrome information domain) and m unknown erasures form a Vandermonde matrix, which ensures invertibility and consequently erasure recovery. The DFT block codes are thus a special case of Reed-Solomon (RS) codes in the field of real/complex numbers [105].

Figure 12 represents convolutional encoders of rate 1/2of finite constraint length [105] and infinite precision per symbol. Figure 12a is a systematic convolutional encoder and resembles an oversampled signal discussed in Section 3 if the FIR filter acts as an ideal interpolating filter. Figure 12b is a non-systematic encoder used in the simulations to be discussed subsequently. In the case of additive impulsive noise, errors could be detected based on the side information that there are frequency gaps in the original oversampled signal (syndrome). In the following subsections, various algorithms for decoding along with simulation results are given for both block and convolutional codes. Some of these algorithms can be used in other applications such as spectral and channel estimation.

4.1 Decoding of block codes—ELP method

Iterative reconstruction for an erasure channel is identical to the missing sampling problem [115] discussed in Section 3.1.1 and therefore, will not be discussed here. Let us assume that we have a finite discrete signal x_{orig}[i], where $i=1,\dots ,l$. The DFT of this sequence yields l complex coefficients in the frequency domain (${X}_{\text{orig}}\left[j\right],\phantom{\rule{1em}{0ex}}j=1,\dots ,l$). If we insert p consecutive zeros^{e}to get n = l + p samples ($X\left[j\right],\phantom{\rule{1em}{0ex}}j=1,\dots ,n$) and take its inverse DFT, we end up with an oversampled version of the original signal with n complex samples ($x\left[i\right],\phantom{\rule{1em}{0ex}}i=1,\dots ,n$). This oversampled signal is real if Hermitian symmetry (complex conjugate symmetry) is preserved in the frequency domain, e.g., the set Λ of p zeros is centered at $\frac{n}{2}$. For erasure channels, the sparse missing samples are denoted by e [i_{
m
}] = x [i_{
m
}], where i_{
m
}s denote the positions of the lost samples; consequently, for i≠i_{
m
}, e [i]=0. The Fourier transform of e [i] (called $E\left[j\right],\phantom{\rule{1em}{0ex}}j=1,\dots ,n$) is known for the syndrome positions Λ. The remaining values of E [j]can be found from the following recursion (see Appendix Appendix 1):

where h_{
k
}s are the ELP coefficients as defined in (36) and Appendix Appendix 1, r is a member of the complement of Λ, and the index additions are in mod(n). After finding E [j] values, the spectrum of the recovered oversampled signal X [j]can be found by removing E [j]from the received signal (see (99) in Appendix Appendix 1). Hence the original signal can be recovered by removing the inserted zeros at the syndrome positions of X [j]. The above algorithm, called the ELP algorithm, is capable of correcting any combination of erasures. However, if the erasures are bursty, the above algorithm may become unstable. To combat bursty erasures, we can use the Sorted DFT (SDFT^{f}) [1, 59, 116, 117] instead of the conventional DFT. The simulation results for block codes with erasure and impulsive noise channels are given in the following two subsections.

4.1.1 Simulation results for erasure channels

The simulation results for the ELP decoding implementation for n = 32, p = 16, and k=16 erasures (a burst of 16 consecutive missing samples from position 1 to 16) are shown in Figure 13; this figure shows we can have perfect reconstruction up to the capacity of the code (up to the finite computer precision which is above 320 dB; this is also true for Figures 14 and 15). By capacity we mean the maximum number of erasures that a code is capable of correcting.

Since consecutive sample losses represent the worst case [59, 116], the proposed method works better for random samples. In practice, the error recovery capability of this technique degrades with the increase of the block and/or burst size due to the accumulation of round-off errors. In order to reduce the round-off error, instead of the DFT, a transform based on the SDFT, or Sorted DCT (SDCT) can be used [1, 59, 116]. These types of transformations act as an interleaver to break down the bursty erasures.

4.1.2 Simulation results for random impulsive noise channel

There are several methods to determine the number, locations, and values of the impulsive noise samples, namely Modified Berlekamp-Massey for real fields [118, 119], ELP, IMAT, and constant false alarm rate with recursive detection estimation (CFAR-RDE). The Berlekamp-Massey method for real numbers is sensitive to noise and will not be discussed here [118]. The other methods are discussed below.

When the number and positions of the impulsive noise samples are not known, h_{
t
} in (38) is not known for any t; therefore, we assume the maximum possible number of impulsive noise samples per block, i.e., $k=\lfloor \frac{n-l}{2}\rfloor $ as given in (96) in Appendix Appendix 1. To solve for h_{
t
}, we need to know only n−l samples of E in the positions where zeros are added in the encoding procedure. Once the values of h_{
t
} are determined from the pseudo-inverse [104], the number and positions of impulsive noise can be found from (98) in Appendix Appendix 1. The actual values of the impulsive noise can be determined from (38) as in the erasure channel case. For the actual algorithm, please refer to Appendix Appendix 2. As we are using the above method in the field of real numbers, exact zeros of {h_{
k
}}, which are the DFT of {h_{
i
}}, are rarely observed; consequently, the zeros can be found by thresholding the magnitudes of h_{
k
}. Alternatively, the magnitudes of h_{
k
}can be used as a mask for soft-decision; in this case, thresholding is not needed.

The CFAR-RDE method is similar to the IMAT with the additional inclusion of the CFAR module to estimate the impulsive noise; CFAR is extensively used in radars to detect and remove clutter noise from data. In CFAR, we compare the noisy signal with its neighbors and determine if an impulsive (sparse) noise is present or not (using soft decision [31]).^{g} After removing the impulsive noise in a “soft” fashion, we estimate the signal using the iterative method for an erasure channel as described in Section 3.1.1 for random sampling or using the ELP method. The impulsive noise and signal detection and estimation go through several iterations in a recursive fashion as shown in Figure 16. As the number of recursions increases, the certainty about the detection of impulsive noise locations also increases; thus, the soft decision is designed to act more like the hard decision during the later parts of the iteration steps, which yields the error locations. Meanwhile, further iterations are performed to enhance the quality of the original signal since suppression of the impulsive noise also suppresses the original signal samples at the location of the impulsive noise. The improvement of using CFAR-RDE over a simple soft decision RDE is shown in Figure 17.

4.2 Decoding for convolutional codes

The performance of convolutional decoders depends on the coding rate, the number and values of FIR taps for the encoders, and the type of the decoder. Our simulation results are based on the structure given in Figure 12b, and the taps of the encoder are

The input signal is taken from a uniform random distribution of size 50 and the simulations are run 1,000 times and then averaged. The following subsections describe the simulation results for erasure and impulsive noise channels.

4.2.1 Decoding for erasure channels

For the erasure channels, we derive the generator matrix of a convolutional encoder (Figure 12b with taps given in (39)) as shown below [4]

An iterative decoding scheme for this matrix representation is similar to that of Figure 7 except that the operator G consists of the generator matrix, a mask (erasure operation), and the transpose of the generator matrix. If the rate of erasure does not exceed the encoder full capacity, the matrix form of the operator G can be shown to be a nonnegative definite square matrix and therefore its inverse exists [51, 60].

Figure 14 shows that the SNR values gradually decrease as the rate of erasure reaches its maximum (capacity).

4.2.2 Decoding for impulsive noise channels

Let us consider x and y as the input and the output streams of the encoder, respectively, related to each other through the generator matrix G as y = Gx.

Denoting the observation vector at the receiver by $\widehat{\mathbf{y}}$, we have $\widehat{\mathbf{y}}=\mathbf{y}+\mathit{\nu}$, where ν is the impulsive noise vector. Multiplying $\widehat{\mathbf{y}}$ by the transpose of the parity check matrix H^{
T
}, we get

Thus by multiplying the received vector by H(H^{
T
}H)^{−1}H^{
T
}(projection matrix into the range space of H), we obtain an approximation of the impulsive noise. In the IMAT method, we apply the operator H(H^{
T
}H)^{−1}H^{
T
} in the iteration of Figure 9; the threshold level is reduced exponentially at each iteration step. The block diagram of IMAT in Figure 9 is modified as shown in Figure 18.

For simulation results, we use the generator matrix shown in (40), which can be calculated from [4].

In our simulations, the locations of the impulsive noise samples are generated randomly and their amplitudes have Gaussian distributions with zero mean and variance equal to 1, 2, 5, and 10 times the variance of the encoder output. The results are shown in Figure 15 after 300 iterations. This figure shows that the high variance impulsive noise has a better performance.

5 Spectral estimation

In this section, we review some of the methods which are used to evaluate the frequency content of data [7–10]. In the field of signal spectrum estimation, there are several methods which are appropriate for different types of signals. Some methods are more suitable to estimate the spectrum of wideband signals, whereas some others are better for the extraction of narrow-band components. Since our focus is on sparse signals, it would be reasonable to assume sparsity in the frequency domain, i.e., we assume the signal to be a combination of several sinusoids plus white noise.

Conventional methods for spectrum analysis are non-parametric methods in the sense that they do not assume any model (statistical or deterministic) for the data, except that it is zero or periodic outside the observation interval. For example, the periodogram ${\widehat{P}}_{\text{per}}\left(f\right)$ is a well-known nonparametric method that can be computed via the FFT algorithm:

where m is the number of observations, T_{
s
} is the sampling interval (usually assumed as unity), and x_{
r
}is the signal. Although non-parametric methods are robust with low computational complexity, they suffer from fundamental limitations. The most important limitation is their resolution; too closely spaced harmonics cannot be distinguished if the spacing is smaller than the inverse of the observation period.

To overcome this resolution problem, parametric methods are devised. Assuming a statistical model with some unknown parameters, we can increase resolution by estimating the parameters from the data at the cost of more computational complexity. Theoretically, in parametric methods, we can resolve closely spaced harmonics with limited data length if the SNR goes to infinity.^{h}

In this section, we shall discuss three parametric approaches for spectral estimation: the Pisarenko, the Prony, and the MUSIC algorithms. The first two are mainly used in spectral estimation, while the MUSIC algorithm was first developed for array processing and later has been extended to spectral estimation. It should be noted that the parametric methods unlike the non-parametric approaches require prior knowledge of the model order (the number of tones). This can be decided from the data using the minimum discription length (MDL) method discussed in the next section.

5.1 Prony method

The Prony method was originally proposed for modeling the expansion of gases [120]; however, now it is known as a general spectral estimation method. In fact, Prony tried to fit a weighted mixture of k damped complex exponentials to 2k data measurements. The original approach is related to the noiseless measurements; however, it has been extended to produce the least squared solutions for noisy measurements. We focus only on the noiseless case here. The signal is modeled as a weighted mixture of k complex exponentials with complex amplitudes and frequencies:

${x}_{r}=\sum _{i=1}^{k}{b}_{i}{z}_{i}^{r}$

(44)

where x_{
r
} is the noiseless discrete sparse signal consisting of k exponentials with parameters

where a_{
i
},θ_{
i
},f_{
i
} represent the amplitude, phase, and the frequency (f_{
i
}is a complex number in general), respectively. Let us define the polynomial H(z) such that its roots represent the complex exponential functions related to the sparse tones (see Section 3.3 on FRI, (38) on ELP and Appendix 1):

where r is indexed in the range k + 1≤ r ≤ 2 k. This formula implies a recursive equation to solve for h_{
i
}s [8]. After the evaluation of the h_{
i
}s, the roots of (46) yield the frequency components. Hence, the amplitudes of the exponentials can be evaluated from a set of linear equations given in (44). The basic Prony algorithm is given in Table 13.

Table 13

Basic prony algorithm

1. Solve the recursive equation in (47) to evaluate h_{
i
}s.

2. Find the roots of the polynomial represented in (46); these roots are the complex exponentials defined as z_{
i
}in (44).

3. Solve (44) to obtain the amplitudes of the exponentials (b_{
i
}s).

The Prony method is sensitive to noise, which was also observed in the ELP and the annihilating filter methods discussed in Sections 3.3 and 4.1. There are extended Prony methods that are better suited for noisy measurements [10].

5.2 Pisarenko harmonic decomposition (PHD)

The PHD method is based on the polynomial of the Prony method and utilizes the eigen-decomposition of the data covariance matrix [10]. Assume k complex tones are present in the spectrum of the signal. Then, decompose the covariance matrix of k + 1dimensions into a k-dimensional signal subspace and a 1-dimensional noise subspace that are orthogonal to each other. By including the additive noise, the observations are given by

where y is the observation sample and ν is a zero-mean noise term that satisfies E{ν_{
r
}ν_{r + i}}=σ^{2}δ [i]. By replacing x_{
r
}=y_{
r
}−ν_{
r
}in the difference equation (47), we get

which reveals the auto-regressive moving average (ARMA) structure (order (k,k)) of the observations y_{
r
}as a random process. To benefit from the tools in linear algebra, let us define the following vectors:

which is the key equation of the Pisarenko method. The eigen-equation of (54) states that the elements of the eigenvector of the covariance matrix, corresponding to the smallest eigenvalue (σ^{2}), are the same as the coefficients in the recursive equation of x_{
r
}(coefficients of the ARMA model in (49)). Therefore, by evaluating the roots of the polynomial represented in (46) with coefficients that are the elements of this vector, we can find the tones in the spectrum.

Although we started by eigen-decomposition of R_{
y
y
}, we observed that only one of the eigenvectors is required; the one that corresponds to the smallest eigenvalue. This eigenvector can be found using simple approaches (in contrast to eigen-decomposition) such as power method. The PHD method is briefly shown in Table 14.

Table 14

PHD algorithm

1. Given the model order k (number of sinusoids), find the autocorrelation matrix of the noisy observations with dimension k + 1(R_{
y
y
}).

2. Find the smallest eigenvalue (σ^{2}) of R_{
y
y
}and the corresponding eigenvector (H).

3. Set the elements of the obtained vector as the coefficients of the polynomial in (46). The roots of this polynomial are the estimated frequencies.

A different formulation of the PHD method with linear programming approach (refer to Section 2.2 for description of linear programming) for array processing is studied in [121]. The PHD method is shown to be equivalent to a geometrical projection problem which can be solved using ℓ_{1}-norm optimization.

5.3 MUSIC

MUltiple SIgnal Classification (MUSIC), is a method originally devised for high-resolution source direction estimation in the context of array processing that will be discussed in the next section [122]. The inherent equivalence of array processing and time series analysis paves the way for the employment of this method in spectral estimation. MUSIC can be understood as a generalization and improvement of the Pisarenko method. It is known that in the context of array processing, MUSIC can attain the statistical efficiency^{i} in the limit of asymptotically large number of observations [11].

In the PHD method, we construct an autocorrelation matrix of dimension k + 1 under the assumption that its smallest eigenvalue (σ^{2}) belongs to the noise subspace. Then we use the Hermitian property of the covariance matrix to conclude that the noise eigenvector should be orthogonal to the signal eigenvectors. In MUSIC, we extend this method using a noise subspace of dimension greater than one to improve the performance. We also use some kind of averaging over noise eigenvectors to obtain a more reliable signal estimator.

The data model for the sum of exponentials plus noise can be written in the matrix form as

where ν represents the noise vector. Since the frequencies are different, A is of rank k and the first term in (55) forms a k-dimensional signal subspace, while the second term is randomly distributed in both signal and noise subspaces; i.e., unlike the first term, it is not confined to a subspace of lower dimension. The correlation matrix of the observations is given by

where the noise is assumed to be white with variance σ^{2}. If we decompose R into its eigenvectors, k eigenvalues corresponding to the k-dimensional subspace of the first term of (57) are essentially greater than the remaining m − k values, σ^{2}, corresponding to the noise subspace; thus, by sorting the eigenvalues, the noise and signal subspaces can be determined. Assume ω is an arbitrary frequency and $\mathbf{e}\left(\omega \right)=[1,{e}^{\mathrm{j\omega}},\dots ,{e}^{j(m-1)\omega}]$. The MUSIC method estimates the spectrum content of the signal at frequency ω by projecting the vector e(ω)into the noise subspace. When the projected vector is zero, the vector e(ω) falls in the signal subspace and most likely, ω is among the spectral tones. In fact, the frequency content of the spectrum is inversely proportional to the ℓ_{2}-norm of the projected vector:

where v_{
i
}s are eigenvectors of R corresponding to the noise subspace.

The k peaks of P_{
MU
}(ω)are selected as the frequencies of the sparse signal. The determination of the number of frequencies (model order) in MUSIC is based on the MDL and Akaike information criterion (AIC) methods to be discussed in the next section. The MUSIC algorithm is briefly explained in Table 15.

Table 15

MUSIC algorithm

1. Find the autocorrelation matrix of the noisy observations (R_{
y
y
}) with the available size as shown in (57).

2. Using a given value of k or a method to determine k (such as MDL), separate the m − k smallest eigenvalues of R_{
y
y
}and the corresponding eigenvectors (${\mathbf{v}}_{k+1},\dots ,{\mathbf{v}}_{m}$).

3. Use (58) to estimate the spectral content at frequency ω.

Figure 19 compares the results (in the order of improved performance) for various spectral line estimation methods. The first upper figure shows the original spectral lines, and the four other figures show the results for Prony, PHD, MUSIC, and IMAT methods. We observe that the Prony method (which is similar to ELP and annihilating filter of Section 3.3 and (38)) does not yield good results due to its sensitivity to noise, while the IMAT method is the best. The application of IMAT to spectral estimation is a clear confirmation of our contention that we can apply tools developed in some areas to other areas for better performance.

6 Sparse array processing

There are three types of array processing: 1—estimation of multi-source location (MSL) and Direction of Arrival (DOA), 2—sparse array beam-forming and design, and 3—sparse sensor networks. The first topic is related to estimating the directions and/or the locations of multiple targets; this problem is very similar to the problem of spectral estimation dealt with in the previous section; the relations among sparsity, spectral estimation, and array processing were discussed in [123, 124]. The second topic is related to the design of sparse arrays with some missing and/or random array sensors. The last topic, depending on the type of sparsity, is either similar to the second topic or related to CS of sparse signal fields in a network. In the following, we will only consider the first kind.

6.1 Array processing for MSL and DOA estimation

Among the important fields of active research in array processing are MSL and DOA estimation [122, 125, 126]. In such schemes, a passive or active array of sensors is used to locate the sources of narrow-band signals. Some applications may assume far-field sources (e.g., radar signal processing) where the array is only capable of DOA estimation, while other applications (e.g. biomedical imaging systems) assume near-field sources where the array is capable of locating the sources of radiation. A closely related field of study is spectral estimation due to similar linear statistical models. The stochastic sparse signals pass through a partially known linear transform (e.g., array response or inverse Fourier transform) and are observed in a noisy environment.

In the array processing context, the common temporal frequency of the source signals is known. Spatial sampling of the signal is used to extract the direction of the signal (spatial frequency). As a far-field approximation, the signal wavefronts are assumed to be planar. Consider a signal arriving with angle φ as in Figure 20. Simultaneous sampling of this wavefront on the array will exhibit a phase change of the signal from sensor to sensor. In this way, discrete samples of a complex exponential are obtained, where its frequency can be translated to the direction of the signal source. The response of a uniform linear array (ULA) to a wavefront impinging on the array from direction φ is

where d is the inter-element spacing of the array, λ is the wavelength, and n is the number of sensors in the array. When multiple sources are present, the observed vector is the sum of the response (sweep) vectors and noise. This resembles the spectral estimation problem with the difference that sampling of the array elements is not limited in time. In fact in array processing, an additional degree of freedom (the number of elements) is present; thus, array processing is more general than spectral estimation.

Two main fields in array processing are MSL and DOA for estimating the source locations and directions, respectively; for both purposes, the angle of arrival (azimuth and elevation) should be estimated while for MSL an extra parameter of range is also needed. The simplest case is the 1-D ULA (azimuth-only) for DOA estimation.

For the general case of k sources with angles ${\phi}_{1},\dots ,{\phi}_{k}$ with respect to the array, the ULA response is given by the matrix $\mathbf{A}\left(\mathit{\phi}\right)=\left[\mathbf{a}\right({\phi}_{1}),\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}\mathbf{a}({\phi}_{k}\left)\right]$, where the vector φ of DOA’s is defined as $\mathit{\phi}=[{\phi}_{1},\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}{\phi}_{k}]$. In the above notation, A is a matrix of size n×k and a(φ_{
i
})s are column vectors. Now, the vector of observations at array elements (y[i]) is given by

where the vector s[i] represents the multi-source signals and ν[i]is the white Gaussian noise vector. Source signals and additive noise are assumed to be zero-mean and i.i.d. normal processes with covariance matrices P and σ^{2}I, respectively. With these assumptions, the observation vector y[i]will also follow an n-dimensional zero-mean normal distribution with the covariance matrix

In the field of DOA estimation, extensive research has been accomplished in (1) source enumeration, and (2) DOA estimation methods. Both of the subjects correspond to the determination of parameters k and φ.

Although some methods are proposed for simultaneous detection and estimation of the model statistical characteristics [127], most of the literature is devoted to two-stage approaches; first, the number of active sources is detected and then their directions are estimated by techniques such as estimation of signal parameters via rotational invariance techniques (ESPRIT)^{j}[128–132]. Usually, the joint detection-estimation methods outperform the two-stage approaches with the cost of higher computational complexity. In the following, we will describe Minimum Description Length (MDL) as a powerful tool to detect the number of active sources.

6.1.1 Minimum description length

One of the most successful methods in array processing for source enumeration is the use of the MDL criterion [133]. This technique is very powerful and outperforms its older versions including AIC [134–136]. Hence, we confine our discussion to MDL algorithms.

6.1.2 Preliminaries

Minimum description length is an optimum method of finding the model order and parameters for the most compressed representation of the observed data. For the purpose of statistical modeling, the MAP probability or the suboptimal criterion of ML is used; more precisely, conditioned on the observed data, the maximum probability among the possible options is found (hypotheses testing) [137]. When the model parameters are not known, the MAP and ML criteria result in the most complex approach; consider fitting a finite sequence of data to a polynomial of unknown degree [33]:

where $P\left(t\right)={a}_{0}+{a}_{1}t+\cdots +{a}_{k}{t}^{k}$, ν(t)is the observed Gaussian noise and k is the unknown model order (degree of the polynomial P(t)) which determines the complexity. Clearly, m−1 is the maximum required order for unique description of the data (m observed samples), and the ML criterion always selects this maximum value (${\widehat{k}}_{\mathit{\text{ML}}}=m-1$); i.e., the ML method forces the polynomial P(t)to pass through all the points. MDL, on the other hand, yields a sparser solution (${\widehat{k}}_{\mathit{\text{MDL}}}<m-1$).

Due to the existence of additive noise, it is quite rational to look for a polynomial with degree less than m which also takes the complexity order into account. In MDL, the idea of how to consider the complexity order is borrowed from information theory: given a specific statistical distribution, we can find an optimum source coding scheme (e.g., Huffman coding) which attains the lowest average code length for the symbols. Furthermore, if p_{
s
} is the distribution of the source s and q_{
s
}is another distribution, we have [138]:

where H(s) is the entropy of the signal. This implies that the minimum average code length is obtained only for the correct source distribution (model parameters); in other words, the choice of wrong model parameters (distribution function) leads to larger code lengths. When a particular model with the set of parameters θ is assumed for the data a priori, each time a sequence y is received, the parameters should first be estimated. The optimum estimation method is usually the ML estimator which results in ${\widehat{\mathit{\theta}}}_{\mathit{\text{ML}}}$. Now, the probability distribution for a received sequence y becomes $p\left(y|{\widehat{\mathit{\theta}}}_{\mathit{\text{ML}}}\right)$ which according to information theory, requires an average code length of $-log\left(p\left(y|{\widehat{\mathit{\theta}}}_{\mathit{\text{ML}}}\left(y\right)\right)\right)$ bits. In addition to the data, the model parameters should also be encoded which in turn requires $\frac{\kappa}{2}log\left(m\right)$ bits where κ is the number of independent parameters to be encoded in the model and m is the number of data points.^{k} Thus, the two-part MDL selects the model that minimizes the whole required code length which is given by [139]:

The first term is the ML term for data encoding, and the second term is a penalty function that inhibits the number of free parameters of the model to become very large.

Example of using MDL in spectral estimation

An example from spectral estimation can help clarify how the MDL method works (for more information refer to the previous section on spectral estimation). The mathematical formulation of the problem is as follows: If there are k (unknown) sinusoids with various frequencies, amplitudes, and phases (3k unknown parameters) observed in a noisy data vector x (sampled at n distinct time slots), the maximum likelihood function for this observed data with additive Gaussian noise is as follows:

here ${\theta}_{k}={\{{a}_{j},{\omega}_{j},{\varphi}_{j}\}}_{j=1}^{k}$ are the unknown sinusoidal parameters to be estimated to compute the likelihood term in (65), which in this case is computed from (66). The 3k unidentified parameters are estimated by the grid search, i.e., all possible values of frequency and phase (amplitude can be estimated using the assumed frequency and phase by using this relation; $\widehat{{a}_{j}}=\frac{{\Sigma}_{t}x\left(t\right)sin(\widehat{{\omega}_{j}}t+\widehat{\varphi})}{{\Sigma}_{t}{\left(x\right(t)sin(\widehat{{\omega}_{j}}t+\widehat{\varphi}\left)\right)}^{2}}$[140] are tested and the one maximizing the likelihood function (66) is selected as the best estimate.

To find the number of embedded sinusoids in the noisy observed data, it is initially assumed that k=0 and (65) is calculated, then k is increased and by using the grid search, the maximum value of the likelihood for the assumed k is calculated from (66), and this calculated value is then used to compute (65). This procedure should be followed as long as (65) decreases and consequently aborted when it starts to rise. The k minimizing (65) is the k selected by MDL method and hopefully reveals the true number of the sinusoids in the noisy observed data. It is obvious that the sparsity condition, i.e., k<<n, is necessary for the efficient operation of MDL. In addition to the number of sinusoids, MDL has apparently estimated the frequency, amplitude, and phase of the embedded sinusoids. This should make it clear why such methods are called detection–estimation algorithms.

The very same method can be used to find the number, position, and amplitude of an impulsive noise added to a low-pass signal in additive noise. If the samples of the added impulsive noise are statistically independent from each other, the high-pass samples of the discrete fourier transform (DFT) of the noisy observed data with impulsive noise should be taken and the same method applied.

MDL source enumeration

In the source enumeration problem, our model is a multivariate Gaussian random process with zero mean and covariance of the type shown in (62), where the number of active sources is unknown. In some enumeration methods (other than MDL), the exact form of (62) is employed which results in high computational complexity. In the conventional MDL method, it is assumed that the model is a covariance matrix with a spherical subspace^{l} of dimension n−k. Suppose the sample covariance matrix is

and assume the ordered eigenvalues of $\widehat{\mathbf{R}}$ are ${\widehat{\lambda}}_{1}\ge {\widehat{\lambda}}_{2}\ge \cdots \ge {\widehat{\lambda}}_{n}$, while the ordered eigenvalues of the exact covariance matrix R are ${\lambda}_{1}\ge \cdots \ge {\lambda}_{k}\ge {\lambda}_{k+1}=\cdots ={\lambda}_{n}={\sigma}^{2}$. The normal distribution function of the received complex data x is [129]

where tr(.)stands for the trace operator. The ML estimate of signal eigenvalues in R are ${\widehat{\lambda}}_{i},\phantom{\rule{1em}{0ex}}i=1,\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}k$ with the respective eigenvectors ${\left\{{\widehat{\mathbf{v}}}_{i}\right\}}_{i=1}^{k}$. Since ${\lambda}_{k+1}=\cdots ={\lambda}_{n}={\sigma}^{2}$, the ML estimate of the noise eigenvalue is ${\widehat{\sigma}}_{\mathit{\text{ML}}}^{2}=\frac{1}{n-k}\sum _{i=k+1}^{n}{\widehat{\lambda}}_{i}$ and ${\left\{{\widehat{\mathbf{v}}}_{i}\right\}}_{i=k+1}^{n}$ are all noise eigenvectors. Thus, the ML estimate of R given $\widehat{\mathbf{R}}$ is

which is independent of k and can be omitted in the minimization of (65). Thus, for the first term of (65) we only need the determinant |R_{
ML
}|which is the product of the eigenvalues, and the MDL criterion becomes

where κ is the number of free parameters in the distribution. This expression should be computed for different values of 0≤k≤n−1 and its minimum point should be ${\widehat{k}}_{\mathit{\text{MDL}}}$. Note that we can subtract the term $m\sum _{i=1}^{n}log\left({\widehat{\lambda}}_{i}\right)$ from the expression, which is not dependent on k to get the well-known MDL criterion [129]:

where the first term is the likelihood ratio for the sphericity test of the covariance matrix. This likelihood ratio is a function of arithmetic and geometric means of the noise subspace eigenvalues [141]. Figure 21 is an example of MDL performance in determining the number of sources in array processing. It is evident that in low SNRs, the MDL has a strong tendency to underestimate the number of sources, while as SNR increases, it gives a consistent estimate. Also at high SNRs, underestimation is more probable than overestimation.

Now we compute the number of independent parameters (κ) in the model. Since the noise subspace is spherical, the choice of eigenvectors in this subspace can accept any arbitrary orthonormal set; i.e., no information is revealed when these vectors are known. Thus, the set of parameters is $\{{\lambda}_{1},\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}{\lambda}_{k},{\sigma}^{2},{\mathbf{v}}_{1},\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}{\mathbf{v}}_{k}\}$. The eigenvalues of a hermitian matrix (correlation matrix) are all real while the eigenvectors are normal complex vectors. Therefore, the eigenvalues (including σ^{2}) introduce k + 1 degrees of freedom. The first eigenvector has 2n−2degrees of freedom (since its first nonzero element can be adjusted to unity), while the second, due to its orthogonality to the first eigenvector, has 2n−4degrees of freedom. With the same argument, it can be shown that there are 2(n−i) free parameters in the i^{
th
}eigenvector; hence

$\kappa =1+k+\sum _{i=1}^{k}2(n-i)=n(2n-k)+1$

(73)

where the last integer 1 can be omitted since it is independent of k.

The two-part MDL, despite its very low computational complexity, is among the most successful methods for source enumeration in array processing. Nonetheless, this method does not reach the best attainable performance for finite number of measurements [142]. The new version of MDL, called one-part or Refined MDL has improved the performance for the cases of finite measurements which has not been applied to the array processing problem [33].

6.2 Sparse sensor networks

Wireless sensor networks typically consist of a large number of sensor nodes, spatially distributed over a region of interest, that observe some physical environment including acoustic, seismic, and thermal fields with applications in a wide range of areas such as health care, geographical monitoring, homeland security, and hazard detection. The way sensor networks are used in practical applications can be divided into two general categories:

(1)

There exists a central node known as the fusion center (FC) that retrieves relevant field information from the sensor nodes and communication from the sensor nodes to FC generally takes place over a power- and bandwidth-constrained wireless channel.

(2)

Such a central node does not exist and the nodes take specific decisions based on the information they obtain and exchange among themselves. Issues such as distributed computing and processing are of high importance in such scenarios.

In general, there are three main tasks that should be implemented efficiently in a wireless sensor network: sensing, communication, and processing. The main challenge in design of practical sensor networks is to find an efficient way of jointly performing these tasks, while using the minimum amount of system resources (computation, power, bandwidth) and satisfying the required system design parameters (such as distortion levels). For example, one such metric is the so-called energy-distortion tradeoff which determines how much energy the sensor network consumes in extracting and delivering relevant information up to a given distortion level. Although many theoretical results are already available in the case of point-to-point links in which separation between source and channel coding can be assumed, the problem of efficiently transmitting or sharing information among a vast number of distributed nodes remains a great challenge. This is due to the fact that well-developed theories and tools for distributed signal processing, communications, and information theory in large-scale networked systems are still under development. However, recent results on distributed estimation or detection indicate that joint optimization through some form of source-channel matching and local node cooperation can result in significant system performance improvement [143–147].

6.2.1 How sparsity can be exploited in a sensor network

Sparsity appears in many applications for which sensor networks are deployed, e.g., localization of targets in a large region or estimation of physical phenomena such as temperature fields that are sparse under a suitable transformation. For example, in radar applications, under a far-field assumption, the observation system is linear and can be expressed as a matrix of steering vectors [148, 149]. In general, sparsity can arise in a sensor network from two main perspectives:

(1)

Sparsity of node distribution in spatial terms

(2)

Sparsity of the field to be estimated

Although nodes in a sensor network can be assumed to be regularly deployed in a given environment, such an assumption is not valid in many practical scenarios. Therefore, the non-uniform distribution of nodes can lead to some type of sparsity in spatial domain that can be exploited to reduce the amount of sensing, processing, and/or communication. This issue is subsequently related to extensions of the nonuniform sampling techniques to two-dimensional domains through proper interpolation and data recovery when samples are spatially sparse [34, 150]. The second scenario that provides a proper basis for exploiting the sparsity concepts arises when the field to be estimated is a sparse multi-dimensional signal. From this point of view, ideas such as those presented earlier in the context of compressed sensing (Section 3.2) provide the proper framework to address the sparsity in such fields.

Spatial sparsity and interpolation in sensor networks

Although general 2-D interpolation techniques are well-known in various branches of statistics and signal processing, the main issue in a sensor network is exploring proper spatio/temporal interpolation such that communication and processing are also efficiently accomplished. While there is a wide range of interpolation schemes (polynomial, Fourier, and least squares [151]), many of these schemes are not directly applicable for spatial interpolation in sensor networks due to their communication complexity.

Another characteristic of many sensor networks is the non-uniformity of node distribution in the measurement field. Although non-uniformity has been dealt with extensively in contexts such as signal processing, geo-spatial data processing, and computational geometry [1], the combination of irregular sensor data sampling and intra-network processing is a main challenge in sensor networks. For example, reference [152] addresses the issue of spatio-temporal non-uniformity in sensor networks and how it impacts performance aspects of a sensor network such as compression efficiency and routing overhead. In order to reduce the impact of non-uniformity, the authors in [152] propose using a combination of spatial data interpolation and temporal signal segmentation. A simple interpolation wavelet transform for irregular sampling which is an extension of the 2-D irregular grid transform to 3-D spatio-temporal transform grids is also proposed in [153]. Such a multi-scale transform extends the approach in [154] and removes the dependence on building a distributed mesh within the network. It should be noted that although wavelet compression allows the network to trade reconstruction quality for communication energy and bandwidth usage, such energy savings are naturally offset by the overhead cost of computing the wavelet coefficients.

Distributed wavelet processing within sensor networks is yet another approach to reduce communication energy and wireless bandwidth usage. Use of such distributed processing makes it possible to trade long-haul transmission of raw data to the FC for less costly local communication and processing among neighboring nodes [153]. In addition, local collaboration among nodes decorrelates measurements and results in a sparser data set.

Compressive sensing in sensor networks

Most natural phenomena in SNs are compressible through representation in a natural basis [86]. Some examples of these applications are imaging in a scattering medium [148], MIMO radar [149], and geo-exploration via underground seismic data. In such cases, it is possible to construct a highly compressed version of a given field, in a decentralized fashion. If the correlations between data at different nodes are known a-priori, it is possible to use schemes that have very favorable power-distortion-latency tradeoffs [143, 155, 156]. In such cases, distributed source coding techniques, such as Slepian-Wolf coding, can be used to design compression schemes without collaboration between nodes (see [155] and the references therein). Since prior knowledge of such correlations is not available in many applications, collaborative, intra-network processing and compression are used to determine unknown correlations and dependencies through information exchange between network nodes. In this regard, the concept of compressive wireless sensing has been introduced in [147] for energy-efficient estimation at the FC of sensor data, based on ideas from wireless communications [143, 145, 156–158] and compressive sampling theory [29, 75, 159]. The main objective in such an approach is to combine processing and communications in a single distributed operation [160–162].

Methods to obtain the required sparsity in a SN

While transform-based compression is well-developed in traditional signal and image processing domains, the understanding of sparse transforms for networked data is not as trivial [163]. There are methods such as associating a graph with a given network, where the vertices of the graph represent the nodes of the network, and edges between vertices represent relationships among data at adjacent nodes. The structure of the connectivity is the key to obtaining effective sparse transformations for networked data [163]. For example, in the case of uniformly distributed nodes, tools such as DFT or DCT can be adopted to exploit the sparsity in the frequency domain. In more general settings, wavelet techniques can be extended to handle the irregular distribution of sampling locations [153]. There are also scenarios in which standard signal transforms may not be directly applicable. For example, network monitoring applications rely on the analysis of communication traffic levels at the network nodes where network topology affects the nature of node relationships in complex ways. Graph wavelets [164] and diffusion wavelets [165] are two classes of transforms that have been proposed to address such complexities. In the former case, the wavelet coefficients are obtained by computing the digital differences of the data at different scales. The coefficients at the first scale are differences between neighboring data points, and those at subsequent spatial scales are computed by first aggregating data in neighborhoods and then computing differences between neighboring aggregations. The resulting graph wavelet coefficients are then defined by aggregated data at different scales and computing differences between the aggregated data [164]. In the latter scheme, diffusion wavelets are based on construction of an orthonormal basis for functions supported on a graph and obtaining a custom-designed basis by analyzing eigenvectors of a diffusion matrix derived from the graph adjacency matrix. The resulting basis vectors are generally localized to neighborhoods of varying size and may also lead to sparse representations of data on a graph [165]. One example of such an approach is where the node data correspond to traffic rates of routers in a computer network.

Implementation of CS in a wireless SN

Two main approaches to implement random projections in a SN are discussed in the literature [163]. In the first approach, the CS projections are simultaneously calculated through superposition of radio waves and communicated using amplitude-modulated coherent transmissions of randomly weighted values directly from the nodes in the network to the FC (Figure 22). This scheme, introduced in [147, 157] and further refined in [166], is based on the notion of the so-called matched source-channel communication[156, 157]. Although the need for complex routing, intra-network communications, and processing are alleviated, local phase synchronization among nodes is an issue to be addressed properly in this approach.

In the second approach, the projections can be computed and delivered to every subset of nodes in the network using gossip/consensus techniques, or be delivered to a single point using clustering and aggregation. This approach is typically used for networked data storage and retrieval applications. In this method, computation and distribution of each CS sample is accomplished through two simple steps [163]. In the first step, each of the sensors multiplies its data with the corresponding element of the compressing matrix. Then, in the second step, the resulting local terms are simultaneously aggregated and distributed across the network using randomized gossip [167], which is a simple iterative decentralized algorithm for computing linear functions. Because each node only exchanges information with its immediate neighbors in the network, gossip algorithms are more robust to failures or changes in the network topology and cannot be easily compromised by eliminating a single server or fusion center [168].

Finally, it should be noted that in addition to the encoding process, the overall system performance is significantly affected by the decoding process [44, 88, 169]; this study and its extensions to sparse SNs remain as challenging tasks.

6.2.2 Sensing capacity

Despite wide-spread development of SN ideas in recent years, understanding of fundamental performance limits of sensing and communication between sensors is still under development. One of the issues that has recently attracted attention in theoretical analysis of sensor networks is the concept of sensor capacity. The sensing capacity was initially introduced for discrete alphabets in applications such as target detection [170] and later extended in [14, 171, 172] to the continuous case. The questions in this area are related to the problem of sampling of sparse signals, [29, 76, 159] and sampling with finite rate of innovation [3, 103]. In the context of the CS, sensing capacity provides bounds on the maximum signal dimension or complexity per sensor measurement that can be recovered to a pre-defined degree of accuracy. Alternatively, it can be interpreted as the minimum number of sensors necessary to monitor a given region to a desired degree of fidelity based on noisy sensor measurements. The inverse of sensing capacity is the compression rate; i.e., the ratio of the number of measurements to the number of signal dimensions which characterizes the minimum rate to which the source can be compressed. As shown in [14], sensing capacity is a function of SNR, the inherent dimensionality of the information space, sensing diversity, and the desired distortion level.

Another issue to be noted with respect to the sensing capacity is the inherent difference between sensor network and CS scenarios in the way in which the SNR is handled [14, 172]. In sensor networks composed of many sensors, fixed SNR can be imposed for each individual sensor. Thus, the sensed SNR per location is spread across the field of view leading to a row-wise normalization of the observation matrix. On the other hand, in CS, the vector-valued observation corresponding to each signal component is normalized by each column. This difference has led to different regimes of compression rate [172]. In SN, in contrast to the CS setting, sensing capacity is generally small and correspondingly the number of sensors required does not scale linearly with the target sparsity. Specifically, the number of measurements is generally proportional to the signal dimension and is weakly dependent on target density sparsity. This issue has raised questions on compressive gains in power-limited SN applications based on sparsity of the underlying source domain.

7 Sparse component analysis: BSS and SDR

7.1 Introduction

Recovery of the original source signals from their mixtures, without having a priori information about the sources and the way they are mixed, is called blind source separation (BSS). This process is impossible if no assumption about the sources can be made. Such an assumption on the sources may be uncorrelatedness, statistical independence, lack of mutual information, or disjointness in some space [18, 19, 49].

The signal mixtures are often decomposed into their constituent principal components, independent components, or are separated based on their disjoint characteristics described in a suitable domain. In the latter case, the original sources should be sparse in that domain. Independent component analysis (ICA) is often used for separation of the sources in the former case, whereas SCA is employed for the latter case. These two mathematical tools are described in the following sections followed by some results and illustrations of their applications.

7.2 Independent component analysis (ICA)

The main assumption in ICA is the statistical independence of the constituent sources. Based on this assumption, ICA can play a crucial role in the separation and denoising of signals (BSS).

There has been recent research interest in the field of BSS due to its practicality in a wide range of problems. For example, BSS of acoustic signals measured in a room is often referred to as the Cocktail Party problem, which means separation of individual sounds from a number of recordings in an echoic and noisy environment. Figure 23 illustrates the BSS concept, wherein the mixing block represents the multipath propagation model between the original sources and the microphone measurements.

Generally, BSS algorithms make assumptions about the environment in order to make the problem more tractable. There are typically three assumptions about the mixing medium. The most simple but widely used case is the instantaneous case, where the source signals arrive at the sensors at the same time. This has been considered for separation of biological signals such as the EEG where the signals have narrow bandwidths and the sampling frequency is normally low [173]. The generative model for BSS in this case can be easily formulated as

where s[i], x[i], and ν[i] denote, respectively, the vector of source signals, size n×1, observed signal size m×1, and noise signal size m×1. H is the mixing matrix of size m×n. Generally, the mixing process can be nonlinear (due to inhomogenity of the environment and that the medium can change with respect to the source signal variations; e.g., stronger vibration of a drum as a medium, with louder sound). However, in an instantaneous linear case where the above problems can be avoided or ignored, the separation is performed by means of a separating matrix, W of size n×m, which uses only the information contained in x[i]to reconstruct the original source signals (or the independent components) as

where y[i] is the estimate for the source signal s [i]. The early approaches in instantaneous BSS started from the work by Herault and Jutten [174] in 1986. In their approach, they considered non-Gaussian sources with equal number of independent sources and mixtures. They proposed a solution based on a recurrent artificial neural network for separation of the sources.

In the cases where the number of sources is known, any ambiguity caused by false estimation of the number of sources can be avoided. If the number of sources is unknown, a criterion may be established to estimate the number of sources beforehand. In the context of model identification, this is referred to as Model Order Selection and methods such as the final prediction error (FPE), AIC, residual variance (RV), MDL and Hannan and Quinn (HNQ) methods [175] may be considered to solve this problem.

In acoustic applications, however, there are usually time lags between the arrival times of the signals at the sensors. The signals also may arrive through multiple paths. This type of mixing model is called a convolutive model [176]. The convolutive mixing model can also be classified into two subcategories: anechoic and echoic. In both cases, the vector representations of mixing and separating processes are modified as x[i]=H[i]∗s[i] + ν[i] and y[i]=W[i]∗x[i], respectively, where ∗denotes the convolution operation. In an anechoic model, however, the expansion of the mixing process may be given as

where the attenuation, h_{r,j}, and delay δ_{r,j} of source j to sensor r would be determined by the physical position of the source relative to the sensors. Then the unmixing process to estimate the sources will be given as

where the w_{j,r}s are the elements of W. In an echoic mixing environment, it is expected that the signals from the same sources reach the sensors through multiple paths. Therefore, the expansion of the mixing and separating models will be changed to

where L denotes the maximum number of paths for the sources, ν_{
r
}[i] is the accumulated noise at sensor r, and (.)^{
l
}refers to the l^{
th
}path. The unmixing process will be formulated similarly to the anechoic one. For a known number of sources, an accurate result may be expected if the number of paths is known; otherwise, the overall number of observations in an echoic case is infinite.

The aim of BSS using ICA is to estimate an unmixing matrix W such that Y=WX best approximates the independent sources s, where y and x are respectively matrices with columns $\mathbf{y}\left[i\right]={\left[{y}_{1}\left[i\right],\phantom{\rule{1em}{0ex}}{y}_{2}\left[i\right],\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}{y}_{n}\left[i\right]\right]}^{T}$ and $\mathbf{x}\left[i\right]={\left[{x}_{1}\left[i\right],\phantom{\rule{1em}{0ex}}{x}_{2}\left[i\right],\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}{x}_{m}\left[i\right]\right]}^{T}$. Thus the ICA separation algorithms are subject to permutation and scaling ambiguities in the output components, i.e. W=PDH^{−1}, where P and D are the permutation and scaling (diagonal) matrices, respectively. Permutation of the outputs is troublesome in places where either the separated segments of the signals are to be joined together or when a frequency-domain BSS is performed.

Mutual information is a measure of independence and maximizing the non-Gaussianity of the source signals is equivalent to minimizing the mutual information between them [177].

In those cases where the number of sources is more than the number of mixtures (underdetermined systems), the above BSS schemes cannot be applied simply because the mixing matrix is not invertible, and generally the original sources cannot be extracted. However, when the signals are sparse, the methods based on disjointness of the sources in some domain may be utilized. Separation of the mixtures of sparse signals is potentially possible in the situation where, at each sample instant, the number of nonzero sources is not more than a fraction of the number of sensors (see Table 1, row and column 6). The mixtures of sparse signals can also be instantaneous or convolutive.

7.3 Sparse component analysis (SCA)

While the independence assumption for the sources is widely exploited in the design of BSS algorithms, the possible disjointness of the sources in some domain has not been considered. In SCA, this property is directly employed. Blind source separation by sparse decomposition has been addressed by Zibulevsky and Pearlmutter [178] for both over-determined/exactly-determined and underdetermined systems using the maximum a posteriori approach. One way of formulating SCA is by representing the sources using a proper signal dictionary:

where $r=1,\dots ,\phantom{\rule{1em}{0ex}}m$ and n is the number of basis functions in the dictionary. The functions ϕ_{
l
}[i] are called atoms or elements of the dictionary. These atoms do not have to be linearly independent and may form an overcomplete dictionary. The sparsity property requires that only a small number of the coefficients c_{r,l} differ significantly from zero. Based on this definition, the mixing and unmixing systems are modeled as follows:

where ν[i] is an m×1vector. A and C can be determined by optimization of a cost function based on an exponential distribution for c_{i,j}[178]. In places where the sources are sparse and at each time instant, at most one of the sources has significant nonzero value, the columns of the mixing matrix may be calculated individually, which makes the solution to the underdetermined case possible.

The SCA problem can be stated as a clustering problem since the lines in the scatter plot can be separated based on their directionalities by means of clustering. A number of works on this method have been reported [18, 179, 180]. In the work by Li et al. [180], the separation has been performed in two different stages. First, the unknown mixing matrix is estimated using the k-means clustering method. Then, the source matrix is estimated using a standard linear programming algorithm. The line orientation of a data set may be thought of as the direction of its greatest variance. One way is to perform eigenvector decomposition on the covariance matrix of the data, the resultant principal eigenvector, i.e., the eigenvector with the largest eigenvalue, indicates the direction of the data, since it has the maximum variance. In [179], GAP statistics as a metric which measures the distance between the total variance and cluster variances, has been used to estimate the number of sources followed by a similar method to Li’s algorithm explained above. In line with this approach, Bofill and Zibulevsky [15] developed a potential function method for estimating the mixing matrix followed by ℓ_{1}-norm decomposition for the source estimation. Local maxima of the potential function correspond to the estimated directions of the basis vectors. After the mixing matrix is identified, the sources have to be estimated. Even when A is known, the solution is not unique. So, a solution is found for which the ℓ_{1}-norm is minimized. Therefore, for $\mathbf{x}\left[i\right]=\sum {\mathbf{a}}_{j}{s}_{j}\left[i\right]$, $\sum _{j}\left|{s}_{j}\right|$ is minimized using linear programming.

Geometrically, for a given feasible solution, each source component is a segment of length |s_{
j
}| in the direction of the corresponding a_{
j
}and, by concatenation, their sum defines a path from the origin to x [i]. Minimizing $\sum _{j}\left|{s}_{j}\right|$ amounts therefore to finding the shortest path to x [i]over all feasible solutions $j=1,\phantom{\rule{1em}{0ex}}\dots ,\phantom{\rule{1em}{0ex}}n$, where n is the dimension of space of the independent basis vectors [18]. Figure 24 shows the scatter plot and the shortest path from the origin to the data point x [i].

There are many cases for which the sources are disjoint in other domains, rather than the time-domain, or when they can be represented as sum of the members of a dictionary which can consist for example of wavelets or wavelet packets. In these cases the SCA can be performed in those domains more efficiently. Such methods often include transformation to time-frequency domain followed by a binary masking [181] or a BSS followed by binary masking [176]. One such approach, called degenerate unmixing estimation technique (DUET) [181], transforms the anechoic convolutive observations into the time-frequency domain using a short-time Fourier transform and the relative attenuation and delay values between the two observations are calculated from the ratio of corresponding time-frequency points. The regions of significant amplitudes (atoms) are then considered to be the source components in the time-frequency domain. In this method only two mixtures have been considered and as a major limit of this method, only one source has been considered active at each time instant.

For instantaneous separation of sparse sources, the common approach used by most researchers is to attempt to maximize the sparsity of the extracted signals at the output of the separator. The columns of the mixing matrix A assign each observed data point to only one source based on some measure of proximity to those columns [182], i.e., at each instant only one source is considered active. Therefore the mixing system can be presented as:

where in an ideal case, a_{j,r}= 0 for r≠j. Minimization of the ℓ_{1}-norm is one of the most logical methods for estimation of the sources as long as the signals can be considered sparse. ℓ_{1}-norm minimization is a piecewise linear operation that partially assigns the energy of x [i] to the m columns of A around x [i] in ${\mathbb{R}}^{n}$ space. The remaining n−m columns are assigned zero coefficients, therefore the ℓ_{1}-norm minimization can be manifested as:

A detailed discussion of signal recovery using ℓ_{1}-norm minimization is presented by Takigawa et al. [183] and described below. As mentioned above, it is important to choose a domain that sparsely represents the signals.

On the other hand, in the method developed by Pedersen et al. [176], as applied to stereo signals, the binary masks are estimated after BSS of the mixtures and then applied to the microphone signals. The same technique has been used for convolutive sparse mixtures after the signals are transformed to the frequency domain.

In another approach [184], the effect of outlier noise has been reduced using median filtering then hybrid fast ICA filtering, and ℓ_{1}-norm minimization have been used for separation of temporomandibular joint sounds. It has been shown that for such sources, this method outperforms both DUET and Li’s algorithms. The authors of [185] have recently extended the DUET algorithm to separation of more than two sources in an echoic mixing scenario in the time-frequency domain.

In a very recent approach, it has been considered that brain signal sources in the space-time frequency domain are disjoint. Therefore, clustering the observation points in the space-time-frequency-domain can be effectively used for separation of brain sources [186].

As it can be seen, generally, BSS exploits independence of the source signals, whereas SCA benefits from the disjointness property of the source signals in some domain. While the BSS algorithms mostly rely on ICA with statistical properties of the signals, SCA uses their geometrical and behavioral properties. Therefore, in SCA, either a clustering approach or a masking procedure can result in estimation of the mixing matrix. Often, an ℓ_{1}-norm is used to recover the source signals. Generally, in places where the source signals are sparse, the SCA methods often result in more accurate estimation of the signals with less ambiguities in the estimation.

7.4 SCA algorithms

There are three main steps for the solution of an SCA problem as shown in Table 16[187]. The first step of Table 16 shows a linear model for the SCA problem, the second step consists of estimating the mixing matrix A using sparsity information, and finally the third step is to estimate the sparse source representation based on the estimate of A[17].

Table 16

SCA steps

1. Consider the model x=A·s; we need a linear transformation that applies to both sides of the equation to yield a new sparse source vector.

2. Estimate the mixing matrix A. Several approaches are presented for this step, such as natural gradient ICA approaches, and clustering techniques with variants of k-means algorithm [18, 187].

3. Estimate the source representation based on the sparsity assumption. A majority of proposed methods are primarily based on minimizing some norm or pseudo-norm of the source representation vector. The most effective approaches are Matching Pursuit [38, 187], Basis Pursuit, [85, 178, 188, 189], FOCUSS [46], IDE [73] and Smoothed ℓ_{0}-norm [47].

A brief review of major approaches that are suggested for the third step was given in Section 2.

7.5 Sparse dictionary representation (SDR) and signal modeling

A signal $\mathbf{x}\in {\mathbb{R}}^{n}$ may be sparse in a given basis but not sparse in a different basis. For example, an image may be sparse in a wavelet basis (i.e., most of the wavelet coefficients are small) even though the image itself may not be sparse (i.e., many of the gray values of the image are relatively large). Thus, given a class $\mathcal{S}\subset {\mathbb{R}}^{n}$, an important problem is to find a basis or a frame in which all signals in $\mathcal{S}$ can be represented sparsely. More specifically, given a class of signals $\mathcal{S}\subset {\mathbb{R}}^{n}$, it is important to find a basis (or a frame) $D={\left\{{w}_{j}\right\}}_{j=1}^{d}$ (if it exists) for ${\mathbb{R}}^{n}$ such that every data vector $\mathbf{x}\in \mathcal{S}$ can be represented by at most k≪n linear combinations of elements of D. The dictionary design problem has been addressed in [18–20, 40, 75, 190]. A related problem is the signal modeling problem in which the class $\mathcal{S}$ is to be modeled by a union of subspaces $\mathcal{M}=\bigcup _{i=1}^{l}{V}_{i}$ where each V_{
i
} is a subspace of ${\mathbb{R}}^{n}$ with the dimension of V_{
i
}≤k where k≪n[49]. If the subspaces V_{
i
} are known, then it is possible to pick a basis ${E}^{i}={\left\{{e}_{j}^{i}\right\}}_{j}$ for each V_{
i
} and construct a dictionary $D=\bigcup _{i=1}^{l}{E}^{i}$ in which every signal of $\mathcal{S}$ has sparsity k (or is almost k sparse). The model $\mathcal{M}=\bigcup _{i=1}^{l}{V}_{i}$ can be found from an observed set of data $F=\{{f}_{1},\dots ,{f}_{m}\}\subset \mathcal{S}$ by solving (if possible) the following non-linear least squares problem:

Find subspaces ${V}_{1},\dots ,{V}_{l}$ of ${\mathbb{R}}^{n}$ that minimize the expression

over all possible choices of l subspaces with dimension of V_{
i
} ≤ k < n. Here d denotes the Euclidian distance in ${\mathbb{R}}^{n}$ and k is an integer with 1≤k<n for $i=1,\dots ,l$. Note that $e\left(F,\{{V}_{1},\dots ,{V}_{l}\}\right)$ is calculated as follows: for each f_{
i
} ∈ F and fixed $\{{V}_{1},\dots ,{V}_{l}\}$, the subspace ${V}_{j}\in \{{V}_{1},\dots ,{V}_{l}\}$ closest to f_{
i
} is found and the distance d^{2}(f_{
i
},V_{
j
}) is computed. This process is repeated for all f_{
i
}∈F and the squares of the distances are added together to find $e\left(F,\{{V}_{1},\dots ,{V}_{l}\}\right)$. The optimal model is then obtained as the union $\mathcal{M}=\bigcup _{i}{V}_{i}^{o}$, where $\{{V}_{1}^{o},\dots ,{V}_{l}^{o}\}$ minimize the expression (83). When l = 1 this problem reduces to the classical least squares problem. However, when l > 1 the set $\bigcup _{i}{V}_{i}$ is a nonlinear set and the problem is fully non-linear (see Figure 25). A more general nonlinear least squares problem has been studied for finite and infinite Hilbert spaces [49]. In that general setting, the existence of solutions is proved and a meta-algorithm for searching for the solution is described.

For the special finite dimensional case of ${\mathbb{R}}^{n}$ in (83), the search algorithm is an iterative algorithm that alternates between data partition and the optimization of a simpler least squares problem. This algorithm, which is equivalent to the k-means algorithm, is summarized in Table 17.

1. Use the SVD to find $\{{V}_{1}^{1},\dots ,{V}_{l}^{1}\}$ by minimizing $e\left({F}_{i}^{1},{V}_{i}^{1}\right)$ for each i, and compute ${\Gamma}_{1}=\sum _{i}e\left({F}_{i}^{1},{V}_{i}^{1}\right)$;

4. Choose a new partition $\left\{{F}_{1}^{j+1},\dots ,{F}_{l}^{j+1}\right\}$ that satisfies, $f\in {F}_{k}^{j+1}$ implies that $d\left(f,{V}_{k}^{j}\right)\le d\left(f,{V}_{h}^{j}\right)$, $h=1,\dots ,l$;

5. Use SVD to find and choose $\{{V}_{1}^{j+1},\dots ,{V}_{l}^{j+1}\}$, by minimizing $e\left({F}_{i}^{j+1},{V}_{i}\right)$ for each i, and compute ${\Gamma}_{j+1}=\sum _{i}e\left({F}_{i}^{j+1},{V}_{i}^{j+1}\right)$;

6. Increment j by 1, i.e., j→j + 1;

7. End while

● Output:

−$\{{F}_{1}^{j},\dots ,{F}_{l}^{j}\}$ and $\{{V}_{1}^{j},\dots ,{V}_{l}^{j}\}$.

In some new attempts sparse representation and the compressive sensing concept have been extended to solving multichannel source separation [191–194]. In [191, 192] separation of sparse sources with different morphologies has been presented by developing a multichannel morphological component analysis approach. In this scheme, the signals are considered as combination of features from different dictionaries. Therefore, different dictionaries are assumed for different sources. In [193] inversion of a random field from pointwise measurements collected by a sensor network is presented. In this article, it is assumed that the field has a sparse representation in a known basis. To illustrate the approach, the inversion of an acoustic field created by the superposition of a discrete number of propagating noisy acoustic sources is considered. The method combines compressed sensing (sparse reconstruction by ℓ_{1}-constrained optimization) with distributed average consensus (mixing the pointwise sensor measurements by local communication among the sensors). [194] addresses source separation from a linear mixture under source sparsity and orthogonality of the mixing matrix assumptions. A two-stage separation process is proposed. In the first stage recovering a sparsity pattern of the sources is tried by exploiting the orthogonality prior. In the second stage, the support is used to reformulate the recovery task as an optimization problem. Then a solution based on alternating minimization for solving the above problems is suggested.

8 Multipath channel estimation

In wireless systems, channel estimation is required for the compensation of channel distortions. The transmitted signal reflects off different objects and arrives at the receiver from multiple paths. This phenomenon causes the received signal to be a mixture of reflected and scattered versions of the transmitted signal. The mobility of the transmitter, receiver, and scattering objects results in rapid changes in the channel response, and thus the channel estimation process becomes more complicated. Due to the sparse distribution of scattering objects, a multipath channel is sparse in the time domain as shown in Figure 26. By taking sparsity into consideration, channel estimation can be simplified and/or made more accurate. The sparse time varying multipath channel is modeled as

where k is the number of taps, α_{
l
}is the l^{
th
} complex path gain, and τ_{
l
} is the corresponding path delay. At time t, the transfer function is given by

The estimation of the multipath channel impulse response is very much similar to the determination of analog epochs and amplitudes of discontinuities for finite rate of innovation as shown in (31). Essentially, if a known train of impulses is transmitted and the received signal from the multipath channel is filtered and sampled (information domain as discussed in Section 3.3), the channel impulse response can be estimated from these samples using an annihilating filter (the Prony or ELP method) [27] defined with the $\mathcal{Z}$-transform and a pseudo-inverse matrix inversion, in principle.^{m}Once the channel impulse response is estimated, its effect is compensated; this process can be repeated according to the dynamics of the time varying channel.

A special case of multipath channel is an OFDM channel, which is widely used in ADSL, DAB, DVB, WLAN, WMAN, and WIMAX.^{n}OFDM is a digital multi-carrier transmission technique where a single data stream is transmitted over several sub-carrier frequencies to achieve robustness against multipath channels as well as spectral efficiency [195]. Channel estimation for OFDM is relatively simple; the time instances of channel impulse response is now quantized and instead of an annihilating filter defined in the $\mathcal{Z}$-transform, we can use DFT and ELP of Section 4.1. Also, instead of a known train of impulses, some of the available sub-carriers in each transmitted symbol are assigned to predetermined patterns, which are usually called comb-type pilots. These pilot tones help the receiver to extract some of the DFT samples of the discrete time varying channel (84) at the respective frequencies in each transmitted symbol. These characteristics make the OFDM channel estimation similar to unknown sparse signal recovery of Section 3.1.1 and the impulsive noise removal of Section 4.1.2. Because of these advantages, our main example and simulations are related to OFDM channel estimation.

8.1 OFDM channel estimation

For OFDM, the discrete version of the time varying channel of (85) in the frequency domain becomes

where T_{
f
}and n are the symbol length (including cyclic prefix) and number of sub-carriers in each OFDM symbol, respectively. Δf is the sub-carrier spacing, and ${T}_{s}=\frac{1}{\mathrm{\Delta f}}$ is the sample interval. The above equation shows that for the r^{
th
}OFDM symbol, H [r,i]is the DFT of h [r,l].

Two major methods are used in the equalization process [196]: (1) zero forcing and (2) minimun mean squared error (MMSE). In the zero forcing method, regardless of the noise variance, equalization is obtained by dividing the received OFDM symbol by the estimated channel frequency response; while in the MMSE method, the approximation is chosen such that the MSE of the transmitted data vector $\left(E\left[\parallel \mathbf{X}-\widehat{\mathbf{X}}{\parallel}^{2}\right]\right)$ is minimized, which introduces the noise variance in the equations.

8.1.1 Statement of the problem

The goal of the channel estimation process is to obtain the channel impulse response from the noisy values of the channel transfer function in the pilot positions. This is equivalent to solving the following equation for H.

where i_{
p
}is an index vector denoting the pilot positions in the frequency spectrum, ${\stackrel{~}{\mathbf{H}}}_{{i}_{p}}$ is a vector containing the noisy value of the channel frequency spectrum in these pilot positions and ${\mathbf{F}}_{{i}_{p}}$ denotes the matrix obtained from taking the rows of the DFT matrix pertaining to the pilot positions. ${\mathit{\nu}}_{{i}_{p}}$ is the additive noise on the pilot points in the frequency domain. Thus, the channel estimation problem is equivalent to finding the sparse vector H from the above set of equations for a set of pilots. Various channel estimation methods [197] have been used with the usual tradeoffs of optimality and complexity. The least square (LS) [197], ML [198], MMSE [199–201], and Linear Minimum Mean Squared Error (LMMSE) [198, 199, 202] techniques are among some of these methods. However, none of these techniques use the inherent sparsity of the multipath channel H, and thus, they are not as accurate.

8.1.2 Sparse OFDM channel estimation

In the following, we present two methods that utilize this sparsity to enhance the channel estimation process.

CS-based channel estimation

The idea of using time-domain sparsity in OFDM channel estimation has been proposed by [203–205]. There are two main advantages in including the sparsity constraint of the channel impulse response in the estimation process:

(1)

Decrease in the MSE: By applying the sparsity constraint, the energy of the estimated channel impulse response will be concentrated into a few coefficients while in the conventional methods, we usually observe a leakage of the energy to the neighboring coefficients of the nonzero taps. Thus, if the sparsity-based methods succeed in estimating the support of the channel impulse response, the MSE will be improved by prevention of the leakage effect.

(2)

Reduction in the overhead: The number of pilot sub-carriers is in fact, the number of (noisy) samples that we obtain from the channel frequency response. Since the pilot sub-carriers do not convey any data, they are considered as the overhead imposed to enhance the estimation process. The theoretical results in [203] indicate that by means of sparsity-based methods, the perfect estimation can be achieved with an overhead proportional to the number of non-zero channel taps (which is considerably less than that of the current standards).

In the sequel, we present two iterative methods which exploit the inherent sparsity of the channel impulse response to improve the channel estimation task in OFDM systems.

8.1.3 Iterative method with adaptive thresholding (IMAT) for OFDM channel estimation[206]

Here we apply a similar iterative method as in Section 4.2 for the channel estimation problem in (88). The main goal is to estimate H from ${\stackrel{~}{\mathbf{H}}}_{{i}_{p}}$ given that H has a few non-zero coefficients. To obtain an initial estimate ${\widehat{\mathbf{h}}}_{0}$, we use the Moore-Penrose pseudo-inverse of ${\mathbf{F}}_{{i}_{p}}$ which yields a solution with minimum ℓ_{2}-norm:

where λ and i are the relaxation parameter and the iteration number, respectively, k is the index of channel impulse response and $\mathbf{G}=\frac{1}{N}{\mathbf{F}}_{{i}_{p}}^{H}{\mathbf{F}}_{{i}_{p}}$ is defined in (89). The block diagram of the proposed channel estimation method is shown in Figure 27.

8.1.4 Modified IMAT (MIMAT) for OFDM channel estimation[23]

In this method, the spectrum of the channel is initially estimated using a simple interpolation method such as linear interpolation between pilot sub-carriers. This initial estimate is further improved in a series of iterations between time (sparse) and frequency (information) domains to find the sparsest channel impulse response by using an adaptive thresholding scheme; in each iteration, after finding the locations of the taps (locations with previously estimated amplitudes higher than the threshold), their respective amplitudes are again found using the MMSE criterion. In each iteration, due to thresholding, some of the false taps that are noise samples with amplitudes above the threshold are discarded. Thus, the new iteration starts with a lower number of false taps. Moreover, because of the MMSE estimator, the valid taps approach their actual values in each new iteration. In the last iteration, the actual taps are detected and the MMSE estimator gives their respective values. This method is similar to RDE and IDE methods discussed in Sections 2.6 and 4.1.2. The main advantage of this method is its robustness against side-band zero-padding.^{o}

Table 18 summarizes the steps in the MIMAT algorithm. In the threshold of the MIMAT algorithm, α and β are constants which depend on the number of taps and initial powers of noise and channel impulses. In the first iteration, the threshold is a small number, and with each iteration it is gradually increased. Intuitively, this gradual increase of the threshold with the iteration number, results in a gradual reduction of false taps (taps that are created due to noise). In each iteration, the tap values are obtained from

where t denotes the index of nonzero impulses obtained from the previous step and $\stackrel{~}{\mathbf{F}}$ is obtained from ${\mathbf{F}}_{{i}_{p}}$ by keeping the columns determined by t. The amplitudes of nonzero impulses can be obtained from simple iterations, pseudo-inverse, or the MMSE equation (94) of Table 18 that yields better results under additive noise environments.

Table 18

MIMAT algorithm for OFDM channel estimation

● Initialization:

−Find an initial estimate of the time domain channel using linear interpolation: ${\u0125}^{\left(0\right)}={\u0125}_{\mathit{\text{linear}}}$

● Iterations:

1. Set Threshold=βe^{
αi
}.

2. Using the threshold from the previous step, find the locations of the taps t by thresholding the time domain channel from the previous iteration (${\u0125}^{(i-1)}$).

3. Solve for the values of the non-zero impulses using MMSE:${\u0125}_{t}=\mathit{\text{SNR}}\xb7{\stackrel{~}{\mathbf{F}}}^{H}{(\stackrel{~}{\mathbf{F}}\xb7\mathit{\text{SNR}}\xb7{\stackrel{~}{\mathbf{F}}}^{H}+\mathbf{I})}^{-1}$

4. Find the new estimate of the channel (${\u0125}^{\left(i\right)}$) by substituting the taps in their detected positions.

5. Stop if the estimated channel is close enough to the previous estimation or when a maximum number of iterations is reached.

The equation that has to be solved in (93) is usually over-determined which helps the suppression of the noise in each iteration step. Note that the solution presented in (94) represents a variant of the MMSE solution when the location of discrete impulses are known. If further statistical knowledge is available, this solution can be modified and a better estimation is obtained; however, this makes the approximation process more complex. This algorithm does not need many steps of iterations; the positions of the non-zero impulses are perfectly detected in three or four iterations for most types of channels.

8.2 Simulation results and discussions

For OFDM simulations, the DVB-H standard was used with the 16-QAM constellation in the 2K mode (2^{11} FFT size). The channel profile was the Brazil channel D. Figures 28, 29, 30, and 31 show the symbol error rate (SER) versus the carrier-to-noise ratio (CNR) after equalizing using different sparse reconstruction methods such as orthogonal matching pursuit (OMP) [88], compressive sampling matching pursuit (CoSaMP) [41], gradient projection for sparse reconstruction (GPSR) [44], IMAT and MIMAT. Also the standard linear interpolation in the frequency domain using the noisy pilot samples is simulated. In these simulations, we have considered the effects of zero-padding and Doppler frequency in the SER of estimation. As can be seen in Figures 28, 29, 30, and 31, the SER obtained from the sparsity-based algorithms reveal almost perfect approximation of the hypothetical ideal channel (where the exact channel frequency response is used for equalization).

9 Conclusion

A unified view of sparse signal processing has been presented in tutorial form. The sparsity in the key areas of sampling, coding, spectral estimation, array processing, component analysis, and channel estimation has been carefully exploited. Some form of uniform or random sampling has been shown to underpin the associated sparse processing methods used in each of these fields. The reconstruction methods used in each application domain have been introduced and the interconnections among them have been highlighted.

This development has revealed, for example, that the iterative methods developed for random sampling can be applied to real-field block and convolutional channel coding for impulsive noise (salt-and-pepper noise in the case of images) removal, SCA, and channel estimation for orthogonal frequency division multiplexing systems. These iterative reconstruction methods have been shown to be naturally extendable to spectral estimation and sparse array processing due to their similarity to channel coding in terms of mathematical models with significant improvements. Conversely, the minimum description length method developed for spectral estimation and array processing has potential for application in other areas. The error locator polynomial method developed for channel coding has, moreover, been shown to be a discrete version of the annihilating filter used in sampling with a finite rate of innovation and the Prony method in spectral estimation; the Pisarenko and MUSIC methods are further improvements of the Prony method when additive noise is also considered.

Linkages with emergent areas such as compressive sensing and channel estimation have also been considered. In addition, it has been suggested that the linear programming methods developed for compressive sensing and SCA can be applied to other applications with possible reduction of sampling rate. As such, this tutorial has provided a route for new applications of sparse signal processing to emerge, which can potentially reduce computational complexity and improve performance quality. Other potential applications of sparsity are in the areas of sensor networks and sparse array design.

Endnotes

^{a}Sparse Signal Processing, Panel Session organized and chaired by F. Marvasti and lectured by Profs. E. Candes, R. G. Baraniuk, P. Marziliano, and Dr. A. Cichoki, ICASSP 2008, Las Vegas, May 2008.^{b}A list of acronyms is given in Table 2 at the end of this section.^{c}The sequence of vectors {v_{
n
}} is called a Riesz basis if there exist scalars 0<A≤B<∞ such that for every absolutely summable sequence of scalars {a_{
n
}}, we have the following inequalities [207]: