WO1997050182A1

WO1997050182A1 - M=4(2,10), d=2.5 runlength limited code for multi-level data

Info

Publication number: WO1997050182A1
Application number: PCT/US1997/011533
Authority: WO
Inventors: Steven W. Mclaughlin
Original assignee: Etom Technologies Corporation
Priority date: 1996-06-24
Filing date: 1997-06-24
Publication date: 1997-12-31

Abstract

A system for encoding digital data with an M-ary (d, k) code to provide multi-level coded data where M > 2 comprises an M-ary (d, k) encoder for accepting digital input data. The M-ary (d, k) coder encodes the digital input data to produce a plurality of code symbols, where each code symbol is at one of M levels and each pair of non-zero code symbols is separated by at least d but no more than k zeros. A waveform encoder (204) converts the code symbols into waveform signal amplitudes compatible with a multi-level channel. Each waveform signal amplitude is generated by modulo M addition of a current code symbol with a previous waveform signal amplitude. A specific M=4(2,10) code provides high density recording to a multi-level storage medium. The M=4(2,10) encoder is implemented using a three-state encoder and a modulo four waveform encoder.

Description

M=4 (2,10), D=2.5 Runlength Limited Code for Multi-Level Data

Background of the Invention

1. Field of the In vention

The present invention relates generally to multi-level coding techniques, and more specifically to a system and method for coding data using an M=4 (2,10) runlength limited code, such code being particularly useful for storing and/or transmitting multi-level data.

2. Related Art

Various techniques are currently in use for increasing the recording density on various digital recording mediums such as magnetic tapes and disks and in other similar media. One technique utilizes an approach known as run- length-limited coding. This technique requires that each " 1 " in a coded bit sequence must be separated by a specified number of "0's." This number of zeros must be at least a minimum quantity, d, to reduce intersymbol interference, and is limited to a maximum quantity k for self clocking purposes. Such codes are generally referred to as (d,k) run-length-limited (RLL) codes.

Because conventional recording techniques use saturation recording to store information, binary recording techniques are often used to mark the recording medium. As a result, conventional (d,k) RLL codes developed to date are developed and optimized to store binary data.

Significant advances in data storage materials have lead to the development of a storage medium that provides a linear response characteristic. One such material providing a linear response characteristic is an electron trapping material such as is disclosed in U.S. Patents No. 4,864,536, 5,007,037, and 5,142,493, all to Lindmayer.

Using a material which provides a linear response characteristic yields an advantage over saturation-type media in that it adds an analog dimension to the storage capacity of the medium. Because the response is linear, the linear- response storage materials provide the ability to encode information in two dimensions - amplitude and phase.

As a result, the storage medium is no longer confined to storing binary or even tri-level data. Instead, the concept of M-ary, or non-binary, data coding and storage is provided. The increased symbol set allowed by such encoding provides the opportunity to dramatically increase the data recording density and transfer rate of the storage device. For example, the potential storage capacity of a single 5'Λ inch disk can be extended to several gigabytes if that disk is implemented using electron trapping materials with M-ary (multi-level) data coding.

Summary of the Invention

The present invention is directed toward an M=4 (2,10) runlength-limited code for multi-level data storage and/or communications. Also disclosed herein is a system and method for generating multi-level data from a binary input data stream using an M-ary (d,k) code such as the M=4 (2,10) runlength limited code.

According to the invention input data bits are coded using an M-ary (d,k) encoder to generate code symbols. Specifically, input data bits x are encoded using the M-ary (d,k) encoder to generate code symbols y, where:

^X ~ \.^XQ1 * |» "^{• X}p -_] J for p input date bits, and y = Ov y_v ^••• y,-.) where p/q is the code rate R.

The code symbols y are multi-level symbols, each being at one of M levels. The code symbol stream provided meets the code specifications of no fewer than d and no greater than k zeros between each non-zero symbol. Thus, according to the M=4 (2,10) code disclosed herein, code symbols are each at one of four levels and there is a minimum of two and a maximum of ten zeros between each non-zero symbol.

The code symbols y are encoded to generate a series of waveform amplitudes z. The waveform amplitudes are generated by modulo M addition of the current code symbol y_; with the previous waveform amplitude z ,., The waveform amplitudes are used to modulate a write laser to store information onto an optical disk or to otherwise store or communicate the input data bits x in the form of multi-level information.

To recover the original data bits x from the medium, the information stored on the medium is read and the resultant signal amplitudes are decoded.

Two stages of decoding are provided. In the first stage, the waveform amplitudes are decoded to generate code symbols. In the second stage, the code symbols are decoded to recover the original data bits.

The system and method described herein for coding and decoding the data is described with respect to the M=4 (2,10) code disclosed herein. However, while other codes may not be obvious in light of the code disclosed herein, given a specific M-ary (d,k) code, after reading the below disclosure, it will become apparent to a person skilled in the relevant art how the disclosed system and method can be implemented to code and decode the data using such a specific M- ary (d,k) code. An advantage of the invention is that the recording density can be increased by coding the input data using the disclosed M=4 (2, 10) code. Because there are at least d zeros between every non-zero code symbol, there can be at least d+1 symbols stored for a given minimum feature size. Given a code of rate R, the density achievable is (d+l)R.

It should be noted that the coding techniques described herein are not limited to optical recording. Other recording systems capable of supporting multi-level data would benefit from the coding techniques described herein. Additionally, these coding techniques are also applicable to communications systems where the communications channel is capable of supporting multi-level data. In such an implementation, the waveform amplitudes could be used to modulate a signal carrier for transmission across the multi-level channel.

Further features and advantages of the present invention, as well as the structure and operation of various embodiments of the present invention, are described in detail below with reference to the accompanying drawings.

Brief Description of the Drawings

The present invention is described with reference to the accompanying drawings. In the drawings, like reference numbers indicate identical or functionally similar elements. Additionally, the left-most digit of a reference number identifies the drawing in which the reference number first appears.

FIG. 1 is a diagram illustrating a portion of an optical storage medium and features thereon.

FIG. 2 is a diagram illustrating a data storage system for storing a multi¬ level coded data. FIG. 3 is a diagram illustrating an encoder for encoding multi-level data using a multi-level (d,k) code.

FIG.4 is a flow diagram illustrating the operation of a multi-state encoder.

FIG. 5 is a diagram illustrating an example input data stream being coded using the encoder illustrated in FIG. 4.

FIG. 6 is a diagram illustrating a decoder for decoding multi-level (d,k) coded data.

FIG. 7 is a diagram illustrating a sliding block decoder.

FIG. 8 is a diagram illustrating encoder shut-down.

Detailed Description of the Embodiments

1. Introduction

The present invention is directed toward an M-ary (d,k) code for use in storage and/or transmission of multi-level data, and a system and method for generating the same. This discussion is provided in several sections. In Section 2, before discussing the invention in detail, a brief discussion of binary (d,k) codes is presented. In Section 3, a coding system for coding input data using an M-ary (d,k) code is described. In Section 4, some code design factors are described. In Section 5, a specific M=4 (2,10) code is described that is particularly useful for storage and/or transmission of multi-level data. Section 5 also provides a detailed description of the encoder used to code data using the disclosed M=4 (2,10) code. In Section 6 there is presented a discussion of a sliding block decoder generally useful for decoding M-ary (d,k) codes, as well as a specific decoder for decoding the M=4 (2,10) code described in Section 5. The present invention is generally described in terms of an embodiment where multi-level data are stored on and retrieved from an optical disk. In such an embodiment, the encoder and decoder described herein may be implemented for multi-level data storage in an optical disk system such as that disclosed in U.S. Patent No. 5,007,037, which is incoφorated herein by reference. However, after reading the below description, it will become apparent to a person skilled in the relevant art how the systems and methods of the invention can be implemented for alternative applications such as multi-level data communications and storage of multi-level data on media other than optical disks. In yet other alternative embodiments, the invention can be implemented to transmit and receive data across an M-ary communications channel. In this document, the term "channel" is sometimes used to refer to the optical disk. It should be understood that in the alternative embodiments the term channel can be used to describe alternative storage media and/or communications channels.

