A method for coding a binary data string

Abstract: A method for coding a binary data string for a partial-response channel having a transfer function with a spectral null at zero frequency to provide a coding rate 8/10 and an output which is invariant to 180-degree phase shifts in the channel output signal. A finite-state machine is created having two pairs of states and a plurality of codewords each corresponding to a respective binary data byte. The binary data string is encoded by said machine into a string of binary codewords having a power spectrum value of zero for a frequency of zero. In response to each successive data byte in the binary data string, there is generated one of two complementary codewords from the one of that pair of the states designated by said machine as corresponding to the data byte for the then current state of the machine. The sequence of said one complementary codewords is so decoded as to provide the same data output for said codeword sequence and its complement, irrespective of which of said complementary codewords was generated. The next state of said machine is preselected according to the value of the data byte and current state, and the next state for one element of a pair is the complement of the next state for the other element of the same pair.

Description: Field of the Invention This invention relates to a method of coding input strings of binary data over partial-response channels using maximum-likelihood sequence detection (PRML). More particularly, it relates to a method employing an improved rate 8/10 matched spectral null trellis code for PRML channels which provides block decoding, phase reversal invariance, decreased encoder/decoder complexity, and elimination of quasi-catastrophic sequences, while maintaining high coding gain. Background of the Invention The most pertinent prior art of which applicants are aware is their copending application, EPA 0333321. A coding method for a constrained system using a rate 8/10 code with spectral null at f=0 is described therein. While the coding method therein described operates very satisfactorily to achieve the stated objectives, it is sensitive to phase shifts in channel output signal. As a result, an inversion of the signal polarity can cause error propagation at the output of the decoder. Also, the code on occasion generates quasi-catastrophic sequences. These sequences represent more than one distinct path through the canonical state diagrams that describe sequences with spectral null constraints. Quasi-catastrophic sequences degrade the worst case coding gain and result in decoding delays. GB 2099263-A describes a coding system in which each data word is assigned a set of codewords, each set comprising two or four words. Half the words in a set start with a binary "0", the others with a binary "1". The particular codeword that is selected from the set commences with the same bit as the last bit of the immediately preceding codeword. There is a need for a method employing a matched spectral null (MSN) trellis code that: (1) is indifferent to 180 -degree phase shifts in channel output signal (an important consideration in magnetic recording, where the state of the write driver and polarity of recording head leads may be unknown); (2) eliminates all quasi-catastrophic sequences; (3) eliminates the need for differential encoding/decoding circuits typically required for application of phase invariant codes; (4) decreases encoder/decoder complexity relative to the 8/10 code described in the above-cited application; and (5) achieves the foregoing without reduction in the coding gain. Disclosure of the Invention Accordingly, the invention provides a method for coding a binary data string for a partial-response channel having a transfer function with a spectral null at zero frequency to provide a code which is invariant to 180-degree phase shifts in the channel output signal and which may be decoded using a trellis decoder, said coding being performed using a finite-state machine having a plurality of pairs of states, with states in the same pair being termed complementary states, and a plurality of codewords each corresponding to a respective binary data byte, said method comprising the steps of: (a) in said finite-state machine, encoding the binary data string into a string of binary codewords having a power spectrum value of zero for a frequency of zero, by generating for each data byte in said binary data string a codeword designated by said machine as corresponding to said data byte for the then current state of the machine, wherein the codeword for a given binary data byte in a first state in a pair is the complement of the codeword for the same binary data byte in the other state in the pair, and, for a given binary data byte, the next state following a given state in a pair and the next state following the other state in the pair are complementary states; (b) and inputting said generated codewords into said partial response channel. Preferably decoding is performed by a block decoder requiring no look-ahead to decode, and the code does not employ any quasi-catastrophic sequences from a spectrul null canonical state diagram. Preferably the method further comprises the step of preselecting the next state of said machine according to the value of the data byte and the current state. Thus, according to the method, a binary data string is coded for a partial-response channel having a transfer function with a spectral null at zero frequency to provide a coding rate and an output which is invariant to 180-degree phase shifts in the channel output signal. A finite-state machine is created having a plurality of pairs of states and a plurality of codewords each corresponding to a respective binary data byte. The binary data string is encoded by said machine into a string of binary codewords having a power spectrum value of zero for a frequency of zero. In response to a data byte in the binary data string, one of two complementary codewords is generated from said binary codeword string. The said one complementary codeword is so decoded as to provide the same data byte output irrespective of which of said complementary codewords was generated. The next state of said machine is preselected according to the value of the data byte and current state, and the next state for one element of a pair is the complement of the next state for the other element of the same pair. Brief Description of the Drawings Fig. 1 is a block diagram of a recording system employing a trellis coding method according to the invention; Fig. 2 depicts a seven-state subdiagram of the canonical diagram for binary sequences with spectral null at f=0; Fig. 3 depicts the component of the second power of the diagram shown in Fig. 2; Fig. 4 depicts an encoder for use in implementing the method of the invention; Fig. 5 depicts a trellis structure for an MSN Viterbi detector; and Fig. 6 depicts a block decoder for use in implementing the method of the invention. Description of Preferred Embodiment With reference to the drawings, an improved method is described for constructing a high rate 8/10 MSN trellis code for a partial response channel, such as a dicode (1-D) partial-response channel. The code can also be adapted to a class 4 (1-D 2 ) partial-response channel by interleaving using the technique disclosed, for example, in the December 1988 issue of the IBM Technical Disclosure Bulletin at pp. 476 et seq. These are among the codes of greatest current interest in magnetic and optical data recording. As described in EPA 0333321, an MSN trellis code spectrum is designed to have nulls at frequencies where the channel transfer function has a null, thereby providing improved coding gains and reduced Viterbi decoder complexity. As illustrated in Fig. 1, input data, such as in the form of binary symbol strings, is transmitted from a bus 10 to a rate 8/10 finite-state-machine encoder 11. Encoder 11 produces a binary code symbol sequence that serves as input to a dicode (1-D) partial-response channel 12. This code has a power spectrum of zero for each frequency at which there is a zero in the transfer function of channel 12; i.e., the code sequences have spectral nulls that match those of the partial-response channel. A channel output sequence is generated by partial-response channel 12 and detected at the channel output by a Viterbi detector 13. This detector calculates the most probable code sequence from the channel output sequence. Detector 13 reduces computational and hardware requirements by tracking only the frequency spectral content of the channel output sequence, thereby producing a near maximum-likelihood estimate (or most probable code sequence) of the transmitted original data sequence supplied by the bus 10. A rate 10/8 decoder 14 then generates from the detected sequence the MSN code output data in a bus 15. Table 1 shows the structure of the finite-state-machine encoder 11. As illustrated, the encoder 11 has four states designated by decimal numbers (0-3), and divided into two pairs 0,3 and 1,2. Within each pair, a given data byte will produce one of two complementary codewords, dependent upon which of the pair of states is the current state of the encoder. Data words are denoted by decimal numbers (0-255). Codewords are grouped into lists with similar properties (as hereinafter described) and designated by capital letters, with the size of the set indicated in parentheses. For example, F(10) denotes a list of 10 codewords (124, 188, 220, 236, 241, 242, 244, 248, 316 and 451, in decimal) designated by F. The notation F denotes the list of codewords which are obtained from the words in set F by bitwise complementing. Finite-State-Machine Encoder Structure State Data Next Codeword 0 0 - 99 3 A(100) 0 100 - 142 2 B( 43) 0 143 - 255 2 C(113) 1 0 - 9 2 F( 10) 1 10 - 99 2 D( 90) 1 100 - 142 0 E( 43) 1 143 - 255 0 C (113) 2 0 - 9 1 F ( 10) 2 10 - 99 1 D ( 90) 2 100 - 142 3 E ( 43) 2 143 - 255 3 C(113) 3 0 - 99 0 A (100) 3 100 - 142 1 B ( 43) 3 143 - 255 1 C (113) The codeword lists are characterized in a manner best explained by reference to the finite state transition diagram which describes the MSN constraint, which in this case corresponds to a spectral null at f=0. Fig. 2 shows a 7-state subdiagram of the canonical diagram for binary sequences with spectral null at f=0. The states are labelled 1 through 7. The paths in the diagram generate all binary sequences with digital sum variation (DSV) bounded by 6. The DSV corresponds to the maximum variation in the running digital sum value achieved by any sequence a =a 1 ...a N generated by the diagram. The component of the second power of the diagram of Fig. 2, which contains states 2, 4 and 6, is shown in Fig. 3. The edges in Fig. 3 correspond to pairs of edges in Fig. 2 and are labelled by pairs of binary symbols. The lists of codewords used in the finite-state-machine encoder 11 are best described in terms of the diagram in Fig. 3. Fig. 3 is used to derive the Viterbi detector trellis structure illustrated in Fig. 5. All codewords are 10 bits in length and are generated by paths of length 5 in Fig. 3. List A: Consists of the 100 codewords generated by paths starting from state 2 and ending in state 6. List B: Consists of the 43 sequences generated by paths from state 2 to state 4 which also pass through state 6. List C: Consists of 113 of the 121 possible sequences generated by paths from state 2 to state 4 which do not pass through state 6. List D: Consists of the 90 codewords generated by paths which start and end at state 4 which also pass through state 2 but do not pass through state 6. List E: Consists of the 43 sequences generated by paths from state 4 to state 2 which also pass through state 6. List F: Consists of 10 of the 20 words which start and end at state 4 which also pass through both state 2 and state 6. Table 2 gives a full description of the codeword lists, with the 10-bit words expressed in decimal. Lists are ordered left-to-right, row-by-row from top-to-bottom. It will be noted that the rate 8/10 code described herein does not employ any of the quasi-catastrophic sequences of the canonical state diagram. Fig. 4 illustrates a read only memory (ROM) implementation of finite-state-machine encoder 11 for the rate 8/10 trellis code. The ROM contents are derived directly from the right-most two columns of the finite-state-machine encoder Table 1. Encoder 11, as illustrated, comprises registers 20,21 and a ROM 22. The 8-bit input data string is delayed one machine cycle by register 20 and then output to ROM 22. ROM 22 also receives a 2-bit input from register 21, which constitutes the current state of encoder 11. The output from ROM 22 is a 10-bit codeword, 2 bits of which are recirculated via register 21 for denoting the next state. Encoder 11 generates a binary code sequence that is input to the dicode partial-response channel 12. The output sequence generated by channel 12, affected by noise, is detected by Viterbi detector 13. Fig. 5 shows the reduced complexity trellis structure of Viterbi detector 13 for the rate 8/10 MSN trellis code. Detector 13 is similar to that described in the above-cited copending application. It calculates most probable code sequence from the output sequence of channel 12. Detector 13 reduces computational and hardware requirements by tracking only the frequency spectral content of the channel output sequence, thereby to produce a near maximum-likelihood estimate (or most probable code sequence) of the original data sequence supplied via bus 10. The trellis is derived from the diagram in Fig. 3, and represents the possible sequences at the output of dicode channel 12 when the channel inputs are generated by Fig. 3. The edges are labelled by u 1 u 2 /v 1 v 2 where u 1 u 2 are code symbols and v 1 v 2 are channel output symbols. The free Euclidean distance of the trellis, d 2 / free, is the minimum squared Euclidean distance between trellis-coded channel output sequences which start from the same state and remerge after a finite number of steps. It can be checked that d 2 / free =4, indicating a potential 3 dB gain over an uncoded dicode channel. The Viterbi algorithm for the trellis in Fig. 5 is derived according to conventional methods such as described in the March 1973 issue of IEEE Proceedings at pp. 268-278. The survivor metric update rules are given in detail in Table 3. Survivor path extensions are determined on the basis of the metric update computation in the usual manner (Add-Compare-Select). where M n (j) is the survivor metric for state j at time n, where j varies from 1 to 6; and 3 1 and 3 2 represent two consecutive output signals from the channel. According to an important feature of the invention, the rate 8/10 code is decoded with block decoder 14 that provides an output (see Table 4) which is the same for a codeword or its complement. Decoder 14 generates, from the detected sequence, the MSN code output data which is transmitted to bus 15. Decoder 14 requires no look-ahead to decode the current codeword. For the current 10-bit codeword y , decoder 14 determines an 8-bit word w according to Table 4. The maximum error propagation due to a single bit error at the decoder input is therefore one byte. Decoder 14 may, for sake of illustration, be of the type shown in Fig. 6 for implementing the block decoder algorithm just described. Decoder 14 comprises a register 30 which receives the 10-bit most probable code sequence codeword from detector 13. This codeword is transmitted to a 1024 X 8 bit read only memory (ROM) 31. Using look-up Table 4, ROM 31 decodes the 10-bit codeword into an 8-bit output. The 8-bit output of ROM 31 is transmitted to data bus 15. As a result of the structuring of the contents of ROM 31, the MSN code output data in bus 15 will be the same for a given codeword or its complement. The method according to the invention has been described with reference to an 8/10 coding rate. However, it will be understood that this method may be used with codes with other coding rates.

