By Topic

A Fast Fixed Point Iteration Algorithm for Sparse Channel Estimation

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
$33 $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

3 Author(s)
Xue Jiang ; Sunplus mMobile Inc., Beijing, China ; Wen-Jun Zeng ; En Cheng

Channels with a long but sparse impulse response arise in a variety of wireless communication applications, such as high definition television (HDTV) terrestrial transmission and underwater acoustic communications. By adopting the ℓ1-norm as the sparsity metric of the channel response, the channel estimation is formulated as a complex-valued convex optimization problem. A fast fixed point iteration algorithm is developed to solve the resultant complex-valued ℓ1-minimization problem. The proposed fast channel estimation algorithm is easy to implement and has a low computational complexity of O (N log N) per iteration with N the signal length. Simulation results are provided to demonstrate the performance of the proposed fixed point algorithm.

Published in:

Communications and Mobile Computing (CMC), 2011 Third International Conference on

Date of Conference:

18-20 April 2011