Additionally, after reading the below detailed description of the encoder and decoder of the present invention, it will become apparent to a person skilled in the art that these disclosed components can be implemented using hardware, software or a combination of both hardware and software.

2. Binary (d,k) Run-Length-Limited Coding

Using conventional binary storage techniques, data are written to a storage medium using binary l's and 0's. Using run-length limited coding, the data to be recorded are first encoded using a run-length-limited encoder. As stated above, with a (d,k) RLL code, there is a minimum and a maximum number of 0's that can occur between each pair of 1 's, as specified by the code parameters d and k. Thus, the (d,k) RLL encoder results in a 1 followed by at least d and at most k 0's before another 1 occurs. Such (d,k) RLL codes for binary applications are well known in the art. To write input data to the saturation storage medium, the input data are first encoded to create symbols. The encoder is designed such that the output symbols conform to the code specifications: each 1 is followed by a minimum of d and a maximum of k O's. These symbols are then written to the storage medium as a series of features. For example, for optical disks, a feature is the presence or absence of a bum mark. In a magnetic tape, the feature is a grouping of magnetic particles oriented in a particular manner.

FIG. 1 illustrates a portion of an optical storage medium 108 that stores binary data as features 102. Illustrated are shaded and unshaded features 102, indicating the absence or presence of a burn mark. Also illustrated in FIG. 1 is an example symbol stream 112 that is used to write the features 102 to medium 108. As discussed above, symbol stream 112 is the result of encoding input data using a (d,k) RLL code. Symbol stream 112 is written to medium 108 using an additional coding step as follows: the occurrence of a 1 indicates a change in the type of mark (i.e., absence or presence of a burn mark); the occurrence of a 0 indicates no change in mark type. This additional coding step is sometimes referred to as non-return-to-zero interleaved (NRZI) precoding.

Note that with a (d,k) RLL code where d=2, the minimum number of symbols represented by a single feature 102 is three. Thus, for a minimum feature size (e.g., for me smallest spot size on medium 108) three symbols can be represented. As a result, for a rate 1/2 code, where each input bit corresponds to two symbols, the minimum density of data written to medium 108 is 1.5 bits per feature. Thus, as a result of using the (d,k) RLL coding in the described scenario, the density of the recording system can be increased by 50%. 3. A Generic M-ary Runlength-Limited (d,k) Coder

A few advantages of (d,k) coding are described above with reference to binary data systems. It is important to note that similar gains in density can be realized for storage and communications systems using multi-level (versus binary) data. To optimize such gains, however, new codes and new coding techniques are required to take full advantage of the unique properties of the multi-level data. Thus, the inventors have developed a system and method for encoding data using M-ary (d,k) codes.

FIG. 2 is a high-level block diagram generally illustrating a multi-level data recording system 200. The recording system is comprised of an encoder 204, multi-level storage medium 208 and a decoder 212. As stated above, multi-level storage medium 208 can be replaced with a communications channel allowing the multi-level (d,k) code and coding scheme to be used with multi-level data communications. In such a communications embodiment, encoder 204 and decoder 212 can be provided on both ends of the communications channel to allow bi-directional coded communications.

According to the invention, input data bits x = (X_Q, X„ ..., x,,.,) are the actual data that a user wishes to be stored on and retrieved from medium 208. However, to take full advantage of the multi-level properties of medium 208 and to increase the storage density achieved, the invention provides for the encoding of input data x so that multi-level data is stored on medium 208. Such encoding is accomplished using encoder 204.

In one embodiment, encoder 204 is implemented as a two-stage encoder. FIG. 3 is a block diagram illustrating encoder 204 in this embodiment. Referring to FIG. 3, encoder 204 is comprised of a symbol encoder 304 and a waveform encoder 308, referred to herein as encoder 304 and encoder 308, respectively. Encoder 304 is a (d,k) RLL symbol encoder that accepts the input data bits x and converts them to a stream of code symbols y = (y₀, y„ ..., y_q.,). To take advantage of the multi-level characteristics of medium 208, encoder 304 generates code symbols y at M different levels, where M>2. A second feature of encoder 304 is that the stream of code symbols y meets the code specification that there are no fewer than d and no greater than k zeros between each non-zero code symbol. Another feature of encoder 304 is that there are R input bits x, for each code symbol y, generated. This feature is referred to as the code rate. Thus for a rate 1/N code (i.e., where R = 1/N), there are N code symbols y, generated for each input data bit x,.

Waveform encoder 308 accepts code symbols y and converts them to a series of waveforms z = (z,,, z„ ..., z_q.,), each of a given amplitude. Waveform encoder 308 generates output waveforms z, each at one of M different amplitudes. The waveform amplitudes are generated by modulo M addition of the current code symbol y, with the previous waveform amplitude z,.,. It is the waveforms z which are used to modulate a write laser for storing data onto medium 208 (or transmitted across the multi-amplitude channel).

Because there are at a minimum d zeros, between each non-zero code symbol, each waveform amplitude z generated represents, at a minimum, d+1 code symbols y. Also, because there are 1/R code symbols y generated for each input data bit x, each waveform amplitude z generated represents, at a minimum, (d+l)R data bits x. Thus, for a minimum feature size (e.g., the smallest spot that can be written to the storage medium or the shortest pulse that can be transmitted across the communications channel), the density achieved is D = (d+l)R.

Consider this density in terms of the specific M=4 (2, 10) code described below. The rate of this code is R=5/6 and d=2. For this code, the density is 2.5 input data bits x, per minimum feature size. In other words, 2.5 input data bits can be stored using a single minimum-size feature. 4. Code Design Factors

The coding system and method described above can be used to code input data using any of number of M-ary (d,k) codes. However, the design of a specific M-ary (d,k) code is not a trivial matter.

There are several factors that must be taken into consideration when designing M-ary (d,k) codes. The specific coding scheme used to implement a given code impacts the performance of the encoding and decoding systems. For example, the code should be designed such that encoders and decoders can be implemented in a straight-forward and cost-effective manner. Toward this end, the desirable code can be implemented using encoders that have a relatively small number of states while still meeting the code parameters (i.e., M, d and k). Additionally, the decoder required to decode the coded data should be implementable using a small sliding block window size and the decoder should have a relatively a small table size.

Further, the code design must result in an encoder and decoder that operate such that errors in the decoder side have a minimum effect. It would be undesirable for errors to propagate too far in the decoded data stream. In some less-than-desirable systems, a single decoding error can result in a very large, if not infinite, number of additional decoding errors.

Achievement of such design goals is not a trivial matter. Not every M-ary (d,k) code of a given set of parameter values will perform in a desirable manner. Provided in the next section of this document is a specific M=4 (2,10) runlength- limited code that meets the design goals outlined above. 5. M=4 (2,10) runlength-limited code

As stated above, code design is not a trivial matter as there are several coding factors that affect the performance of the system. The specific code implemented for a given set of parameters can impact the overall performance of the system. This section of the patent document describes a specific M-ary (d,k) code and the specific encoder used to implement this code. In particular, this section describes a specific M=4 (2,10) runlength-limited code having a rate R=5/6.

Table 1 is a state table illustrating an encoder 400 for encoding input data x to generate code symbols y for the M=4 (2,10) code (i.e. a specific version of encoder 304). Encoder 400 is a three-state, M=4 (2,10) encoder. For each input data bit set X_Q - x₄, an output code symbol set y₀ - y₅ is produced; each output code symbol y, is at one of four levels (0-3). The various states as well as the inputs and outputs of Encoder 400 M=4 (2,10) are illustrated using Table 1.