Claims: A method for coding a binary data string (10) for a partial-response channel (12) having a transfer function with a spectral null at zero frequency to provide a code which is invariant to 180-degree phase shifts in the channel output signal and which may be decoded using a trellis decoder, said coding being performed using a finite-state machine having a plurality of pairs of states, with states in the same pair being termed complementary states, and a plurality of codewords each corresponding to a respective binary data byte, said method comprising the steps of: a) in said finite-state machine, encoding the binary data string into a string of binary codewords having a power spectrum value of zero for a frequency of zero, by generating for each data byte in said binary data string a codeword designated by said machine as corresponding to said data byte for the then current state of the machine, wherein the codeword for a given binary data byte in a first state in a pair is the complement of the codeword for the same binary data byte in the other state in the pair, and, for a given binary data byte, the next state following a given state in a pair and the next state following the other state in the pair are complementary states; b) and inputting said generated codewords into said partial response channel. The method of claim 1, wherein the next state of said finite-state machine is selected according to the value of the data byte and the current state. The method of any preceding claim, wherein the code does not employ any quasi-catastrophic sequences from a spectral null canonical state diagram. The method of any preceding claim, wherein the channel is a dicode (1-D) channel, and the output code has an 8/10 coding rate. A method for coding a binary data string in accordance with any preceding claim, further comprising the step of decoding said generated codewords ,whereby said codewords may be decoded in such manner as to provide the same data byte output irrespective of which of said complementary codewords was generated. The method of claim 5, wherein a table lookup is used to decode said codewords. The method of claim 5 or 6, wherein the decoding is performed by a block decoder requiring no look-ahead to decode. The method of any preceding claim, wherein the encoding and decoding is repeated for successive codewords.

Inventors: KARABED RAZMIK, SIEGEL PAUL HOWARD, KARABED, RAZMIK, SIEGEL, PAUL HOWARD
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1990
Main classification: H03M5
IPC codes: H04L25, H03M7, G11B20, H03M13, H03M5