Method and apparatus for generating a noiseless sliding block code for a (2,7) channel with rate 1/2
AssigneeInternational Business Machines Corporation
InventorsRoy L. Adler, Martin Hassner
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsRoy L. Adler, Martin Hassner
Estimating the term…
An algorithm and the hardware embodiment for producing a run length limited code useful in magnetic recording channels are described. The system described produces sequences which have a minimum of 2 zeros and a maximum of 7 zeros between adjacent 1's. The code is generated by a sequential scheme that maps 1 bit of unconstrained into 2 bits of constrained data. The encoder is a finite state machine whose internal state description requires 3 bits. It possesses the attractive feature of reset data blocks which reset it to a fixed state. The decoder requires a lookahead of three future channel symbols (6 bits) and its operation is channel state independent. The error propagation due to a random error is 3 bits. The hardware implementation is extremely simple and can operate at very high data speeds.
A method for encoding a series of unconstrained binary input symbols into a run length limited (2,7) code having a 1/2 rate which comprises consecutively entering one new input symbol (X) comprising 1 bit into a logical tree coding network and simultaneously entering three state bits (Y) which were produced by the encoder during the immediately preceding encoding operation into the same encoding network and producing two channel outputs bits (Z) obeying said (2,7) encoding rules and three next state bits (Y') for use in the next succeeding coding operation, said method further including mapping the single input bit X into said two channel bits (Z) and said three next state bits (Y') as a function of the input bit (X) and 3 state bits (Y) according to the following mapping table:
An encoder for producing a run length limited (RLL) code for use in a structurally constrained environment, said code having a minimum of 2 and a maximum of seven 0's between adjacent 1's and a coding rate 1/2, said encoder comprising means for receiving as an input vector for a given encoding operation, one new message bit (X) and a three bit state vector (Y) derived from the immediately preceding encoding operation, logic circuit means for producing a two bit constrained channel vector (Z), obeying said RLL coding rules and a three-bit next-state vector (Y') which becomes the state vector (Y) for use in the next encoding operation wherein the vectors Z and Y' are functions of all four input bits to the encoder logic circuit means, said logic circuit including means for performing a mapping function to map the two input vectors X and Y into the two output vectors Z and Y' according to the mapping function table:
An encoding/decoding system for producing a run length limited (RLL) code for use in a structurally constrained environment, said code having a minimum of 2 and a maximum of seven 0's between adjacent 1's and a coding rate 1/2, said encoder comprising means for receiving as an input vector for a given encoding operation, 1 new message bit (X) and a three bit state vector (Y) derived from the immediately preceding encoding operation, logic circuit means for producing a two bit constrained channel vector (Z) obeying said RLL coding rules and a three bit next-state vector (Y') which becomes the state vector (Y) for use in the next encoding operation and said logic circuit means producing the vectors Z and Y' as functions of all four input bits to the encoder logic circuit means,
Dependencies are inferred from the claim text.