Five runlength-limited codes for M-ary recording channels

被引：28

作者：

McLaughlin, SW

机构：

[1] School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta

来源：

IEEE TRANSACTIONS ON MAGNETICS | 1997年 / 33卷 / 03期

基金：

美国国家科学基金会;

关键词：

constrained codes; magnetic and optical recording; runlength-limited codes;

D O I：

10.1109/20.573871

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

This paper is concerned with M-ary runlength-limited (RLL) codes for nonbinary recording channels, The codes have fixed-rate finite state encoders, sliding block decoders, and large coding density. Five codes are given achieving coding densities of 24 bit/minimum-recorded-mark as compared with 1-1.5 for binary recording channels, The codes are 93-98.5% efficient and either achieve or come close to achieving the fewest number of encoder states possible, One of these codes has been implemented in a prototype system that supports M=6 discrete recording levels.

引用

页码：2442 / 2450

页数：9

共 12 条

[1] AN APPLICATION OF SYMBOLIC DYNAMICS TO INFORMATION-THEORY
ADLER, RL
COPPERSMITH, D
HASSNER, M
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (01) : 5 - 22
[2] EARMAN A, 1992, P OPT DAT STOR C SAN, P271
[3] RESULTS INVOLVING (D,K) CONSTRAINED M-ARY CODES
FRENCH, CA
DIXON, GS
WOLF, JK
[J]. IEEE TRANSACTIONS ON MAGNETICS, 1987, 23 (05) : 3678 - 3680
[4] IMMINK KAS, 1991, CODING TECHNIQUES DI
[5] BOUNDS ON THE NUMBER OF STATES IN ENCODER GRAPHS FOR INPUT-CONSTRAINED CHANNELS
MARCUS, BH
ROTH, RM
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) : 742 - 758
[6] FINITE-STATE MODULATION CODES FOR DATA-STORAGE
MARCUS, BH
SIEGEL, PH
WOLF, JK
[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1992, 10 (01) : 5 - 37
[7] MARX D, 1994, P OPT DAT STOR C DAN, P77
[8] MCLAUGHLIN SW, 1995, IEEE T MAGN, V33, P1155
[9] MCLAUGHLIN SW, P 1994 INT S INF THE
[10] Seneta E., 1981, Non-negative Matrices and Markov Chains, V2nd

← 1 2 →