Title :
Simple Classes of Constrained Systems With Unconstrained Positions That Outperform the Maxentropic Bound
Author :
Immink, Kees A Schouhamer ; Cai, Kui
Author_Institution :
Turing Machines Inc., Rotterdam
fDate :
5/1/2009 12:00:00 AM
Abstract :
The Wijngaarden-Immink (WI) scheme is a combined modulation/ECC coding scheme, where arbitrary user data are translated into a constrained sequence in which predefined positions are reserved for error-correcting codes (ECC) parity. Besides offering the benefit of combined modulation/ECC coding, the WI scheme has two extra benefits. They are (a) error propagation is limited to the constrained symbols, since symbols on the unconstrained positions are not related, and (b) code hardware is limited to a lookup table of the coded part. We will describe classes of simple bit-stuffing schemes that require less redundancy than predicted by the bound based on the performance of maxentropic constrained systems presented by Campello and Poo.
Keywords :
channel capacity; channel coding; error correction codes; modulation coding; table lookup; ECC coding scheme; Wijngaarden-Immink scheme; arbitrary user data; channel capacity; combined modulation; constrained system; error-correcting codes; lookup table; unconstrained positions; Disk recording; Error correction codes; Hardware; Magnetic recording; Modulation coding; Parity check codes; Proposals; Redundancy; Table lookup; Turing machines; $(d, k)$ sequence; Channel capacity; constrained code; error-correcting code (ECC); magnetic recording; run-length limited (RLL) sequence;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2009.2016053