Sparse representations and sphere decoding for array signal processing

Array processing algorithms are used in many applications for source localization and signal waveform estimation. When the number of snapshots is small and/or the signal-to-noise ratio (SNR) is low, it becomes a challenge to discriminate closely-spaced sources. In this paper, two new array processin...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Digital signal processing Ročník 22; číslo 2; s. 253 - 262
Hlavní autori: Yardibi, T., Li, J., Stoica, P., Cattafesta, L.N.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.03.2012
Predmet:
Algorithms
Array processing
Arrays
Computer simulation
Decoding
Digital signal processing
Position (location)
Power estimation
Shrinkage
Signal processing
Source localization
Sparsity
Sphere decoding
Sparsity
Source localization
Array processing
Power estimation
Sphere decoding
ISSN:1051-2004, 1095-4333, 1095-4333
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Array processing algorithms are used in many applications for source localization and signal waveform estimation. When the number of snapshots is small and/or the signal-to-noise ratio (SNR) is low, it becomes a challenge to discriminate closely-spaced sources. In this paper, two new array processing algorithms exploiting sparsity are proposed to overcome this problem. The first proposed method combines a well-known sparsity preserving algorithm, namely the least absolute shrinkage and selection operator (LASSO), with the Bayesian information criterion (BIC) to eliminate user parameters. The second proposed algorithm extends the sphere decoding algorithm, which is widely used in communication applications for the recovery of signals belonging to a finite integer dictionary, to promote the sparsity of the solution. The proposed algorithms are compared with several existing sparse signal estimation techniques. Simulations involving uncorrelated and coherent sources demonstrate that the proposed algorithms, especially the algorithm based on sphere decoding, show better performance than the existing methods. Moreover, the proposed algorithms are shown to be more practical than the existing methods due to the easiness in selecting their user parameters.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1051-2004
1095-4333
1095-4333
DOI:10.1016/j.dsp.2011.10.006