By Topic

Blind OFDM Channel Estimation Using FIR Constraints: Reduced Complexity and Identifiability

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

2 Author(s)
Seongwook Song ; Samsung Electron. Co., Ltd, Gyeonggi ; Andrew C. Singer

In this correspondence, blind channel estimators exploiting finite alphabet constraints are discussed for orthogonal frequency-division multiplexing (OFDM) systems. Considering the channel and data jointly, a joint maximum-likelihood (JML) algorithm is described, along with identifiability conditions in the noise-free case. This approach enables development of general identifiability conditions for the minimum-distance (MD) finite alphabet blind algorithm of Zhou and Giannakis. Both the JML and MD algorithms suffer from high numerical complexity, as they rely on exhaustive search methods to resolve a large number of ambiguities. We present a substantially more efficient blind algorithm, the reduced complexity minimum distance (RMD) algorithm, by exploiting properties of the assumed finite-length impulse response (FIR) channel. The RMD algorithm exploits constraints on the unwrapped phase of FIR systems and results in significant reductions in numerical complexity over existing methods. In many cases, the RMD approach is able to completely eliminate the exhaustive search of the JML and MD approaches, while providing channel estimates of the same quality

Published in:

IEEE Transactions on Information Theory  (Volume:53 ,  Issue: 3 )