Performance and decoding complexity of nonbinary LDPC codes for magnetic recording

被引：9

作者：

Chang, Wu ^{[1
]}

Cruz, J. R. ^{[1
]}

机构：

[1] Univ Oklahoma, Sch Elect & Comp Engn, Norman, OK 73019 USA

来源：

IEEE TRANSACTIONS ON MAGNETICS | 2008年 / 44卷 / 01期

关键词：

decoding complexity; iterative decoding; low-density parity-check codes; partial response channels; perpendicular magnetic recording;

D O I：

10.1109/TMAG.2007.912832

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We consider a group of high-performance q-ary low-density parity-check (LDPC) coded perpendicular magnetic recording channels (PMRCs) with optimized targets and codes over various field sizes. We show that the nonbinary LDPC-coded PMRCs provide 1-dB coding gain over a practical implementation of a good binary LDPC-coded PMRC at user density of 1.22, and evaluate the decoding complexities of these systems in terms of both the number of floating-point (FLP) operations and the computational time. Decoding complexity ratios of nonbinary LDPC-coded PMRCs to the binary LDPC-coded system are presented. After careful analysis, we conclude that the time complexity ratios are always smaller than the ratios obtained by the number of FLP operations, which do not exceed 7.42. Furthermore, experimental results show that the size of the Galois field does not affect the decoding complexity.

引用

页码：211 / 216

页数：6

共 23 条

[11] Binary representation of cycle Tanner-graph GF(2b) codes [J].

Hu, XY ;

Eleftheriou, E .

2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, :528-532

[12]

Hu XY, 2001, GLOB TELECOMM CONF, P995, DOI 10.1109/GLOCOM.2001.965567

[13] Low-density parity-check codes based on finite geometries: A rediscovery and new results [J].

Kou, Y. (ykou@att.net), 2001, Institute of Electrical and Electronics Engineers Inc. (47)

[14] Generalized partial-response targets for perpendicular recording with jitter noise [J].

Kovintavewat, P ;

Ozgunes, I ;

Kurtas, E ;

Barry, JR ;

McLaughlin, SW .

IEEE TRANSACTIONS ON MAGNETICS, 2002, 38 (05) :2340-2342

[15] Good error-correcting codes based on very sparse matrices [J].

MacKay, DJC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431

[16]

Muller J.-M., 2006, ELEMENTARY FUNCTIONS

[17] Design of capacity-approaching irregular low-density parity-check codes [J].

Richardson, TJ ;

Shokrollahi, MA ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :619-637

[18] Performance analysis of modified PRML channels for perpendicular recording systems [J].

Sawaguchi, H ;

Nishida, Y ;

Takano, H ;

Aoi, H .

JOURNAL OF MAGNETISM AND MAGNETIC MATERIALS, 2001, 235 (1-3) :265-272

[19] Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording [J].

Song, HX ;

Cruz, JR .

IEEE TRANSACTIONS ON MAGNETICS, 2003, 39 (02) :1081-1087

[20] Algebraic constructions of nonbinary quasi-cyclic LDPC codes [J].

Song, Shumei ;

Zeng, Lingqi ;

Lin, Shu ;

Abdel-Ghaffar, Khaled .

2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :83-+

← 1 2 3 →