TY - GEN
T1 - Group sparse total least-squares for cognitive spectrum sensing
AU - Dall'Anese, Emiliano
AU - Bazerque, Juan Andres
AU - Zhu, Hao
AU - Giannakis, Georgios B.
PY - 2011
Y1 - 2011
N2 - The present paper develops a collaborative scheme whereby cognitive radios cooperate to localize active primary transmitters and reconstruct the power spectral density (PSD) maps (one per frequency band) portraying the power distribution across space. The sensing scheme relies on a parsimonious linear system model that accounts for the narrow-band nature of transmit-PSDs compared to the large swath of sensed frequencies, and for the group sparsity emerging when adopting a spatial grid of candidate primary user locations. Combining the merits of Lasso, group Lasso, and total least-squares (TLS), the proposed group sparse (GS) TLS approach yields hierarchically-sparse PSD estimates, and copes with model uncertainty induced by channel randomness and grid mismatch effects. Taking advantage of a novel low-complexity solver for the GS-Lasso, a block coordinate descent scheme is developed to solve the formulated GS-TLS problem. Simulations demonstrate the superior localization and PSD-estimation performance of GS-TLS compared to approaches that do not account for model uncertainties.
AB - The present paper develops a collaborative scheme whereby cognitive radios cooperate to localize active primary transmitters and reconstruct the power spectral density (PSD) maps (one per frequency band) portraying the power distribution across space. The sensing scheme relies on a parsimonious linear system model that accounts for the narrow-band nature of transmit-PSDs compared to the large swath of sensed frequencies, and for the group sparsity emerging when adopting a spatial grid of candidate primary user locations. Combining the merits of Lasso, group Lasso, and total least-squares (TLS), the proposed group sparse (GS) TLS approach yields hierarchically-sparse PSD estimates, and copes with model uncertainty induced by channel randomness and grid mismatch effects. Taking advantage of a novel low-complexity solver for the GS-Lasso, a block coordinate descent scheme is developed to solve the formulated GS-TLS problem. Simulations demonstrate the superior localization and PSD-estimation performance of GS-TLS compared to approaches that do not account for model uncertainties.
UR - http://www.scopus.com/inward/record.url?scp=80052659631&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052659631&partnerID=8YFLogxK
U2 - 10.1109/SPAWC.2011.5990487
DO - 10.1109/SPAWC.2011.5990487
M3 - Conference contribution
AN - SCOPUS:80052659631
SN - 9781424493326
T3 - IEEE Workshop on Signal Processing Advances in Wireless Communications, SPAWC
SP - 96
EP - 100
BT - 2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2011
T2 - 2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2011
Y2 - 26 June 2011 through 29 June 2011
ER -