Bit Stuff Encoding for (0, G/I) Constraints

Author

Sankarasubramaniam, Yogesh ; McLaughlin, Steven W.

Author_Institution

Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA

fYear

2006

fDate

9-14 July 2006

Firstpage

1194

Lastpage

1198

Abstract

(0,G/I) constraints arise in magnetic recording systems that use partial-response equalization with maximum-likelihood sequence detection (PRML). In this paper, we present simple variable-rate and fixed-rate encoding algorithms for (0,G/I) constraints that come quite close to the constraint capacity. Both algorithms are based on the concept of bit stuffing. We first describe the variable-rate encoding algorithm, and discuss rate computations based on a Markov chain model. The average encoding rates for 1 les G les 15 and 14 les I les 10 are tabulated. It is seen that the variable-rate bit stuff algorithm generates greater than 99% efficiency (0,G/I) codes for a wide range of the values of G and I. Then we present a fixed-rate version of the variable-rate stuff algorithm, and tabulate required parameters for the design of fixed-rate (0,G/I) codes with rate close to 100/101 and 200/201

Keywords

Markov processes; encoding; equalisers; magnetic recording; maximum likelihood detection; Markov chain model; bit stuff encoding; constraint capacity; fixed-rate encoding algorithms; magnetic recording systems; maximum-likelihood sequence detection; partial-response equalization; variable-rate encoding algorithm; Algorithm design and analysis; Application specific integrated circuits; Binary sequences; Character generation; Detectors; Encoding; Magnetic recording; Maximum likelihood detection; Timing; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2006 IEEE International Symposium on

Conference_Location

Seattle, WA

Print_ISBN

1-4244-0505-X

Electronic_ISBN

1-4244-0504-1

Type

conf

DOI

10.1109/ISIT.2006.261994

Filename

4036154