Block turbo codes for magnetic recording channels

被引：0

作者：

Song, HX ^{[1
]}

Cruz, JR ^{[1
]}

机构：

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

来源：

ICC 2000: IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3: GLOBAL CONVERGENCE THROUGH COMMUNICATIONS | 2000年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Block turbo codes have been shown to have near-optimum performance and lower decoding complexity than convolutional turbo codes for additive white Gaussian noise (AWGN) channels. In this paper we discuss the applicability of block turbo codes to partial-response (PR) equalized Lorentzian channels for magnetic recording. In particular, we consider the iterative decoding of product codes and parallel concatenated block codes. Simulation results show that both systems offer substantial gains over uncoded systems.

引用

页码：85 / 88

页数：4

共 8 条

[1]

BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109/ICC.1993.397441

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

CHASE, D .

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

[3]

HAGENAUER J, 1989, DALLAS GLOBECOM 89, VOLS 1-3, P1680, DOI 10.1109/GLOCOM.1989.64230

[4]

NISHIYA T, 1998, P IEEE GLOB TEL C, P2868

[5] Near-optimum decoding of product codes: Block turbo codes [J].

Pyndiah, RM .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (08) :1003-1010

[6]

RYAN W, 1998, P C INF SCI SYST PRI, P489

[7]

Ryan WE, 1998, ICC 98 - 1998 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS VOLS 1-3, P947, DOI 10.1109/ICC.1998.685151

[8]

SOUVIGNIER T, 1999, P IEEE INT C COMM

← 1 →