By Topic

Comparison of basis pursuit algorithms for sparse channel estimation in underwater acoustic OFDM

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jianzhong Huang ; Dept. of Electr. & Comput. Eng., Univ. of Connecticut, Storrs, CT, USA ; Berger, C.R. ; Shengli Zhou ; Jie Huang

Recently it has been shown that sparse channel estimation, implemented with orthogonal matching pursuit (OMP) and basis pursuit (BP) algorithms, has impressive performance gains over alternatives that do not take advantage of the channel sparsity, for underwater acoustic (UWA) communications. We in this paper compare the performance and complexity of three popular BP algorithms, namely l1_ls, SpaRSA, and YALL1, using both simulation and experimental data for underwater orthogonal frequency division multiplexing (OFDM) systems with both single and multiple transmitters. We find that all BP solvers achieve similar block-error-rate performance, considerably outperforming OMP. In terms of complexity, both SpaRSA and YALL1 reduce the runtime by about one order of magnitude relative to l1 ls, catching up with OMP. The efficient BP solvers such as SpaRSA and YALL1 are thus appealing to be implemented in real-time underwater OFDM modems.

Published in:

OCEANS 2010 IEEE - Sydney

Date of Conference:

24-27 May 2010