Non-Binary LDPC Codes for Magnetic Recording Channels: Error Floor Analysis and Optimized Code Design

被引:28
作者
Hareedy, Ahmed [1 ]
Amiri, Behzad [1 ]
Galbraith, Rick [2 ]
Dolecek, Lara [1 ]
机构
[1] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90095 USA
[2] Hitachi Global Storage Technol, Rochester, MN 55901 USA
基金
美国国家科学基金会;
关键词
LDPC codes; non-binary codes; absorbing sets; magnetic recording; partial-response channels; error floor performance; error floor prediction; FULLY ABSORBING SETS; PERFORMANCE EVALUATION; TRAPPING SETS; ALGORITHM;
D O I
10.1109/TCOMM.2016.2574869
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we provide a comprehensive analysis of the error floor along with code optimization guidelines for structured and regular non-binary low-density parity-check (NB-LDPC) codes in magnetic recording (MR) applications. While the topic of the error floor performance of binary LDPC codes over additive white Gaussian noise (AWGN) channels has recently received considerable attention, very little is known about the error floor performance of NB-LDPC codes over other types of channels, despite the early results demonstrating superior characteristics of NB-LDPC codes relative to their binary counterparts. We first show that, due to the outer looping between the detector and the decoder in the receiver, the error profile of NB-LDPC codes over partial-response (PR) channels is qualitatively different from the error profile over AWGN channels-this observation motivates us to introduce new combinatorial objects aimed at capturing decoding errors that dominate the PR channel error floor region. We call these objects balanced absorbing sets (BASs), which are viewed as a special subclass of previously introduced absorbing sets (ASs). Aided by these new objects (BASs), we develop a method that combines analytical equations and biased simulations to predict the error floor performance of NB-LDPC codes over PR channels without the need to execute extensive Monte Carlo (MC) simulations. We show that explicitly incorporating the inter-symbol interference of MR channels into our prediction method makes the accuracy of the error floor estimate within 0.2 of an order of magnitude from the traditional MC simulation. In addition, we prove that, due to the more restrictive definition of BASs (relative to the more general class of ASs), an additional degree of freedom can be exploited in the code design for PR channels. We then demonstrate that the proposed code optimization aimed at removing dominant BASs offers performance improvements in the frame error rate in the error floor region by up to 2.5 orders of magnitude over the unoptimized designs. Our code optimization technique carefully, yet provably, removes BASs from the code while preserving its overall structure (node degree, quasi-cyclic property, regularity, and so forth). The resulting codes outperform the existing binary and NB-LDPC solutions for PR channels by about 2.5 and 1.25 orders of magnitude, respectively.
引用
收藏
页码:3194 / 3207
页数:14
相关论文
共 29 条
[1]   Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes [J].
Amiri, Behzad ;
Kliewer, Joerg ;
Dolecek, Lara .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2014, 62 (02) :398-409
[2]   Asymptotic Distribution of Absorbing Sets and Fully Absorbing Sets for Regular Sparse Code Ensembles [J].
Amiri, Behzad ;
Lin, Chi-Wei ;
Dolecek, Lara .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (02) :455-464
[3]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[4]  
Bazarsky A., 2013, P IEEE INF THEOR WOR, P1
[5]  
Cavus E, 2006, IEEE ICC, P1095
[6]   On the application of factor graphs and the sum-product algorithm to ISI channels [J].
Colavolpe, G ;
Germi, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (05) :818-825
[7]  
Cole C. A., 2006, GENERAL METHOD FINDI
[8]   Low-Density Parity Check Codes over GF (q) [J].
Davey, Matthew C. ;
MacKay, David .
IEEE COMMUNICATIONS LETTERS, 1998, 2 (06) :165-167
[9]   Decoding algorithms for nonbinary LDPC codes over GF(q) [J].
Declercq, David ;
Fossorier, Marc .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (04) :633-643
[10]   Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes [J].
Dolecek, Lara ;
Zhang, Zhengya ;
Anantharam, Venkat ;
Wainwright, Martin J. ;
Nikolic, Borivoje .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) :181-201