FIG. 4 is an operational flow diagram illustrating the operation of state machine 400. The operation of state machine 400 is now described with reference to Table 1 and FIG. 4. In a step 404, the operation starts in a given state at time t=0. In a step 408, an input data bit set x₀ - x₄ is received. In a step 412, Table 1 is used to determine the output code symbol set y₀ - y₅ and next state from the current state and the input data bit set x₀ - x₄ received in step 408. In a step

416, encoder 304 outputs code symbol set y₀ - y₅ determined in step 412. In a step 420, state machine 400 transitions to the next state determined in step 412. At this time, the operation continues at step 408 as indicated by flow line 426.

As is evident by the above description, an output code symbol set y₀ - y₅ of encoder 304 is a function of the input data bit set x₀ - x₄, and the current state

404 of encoder 304. For the M=4 (2,10) encoder of the present invention, Table 1 describes the output code symbol set y₀ - y₅ and next state of encoder 304 for each current state and input data bit set x₀ - x₄.

Table 1

STATE 0

INPUT OUTPUT NEXTSTATE

0 000000 1

1 000000 2

2 000001 0

3 000002 0

4 000003 0

5 000010 0

6 000020 0

7 000030 0

8 000010

9 000020

10 000030

11 000100

12 000200

13 000300

14 000100 2

15 000200 2

16 000300 2

17 001000 1

18 002000 1

19 003000 1

20 001000 2

21 002000 2

22 003000 2

23 001001 0

24 001002 0

25 001003 0

26 002001 0

27 002002 0

28 002003 0

29 003001 0

30 003002 0

31 003003 0 Table 1 (cont.)

STATE 1

INPUT OUTPUT NEXTSTATE

0 010000 1 1 020000 1

2 030000 1

3 010000 2

4 020000 2

5 030000 2

6 010001 0

7 010002 0

8 010003 0

9 020001 0

10 020002 0

11 020003 0

12 030001 0

13 030002 0

14 030003 0

15 010010 0

16 010020 0

17 010030 0

18 020010 0

19 020020 0

20 020030 0

21 030010 0

22 030020 0

23 030030 0

24 010010

25 010020

26 010030

27 020010

28 020020

29 020030

30 030010

31 030020 Table 1 (cont.)

STATE 2

INPUT OUTPUT NEXTSTATE

0 100000 1 I 200000 1

2 300000 1

3 100000 2

4 200000 2

5 300000 2

6 100001 0

7 100002 0

8 100003 0

9 200001 0

10 200002 0

11 000100 1

12 000200 1

13 000300 1

14 000100 2

15 000200 2

16 000300 2

17 001000 1

18 002000 1

19 003000 1

20 001000 2

21 002000 2

22 003000 2

23 200003 0

24 300001 0

25 300002 0

26 300003 0

27 200010

28 200020

29 200030

30 100020

31 300020 To further illustrate the operation of symbol encoder 304, consider an example input data stream x as illustrated in Table 2. In this example, assume the encoder 304 starts in state 0 and that the first input data bit set x₀ - x₄ is '10110'. Referring to the node 404 for state 0, the edge where x₀ - x₄ = '101 10' indicates that encoder 304 outputs symbol '003000' and transitions to state 2. This can also be determined by referring to the rows in Table 1 corresponding to a current state ofO.

FIG. 5 is a diagram further illustrating the example. FIG. 5 illustrates a current state 508 and a new state 512 for the example input data stream provided in Table 2. Referring to FIG. 5 and state machine 400, given the input data stream illustrated in Table 2, for each input data bit set Xo - x₄, encoder 304 transitions from a current state 508 to a new state 512 and produces an output symbol set y₀ - y₅. FIG. 5 illustrates the example for 15 data bits x of the input data stream while Table 2 is an example for 15 data bits x.

Table 2

X 10110 11010 10000 y 003000 300003 000300 z 003333 222221 111000

As described above with reference to FIG. 3, code symbols y are further coded by waveform encoder 308 to generate a sequence of amplitudes z used to modulate the write laser. According to one embodiment, waveform encoder 308 is a modulo four encoder that, for a given time, determines the waveform amplitude Z_j by

^z, ⁼ (Vi ⁺ y) ^{m od M} Note that z is a transformed version of y, where the difference (mod M) between waveform amplitudes z, and z,., is the coded symbol y,. Thus, in this embodiment, each new code symbol y, is modulo four added to the previous waveform amplitude z,_, to result in the current waveform amplitude z,. In following the example described above and illustrated in FIG. 5 and Table 2, the code symbols y are encoded by waveform encoder 308 to waveform amplitudes z, as illustrated in Table 2.

To briefly summarize the encoding process, input binary data bits x are first encoded using an M=4 (2,10) symbol encoder to produce code symbols y at M=4 levels. Code symbols y are then encoded by waveform encoder 308 to produce waveform amplitudes z. According to the current code, M=4 amplitudes (illustrated in the above examples as 0 - 2) are possible. These amplitudes are written to the media by the write laser as illustrated in FIG. 3.

6. Decoder

In order to recover the original data bits x from the amplitudes z stored on the media (or transmitted across the communications channel) a decoder is implemented. In one embodiment, the decoder uses a state independent lookup table to decode amplitude levels z read from the disk. In this embodiment, the decoder is a sliding block decoder, where a sliding window is used to decode amplitudes read from the disk.

FIG. 6 is a block diagram illustrating the decoder. As illustrated in FIG. 6, decoder 212 is comprised of a waveform decoder 604 and a sliding block decoder 608. Waveform decoder 604 receives the signal amplitudes z' (multi¬ level) from the media and converts them to a sequence of digital code symbols y\ Sliding block decoder 608 performs a table lookup to convert output code symbols y' into output data bits x'. Note that in an error free environment, output code symbols y' correspond identically to input code symbols y and output data bits x' correspond identically to input data bits x.

Any of a number of different techniques can be implemented to read waveform amplitudes z off of the media to provide the signal amplitudes z' to waveform decoder 604. It should be noted that the actual read scheme implemented is not important to the invention as long as data are read accurately.

As stated above, the purpose of waveform decoder 604 is to decode signal amplitudes z' to recover the actual code symbols y'. Waveform decoder converts a sequence of amplitudes z' = (z'₀, z'„ ..., z'_N.,) where z\ e [0,A], for some real number A, to a sequence of code symbols y' = (y'₀, y¹,, ..., y'_N.,).

The operation of waveform decoder 604 is now described. For a given time i, the code symbol y'_{ is determined by

y', = (*', ^~ *',.,) mod M

According to this technique, each output symbol y' is determined as being the modulo M difference between the current amplitude waveform z', and the previous amplitude waveform z\_Λ. This decoding essentially undoes the coding performed by waveform encoder 308. Specifically, for M=4 (d,k) codes, such as the M=4 (2,10) code described above in Section 5, the decoding is implemented using a modulo four difference.

6.1 Sliding Block Decoder

The purpose of sliding block decoder 608 is to convert the sequence of code symbols y' into a sequence of data bits x' that coincide with input data bits x. In a preferred embodiment, the decoder is a state independent lookup table. The size of the lookup table is dependent on the specific code implemented. Therefore, the design of encoder 304 affects the size of the lookup table implemented.

Sliding block decoder 608 is illustrated in FIG. 7. Sliding block decoder comprises a sliding window 704 to decode the code symbols y' to arrive at output data bits x'. Whereas encoder 304 accepts one data bit set x₀ - x₄ and generates one code symbol set y₀ - y₅ therefrom, sliding block decoder 608 must look at multiple code symbols y' to decode one data bit set. Specifically, for the encoder described above with reference to Table 1, sliding block decoder 608 requires a block of twelve code symbols y- to uniquely decode one data bit set x₀' - x₄'.

