We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Iterative reduced-state decoding for coded partial-response 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)
Zhiliang Qin ; Data Storage Inst., Singapore, Singapore ; Kah Chan Teh

The conventional iterative decoding based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm rises exponentially in terms of channel memory length. In this paper, we propose a low-complexity soft-input/soft-output (SISO) channel detector based on tentative hard estimates fed back from the outer decoder in the previous iteration. The computational complexity of the proposed detector is polynomial in terms of the channel memory length. To demonstrate the performance/complexity tradeoff of the proposed detector, we present simulation results for 9-tap, 11-tap, and 12-tap channels. We show that the proposed detector significantly reduces the computational complexity with only slight performance degradation compared to the full-complexity BCJR algorithm.

Published in:

Magnetics, IEEE Transactions on  (Volume:41 ,  Issue: 11 )