Apparatus for encoding unconstrained data onto a (1,7) format with rate 2/3

Claim 3

A method for encoding as set forth in claim 1, including mapping two of the state vector (Y) bits into said three channel bits (Z) as a function of the two current input bits (X) and 1 bit z3, the least significant bit of the preceding channel symbol (Z).

Claim 4

A method for encoding as set forth in claim 2 wherein the mapping of the state vector (Y) and the input vector (X) into the output vector (Z) and the next state vector (Y') is performed according to the following mapping table. ______________________________________ ##STR2## ##STR3## ______________________________________ ##STR4## X = (X.sub.2 X.sub.1) = INPUT VECTOR Y = (Y.sub.3 Y.sub.2 Y.sub.1) = STATE VECTOR Y' = (Y.sub.3 'Y.sub.2 'Y.sub.1 ') = NEXTSTATE VECTOR = τ (X,Y) Z = (Z.sub.1 Z.sub.2 Z.sub.3) = OUTPUT VECTOR = ω (X,Y) wherein the decimal values in said table are representative of the binary values manipulated by said method and wherein in the multibit binary vectors X, Y, Y' and Z, bits x2, y3, y3', and z1 are the most significant bits.

Claim 5

A method for encoding as set forth in claim 3 including inserting a predetermined data input configuration into the input code stream to cause the state bits (Y) to assume a predetermined pattern whereby a predetermined channel symbol (Z) configuration is produced which is adapted for control use and for initializing the system.

Claim 6

A lookahead encoder for producing a run length limited (RLL) code for use in a structurally constrained environment, said code having a minimum of 1 and a maximum of seven 0's between adjacent 1's and a coding rate 2/3, said encoder comprising means for receiving as an input vector (X) for a given encoding operation, two new message bits and a three bit state vector (Y) derived from the immediately preceding encoding operation, logic circuit means for producing a three 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, said logic circuit means producing the channel vector Z as a direct function of the two current input bits and the immediately preceding two input bits to said logic circuit means and forming the next-state vector as a catenation of the two current input bits and the least significant bit (z3) of the current channel vector (Z).

Claim 7

A lookahead encoder for producing a run length limited (RLL) code for use in a structurally constrained environment, said code having a minimum of 1 and a maximum of seven 0's between adjacent 1's and a coding rate 2/3, said encoder comprising means for receiving as an input vector (X) for a given encoding operation, two new message bits and a three bit state vector (Y) derived from the immediately preceding encoding operation, logic circuit means for producing a three 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, said logic circuit means producing the channel vector Z as a direct function of the two current input bits and the immediately preceding two input bits to said logic circuit means and forming the next-state vector as a catenation of the two current input bits and the least significant bit (z3) of the current channel vector (Z).

Claim 8

An encoder as set forth in claim 5 wherein said logic circuit means comprises a maximum of three functional logic levels and comprises conventional inverters, AND, OR, and NAND circuits.

Claim 9

An encoder as set forth in claim 5 wherein said logic circuit means performs a mapping function to map the input vector X and the state vector Y into the output channel vector Z and the next-state vector Y' according to the mapping function table: ______________________________________ ##STR5## ##STR6## ______________________________________ ##STR7## X = (X.sub.2 X.sub.1) = INPUT VECTOR Y = (Y.sub.3 Y.sub.2 Y.sub.1) = STATE VECTOR Y' = (Y.sub.3 'Y.sub.2 'Y.sub.1 ') = NEXTSTATE VECTOR = τ (X,Y) Z = (Z.sub.1 Z.sub.2 Z.sub.3) = OUTPUT VECTOR = ω (X,Y) wherein the decimal values in said table represent the binary data gated into and produced by said logic circuit means and wherein, in the multibit binary vectors X, Y, Y' and Z, bits x2, y3, y3', and z1 are the most significant bits.

Claim 10

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 1 and a maximum of seven 0's between adjacent 1's and a coding rate 2/3, said system including a lookahead encoder comprising means for receiving as an input vector (X) for a given encoding operation, 2 new message bits and a three bit state vector (Y) derived from the immediately preceding encoding operation, logic circuit means for producing a three 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, said logic circuit means producing a channel vector Z as a direct function of the two current input bits and the immediately preceding two input bits to the encoder logic circuit means and producing the next-state vector as a catenation of the two current input bits and the least significant bit (z3) of the current channel vector (Z), said system including a decoder for receiving a three bit input vector (X) for a given decoding operation and a 6 bit state vector Y derived from the immediately preceding decoding operation, which comprises logic circuit means for producing a two bit unconstrained output vector (Z) and a 6 bit next-state vector Y' which becomes the state vector Y for use in the next decoding operation, said logic circuit means producing the output vector Z as a function of the state vector Y and the input vector (X) and producing the next-state vector Y' as a catenation of the input vector (X) and a portion of the state vector (Y).

Claim 11

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 1 and a maximum of seven 0's between adjacent 1's and a coding rate 2/3, said system including a lookahead encoder comprising means for receiving as an input vector (X) for a given encoding operation, 2 new message bits and a three bit state vector (Y) derived from the immediately preceding encoding operation, logic circuit means for producing a three 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, said logic circuit means producing a channel vector Z as a direct function of the two current input bits and the immediately preceding two input bits to the encoder logic circuit means and producing the next-state vector as a catenation of the two current input bits and the least significant bit (z3) of the current channel vector (Z), said system including a decoder for receiving a three bit input vector (X) for a given decoding operation and a 6 bit state vector Y derived from the immediately preceding decoding operation, which comprises logic circuit means for producing a two bit unconstrained output vector (Z) and a 6 bit next-state vector Y' which becomes the state vector Y for use in the next decoding operation, said logic circuit means producing the output vector Z as a function of the state vector Y and the input vector (X) and producing the next-state vector Y' as a catenation of the input vector (X) and a portion of the state vector (Y).

Claim 12

An encoding/decoding system as set forth in claim 8 wherein said encoder logic circuit means performs 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: ______________________________________ ##STR8## ##STR9## ______________________________________ ##STR10## X = (X.sub.2 X.sub.1) = INPUT VECTOR Y = (Y.sub.3 Y.sub.2 Y.sub.1) = STATE VECTOR Y' = (Y.sub.3 'Y.sub.2 'Y.sub.1 ') = NEXTSTATE VECTOR = τ (X,Y) Z = (Z.sub.1 Z.sub.2 Z.sub.3) = OUTPUT VECTOR = ω (X,Y) the decimal values in said table being representative of the data content in binary form gated into and generated by said encoder logic circuit means, and wherein in the multibit vectors Y, Y' and Z, bits y2, y2', and z1 are the most significant bits, and wherein the decoder logic circuit means performs a mapping function to map the input vector X and state vector Y into the output vector Z and the next-state vector Y' according to the two mapping function tables: ______________________________________ ##STR11## V 0 1 2 3 4 5 6 7 ______________________________________ 0 0 8 16 24 32 40 48 56 1 1 9 17 25 33 41 49 57 2 2 10 18 26 34 42 50 58 3 3 11 19 27 35 43 51 59 4 4 12 20 28 36 44 52 60 5 5 13 21 29 37 45 53 61 6 6 14 22 30 38 46 54 62 7 7 15 23 31 39 47 55 63 ______________________________________ ##STR12## Y X Z Y1 Y2 Y3 Y4 Y5 Y6 X1X2 X3 Z1 Z2 ______________________________________ d 1 0 0 0 0 dd d 0 0 d 0 0 0 0 0 dd d 0 1 d d d 1 0 0 dd d 1 1 d d 0 0 0 0 ##STR13## d 1 0 d d 0 0 1 0 00 d 1 0 d d d 1 0 1 dd d 1 0 d 0 0 0 0 1 dd d 0 1 d 1 0 0 0 1 dd d 0 0 d d 1 0 0 1 dd d 0 0 d d 1 0 1 0 ##STR14## d 0 0 d d 1 0 1 0 00 d 0 1 d d 1 0 0 0 dd d 0 1 ______________________________________ ##STR15## the decimal values in said tables being representative of the data content in binary form, gated into and generated by said encoder logic circuit means, and wherein in the multibit vectors X, Y, Y' and Z, bits