The actual size of sliding window 704 is determined during code design. An optimally sized sliding window 704 is large enough such that the symbols y' within sliding window 704 unambiguously define the correct output bit set Xo' - x₄' without being so large that unneeded code symbols y' are included therein. In other words, the window size is chosen as the smallest window which guarantees unique decodability.

With the use of a sliding window 704 to decode the data, knowledge of state information is not required. In fact, the contents of sliding window 704 at any given time contain sufficient information such that state information can be determined therefrom. Thus, sliding block decoder 608 is computationally less complex than conventional decoders; more importantly, the sliding block decoder limits the propagation of errors.

Sliding window 704 actually represents the present and future. The code symbols y' actually being decoded to generate data bits x' represent the present.

Future symbols y' are those that occur after the present symbols. In FIG. 7, the present is represented by '003000', and the future by '300003^*. Note that sliding block decoders are well known for decoding binary data. One well known technique for implementing sliding block decoders with binary data is the Adler-Coppersmith-Hassner technique disclosed in U.S. Patent No. 4,413,251. Another, related technique is disclosed in U.S. Patent No. 4,882,583 to Dimitri et al. According to these techniques, the number of past symbols required in the window is fixed based on the code design. The number of future symbols should be maintained as small as possible. These goals apply to the M- ary sliding block decoder as well.

The lookup table contains a plurality of entries. In one embodiment, each entry contains a possible sequence of N code symbols y', where N is the size of sliding window 704. In alternative embodiments, each entry of the lookup table is addressed by (directly, indirectly or via a decoding scheme) one of the possible sequences of code symbols.

Based on the specific design of coder 304, there are a limited number of possible occurrences of N code symbols y'. The lookup table comprises a sufficient number of entries such that there is one entry for each of the possible occurrences of N code symbols. As stated above, N is chosen such that for each sequence of N code symbols y' an output bit set x' is unambiguously defined.

