DocumentCode :
82925
Title :
Iterative Reduced-Complexity Graph-Based Detection for LDPC Coded 2D Recording Channels
Author :
Zhiliang Qin ; Kui Cai ; Kheong Sann Chan
Author_Institution :
Data Storage Inst., Agency for Sci., Technol. & Res. (A*STAR), Singapore, Singapore
Volume :
49
Issue :
6
fYear :
2013
fDate :
Jun-13
Firstpage :
2598
Lastpage :
2602
Abstract :
In this paper, we consider joint detection and decoding for low-density parity-check (LDPC) coded two-dimensional (2D) intersymbol interference (ISI) channels, where message-passing is performed over an overall factor graph representing both the code structure and the channel model. We propose a low-complexity channel detector based on the Chase decoding algorithm to simplify the check node operation by restricting the a posteriori probability (APP) computation to a small subset of candidate vectors. Simulation results show that the proposed receiver provides an adjustable performance/complexity tradeoff and performs close to the full-complexity graph-based receiver.
Keywords :
intersymbol interference; message passing; parity check codes; Chase decoding algorithm; a posteriori probability computation; channel model; check node operation; code structure; full-complexity graph-based receiver; iterative reduced-complexity graph-based detection; low-complexity channel detector; low-density parity-check coded 2D intersymbol interference channels; low-density parity-check coded 2D recording channels; message-passing; overall factor graph; performance-complexity tradeoff; vector subset; Chase decoding; LDPC codes; graph detector; message-passing; two-dimensional (2D) channels;
fLanguage :
English
Journal_Title :
Magnetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9464
Type :
jour
DOI :
10.1109/TMAG.2013.2253763
Filename :
6522234
Link To Document :
بازگشت