US 5,682,155 AGrant
M=6(4,11) Runlength Limited Code for Multi-Level Data
Issue Date:1997-10-28
•12 Claims
•3 Drawing Sheets
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 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=6 (4,11) code provides high density recording to a multi-level storage medium. The M=6 (4,11) encoder is implemented using a six-state encoder and a modulo six waveform encoder.
Metadata
Assignee
- Optex Corporation
Inventor
- Steven W. McLaughlin
Application Information
Application Number:US 4402383
Filing Date:1995-05-12
Priority Date:1995-05-12
Art Unit:214
Classifications
IPC:
H03M 700
Field of Search:
34137536037156;57;59264;34041;4643
Patent Drawings (3 sheets)
Description
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to multi-level coding techniques, and more specifically to a system and method for coding data using an M=6 (4,11) 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. Pat. Nos. 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 51/4 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=6 (4,11) 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=6 (4,11) 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:
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=6 (4,11) code disclosed herein, code symbols are each at one of six levels and there is a minimum of four and a maximum of eleven 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.sub.i with the previous waveform amplitude z.sub.i-1. 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=6 (4,11) 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=6 (4,11) 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+1)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(s) 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.
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=6 (4,11) code is described that is particularly useful for storage and/or transmission of multi-level data. Section 5 also provides a derailed description of the encoder used to code data using the disclosed M=6 (4,11) 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=6 (4,11) code described in Section 4.
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. Pat. No. 5,007,037, which is incorporated 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 derailed 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 1'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 3'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 0'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 burn 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 the 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.sub.0, x.sub.1, . . . , x.sub.p-1) 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.sub.0, y.sub.1, . . . , y.sub.q-1). 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. Mother feature of encoder 304 is that there are R input bits x.sub.i for each code symbol y.sub.i 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.sub.i generated for each input data bit x.sub.i.
Waveform encoder 308 accepts code symbols y and converts them to a series of waveforms z=(z.sub.0, z.sub.1, . . . , z.sub.q-1), 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.sub.i with the previous waveform amplitude z.sub.i-1. 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+1)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+1)R.
Consider this density in terms of the specific M=6 (4,11) code described below. The rate of this code is R=2/3 and d=4. For this code, the density is 3.33 input data bits x.sub.i per minimum feature size. In other words, 3.33 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=6 (4,11) runlength-limited code that meets the design goals outlined above.
5. M=6 (4,11) 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=6 (4,11) runlength-limited code having a rate R=4/6.
Table 1 is a state table illustrating a state machine 400 for encoding input data x to generate code symbols y for the M=6 (4,11) code (i.e. a specific version of encoder 304). State machine 400 is a six-state, M=6 (4,11) encoder. For each input data bit set x.sub.i . . . x.sub.i+3, an output code symbol set y.sub.i . . . y.sub.i+5 is produced; each output code symbol y.sub.i is at one of six levels (0-5). The various states as well as the inputs and outputs of state machine 400 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.sub.i . . . x.sub.i+3 is received. In a step 412, Table 1 is used to determine the output code symbol set y.sub.i . . . y.sub.i+5 and next state from the current state and the input data bit set x.sub.i . . . x.sub.i+3 received in step 408. In a step 416, encoder 304 outputs code symbol set y.sub.i . . . y.sub.i+5 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.sub.i . . . y.sub.i+5 of encoder 304 is a function of the input data bit set x.sub.i . . . x.sub.i+3, and the current state 404 of encoder 304. For the M=6 (4,11) encoder of the present invention, Table 1 describes the output code symbol set y.sub.i . . . y.sub.1+5 and next state of encoder 304 for each current state and input data bit set x.sub.i . . . x.sub.i+3.
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 1 and that the first input data bit set x.sub.i . . . x.sub.i+3 is `1011`. Referring to Table 1 for state 1, the row where x.sub.i . . . x.sub.i+3 =`1011` indicates that encoder 304 outputs symbol `000200` and transitions to state 2.
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 x.sub.i . . . x.sub.i+3, encoder 304 transitions from a current state 508 to a new state 512 and produces an output symbol set y.sub.i . . . y.sub.i+5. FIG. 5 illustrates the example for 12 data bits x of the input data stream while Table 2 is an example for 12 data bits x.
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 six encoder that, for a given time, determines the waveform amplitude z.sub.i by
Note that z is a transformed version of y, where the difference (mod M) between waveform amplitudes z.sub.i and z.sub.i-1 is the coded symbol y.sub.i. Thus, in this embodiment, each new code symbol y.sub.i is modulo six added to the previous waveform amplitude z.sub.i-1 to result in the current waveform amplitude z.sub.i. 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 digital data bits x are first encoded using an M=6 (4,11) symbol encoder to produce code symbols y at M=6 levels. Code symbols y are then encoded by waveform encoder 308 to produce waveform amplitudes z. According to the current code, M=6 amplitudes (illustrated in the above examples as 0-5) 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'.sub.0, z'.sub.1, . . . , z'.sub.N-1) where z'.sub.i .di-elect cons.0,A!, for some real number A, to a sequence of code symbols y'=(y'.sub.0, y'.sub.1, . . . y'.sub.N-1).
The operation of waveform decoder 604 is now described. For a given time i, the code symbol y'.sub.i is determined by
According to this technique, each output symbol y' is determined as being the modulo M difference between the current amplitude waveform z'.sub.i and the previous amplitude waveform z'.sub.i-1. This decoding essentially undoes the coding performed by waveform encoder 308. Specifically, for M=6 (d,k) codes, such as the M=6 (4,11) code described above in Section 5, the decoding is implemented using a modulo six 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.sub.i . . . x.sub.i+3 and generates one code symbol set y.sub.i . . . y.sub.i+5 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.sub.i ' to uniquely decode one data bit set x.sub.i ' . . . x.sub.i+3 '.
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 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 `002000` and the future by `000100`.
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. Pat. No. 4,413,251. Another, related technique is disclosed in U.S. Pat. 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 616 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 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.sub.1, . . . , w.sub.12), the distance d.sub.j for each table entry t.sub.j is computed as: ##EQU1## where, t.sub.ji 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.sub.j.
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 six 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.
It should be noted that at the beginning and the end of a data stream, there is a period of time during which window 704 is not full.
7. 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=6 run-length limited (4,11) code having a rate R=2/3, to produce a series of code symbols y, the method comprising the steps of receiving at a six-state encoder an input data bit set x.sub.i . . . x.sub.i+3 to be encoded into the M=6 run-length limited (4,11) code, and generating in said encoder a code symbol set y.sub.i . . . y.sub.i+5 based on said input data bit set x.sub.i . . . x.sub.i+3 according to the following mapping table: INPUT OUTPUT NEXT STATE ______________________________________ STATE 0 0 000000 3 1 000000 4 2 000000 5 3 000002 0 4 000004 0 5 000005 0 6 000010 0 7 000020 0 8 000030 0 9 000040 0 10 000050 0 11 000010 1 12 000020 1 13 000030 1 14 000040 1 15 000050 1 STATE 1 0 000100 0 1 000200 0 2 000300 0 3 000400 0 4 000500 0 5 000100 1 6 000200 1 7 000300 1 8 000400 1 9 000500 1 10 000100 2 11 000200 2 12 000300 2 13 000400 2 14 000500 2 15 000003 0 STATE 2 0 001000 0 1 002000 0 2 003000 0 3 004000 0 4 005000 0 5 001000 1 6 002000 1 7 003000 1 8 004000 1 9 005000 1 10 001000 2 11 002000 2 12 003000 2 13 004000 2 14 005000 2 15 000001 0 STATE 3 0 010000 3 1 020000 3 2 030000 3 3 040000 3 4 050000 3 5 010000 4 6 020000 4 7 030000 4 8 040000 4 9 050000 4 10 010000 5 11 020000 5 12 030000 5 13 040000 5 14 050000 5 15 300003 0 STATE 4 0 100000 3 1 200000 3 2 300000 3 3 400000 3 4 500000 3 5 100000 4 6 200000 4 7 300000 4 8 400000 4 9 500000 4 10 100000 5 11 200000 5 12 300000 5 13 400000 5 14 500000 5 15 400004 0 STATE 5 0 200001 0 1 200002 0 2 200003 0 3 200004 0 4 200005 0 5 300001 0 6 300002 0 7 300004 0 8 300005 0 9 400001 0 10 400002 0 11 400003 0 12 400005 0 13 500002 0 14 500003 0 15 500004 0 ______________________________________ wherein said code symbol set y.sub.i . . . y.sub.i+5 is generated based on the input data bit set x.sub.i . . . x.sub.i+3, and the current state of said six-state encoder when said data bit set x.sub.i . . . x.sub.i+3 is received.
2. A method for encoding a series of binary input data bits x into an M-ary run-length limited (4,11) code having a rate R=2/3 to produce a series of code symbols y, each code symbol being at one of M levels, where M>2 and each pair of non-zero code symbols having a minimum of four and a maximum of eleven zeroes therebetween, the method comprising the steps of receiving at a six-state encoder an input data bit set x.sub.i . . . x.sub.i+3 to be encoded into the M-ary run-length limited (4,11) code, and generating in said encoder a code symbol set y.sub.i . . . y.sub.i+5 based on said input data bit set x.sub.i . . . x.sub.i+3 according to the following mapping table: INPUT OUTPUT NEXT STATE ______________________________________ STATE 0 0 000000 3 1 000000 4 2 000000 5 3 000002 0 4 000004 0 5 000005 0 6 000010 0 7 000020 0 8 000030 0 9 000040 0 10 000050 0 11 000010 1 12 000020 1 13 000030 1 14 000040 1 15 000050 1 STATE 1 0 000100 0 1 000200 0 2 000300 0 3 000400 0 4 000500 0 5 000100 1 6 000200 1 7 000300 1 8 000400 1 9 000500 1 10 000100 2 11 000200 2 12 000300 2 13 000400 2 14 000500 2 15 000003 0 STATE 2 0 001000 0 1 002000 0 2 003000 0 3 004000 0 4 005000 0 5 001000 1 6 002000 1 7 003000 1 8 004000 1 9 005000 1 10 001000 2 11 002000 2 12 003000 2 13 004000 2 14 005000 2 15 000001 0 STATE 3 0 010000 3 1 020000 3 2 030000 3 3 040000 3 4 050000 3 5 010000 4 6 020000 4 7 030000 4 8 040000 4 9 050000 4 10 010000 5 11 020000 5 12 030000 5 13 040000 5 14 050000 5 15 300003 0 STATE 4 0 100000 3 1 200000 3 2 300000 3 3 400000 3 4 500000 3 5 100000 4 6 200000 4 7 300000 4 8 400000 4 9 500000 4 10 100000 5 11 200000 4 12 300000 5 13 400000 5 14 500000 5 15 400004 0 STATE 5 0 200001 0 1 200002 0 2 200003 0 3 200004 0 4 200005 0 5 300001 0 6 300002 0 7 300004 0 8 300005 0 9 400001 0 10 400002 0 11 400003 0 12 400005 0 13 500002 0 14 500003 0 15 500004 0 ______________________________________ wherein said code symbol set y.sub.i . . . y.sub.i+5 is generated based on the input data bit set x.sub.i . . . x.sub.i+3, and the current state of said six-state encoder when said data bit set x.sub.i . . . x.sub.i+3 is received.
3. A method for converting binary input data bits into a series of waveform amplitudes each amplitude being at one of M=6 levels, the method comprising the steps of: encoding the binary input data bits into an M=6 (4,11) code having a rate R=2/3 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 four and a maximum of eleven zeroes therebetween, said encoding step comprising the step of generating a code symbol set y.sub.i . . . y.sub.i+5 for each input data bit set x.sub.i . . . x.sub.i+3 according to the following mapping table: INPUT OUTPUT NEXT STATE ______________________________________ STATE 0 0 000000 3 1 000000 4 2 000000 5 3 000002 0 4 000004 0 5 000005 0 6 000010 0 7 000020 0 8 000030 0 9 000040 0 10 000050 0 11 000010 1 12 000020 1 13 000030 1 14 000040 1 15 000050 1 STATE 1 0 000100 0 1 000200 0 2 000300 0 3 000400 0 4 000500 0 5 000100 1 6 000200 1 7 000300 1 8 000400 1 9 000500 1 10 000100 2 11 000200 2 12 000300 2 13 000400 2 14 000500 2 15 000003 0 STATE 2 0 001000 0 1 002000 0 2 003000 0 3 004000 0 4 005000 0 5 001000 1 6 002000 1 7 003000 1 8 004000 1 9 005000 1 10 001000 2 11 002000 2 12 003000 2 13 004000 2 14 005000 2 15 000001 0 STATE 3 0 010000 3 1 020000 3 2 030000 3 3 040000 3 4 050000 3 5 010000 4 6 020000 4 7 030000 4 8 040000 4 9 050000 4 10 010000 5 11 020000 5 12 030000 5 13 040000 5 14 050000 5 15 300003 0 STATE 4 0 100000 3 1 200000 3 2 300000 3 3 400000 3 4 500000 3 5 100000 4 6 200000 4 7 300000 4 8 400000 4 9 500000 4 10 100000 5 11 200000 5 12 300000 5 13 400000 5 14 500000 5 15 400004 0 STATE 5 0 200001 0 1 200002 0 2 200003 0 3 200004 0 4 200005 0 5 300001 0 6 300002 0 7 300004 0 8 300005 0 9 400001 0 10 400002 0 11 400003 0 12 400005 0 13 500002 0 14 500003 0 15 500004 0 ______________________________________ wherein said code symbol set y.sub.i . . . y.sub.i+5 is generated based on the input data bit set x.sub.i . . . x.sub.i+3, and the current state of said six-state encoder when said data bit set x.sub.i . . . x.sub.i+3 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 six addition of a current code symbol with a previous waveform signal amplitude.
4. In a data storage system having storage media capable of storing data at multiple levels, a method for converting binary input data bits into a series of waveform amplitudes each amplitude being at one of M=6 levels and storing the waveform amplitudes on the storage medium, the method comprising the steps of: encoding the binary input data bits into an M=6 (4,11) code having a rate R=2/3 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 four and a maximum of eleven zeroes therebetween, said encoding step comprising the step of generating a code symbol set y.sub.i . . . y.sub.i+5 for each input data bit set x.sub.i . . . x.sub.i+3 according to the following mapping table: INPUT OUTPUT NEXT STATE ______________________________________ STATE 0 0 000000 3 1 000000 4 2 000000 5 3 000002 0 4 000004 0 5 000005 0 6 000010 0 7 000020 0 8 000030 0 9 000040 0 10 000050 0 11 000010 1 12 000020 1 13 000030 1 14 000040 1 15 000050 1 STATE 1 0 000100 0 1 000200 0 2 000300 0 3 000400 0 4 000500 0 5 000100 1 6 000200 1 7 000300 1 8 060400 1 9 000500 1 10 000100 2 11 000200 2 12 000300 2 13 000400 2 14 000500 2 15 000003 0 STATE 2 0 001000 0 1 002000 0 2 003000 0 3 004000 0 4 005000 0 5 001000 1 6 002000 1 7 003000 1 8 004000 1 9 005000 1 10 001000 2 11 002000 2 12 003000 2 13 004000 2 14 005000 2 15 000001 0 STATE 3 0 010000 3 1 020000 3 2 030000 3 3 040000 3 4 050000 3 5 010000 4 6 020000 4 7 030000 4 8 040000 4 9 050000 4 10 010000 5 11 020000 5 12 030000 5 13 040000 5 14 050000 5 15 300003 0 STATE 4 0 100000 3 1 200000 3 2 300000 3 3 400000 3 4 500000 3 5 100000 4 6 200000 4 7 300000 4 8 400000 4 9 500000 4 10 100000 5 11 200000 5 12 300000 5 13 400000 5 14 500000 5 15 400004 0 STATE 5 0 200001 0 1 200002 0 2 200003 0 3 200004 0 4 200005 0 5 300001 0 6 300002 0 7 300004 0 8 300005 0 9 400001 0 10 400002 0 11 400003 0 12 400005 0 13 500002 0 14 500003 0 15 500004 0 ______________________________________ wherein said code symbol set y.sub.i . . . y.sub.i+5 is generated based on the input data bit set x.sub.i . . . x.sub.i+3, and the current state of said six-state encoder when said data bit set x.sub.i . . . x.sub.i+3 is received; generating in a waveform encoder waveform signal amplitudes based on said code symbols, wherein each said waveform signal amplitude is generated by modulo six addition of a current code symbol with a previous waveform signal amplitude; and modulating a write signal with said waveform signal amplitudes to write a series of features to the storage medium, each feature being at a level corresponding to a waveform signal amplitude.
5. The method according to claim 4, wherein said waveform signal amplitudes modulate a write laser and wherein said modulated write laser writes features onto the storage medium.
6. The method according to claim 4, further comprising the steps of: reading the storage medium 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 six levels; and decoding said output code symbols to obtain output data bits, wherein said output data bits correspond to the digital 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 for said given code symbol.
8. The method according to claim 7, wherein said lookup table provides an output bit set x' for each sequence of code symbols y' according to the following table: Sequence of Sequence of Sequence of Code Symbols x' Code Symbols x' Code Symbols x' ______________________________________ 000000010000 0000 000040000010 1001 000300000004 0010 000000020000 0000 000040000020 1001 000300000005 0010 000000030000 0000 000040000030 1001 000300000010 0010 000000040000 0000 000040000040 1001 000300000020 0010 000000050000 0000 000040000050 1001 000300000030 0010 000000300003 0000 000050000000 1010 000300000040 0010 000000100000 0001 000050000002 1010 000300000050 0010 000000200000 0001 000050000005 1010 000400000000 0011 000000300000 0001 000050000010 1010 000400000002 0011 000000400000 0001 000050000020 1010 000400000004 0011 000000500000 0001 000050000030 1010 000400000005 0011 000000400004 0001 000050000040 1010 000400000010 0011 000000200001 0010 000050000050 1010 000400000020 0011 000000200002 0010 000010000100 1011 000400000030 0011 000000200003 0010 000010000200 1011 000400000040 0011 000000200004 0010 000010000300 1011 000400000050 0011 000000200005 0010 000010000400 1011 000500000000 0100 000000300001 0010 000010000003 1011 000500000002 0100 000000300002 0010 000020000100 1100 000500000004 0100 000000300004 0010 000020000200 1100 000500000005 0100 000000300005 0010 000020000300 1100 000500000010 0100 000000400001 0010 000020000400 1100 000500000020 0100 000000400002 0010 000020000500 1100 000500000030 0100 000000400003 0010 000020000003 1100 000500000040 0100 000000400005 0010 000030000100 1101 000500000050 0100 000000500002 0010 000030000200 1101 000100000100 0101 000000500003 0010 000030000300 1101 000100000200 0101 000000500004 0010 000030000400 1101 000100000300 0101 000002xxxxxx 0011 000030000500 1101 000100000400 0101 000004xxxxxx 0100 000030000003 1101 000100000500 0101 000005xxxxxx 0101 000040000100 1110 000100000003 0101 000010000000 0110 000040000200 1110 000200000100 0110 000010000002 0110 000040000300 1110 000200000200 0110 000010000004 0110 000040000400 1110 000200000300 0110 000010000005 0110 000040000500 1110 000200000400 0110 000010000010 0110 000040000003 1110 000200000500 0110 000010000020 0110 000050000100 1111 000200000003 0110 000010000030 0110 000050000200 1111 000300000100 0111 000010000040 0110 000050000300 1111 000300000200 0111 000010000050 0110 000050000400 1111 000300000300 0111 000020000000 0111 000050000500 1111 000300000400 0111 000020000002 0111 000050000003 1111 000300000500 0111 000020000004 0111 000100000000 0000 000300000003 0111 000020000005 0111 000100000002 0000 000400000100 1000 000020000010 0111 000100000004 0000 000400000200 1000 000020000020 0111 000100000005 0000 000400000300 1000 000020000030 0111 000100000010 0000 000400000400 1000 000020000040 0111 000100000020 0000 000400000500 1000 000020000050 0111 000100000030 0000 000400000003 1000 000030000000 1000 000100000040 0000 000500000100 1001 000030000002 1000 000100000050 0000 000500000200 1001 000030000004 1000 000200000000 0001 000500000300 1001 000030000005 1000 000200000002 0001 000500000400 1001 000030000010 1000 000200000004 0001 000500000500 1001 000030000020 1000 000200000005 0001 000500000003 1001 000030000030 1000 000200000010 0001 000100001000 1010 000030000040 1000 000200000020 0001 000100002000 1010 000030000050 1000 000200000030 0001 000100003000 1010 000040000000 1001 000200000040 0001 000100004000 1010 000040000002 1001 000200000050 0001 000100005000 1010 000040000004 1001 000300000000 0010 000100000001 1010 000040000005 1001 000300000002 0010 000200001000 1011 000200002000 1011 005000000000 0100 004000004000 1101 000200003000 1011 005000000002 0100 004000005000 1101 000200004000 1011 005000000004 0100 004000000001 1101 000200005000 1011 005000000005 0100 005000001000 1110 000200000001 1011 005000000010 0100 005000002000 1110 000300001000 1100 005000000020 0100 005000003000 1110 000300002000 1100 005000000030 0100 005000004000 1110 000300003000 1100 005000000040 0100 005000005000 1110 000300004000 1100 005000000050 0100 005000000001 1110 000300005000 1100 001000000100 0101 000001xxxxxx 1111 000300000001 1100 001000000200 0101 010000010000 0000 000400001000 1101 001000000300 0101 010000020000 0000 000400002000 1101 001000000400 0101 010000030000 0000 000400003000 1101 001000000500 0101 010000040000 0000 000400004000 1101 001000000003 0101 010000050000 0000 000400005000 1101 002000000100 0110 010000300003 0000 000400000001 1101 002000000200 0110 020000010000 0001 000500001000 1110 002000000300 0110 020000020000 0001 000500002000 1110 002000000400 0110 020000030000 0001 000500003000 1110 002000000500 0110 020000040000 0001 000500004000 1110 002000000003 0110 020000050000 0001 000500005000 1110 003000000100 0111 020000300003 0001 000500000001 1110 003000000200 0111 030000010000 0010 000003xxxxxx 1111 003000000300 0111 030000020000 0010 001000000000 0000 003000000400 0111 030000030000 0010 001000000002 0000 003000000500 0111 036000040000 0010 001000000004 0000 003000000003 0111 030000050000 0010 001000000005 0000 004000000100 1000 030000300003 0010 001000000010 0000 004000000200 1000 040000010000 0011 001000000020 0000 004000000300 1000 040000020000 0011 001000000030 0000 004000000400 1000 040000030000 0011 001000000040 0000 004000000500 1000 040000040000 0011 001000000050 0000 004000000003 1000 040000050000 0011 002000000000 0001 005000000100 1001 040000300003 0011 002000000002 0001 005000000200 1001 050000010000 0100 002000000004 0001 005000000300 1001 050000020000 0100 002000000005 0001 005000000400 1001 050000030000 0100 002000000010 0001 005000000500 1001 050000040000 0100 002000000020 0001 005000000003 1001 050000050000 0100 002000000030 0001 001000001000 1010 050000300003 0100 002000000040 0001 001000002000 1010 010000100000 0101 002000000050 0010 001000003000 1010 010000200000 0101 003000000000 0010 001000004000 1010 010000300000 0101 003000000002 0010 001000005000 1010 010000400000 0101 003000000004 0010 001000000001 1010 010000500000 0101 003000000005 0010 002000001000 1011 010000400004 0101 003000000010 0010 002000002000 1011 020000100000 0110 003000000020 0010 002000003000 1011 020000200000 0110 003000000030 0010 002000004000 1011 020000300000 0110 003000000040 0010 002000005000 1011 020000400000 0110 003000000050 0010 002000000001 1011 020000500000 0110 004000000000 0011 003000001000 1100 020000400004 0110 004000000002 0011 003000002000 1100 030000100000 0111 004000000004 0011 003000003000 1100 030000200000 0111 004000000005 0011 003000004000 1100 030000300000 0111 004000000010 0011 003000005000 1100 030000400000 0111 004000000020 0011 003000000001 1100 030000500000 0111 004000000030 0011 004000001000 1101 030000400004 0111 004000000040 0011 004000002000 1101 040000100000 1000 004000000050 0011 004000003000 1101 040000200000 1000 040000300000 1000 040000200001 1101 500000020000 0100 040000400000 1000 040000200002 1101 500000030000 0100 040000500000 1000 040000200003 1101 500000040000 0100 040000400004 1000 040000200004 1101 500000050000 0100 050000100000 1001 040000200005 1101 500000300003 0100 050000200000 1001 040000300001 1101 100000100000 0101 050000300000 1001 040000300002 1101 100000200000 0101 050000400000 1001 040000300004 1101 100000300000 0101 050000500000 1001 040000300005 1101 100000400000 0101 050000400004 1001 040000400001 1101 100000500000 0101 010000200001 1010 040000400002 1101 100000400004 0101 010000200002 1010 040000400003 1101 200000100000 0110 010000200003 1010 040000400005 1101 200000200000 0110 010000200004 1010 040000500002 1101 200000300000 0110 010000200005 1010 040000500003 1101 200000400000 0110 010000300001 1010 040000500004 1101 200000500000 0110 010000300002 1010 050000200001 1110 200000400004 0110 010000300004 1010 050000200002 1110 300000100000 0111 010000300005 1010 050000200003 1110 300000200000 0111 010000400001 1010 050000200004 1110 300000300000 0111 010000400002 1010 050000200005 1110 300000400000 0111 010000400003 1010 050000300001 1110 300000500000 0111 010000400005 1010 050000300002 1110 300000400004 0111 010000500002 1010 050000300004 1110 400000100000 1000 010000500003 1010 050000300005 1110 400000200000 1000 010000500004 1010 050000400001 1110 400000300000 1000 020000200001 1011 050000400002 1110 400000400000 1000 020000200002 1011 050000400003 1110 400000500000 1000 020000200003 1011 050000400005 1110 400000400004 1000 020000200004 1011 050000500002 1110 500000100000 1001 020000200005 1011 050000500003 1110 500000200000 1001 020000300001 1011 050000500004 1110 500000300000 1001 020000300002 1011 300003xxxxxx 1111 500000400000 1001 020000300004 1011 100000010000 0000 500000500000 1001 020000300005 1011 100000020000 0000 500000400004 1001 020000400001 1011 100000030000 0000 100000200001 1010 020000400002 1011 100000040000 0000 100000200002 1010 020000400003 1011 100000050000 0000 100000200003 1010 020000400005 1011 100000300003 0000 100000200004 1010 020000500002 1011 200000010000 0001 100000200005 1010 020000500003 1011 200000020000 0001 100000300001 1010 020000500004 1011 200000030000 0001 100000300002 1010 030000200001 1100 200000040000 0001 100000300004 1010 030000200002 1100 200000050000 0001 100000300005 1010 030000200003 1100 200000300003 0001 100000400001 1010 030000200004 1100 300000010000 0010 100000400002 1010 030000200005 1100 300000020000 0010 100000400003 1010 030000300001 1100 300000030000 0010 100000400005 1010 030000300002 1100 300000040000 0010 100000500002 1010 030000300004 1100 300000050000 0010 100000500003 1010 030000300005 1100 300000300003 0010 100000500004 1010 030000400001 1100 400000010000 0011 200000200001 1011 030000400002 1100 400000020000 0011 200000200002 1011 030000400003 1100 400000030000 0011 200000200003 1011 030000400005 1100 400000040000 0011 200000200004 1011 030000500002 1100 400000050000 0011 200000200005 1011 030000500003 1100 400000300003 0011 200000300001 1011 030000500004 1100 500000010000 0100 200000300002 1011 200000300004 1011 400000200001 1101 500000400001 1110 200000300005 1011 400000200002 1101 500000400002 1110 200000400001 1011 400000200003 1101 500000400003 1110 200000400002 1011 400000200004 1101 500000400005 1110 200000400003 1011 400000200005 1101 500000500002 1110 200000400005 1011 400000300001 1101 500000500003 1110 200000500002 1011 400000300002 1101 500000500004 1110 200000500003 1011 400000300004 1101 400004xxxxxx 1111 200000500004 1011 400000300005 1101 200001xxxxxx 0000 300000200001 1100 400000400001 1101 200002xxxxxx 0001 300000200002 1100 400000400002 1101 200003xxxxxx 0010 300000200003 1100 400000400003 1101 200004xxxxxx 0011 300000200004 1100 400000400005 1101 200005xxxxxx 0100 300000200005 1100 400000500002 1101 300001xxxxxx 0101 300000300001 1100 400000500003 1101 300002xxxxxx 0110 300000300002 1100 400000500004 1101 300004xxxxxx 0111 300000300004 1100 500000200001 1110 300005xxxxxx 1000 300000300005 1100 500000200002 1110 400001xxxxxx 1001 300000400001 1100 500000200003 1110 400002xxxxxx 1010 300000400002 1100 500000200004 1110 400003xxxxxx 1011 300000400003 1100 500000200005 1110 400005xxxxxx 1100 300000400005 1100 500000300001 1110 500002xxxxxx 1101 300000500002 1100 500000300002 1110 500003xxxxxx 1110 300000500003 1100 500000300004 1110 500004xxxxxx 1111 300000300004 1100 500000300005 1110 ______________________________________
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 stored on a storage medium, wherein said stored data has been encoding using an M=6 (4,11) code, comprising the steps of: reading the storage medium 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 six levels; and decoding said output code symbols to obtain output data bits, wherein said output data bits correspond to the digital input data.
11. The method of claim 10, 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 for said given code symbol.
12. The method according to claim 11, wherein said table provides an output bit set x' for each sequence of code symbols y' according to the following table: Sequence of Sequence of Sequence of Code Symbols x' Code Symbols x' Code Symbols x' ______________________________________ 000000010000 0000 000040000010 1001 000300000004 0010 000000020000 0000 000040000020 1001 000300000005 0010 000000030000 0000 000040000030 1001 000300000010 0010 000000040000 0000 000040000040 1001 000300000020 0010 000000050000 0000 000040000050 1001 000300000030 0010 000000300003 0000 000050000000 1010 000300000040 0010 000000100000 0001 000050000002 1010 000300000050 0010 000000200000 0001 000050000005 1010 000400000000 0011 000000300000 0001 000050000010 1010 000400000002 0011 000000400000 0001 000050000020 1010 000400000004 0011 000000500000 0001 000050000030 1010 000400000005 0011 000000400004 0001 000050000040 1010 000400000010 0011 000000200001 0010 000050000050 1010 000400000020 0011 000000200002 0010 000010000100 1011 000400000030 0011 000000200003 0010 000010000200 1011 000400000040 0011 000000200004 0010 000010000300 1011 000400000050 0011 000000200005 0010 000010000400 1011 000500000000 0100 000000300001 0010 000010000003 1011 000500000002 0100 000000300002 0010 000020000100 1100 000500000004 0100 000000300004 0010 000020000200 1100 000500000005 0100 000000300005 0010 000020000300 1100 000500000010 0100 000000400001 0010 000020000400 1100 000500000020 0100 000000400002 0010 000020000500 1100 000500000030 0100 000000400003 0010 000020000003 1100 000500000040 0100 000000400005 0010 000030000100 1101 000500000050 0100 000000500002 0010 000030000200 1101 000100000100 0101 000000500003 0010 000030000300 1101 000100000200 0101 000000500004 0010 000030000400 1101 000100000300 0101 000002xxxxxx 0011 000030000500 1101 000100000400 0101 000004xxxxxx 0100 000030000003 1101 000100000500 0101 000005xxxxxx 0101 000040000100 1110 000100000003 0101 000010000000 0110 000040000200 1110 000200000100 0110 000010000002 0110 000040000300 1110 000200000200 0110 000010000004 0110 000040000400 1100 000200000300 0110 000010000005 0110 000040000500 1100 000200000400 0110 000010000010 0110 000040000003 1110 000200000500 0110 000010000020 0110 000050000100 1111 000200000003 0110 000010000030 0110 000050000200 1111 000300000100 0111 000010000040 0110 000050000300 1111 000300000200 0111 000010000050 0110 000050000400 1111 000300000300 0111 000020000000 0110 000500000500 1111 000300000400 0111 000020000002 0111 000050000003 1111 000300000500 0111 000020000004 0111 000100000000 0000 000300000003 0111 000020000005 0111 000100000002 0000 000400000100 1000 000020000010 0111 000100000004 0000 000400000200 1000 000020000020 0111 000100000005 0000 000400000300 1000 000020000030 0111 000100000010 0000 000400000400 1000 000020000040 0111 000100000020 0000 000400000500 1000 000020000050 0111 000100000030 0000 000400000003 1000 000030000000 1000 000100000040 0000 000400000100 1001 000030000002 1000 000100000050 0000 000500000200 1001 000030000004 1000 000200000000 0001 000500000300 1001 000030000005 1000 000200000002 0001 000500000400 1001 000030000010 1000 000200000004 0001 000500000500 1001 000030000020 1000 000200000005 0001 000500000003 1001 000030000030 1000 000200000010 0001 000100001000 1010 000030000040 1000 000200000020 0001 000100002000 1010 000030000050 1000 000200000030 0001 000100003000 1010 000040000000 1001 000200000040 0001 000100004000 1010 000040000002 1001 000200000050 0001 000100005000 1010 000040000004 1001 000300000000 0010 000100000001 1010 000040000005 1001 000300000002 0010 000200001000 1011 000200002000 1011 005000000000 0100 004000004000 1101 000200003000 1011 005000000002 0100 004000005000 1101 000200004000 1011 005000000004 0100 004000000001 1101 000200005000 1011 005000000005 0100 005000001000 3110 000200000001 1011 005000000010 0100 003000002000 1110 000300001000 1100 005000000020 0100 005000003000 1110 000300002000 1100 005000000030 0100 005000004000 1110 000300003000 1100 005000000040 0100 005000005000 1110 000300004000 1100 005000000050 0100 005000000001 1110 000300005000 1100 001000000100 0101 000001xxxxxx 1111 000300000001 1100 001000000200 0101 010000010000 0000 000400001000 1101 001000000300 0101 010000020000 0000 000400002000 1101 001000000400 0101 010000030000 0000 000400003000 1101 001000000500 0101 010000040000 0000 000400004000 1101 001000000003 0101 010000050000 0000 000400005000 1101 002000000100 0110 010000300003 0000 000400000001 1101 002000000200 0110 020000010000 0001 000500001000 1110 002000000300 0110 020000020000 0001 000500002000 1110 002000000400 0110 020000030000 0001 000500003000 1110 002000000500 0110 020000040000 0001 000500004000 1110 002000000003 0110 020000050000 0001 000500005000 1110 003000000100 0111 020000300003 0001 000500000001 1110 003000000200 0111 030000010000 0010 000003xxxxxx 1111 003000000300 0111 030000020000 0010 001000000000 0000 003000000400 0111 030000030000 0010 001000000002 0000 003000000500 0111 030000040000 0010 001000000004 0000 003000000003 0111 030000050000 0010 001000000005 0000 004000000100 1000 030000300003 0010 001000000010 0000 004000000200 1000 040000010000 0011 001000000020 0000 004000000300 1000 040000020000 0011 001000000030 0000 004000000400 1000 040000030000 0011 001000000040 0000 004000000500 1000 040000040000 0011 001000000050 0000 004000000003 1000 040000050000 0011 002000000000 0001 005000000100 1001 040000300003 0011 002000000002 0001 005000000200 1001 050000010000 0100 002000000004 0001 005000000300 1001 050000020000 0100 002000000005 0001 005000000400 1001 050000030000 0100 002000000010 0001 005000000500 1001 050000040000 0100 002000000020 0001 005000000003 1001 050000050000 0100 002000000030 0001 001000001000 1010 050000300003 0100 002000000040 0001 001000002000 1010 010000100000 0101 002000000050 0010 001000003000 1010 010000200000 0101 003000000000 0010 001000004000 1010 010000300000 0101 003000000002 0010 001000005000 1010 010000400000 0101 003000000004 0010 001000000001 1010 010000500000 0101 003000000005 0010 002000001000 1011 010000400004 0101 003000000010 0010 002000002000 1011 020000100000 0110 003000000020 0010 002000003000 1011 020000200000 0110 003000000030 0010 002000004000 1011 020000300000 0110 003000000040 0010 002000005000 1011 020000400000 0110 003000000050 0010 002000000001 1011 020000500000 0110 004000000000 0011 003000001000 1100 020000400004 0110 004000000002 0011 003000002000 1100 030000100000 0111 004000000004 0011 003000003000 1100 030000200000 0111 004000000005 0011 003000004000 1100 030000300000 0111 004000000010 0011 003000005000 1100 030000400000 0111 004000000020 0011 003000000001 1100 030000500000 0111 004000000030 0011 004000001000 1101 030000400004 0111 004000000040 0011 004000002000 1101 040000100000 1000 004000000050 0011 004000003000 1101 040000200000 1000 040000300000 1000 040000200001 1101 500000020000 0100 040000400000 1000 040000200002 1101 500000030000 0100 040000500000 1000 040000200003 1101 500000040000 0100 040000400004 1000 040000200004 1101 500000050000 0100 050000100000 1001 040000200005 1101 500000300003 0100 050000200000 1001 040000300001 1101 100000100000 0101 050000300000 1001 040000300002 1101 100000200000 0101 050000400000 1001 040000300004 1101 100000300000 0101 050000500000 1001 040000300005 1101 100000400000 0101 050000400004 1001 040000400001 1101 100000500000 0101 010000200001 1010 040000400002 1101 100000400004 0101 010000200002 1010 040000400003 1101 200000100000 0110 010000200003 1010 040006400005 1101 200000200000 0110 010000200004 1010 040000500002 1101 200000300000 0110 010000200005 1010 040000500003 1101 200000400000 0110 010000300001 1010 040000500004 1101 200000500000 0110 010000300002 1010 050000200001 1110 200000400004 0110 010000300004 1010 050000200002 1110 300000100000 0111 010000300005 1010 050000200003 1110 300000200000 0111 010000400001 1010 050000200004 1110 300000300000 0111 010000400002 1010 050000200005 1110 300000400000 0111 010000400003 1010 050000300001 1110 300000500000 0111 010000400005 1010 050000300002 1110 300000400004 0111 010000500002 1010 050000300004 1110 400000100000 1000 010000500003 1010 050000300005 1110 400000200000 1000 010000500004 1010 050000400001 1110 400000300000 1000 020000200001 1011 050000400002 1110 400000400000 1000 020000200002 1011 050000400003 1110 400000500000 1000 020000200003 1011 050000400005 1110 400000400004 1000 020000200004 1011 050000500002 1110 500000100000 1001 020000200005 1011 050000500003 1110 500000200000 1001 020000300001 1011 050000500004 1110 500000300000 1001 020000300002 1011 300003xxxxxx 1111 500000400000 1001 020000300004 1011 100000010000 0000 500000500000 1001 020000300005 1011 100000020000 0000 500000400004 1001 020000400001 1011 100000030000 0000 100000200001 1010 020000400002 1011 100000040000 0000 100000200002 1010 020000400003 1011 100000050000 0000 100000200003 1010 020000400005 1011 100000300003 0000 100000200004 1010 020000500002 1011 200000010000 0001 100000200005 1010 020000500003 1011 200000020000 0001 100000300001 1010 020000500004 1011 200000030000 0001 100000300002 1010 030000200001 1100 200000040000 0001 100000300004 1010 030000200002 1100 200000050000 0001 100000300005 1010 030000200003 1100 200000300003 0001 100000400001 1010 030000200004 1100 300000010000 0010 100000400002 1010 030000200005 1100 300000020000 0010 100000400003 1010 030000300001 1100 300000030000 0010 100000400005 1010 030000300002 1100 300000040000 0010 100000500002 1010 030000300004 1100 300000050000 0010 100000500003 1010 030000300005 1100 300000300003 0010 100000500004 1010 030000400001 1100 400000010000 0011 200000200001 1011 030000400002 1100 400000020000 0011 200000200002 1011 030000400003 1100 400000030000 0011 200000200003 1011 030000400005 1100 400000040000 0011 200000200004 1011 030000500002 1100 400000050000 0011 200000200005 1011 030000500003 1100 400000300003 0011 200000300001 1011 030000500004 1100 500000010000 0100 200000300002 1011 200000300004 1011 400000200001 1101 500000400001 1110 200000300005 1011 400000200002 1101 500000400002 1110 200000400001 1011 400000200003 1101 500000400003 1110 200000400002 1011 400000200004 1101 500000400005 1110 200000400003 1011 400000200005 1101 500000500002 1110 200000400005 1011 400000300001 1101 500000500003 1110 200000500002 1011 400000300002 1101 500000500004 1110 200000500003 1011 400000300004 1101 400004xxxxxx 1111 200000500004 1011 400000300005 1101 200001xxxxxx 0000 300000200001 1100 400000400001 1101 200002xxxxxx 0001 300000200002 1100 400000400002 1101 200003xxxxxx 0010 300000200003 1100 400000400003 1101 200004xxxxxx 0011 300000200004 1100 400000400005 1101 200005xxxxxx 0100 300000200005 1100 400000500002 1101 300001xxxxxx 0101 300000300001 1100 400000500003 1101 300002xxxxxx 0110 300000300002 1100 400000500004 1101 300004xxxxxx 0111 300000300004 1100 500000200001 1110 300005xxxxxx 1000 300000300005 1100 500000200002 1110 400001xxxxxx 1001 300000400001 1100 500000200003 1110 400002xxxxxx 1010 300000400002 1100 500000200004 1110 400003xxxxxx 1011 300000400003 1100 500000200005 1110 400005xxxxxx 1100 300000400005 1100 500000300001 1110 500002xxxxxx 1101 300000500002 1100 500000300002 1110 500003xxxxxx 1110 300000500003 1100 500000300004 1110 500004xxxxxx 1111 300000500004 1100 500000300005 1110 ______________________________________
Patent Citations (27)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4413251 | 1983-11-01 | Adler et al. | |
| US4463344 | 1984-07-01 | Adler et al. | |
| US4488142 | 1984-12-01 | Franaszek | |
| US4506252 | 1985-03-01 | Jacoby et al. | |
| US4566044 | 1986-01-01 | Langdon, Jr. et al. | |
| US4691193 | 1987-09-01 | Khu | |
| US4760378 | 1988-07-01 | Iketani et al. | |
| US4864536 | 1989-09-01 | Lindmayer | |
| US4870414 | 1989-09-01 | Karabed et al. | |
| US4882583 | 1989-11-01 | Dimitri et al. | |
| US4914438 | 1990-04-01 | Kameyama | |
| US4928187 | 1990-05-01 | Rees | |
| US4949196 | 1990-08-01 | Davie et al. | |
| US5047767 | 1991-09-01 | Weathers et al. | |
| US5099237 | 1992-03-01 | Fitingof | |
| US5136573 | 1992-08-01 | Kobayashi | |
| US5142493 | 1992-08-01 | Lindmayer | |
| US5163039 | 1992-11-01 | Lindmayer | |
| US5173694 | 1992-12-01 | Lynch, Jr. et al. | |
| US5196849 | 1993-03-01 | Galbraith | |
| US5260703 | 1993-11-01 | Nguyen et al. | |
| US5271016 | 1993-12-01 | Hilden et al. | |
| US5287228 | 1994-02-01 | Sawaguchi et al. | |
| US5329512 | 1994-07-01 | Fukimoto et al. | |
| US5390198 | 1995-02-01 | Higgins | |
| US5398260 | 1995-03-01 | Min | |
| US5400313 | 1995-03-01 | Belser et al. |
Non-Patent Literature (19)
- M. Tomlinson, "New Automatic Equalizer Employing Modulo Arithmetic," Electronic Letters, vol. 7, Nos. 5-6, pp. 138-9, Mar. 25, 1971.
- G. Ungerboeck, "Channel Coding With Multilevel/Phase Signals," IEEE Trans. on Information Theory, vol. IT-28, No. 1, pp. 55-67, Jan., 1982.
- S. W. McLaughlin, "Improved Distance M-ary (d,k) Codes for High Density Recording," Rochester Institute of Technology, Rochester, NY, Jun., 1994.
- S. W. McLaughlin et al., "Full Digital Video Read Write Disk Drive Using M-ary Coding," Rochester, Date Unknown.
- Brita H. Olson et al., "Multidimensional Partial Response for Parallel Readout Optical Memories," SPIE, vol. 2297, pp. 331-337, May, 1994.
- Siegel, Paul H., "Recording Codes For Digital Magnetic Storage," IEEE Transactions On Magnetics, vol. 21, No. 5, pp. 1344-1349, Sep. 1985.
- Kobayashi, H. et al., "Application of Partial-response Channel Coding to Magnetic Recording Systems," IBM J. Res. Develop., pp. 368-375, Jul. 1970.
- Lindmayer, Dr. Joseph et al., "Electron Trapping Optical Technology--Memory's Next Generation?," Computer Technolgy Review, Summer, 1990.
- Earman, Allen, "Optical Data Storage With Electron Trapping Materials Using M-ary Data Channel Coding," Proceedings of the the Optical Data Storage Conference, SPIE, Feb. 1992, San Jose, Calif.
- Forney, Jr., G. David et al.,"Coset Codes For Partial Response Channels; or, Coset Codes With Spectral Nulls," IEEE Transactions on Information Theory, vol. 35, No. 5, Sep. 1989, pp. 925-943.
- Laroia, Rajiv et al., "A Simple and Effective Precoding Scheme for Noise Whitening on Intersymbol Interference Channels," IEEE Transactions on Communications, vol. 41, No. 10, Oct. 1993, pp. 1460-1463.
- McLaughlin, Steven et al., "M-ary Runlength Limited Codes for High Density Optical Recording," 1994 Int'l Symposium on Information Theory, Trondheim, Norway, Jun. 1994.
- McLaughlin, Steven, "Improved Distance M-ary (d,k) Codes for High Density Recording," Rochester Institute of Technology, Rochester, New York, 1994.
- Ungerboeck, Gottfried, "Trellis-Coded Modulation with Redundant Signal Sets, Part I: Introduction," IEEE Communications Magazine, vol. 25, No. 2, pp. 5-11, Feb. 1987.
- Ungerboeck, Gottfried, "Trellis-Coded Modulation with Redundant Signal Sets, Part II: State of the Art," IEEE Communications Magazine, vol. 25, No. 2, pp. 12-21, Feb. 1987.
- Marcus, Brian et al., "Finite-State Modulation Codes for Data Storage," IEEE Journal On Selected Areas In Communications, vol. 10, No. 1, pp. 5-37, Jan. 1992.
- Adler, Roy et al., "Algorithms for Sliding Block Codes," IEEE Transactions in Information Theory, vol. IT-29, No. 1, pp. 5-22, Jan. 1983.
- Forney, Jr. G. David et al., "Combined Equalization and Coding Using Precoding," IEEE Communications Magazine, pp. 25-34, Dec. 1991.
- McLaughlin, Steven et al., "Modulation Codes for Multi-amplitude Optical Recording Channels," Rochester Institute of Technology, Rochester, New York, paper presented Nov. 1994.