By Topic

Low-Complexity Algorithm for Tap-Selective Maximum Likelihood Estimation Over Sparse Multipath Channels

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

2 Author(s)
Jeng-Kuang Hwang ; Yuan Ze Univ., Jhongli ; Rih-Lung Chung

A tap-selective maximum likelihood (TS-ML) channel estimation algorithm is proposed for long-range broadband block transmission system over sparse multipath channels. Based on a combined detection-estimation problem formulation, the TS-ML estimator for sparse channels is first derived by estimating a reduced set of significant channel taps. A low-complexity TS-ML algorithm based on fast Fourier transform (FFT) and recursive minimum description length (MDL) criteria is then presented, which not only considerably outperforms the conventional non- sparse ML method, but also has minimum preamble overhead. Simulation results show that the proposed TS-ML algorithm with MDL criterion can achieve the optimal performance bound, and adapt itself to make full use of channel sparsity.

Published in:

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Date of Conference:

26-30 Nov. 2007