Application of soft-decision Reed-Solomon decoding to magnetic recording channels

被引：4

作者：

Xia, HT ^{[1
]}

Cruz, JR ^{[1
]}

机构：

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

来源：

IEEE TRANSACTIONS ON MAGNETICS | 2004年 / 40卷 / 05期

关键词：

error-correction codes; magnetic recording; partial response channels; Reed-Solomon codes; soft Chase algorithm; soft-decision decoding;

D O I：

10.1109/TMAG.2004.834194

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

We report on the application of algebraic soft-decision decoding of Reed-Solomon codes to magnetic recording channels. We present efficient algorithm implementations of the Koetter-Vardy algorithm and introduce a soft version of the Chase algorithm, which expands the decoding list without substantial increase in complexity. Our evaluation of these algorithms, based on realistic simulations on magnetic recording channels, shows that improved performance can be achieved with a small increase in hardware complexity.

引用

页码：3419 / 3430

页数：12

共 23 条

[1]

AHMED A, UNPUB IEEE T VLSI SY

[2] 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

[3] Bounded distance plus 1 soft-decision Reed-Solomon decoding [J].

Berlekamp, E .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (03) :704-720

[4]

Blahut R. E., 1983, THEORY PRACTICE ERRO

[5] CLASS OF ALGORITHMS FOR DECODING BLOCK CODES WITH CHANNEL MEASUREMENT INFORMATION [J].

CHASE, D .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (01) :170-+

[6]

CHENG MK, 2002, INSIC FALL M PITTSB

[7] FAST PARALLEL ALGORITHMS FOR DECODING REED-SOLOMON CODES BASED ON REMAINDER POLYNOMIALS [J].

DABIRI, D ;

BLAKE, IF .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (04) :873-885

[8]

FENG GL, UNPUB IEEE T INFORM

[9] LOW-DENSITY PARITY-CHECK CODES [J].

GALLAGER, RG .

IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&

[10]

Gross W. J., 2002, P 21 BIENN S COMM, P356

← 1 2 3 →