For the encoder 304 described above with reference to Table 1, the preferred lookup table has 311 entries and is illustrated in Table 3. For each entry of twelve code symbols y', there is an output bit set x'. Thus, to decode code symbols y', twelve consecutive code symbols y' are loaded into sliding window 704. The entry corresponding to those twelve code symbols y' is located in the lookup table and the corresponding data bit set x' is output. To determine the next output data bit set x', sliding window 704 is 'slid' one code symbol set y' into the future (i.e., in one embodiment, a next code symbol set y' is shifted into window 704 and the oldest shifted out) and the lookup process is repeated. This sliding process continues as long as code symbols y' are provided to sliding block decoder 608.

In one embodiment, the contents of window 704 are real-valued and, therefore, the table entry retrieved is the entry that is closest in squared Euclidean distance. Specifically, for a given window w = (w,,...,w₁₂), the distance d_j for each table entry ^ is computed as:

where, t,, is the i'th component of the j'th table entry. The window w is then decoded to the table entry with the minimum distance d_r

Other embodiments are contemplated where the contents of window 704 are used as an address or used to generate an address of an entry in a memory, where the contents of that entry contain the appropriate output data bit set x'.

The complexity of the decoding process can be reduced significantly by making hard decisions regarding read signal amplitudes. Specifically, in one embodiment, the read signal amplitudes z' are rounded-off or quantized to be one of the four permissible amplitude levels. Even though this results in a decrease in the performance of the decoder it can significantly reduce its complexity: that is, the table can be a true lookup table requiring no distance calculations. Table 3

Window Contents X' Window Contents X'

0 0 0 0 0 0 0 X 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 X 0 0 0 0 0 1 0 0 0 0

0 0 0 0 0 0 0 X 0 0 0 X 0 0 0 0 0 0 0 0 3 0 0 X 0 0 0 0 X 1 0 0 0 0

0 0 0 0 0 0 0 X 0 0 X 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 X 0 c 1 0 0 0 0

0 0 0 0 0 0 X 0 0 0 0 0 0 0 0 0 1 0 0 0 3 0 0 0 0 X 0 0 0 1 0 0 0 0

0 0 0 0 0 0 X 0 0 0 0 X 0 0 0 0 1 0 0 0 3 0 0 X 0 0 0 0 X 1 0 0 0 0

0 0 0 0 0 0 0 0 0 X 0 0 0 0 0 0 1 0 0 0 3 0 0 X 0 0 0 X 0 1 0 0 0 0

0 0 0 0 0 0 0 0 X 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 X 0 0 0 0 1 0 0 0 1

0 0 0 0 0 0 X 0 0 0 0 X 0 0 0 0 1 0 0 1 0 0 0 0 X 0 0 0 X 1 0 0 0 1

0 0 0 0 0 0 X 0 0 0 X 0 0 0 0 0 1 0 0 1 0 0 0 0 X 0 0 X 0 1 0 0 0 1

0 0 0 0 0 1 X X X X X X 0 0 0 1 0 0 0 2 0 0 0 0 X 0 0 0 0 1 0 0 1 0

0 0 0 0 0 2 X X X X X X 0 0 0 1 1 0 0 2 0 0 0 0 X 0 0 0 X 1 0 0 1 0

0 0 0 0 0 3 X X X X X X 0 0 1 0 0 0 0 2 0 0 0 0 X 0 0 X 0 1 0 0 1 0

0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 3 0 0 0 0 X 0 0 0 0 1 0 0 1 1

0 0 0 0 1 0 0 0 0 0 0 X 0 0 1 0 1 0 0 3 0 0 0 0 X 0 0 0 X 1 0 0 1 1

0 0 0 0 1 0 0 0 0 0 X 0 0 0 1 0 1 0 0 3 0 0 0 0 X 0 0 X 0 1 0 0 1 1

0 0 0 0 1 0 0 0 0 X 0 0 0 0 1 0 1 0 0 1 0 0 0 X 0 0 0 0 0 1 0 1 0 0

0 0 0 0 1 0 0 0 X 0 0 0 0 0 1 0 1 0 0 1 0 0 0 X 0 0 0 0 X 1 0 1 0 0

0 0 0 0 1 0 0 0 X 0 0 X 0 0 1 0 1 0 0 1 0 0 0 0 0 0 X 0 0 1 0 1 0 0

0 0 0 0 2 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 X 0 0 0 1 0 1 0 0

0 0 0 0 2 0 0 0 0 0 0 X 0 0 1 1 0 0 0 1 0 0 0 X 0 0 0 0 X 1 0 1 0 0

0 0 0 0 2 0 0 0 0 0 X 0 0 0 1 1 0 0 0 1 0 0 0 X 0 0 0 X 0 1 0 1 0 0

0 0 0 0 2 0 0 0 0 X 0 0 0 0 1 1 0 0 0 2 0 0 0 X 0 0 0 0 0 1 0 1 0 1

0 0 0 0 2 0 0 0 X 0 0 0 0 0 1 1 0 0 0 2 0 0 0 X 0 0 0 0 X 1 0 1 0 1

0 0 0 0 2 0 0 0 X 0 0 X 0 0 1 1 0 0 0 2 0 0 0 0 0 0 X 0 0 1 0 1 0 1

0 0 0 0 3 0 0 0 0 0 0 0 0 0 1 1 1 0 0 2 0 0 0 0 0 X 0 0 0 1 0 1 0 1

0 0 0 0 3 0 0 0 0 0 0 X 0 0 1 1 1 0 0 2 0 0 0 X 0 0 0 0 X 1 0 1 0 1

0 0 0 0 3 0 0 0 0 0 X 0 0 0 1 1 1 0 0 2 0 0 0 X 0 0 0 X 0 1 0 1 0 1

0 0 0 0 3 0 0 0 0 X 0 0 0 0 1 1 1 0 0 3 0 0 0 X 0 0 0 0 0 1 0 1 1 0

0 0 0 0 3 0 0 0 X 0 0 0 0 0 1 1 1 0 0 3 0 0 0 X 0 0 0 0 X 1 0 1 1 0

0 0 0 0 3 0 0 0 X 0 0 X 0 0 1 1 1 0 0 3 0 0 0 0 0 0 X 0 0 1 0 1 1 0

0 0 0 0 1 0 0 X 0 0 0 0 0 1 0 0 0 0 0 3 0 0 0 0 0 X 0 0 0 1 0 ι ι o

0 0 0 0 1 0 0 X 0 0 0 X 0 1 0 0 0 0 0 3 0 0 0 X 0 0 0 0 X 1 0 1 1 0

0 0 0 0 1 0 0 X 0 0 X 0 0 1 0 0 0 0 0 3 0 0 0 X 0 0 0 X 0 1 0 1 1 0

0 0 0 0 2 0 0 X 0 0 0 0 0 1 0 0 1 0 0 1 0 0 1 X X X X X X 1 0 1 1 1

0 0 0 0 2 0 0 X 0 0 0 X 0 1 0 0 1 0 0 1 0 0 2 X X X X X X 1 1 0 0 0

0 0 0 0 2 0 0 X 0 0 X 0 0 1 0 0 1 0 0 1 0 0 3 X X X X X X 1 1 0 0 1

0 0 0 0 3 0 0 X 0 0 0 0 0 1 0 1 0 0 0 2 0 0 1 X X X X X X 1 1 0 1 0

0 0 0 0 3 0 0 X 0 0 0 X 0 1 0 1 0 0 0 2 0 0 2 X X X X X X 1 1 0 1 1

0 0 0 0 3 0 0 X 0 0 X 0 0 1 0 1 0 0 0 2 0 0 3 X X X X X X 1 1 1 0 0

0 0 0 1 0 0 0 X 0 0 0 0 0 1 0 1 1 0 0 3 0 0 1 X X X X X X 1 1 1 0 1

0 0 0 1 0 0 0 X 0 0 0 X 0 1 0 1 1 0 0 3 0 0 2 X X X X X X 1 1 1 1 0

0 0 0 1 0 0 0 X 0 0 X 0 0 1 0 1 1 0 0 3 0 0 3 X X X X X X 1 1 1 1 1

0 0 0 2 0 0 0 X 0 0 0 0 0 1 1 0 0 0 1 0 0 0 0 0 X 0 0 0 0 0 0 0 0 0

0 0 0 2 0 0 0 X 0 0 0 X 0 1 1 0 0 0 1 0 0 0 0 0 X 0 0 0 X 0 0 0 0 0

0 0 0 2 0 0 0 X 0 0 X 0 0 1 1 0 0 0 1 0 0 0 0 0 X 0 0 X 0 0 0 0 0 0

0 0 0 3 0 0 0 X 0 0 0 0 0 1 1 0 1 0 2 0 0 0 0 0 X 0 0 0 0 0 0 0 0 1

0 0 0 3 0 0 0 X 0 0 0 X 0 1 1 0 1 0 2 0 0 0 0 0 X 0 0 0 X 0 0 0 0 1

0 0 0 3 0 0 0 X 0 0 X 0 0 1 1 0 1 0 2 0 0 0 0 0 X 0 0 X 0 0 0 0 0 1

0 0 0 1 0 0 X 0 0 0 0 0 0 1 1 1 0 0 3 0 0 0 0 0 X 0 0 0 0 0 0 0 1 0

0 0 0 1 0 0 X 0 0 0 0 X 0 1 1 1 0 0 3 0 0 0 0 0 X 0 0 0 X 0 0 0 1 0

0 0 0 1 0 0 0 0 0 X 0 0 0 1 1 1 0 0 3 0 0 0 0 0 X 0 0 X 0 0 0 0 1 0

0 0 0 1 0 0 0 0 X 0 0 0 0 1 1 1 0 0 1 0 0 0 0 X 0 0 0 0 0 0 0 0 1 1

0 0 0 1 0 0 X 0 0 0 0 X 0 1 1 1 0 0 1 0 0 0 0 X 0 0 0 0 X 0 0 0 1 1

0 0 0 1 0 0 X 0 0 0 X 0 0 1 1 1 0 0 1 0 0 0 0 0 0 0 X 0 0 0 0 O i l

0 0 0 2 0 0 X 0 0 0 0 0 0 1 1 1 1 0 1 0 0 0 0 0 0 X 0 0 0 0 0 O i l

0 0 0 2 0 0 X 0 0 0 0 X 0 1 1 1 1 0 1 0 0 0 0 X 0 0 0 0 X 0 0 O i l

0 0 0 2 0 0 0 0 0 X 0 0 0 1 1 1 1 0 1 0 0 0 0 X 0 0 0 X 0 0 0 O i l

0 0 0 2 0 0 0 0 X 0 0 0 0 1 1 1 1 0 2 0 0 0 0 X 0 0 0 0 0 0 0 1 0 0

0 0 0 2 0 0 X 0 0 0 0 X 0 1 1 1 1 0 2 0 0 0 0 X 0 0 0 0 X 0 0 1 0 0

0 0 0 2 0 0 X 0 0 0 X 0 0 1 1 1 1 0 2 0 0 0 0 0 0 0 X 0 0 0 0 1 0 0 Table3 (cont.)

Window Contents X / Window Contents X /

0 2 0 0 0 0 0 0 X 0 0 0 0 0 1 0 0 0 3 0 0 2 0 0 0 0 0 0 0 1 0 1 1 0

0 2 0 0 0 0 X 0 0 0 0 X 0 0 1 0 0 0 3 0 0 2 0 0 0 0 0 0 X 1 0 1 1 0

0 2 0 0 0 0 X 0 0 0 X 0 0 0 1 0 0 0 3 0 0 2 0 0 0 0 0 X 0 1 0 1 1 0

0 3 0 0 0 0 X 0 0 0 0 0 0 0 1 0 1 0 3 0 0 2 0 0 0 0 X 0 0 1 0 1 1 0

0 3 0 0 0 0 X 0 0 0 0 X 0 0 1 0 1 0 3 0 0 2 0 0 0 X 0 0 0 1 0 1 1 0

0 3 0 0 0 0 0 0 0 X 0 0 0 0 1 0 1 0 3 0 0 2 0 0 0 X 0 0 X 1 0 1 1 0

0 3 0 0 0 0 0 0 X 0 0 0 0 0 1 0 1 0 3 0 0 3 0 0 0 0 0 0 0 1 0 1 1 1

0 3 0 0 0 0 X 0 0 0 0 X 0 0 1 0 1 0 3 0 0 3 0 0 0 0 0 0 X 1 0 1 1 1

0 3 0 0 0 0 X 0 0 0 X 0 0 0 1 0 1 0 3 0 0 3 0 0 0 0 0 X 0 1 0 1 1 1

0 1 0 0 0 1 X X X X X X 0 0 1 1 0 0 3 0 0 3 0 0 0 0 X 0 0 1 0 1 1 1

0 1 0 0 0 2 X X X X X X 0 0 1 1 1 0 3 0 0 3 0 0 0 X 0 0 0 1 0 1 1 1

0 1 0 0 0 3 X X X X X X 0 1 0 0 0 0 3 0 0 3 0 0 0 X 0 0 X 1 0 1 1 1

0 2 0 0 0 1 X X X X X X 0 1 0 0 1 0 1 0 0 1 0 0 X 0 0 0 0 1 1 0 0 0

0 2 0 0 0 2 X X X X X X 0 1 0 1 0 0 1 0 0 1 0 0 X 0 0 0 X 1 1 0 0 0

0 2 0 0 0 3 X X X X X X 0 1 0 1 1 0 1 0 0 1 0 0 X 0 0 X 0 1 1 0 0 0

0 3 0 0 0 1 X X X X X X 0 1 1 0 0 0 1 0 0 2 0 0 X 0 0 0 0 1 1 0 0 1

0 3 0 0 0 2 X X X X X X 0 1 1 0 1 0 1 0 0 2 0 0 X 0 0 0 X 1 1 0 0 1

0 3 0 0 0 3 X X X X X X 0 1 1 1 0 0 1 0 0 2 0 0 X 0 0 X 0 1 1 0 0 1

0 1 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 0 1 0 0 3 0 0 X 0 0 0 0 1 1 0 1 0

0 1 0 0 1 0 0 0 0 0 0 X 0 1 1 1 1 0 1 0 0 3 0 0 X 0 0 0 X 1 1 0 1 0

0 1 0 0 1 0 0 0 0 0 X 0 0 1 1 1 1 0 1 0 0 3 0 0 X 0 0 X 0 1 1 0 1 0

0 1 0 0 1 0 0 0 0 X 0 0 0 1 1 1 1 0 2 0 0 1 0 0 X 0 0 0 0 1 1 0 1 1

0 1 0 0 1 0 0 0 X 0 0 0 0 1 1 1 1 0 2 0 0 1 0 0 X 0 0 0 X 1 1 0 1 1

0 1 0 0 1 0 0 0 X 0 0 X 0 1 1 1 1 0 2 0 0 1 0 0 X 0 0 X 0 1 1 0 1 1

0 1 0 0 2 0 0 0 0 0 0 0 1 0 0 0 0 0 2 0 0 2 0 0 X 0 0 0 0 1 1 1 0 0

0 1 0 0 2 0 0 0 0 0 0 X 1 0 0 0 0 0 2 0 0 2 0 0 X 0 0 0 X 1 1 1 0 0

0 1 0 0 2 0 0 0 0 0 X 0 1 0 0 0 0 0 2 0 0 2 0 0 X 0 0 X 0 1 1 1 0 0

0 1 0 0 2 0 0 0 0 X 0 0 1 0 0 0 0 0 2 0 0 3 0 0 X 0 0 0 0 1 1 1 0 1

0 1 0 0 2 0 0 0 X 0 0 0 1 0 0 0 0 0 2 0 0 3 0 0 X 0 0 0 X 1 1 1 0 1

0 1 0 0 2 0 0 0 X 0 0 X 1 0 0 0 0 0 2 0 0 3 0 0 X 0 0 X 0 1 1 1 0 1

0 1 0 0 3 0 0 0 0 0 0 0 1 0 0 0 1 0 3 0 0 1 0 0 X 0 0 0 0 1 1 1 1 0

0 1 0 0 3 0 0 0 0 0 0 X 1 0 0 0 1 0 3 0 0 1 0 0 X 0 0 0 X 1 1 1 1 0

0 1 0 0 3 0 0 0 0 0 X 0 1 0 0 0 1 0 3 0 0 1 0 0 X 0 0 X 0 1 1 1 1 0

0 1 0 0 3 0 0 0 0 X 0 0 1 0 0 0 1 0 3 0 0 2 0 0 X 0 0 0 0 1 1 1 1 1

0 1 0 0 3 0 0 0 X 0 0 0 1 0 0 0 1 0 3 0 0 2 0 0 X 0 0 0 X 1 1 1 1 1

0 1 0 0 3 0 0 0 X 0 0 X 1 0 0 0 1 0 3 0 0 2 0 0 X 0 0 X 0 1 1 1 1 1

0 2 0 0 1 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 0 0 0 0 X 0 0 0 0 0 0 0 0 0

0 2 0 0 1 0 0 0 0 0 0 X 1 0 0 1 0 1 0 0 0 0 0 0 X 0 0 0 X 0 0 0 0 0

0 2 0 0 1 0 0 0 0 0 X 0 1 0 0 1 0 1 0 0 0 0 0 0 X 0 0 X 0 0 0 0 0 0

0 2 0 0 1 0 0 0 0 X 0 0 1 0 0 1 0 2 0 0 0 0 0 0 X 0 0 0 0 0 0 0 0 1

0 2 0 0 1 0 0 0 X 0 0 0 1 0 0 1 0 2 0 0 0 0 0 0 X 0 0 0 X 0 0 0 0 1

0 2 0 0 1 0 0 0 X 0 0 X 1 0 0 1 0 2 0 0 0 0 0 0 X 0 0 X 0 0 0 0 0 1

0 2 0 0 2 0 0 0 0 0 0 0 1 0 0 1 1 3 0 0 0 0 0 0 X 0 0 0 0 0 0 0 1 0

0 2 0 0 2 0 0 0 0 0 0 X 1 0 0 1 1 3 0 0 0 0 0 0 X 0 0 0 X 0 0 0 1 0

0 2 0 0 2 0 0 0 0 0 X 0 1 0 0 1 1 3 0 0 0 0 0 0 X 0 0 X 0 0 0 0 1 0

0 2 0 0 2 0 0 0 0 X 0 0 1 0 0 1 1 1 0 0 0 0 0 X 0 0 0 0 0 0 0 0 1 1

0 2 0 0 2 0 0 0 X 0 0 0 1 0 0 1 1 1 0 0 0 0 0 X 0 0 0 0 X 0 0 0 1 1

0 2 0 0 2 0 0 0 X 0 0 X 1 0 0 1 1 1 0 0 0 0 0 0 0 0 X 0 0 0 0 0 1 1

0 2 0 0 3 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 0 X 0 0 0 0 0 0 1 1

0 2 0 0 3 0 0 0 0 0 0 X 1 0 1 0 0 1 0 0 0 0 0 X 0 0 0 0 X 0 0 0 1 1

0 2 0 0 3 0 0 0 0 0 X 0 1 0 1 0 0 1 0 0 0 0 0 X 0 0 0 X 0 0 0 0 1 1

0 2 0 0 3 0 0 0 0 X 0 0 1 0 1 0 0 2 0 0 0 0 0 X 0 0 0 0 0 0 0 1 0 0

0 2 0 0 3 0 0 0 X 0 0 0 1 0 1 0 0 2 0 0 0 0 0 X 0 0 0 0 X 0 0 1 0 0

0 2 0 0 3 0 0 0 X 0 0 X 1 0 1 0 0 2 0 0 0 0 0 0 0 0 X 0 0 0 0 1 0 0

0 3 0 0 1 0 0 0 0 0 0 0 1 0 1 0 1 2 0 0 0 0 0 0 0 X 0 0 0 0 0 1 0 0

0 3 0 0 1 0 0 0 0 0 0 X 1 0 1 0 1 2 0 0 0 0 0 X 0 0 0 0 X 0 0 1 0 0

0 3 0 0 1 0 0 0 0 0 X 0 1 0 1 0 1 2 0 0 0 0 0 X 0 0 0 X 0 0 0 1 0 0

0 3 0 0 1 0 0 0 0 X 0 0 1 0 1 0 1 3 0 0 0 0 0 X 0 0 0 0 0 0 0 1 0 1

0 3 0 0 1 0 0 0 X 0 0 0 1 0 1 0 1 3 0 0 0 0 0 X 0 0 0 0 X 0 0 1 0 1

0 3 0 0 1 0 0 0 X 0 0 X 1 0 1 0 1 3 0 0 0 0 0 0 0 0 X 0 0 0 0 1 0 1 Table 3 (cont.)

Window Contents X / Window Contents X'

3 0 0 0 0 0 0 0 X 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 X 0 0 0 X 1 0 0 0 1

3 0 0 0 0 0 X 0 0 0 0 X 0 0 1 0 1 0 0 1 0 0 0 0 X 0 0 X 0 1 0 0 0 1

3 0 0 0 0 0 X 0 0 0 X 0 0 0 1 0 1 0 0 2 0 0 0 0 X 0 0 0 0 1 0 0 1 0

1 0 0 0 0 1 X X X X X X 0 0 1 1 0 0 0 2 0 0 0 0 X 0 0 0 X 1 0 0 1 0

1 0 0 0 0 2 X X X X X X 0 0 1 1 1 0 0 2 0 0 0 0 X 0 0 X 0 1 0 0 1 0

1 0 0 0 0 3 X X X X X X 0 1 0 0 0 0 0 3 0 0 0 0 X 0 0 0 0 1 0 0 1 1

2 0 0 0 0 1 X X X X X X 0 1 0 0 1 0 0 3 0 0 0 0 X 0 0 0 X 1 0 0 1 1

2 0 0 0 0 2 X X X X X X 0 1 0 1 0 0 0 3 0 0 0 0 X 0 0 X 0 1 0 0 1 1

0 0 0 1 0 0 0 X 0 0 0 0 0 1 0 1 1 0 0 1 0 0 0 X 0 0 0 0 0 1 0 1 0 0

0 0 0 1 0 0 0 X 0 0 0 X 0 1 0 1 1 0 0 1 0 0 0 X 0 0 0 0 X 1 0 1 0 0

0 0 0 1 0 0 0 X 0 0 X 0 0 1 0 1 1 0 0 1 0 0 0 0 0 0 X 0 0 1 0 1 0 0

0 0 0 2 0 0 0 X 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 X 0 0 0 1 0 1 0 0

0 0 0 2 0 0 0 X 0 0 0 X 0 1 1 0 0 0 0 1 0 0 0 X 0 0 0 0 X 1 0 1 0 0

0 0 0 2 0 0 0 X 0 0 X 0 0 1 1 0 0 0 0 1 0 0 0 X 0 0 0 X 0 1 0 1 0 0

0 0 0 3 0 0 0 X 0 0 0 0 0 1 1 0 1 0 0 2 0 0 0 X 0 0 0 0 0 1 0 1 0 1

0 0 0 3 0 0 0 X 0 0 0 X 0 1 1 0 1 0 0 2 0 0 0 X 0 0 0 0 X 1 0 1 0 1

0 0 0 3 0 0 0 X 0 0 X 0 0 1 1 0 1 0 0 2 0 0 0 0 0 0 X 0 0 1 0 1 0 1

0 0 0 1 0 0 X 0 0 0 0 0 0 1 1 1 0 0 0 2 0 0 0 0 0 X 0 0 0 1 0 1 0 1

0 0 0 1 0 0 X 0 0 0 0 X 0 1 1 1 0 0 0 2 0 0 0 X 0 0 0 0 X 1 0 1 0 1

0 0 0 1 0 0 0 0 0 X 0 0 0 1 1 1 0 0 0 2 0 0 0 X 0 0 0 X 0 1 0 1 0 1

0 0 0 1 0 0 0 0 X 0 0 0 0 1 1 1 0 0 0 3 0 0 0 X 0 0 0 0 0 1 0 1 1 0

0 0 0 1 0 0 X 0 0 0 0 X 0 1 1 1 0 0 0 3 0 0 0 X 0 0 0 0 X 1 0 1 1 0

0 0 0 1 0 0 X 0 0 0 X 0 0 1 1 1 0 0 0 3 0 0 0 0 0 0 X 0 0 1 0 1 1 0

0 0 0 2 0 0 X 0 0 0 0 0 0 1 1 1 1 0 0 3 0 0 0 0 0 X 0 0 0 1 0 1 1 0

0 0 0 2 0 0 X 0 0 0 0 X 0 1 1 1 1 0 0 3 0 0 0 X 0 0 0 0 X 1 0 1 1 0

0 0 0 2 0 0 0 0 0 X 0 0 0 1 1 1 1 0 0 3 0 0 0 X 0 0 0 X 0 1 0 1 1 0

0 0 0 2 0 0 0 0 X 0 0 0 0 1 1 1 1 2 0 0 0 0 3 X X X X X X 1 0 1 1 1

0 0 0 2 0 0 X 0 0 0 0 X 0 1 1 1 1 3 0 0 0 0 1 X X X X X X 1 1 0 0 0

0 0 0 2 0 0 X 0 0 0 X 0 0 1 1 1 1 3 0 0 0 0 2 X X X X X X 1 1 0 0 1

0 0 0 3 0 0 X 0 0 0 0 0 1 0 0 0 0 3 0 0 0 0 3 X X X X X X 1 1 0 1 0

0 0 0 3 0 0 X 0 0 0 0 X 1 0 0 0 0 2 0 0 0 1 0 X X X X X X 1 1 0 1 1

0 0 0 3 0 0 0 0 0 X 0 0 1 0 0 0 0 2 0 0 0 2 0 X X X X X X 1 1 1 0 0

0 0 0 3 0 0 0 0 X 0 0 0 1 0 0 0 0 2 0 0 0 3 0 X X X X X X 1 1 1 0 1

0 0 0 3 0 0 X 0 0 0 0 X 1 0 0 0 0 1 0 0 0 2 0 X X X X X X 1 1 1 1 0

0 0 0 3 0 0 X 0 0 0 X 0 1 0 0 0 0 3 0 0 0 2 0 X X X X X X 1 1 1 1 1

0 0 1 0 0 0 0 X 0 0 0 0 1 0 0 0 1

7. Encoder Shut-down

It should be noted that at the end of a data stream, there is a period of time during which window 704 is not full. For example, referring to FIG. 7, suppose that the code symbols '000300' are the last in the data stream. Thus when decoder 212 attempts to decode code symbols '000300', there are no future code symbols available. What is needed is a way to "shut-down" encoder 204.

FIG. 8 is a diagram illustrating encoder shut-down. In a preferred embodiment, encoder 204 is shut-down by appending a block of p=5 "stuffed" bits to the stream of input data bits; in a preferred embodiment, the stuffed bits are all zeros. Because the end of the input data stream may not coincide with the end of a block of p=5 input data bits, the number of stuffed bits varies. When this happens, stuffed bits are also added to complete the incomplete block of input data bits, as shown in FIG. 8.

8. Conclusion

While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Claims

What is Claimed is:

1. A method for encoding a series of binary input data bits x into an M=4 run-length limited (2,10) code having a rate R=5/6, to produce a series of code symbols y , the method comprising the steps of: receiving at a three-state encoder an input data bit set X_Q - x₄ to be encoded into the M=4 run-length limited (2,10) code; and generating in said encoder a code symbol set y₀ - y₅ based on said input data bit set XQ - x₄ according to Table 1 , wherein said code symbol set y₀ - y_s is generated based on the input data bit set X_Q - x₄ and the current state of said three-state encoder when said data bit set x₀ - x₄ is received.

2. The method of claim 1 , further comprising the step of: modulating a signal with waveform signal amplitudes to transmit a series of features across the channel, each feature being at a level corresponding to one of said waveform signal amplitudes; and wherein said generating step comprises the steps of: encoding the binary input data bits into an M=4 (2,10) code having a rate R=5/6 to produce a series of code symbols, each code symbol being at one of M levels, and each pair of non-zero code symbols having a minimum of two and a maximum often zeroes therebetween, said encoding step comprising the step of generating a code symbol set y₀ - y₅ for each input data bit set x₀ - x₄ according to Table 1, wherein said code symbol set y₀ - y₅ is generated based on the input data bit set X_Q - x₄ and the current state of said three-state encoder when said data bit set x₀ - x₄ is received; and generating in a waveform encoder waveform signal amplitudes based on said code symbols, wherein each said waveform signal amplitude is generated by modulo four addition of a current code symbol with a previous waveform signal amplitude.

3. A method for converting binary input data bits into a series of waveform amplitudes, each amplitude being at one of M=4 levels, the method comprising the steps of: encoding the binary input data bits into an M=4 (2,10) code having a rate R=5/6 to produce a series of code symbols, each code symbol being at one of M levels, and each pair of non-zero code symbols having a minimum of two and a maximum of ten zeroes therebetween, said encoding step comprising the step of generating a code symbol set y₀ - y₅ for each input data bit set Xo - x₄ according to Table 1 , wherein said code symbol set y₀ - y₅ is generated based on the input data bit set X_Q - x₄ and the current state of said three-state encoder when said data bit set x₀ - x₄ is received; and generating in a waveform encoder waveform signal amplitudes based on said code symbols, wherein each said waveform signal amplitude is generated by modulo four addition of a current code symbol with a previous waveform signal amplitude.

4. The method of claim 3, further comprising the step of modulating a signal with said waveform signal amplitudes to generate a series of features, each feature being at a level corresponding to a waveform signal amplitude; and wherein said waveform signal amplitudes modulate a write laser and wherein said modulated write laser writes said features onto a storage medium.

5. The method of claim 3 , further comprising the step of modulating a signal with said waveform signal amplitudes to generate a series of features, each feature being at a level corresponding to a waveform signal amplitude; and wherein said waveform signal amplitudes modulate a transmitter and wherein said transmitter transmits said features over a communications channel.

6. The method of claim 3, further comprising the steps of: receiving said features to recover output waveform signal amplitudes; converting said output waveform signal amplitudes into output code symbols, wherein each output code symbol is at one of four levels; and decoding said output code symbols to obtain output data bits, wherein said output data bits correspond to the binary input data.

7. The method of claim 6, wherein said step of decoding comprises the steps of: identifying with a sliding window a sequence of code symbols that represents a given code symbol set; and in a table comprising a number of entries corresponding to a number of possible unique sequences of code symbols, each entry identified by one of said possible unique sequences of code symbols, and wherein each entry identifies an output data bit set that is a decoded data bit set for the code symbol set represented by the sequence of code symbols that identifies that entry, looking up with said identified sequence of code symbols the output data bit set for said given code symbol set.

8. The method of claim 7, wherein said lookup table provides an output bit set x' for each sequence of code symbols y' according to Table 3.

9. The method of claim 7, wherein said look-up step comprises the step of determining, using a squared euclidean distance, which table entry is identified by a sequence of code symbols.

10. A method for decoding data on a channel, wherein said data has been encoded using an M=4 (2,10) code, comprising the steps of: reading the data to recover output waveform signal amplitudes; converting said output waveform signal amplitudes into output code symbols, wherein each output code symbol is at one of four levels; and decoding said output code symbols to obtain output data bits, wherein said output data bits correspond to the encoded data.

11. The method of claim 10, wherein said decoding step comprises the steps of: identifying with a sliding window a sequence of code symbols that represents a given code symbol set; and in a table comprising a number of entries corresponding to a number of possible unique sequences of code symbols, each entry identified by one of said possible unique sequences of code symbols, and wherein each entry identifies an output data bit set that is a decoded data bit set for the code symbol set represented by the sequence of code symbols that identifies that entry, looking up with said identified sequence of code symbols the output data bit set for said given code symbol set.

12. The method of claim 1 1 , wherein said table provides an output bit set x' for each sequence of code symbols y' according to Table 3.

13. The method of claim 10, wherein said channel is a storage medium or a communications channel.

14. A system for encoding a series of binary input data bits x into an M=4 run-length limited (2,10) code having a rate R=5/6, to produce a series of code symbols y, the system comprising: means for receiving at a three-state encoder an input data bit set x₀ - x₄ to be encoded into the M=4 run-length limited (2,10) code; and means for generating in said encoder a code symbol set y₀ - y₅ based on said input data bit set X_Q - x₄ according to Table 1 , wherein said code symbol set y₀ - y₅ is generated based on the input data bit set Xo - x₄ and the current state of said three-state encoder when said data bit set x₀ - x₄ is received.

15. A system for converting binary input data bits into a series of waveform amplitudes, each amplitude being at one of M=4 levels, the system comprising: means for encoding the binary input data bits into an M=4 (2,10) code having a rate R=5/6 to produce a series of code symbols, each code symbol being at one of M levels, and each pair of non-zero code symbols having a minimum of two and a maximum of ten zeroes therebetween, said means for encoding comprising means for generating a code symbol set y₀ - y₅ for each input data bit set X_Q - x₄ according to Table 1 , wherein said code symbol set y₀ - y₅ is generated based on the input data bit set x₀ - x₄ and the current state of said three-state encoder when said data bit set x₀ - x₄ is received; and means for generating in a waveform encoder waveform signal amplitudes based on said code symbols, wherein each said waveform signal amplitude is generated by modulo four addition of a current code symbol with a previous waveform signal amplitude.

16. The system of claim 15, further comprising means for modulating a signal with said waveform signal amplitudes to generate a series of features, each feature being at a level corresponding to a waveform signal amplitude; and wherein said waveform signal amplitudes modulate a write laser and wherein said modulated write laser writes said features onto a storage medium.

17. The system of claim 15, further comprising means for modulating a signal with said waveform signal amplitudes to generate a series of features, each feature being at a level corresponding to a waveform signal amplitude; and wherein said waveform signal amplitudes modulate a transmitter and wherein said transmitter transmits said features over a communications channel.

18. The system of claim 15, further comprising: means for receiving said features to recover output waveform signal amplitudes; means for converting said output waveform signal amplitudes into output code symbols, wherein each output code symbol is at one of four levels; and means for decoding said output code symbols to obtain output data bits, wherein said output data bits correspond to the binary input data.

19. The system of claim 18, wherein said means for decoding comprises: means for identifying with a sliding window a sequence of code symbols that represents a given code symbol set; and means for, in a table comprising a number of entries corresponding to a number of possible unique sequences of code symbols, each entry identified by one of said possible unique sequences of code symbols, and wherein each entry identifies an output data bit set that is a decoded data bit set for the code symbol set represented by the sequence of code symbols that identifies that entry, looking up with said identified sequence of code symbols the output data bit set for said given code symbol set.

20. The system of claim 19, wherein said lookup table provides an output bit set x' for each sequence of code symbols y' according to Table 3.

21. The system of claim 19, wherein said means for looking up comprises means for determining, using a squared euclidean distance, which table entry is identified by a sequence of code symbols.

22. A system for decoding data on a channel, wherein said data has been encoded using an M=4 (2, 10) code, comprising: means for reading the data to recover output waveform signal amplitudes; means for converting said output waveform signal amplitudes into output code symbols, wherein each output code symbol is at one of four levels; and means for decoding said output code symbols to obtain output data bits, wherein said output data bits correspond to the encoded data.

23. The system of claim 22, wherein said means for decoding comprises: means for identifying with a sliding window a sequence of code symbols that represents a given code symbol set; and means for, in a table comprising a number of entries corresponding to a number of possible unique sequences of code symbols, each entry identified by one of said possible unique sequences of code symbols, and wherein each entry identifies an output data bit set that is a decoded data bit set for the code symbol set represented by the sequence of code symbols that identifies that entry, looking up with said identified sequence of code symbols the output data bit set for said given code symbol set.

24. The system of claim 23, wherein said table provides an output bit set x' for each sequence of code symbols y' according to Table 3.

25. The system of claim 22, wherein said channel is a storage medium or a communications channel.