WO2002041500A1 - Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module - Google Patents

Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module Download PDF

Info

Publication number
WO2002041500A1
WO2002041500A1 PCT/KR2000/001292 KR0001292W WO0241500A1 WO 2002041500 A1 WO2002041500 A1 WO 2002041500A1 KR 0001292 W KR0001292 W KR 0001292W WO 0241500 A1 WO0241500 A1 WO 0241500A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit code
bit
words
word
code words
Prior art date
Application number
PCT/KR2000/001292
Other languages
English (en)
Inventor
Kees A. Schouhamer Immink
Original Assignee
Lg Electronics Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Lg Electronics Inc. filed Critical Lg Electronics Inc.
Priority to JP2002543791A priority Critical patent/JP4095440B2/ja
Priority to PCT/KR2000/001292 priority patent/WO2002041500A1/fr
Priority to CNB00818304XA priority patent/CN100474782C/zh
Priority to EP00973254A priority patent/EP1332561A4/fr
Priority to AU2001211783A priority patent/AU2001211783A1/en
Publication of WO2002041500A1 publication Critical patent/WO2002041500A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/46—Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10—Digital recording or reproducing
    • G11B20/14—Digital recording or reproducing using self-clocking codes
    • G11B20/1403—Digital recording or reproducing using self-clocking codes characterised by the use of two levels
    • G11B20/1423—Code representation depending on subsequent bits, e.g. delay modulation, double density code, Miller code
    • G11B20/1426—Code representation depending on subsequent bits, e.g. delay modulation, double density code, Miller code conversion to or from block codes or representations thereof
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/01—Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M5/00—Conversion of the form of the representation of individual digits
    • H03M5/02—Conversion to or from representation by pulses
    • H03M5/04—Conversion to or from representation by pulses the pulses having two levels
    • H03M5/14—Code representation, e.g. transition, for a given bit cell depending on the information in one or more adjacent bit cells, e.g. delay modulation code, double density code
    • H03M5/145—Conversion to or from block codes or representations thereof

Definitions

  • the present invention relates to coding information, and more particularly, to a method and apparatus for coding information having improved information density.
  • the present invention further relates to producing a modulated signal from the coded information, producing a recording medium from the coded information, and the recording medium itself.
  • the present invention still further relates to a method and apparatus for decoding coded information, and decoding coded information from a modulated signal and/or a recording medium.
  • the data When data is transmitted through a transmission line or recorded onto a recording medium such as a magnetic disc, an optical disc or a magneto-optical disc, the data is modulated into code matching the transmission line or the recording medium prior to the transmission or recording.
  • a recording medium such as a magnetic disc, an optical disc or a magneto-optical disc
  • Run length limited codes generically designated as (d, k) codes
  • (d, k) codes have been widely and successfully applied in modern magnetic and optical recording systems. Such codes, and means for implementing such codes are described by K. A. Schouhamer Immink in the book entitled “Codes for Mass Data Storage Systems” (ISBN 90-74249-23-X , 1999).
  • Run length limited codes are extensions of earlier non return to zero recording codes, where binary recorded "zeros" are represented by no (magnetic flux) change in the recording medium, while binary "ones” are represented by transitions from one direction of recorded flux to the opposite direction.
  • a (d, k) code the above recording rules are maintained with the additional constraints that at least d "zeros" are recorded between successive "ones", and no more than k “zeros" are recorded between successive "ones".
  • the first constraint arises to obviate intersymbol interference occurring because of pulse crowding of the reproduced transitions when a series of "ones" are contiguously recorded.
  • the second constraint arises to ensure recovering a clock from the reproduced data by "locking" a phase locked loop to the reproduced transitions. If there is too long an unbroken string of contiguous "zeros" with no interspersed "ones", the clock regenerating phase-locked-loop will fall out of synchronism.
  • a (1 ,7) code there is at least one "zero” between recorded "ones", and there are no more than seven recorded contiguous "zeros” between recorded “ones”.
  • the series of encoded bits is converted, via a modulo-2 integration operation, to a corresponding modulated signal formed by bit cells having a high or low signal value.
  • a "one” bit is represented in the modulated signal by a change from a high to a low signal value or vice versa, and a "zero" bit is represented by the lack of change in the modulated signal.
  • the information conveying efficiency of such codes is typically expressed as a rate, which is the quotient of the number of bits (m) in the information word to the number of bits (n) in the code word (i.e., m/n).
  • the theoretical maximum rate of a code, given values of d and k, is called the Shannon capacity.
  • (1,7) codes having a rate of 2/3 and means for implementing associated encoders and decoders are known in the art.
  • U.S. Patent No. 4,488,142 entitled “Apparatus for Encoding Unconstrained Data onto a (1 ,7) Format with Rate 2/3”, issued in the name of Franaszek discloses an encoder having 8 internal states.
  • n-bit code words are divided into a first type and a second type, and into coding states of a first kind and a second kind such that an m-bit information word is converted into an n-bit code word of the first or second kind if the previous m-bit information word was converted into an n-bit code word of the first type and is converted into an n-bit code word of the first kind if the previous m-bit information word was converted into an n-bit code word of the second type.
  • n-bit code words of the first type end in zero
  • n-bit code words of the second type end in one
  • n-bit code words of the first kind start with zero
  • n-bit code words of the second kind start with zero or one.
  • the n-bit code words satisfy a dk-constraint to (1 ,k) such that a minimum of 1 zero and a maximum of k zeros falls between consecutive ones.
  • the coding device and method according to the present invention are employed to record information on a recording medium and create a recording medium according to the present invention.
  • the coding device and method according to the present invention are further employed to transmit information.
  • n-bit code words created according to the coding method and apparatus are decoded into m-bit information words.
  • the decoding involves determining the state of a next n-bit code word, and based on the state determination, the current n-bit code word is converted into an m-bit information word.
  • the decoding device and method according to the present invention are employed to reproduce information from a recording medium.
  • the decoding device and method according to the present invention are employed to receive information transmitted over a medium.
  • FIGURE 2 shows an example of how the code words in the various subgroups are allocated in to the various states in the first embodiment;
  • FIGURE 3 shows an embodiment for a coding device according to the invention
  • FIGURES 4A-4H show a complete translation table according to the first embodiment for converting 9-bit information words into 13-bit code words;
  • FIGURE 5 illustrates the conversion of a series of information words into a series of code words using the translation table of FIGURES 4A-4H;
  • FIGURE 6 illustrates an embodiment of a recording device according to the present invention
  • FIGURE 7 illustrates a recording medium and modulated signal according to the present invention
  • FIGURE 8 illustrates a transmission device according to the present invention
  • FIGURE 9 illustrates a decoding device according to the present invention
  • FIGURE 10 illustrates a reproducing device according to the present invention
  • FIGURE 11 illustrates a receiving device according to the present invention
  • FIGURE 12 shows an example of how the code words in the various subgroups are allocated in to the various states in the second embodiment
  • FIGURES 13A-13C show the beginning, middle and end portions of a translation table according to the second embodiment for converting 9-bit information words into 13-bit code words
  • FIGURE 14 shows an example of how the code words in the various subgroups are allocated in to the various states in the third embodiment
  • FIGURES 15A-15C show the beginning, middle and end portions of a translation table according to the third embodiment for converting 11 -bit information words into 16-bit code words
  • FIGURE 16 shows an example of how the code words in the various subgroups are allocated in to the various states in the fourth embodiment.
  • FIGURES 17A-17C show the beginning, middle and end portions of a translation table according to the fourth embodiment for converting 13-bit information words into 19-bit code words.
  • the general coding method according to the present invention will be described followed by a specific first embodiment of the coding method.
  • the general decoding method according to the present invention will be described in the context of the first embodiment.
  • the various apparatuses according to the present invention will then be described. Specifically, the coding device, recording device, transmission device, decoding device, reproducing device and receiving device according to the present invention will be described. Afterwards, additional coding embodiments according to the present invention will be described.
  • an m-bit information word is converted into an n-bit code word such that the rate of m/n is greater than 2/3.
  • the code words are divided into first and second types wherein the first type includes code words ending with "0" and the second type includes code words ending with "1.”
  • the code words of the first type are divided into two subgroups E00 and E10, and code words of the second type are divided into two subgroups E01 and E11.
  • Code word subgroup E00 includes code words that start with “0” and end with “0”
  • code word subgroup E01 includes code words that start with “0” and end with “1”
  • code word subgroup E10 includes code words that start with “1” and end with “0”
  • code word subgroup E11 includes code words that start with “1” and end with “1”.
  • the code words are also divided into at least one state of a first kind and at least one state of a second kind. States of the first kind include code words that only start with "0,” and states of the second kind include code words that start with either "0" or "1.”
  • 9-bit information words are converted into 13-bit code words.
  • the code words satisfy a (1 ,k) constraint, and are divided into 3 states of the first kind and 2 states of the second kind (a total of 5 states).
  • three code words namely, "0000000000000", "0000000000001", and "0000000000010” are barred from the encoding tables.
  • An enumeration of code words shows there are 231 code words in subgroup E00, 144 code words in subgroup E10, 143 code words in subgroup E01 , and 89 code words in subgroup E11.
  • each 13-bit code word in each state is associated with a coding state direction.
  • the state direction indicates the next state from which to select a code word in the encoding process.
  • code words in subgroups E10 and E00 can be assigned 5 times to different information words within one state
  • code words in subgroups E11 and E01 can be assigned 3 times to different information words within one state.
  • there are 231 code words in subgroup E00 and 144 code words in subgroup E10 there are 1875 (5*(231+144)) "code word - state direction" combinations for code words of the first type.
  • There are 143 code words in subgroup E01 and 89 code words in E11 so that there are 696 (3*(143+89)) "code word - state direction” combinations for code words of the second type.
  • states 1 , 2, and 3 are states of the first kind and states 4 and 5 are states of the second kind.
  • subgroup E00 has 76 code words in each of states 1 , 2, and 3 plus 1 code word in each of states 4 and 5.
  • FIGURE 2 there at least 512 information words that can be assigned to code words, which is enough to accommodate 9-bit information words.
  • FIGURES 4A-4H show a complete translation table according to this embodiment for converting 9-bit information words into 13-bit code words. Included in the translation table of FIGURES 4A-4H are the state direction assigned to each code word. Specifically, in FIGURES 4A-4H, the first column shows the decimal notation of the information words in the second column. The third, fifth, seventh, ninth and eleventh columns show the code words (also referred to in the art as channel bits) assigned to the information words in states 1 , 2, 3, 4 and 5, respectively. The fourth, sixth, eighth, tenth and twelfth columns show by way of the respective digits 1, 2, 3, 4 and 5 the state direction of the associated code words in the third, fifth, seventh, ninth and eleventh columns, respectively.
  • the conversion of a series of information words into a series of code words will be further explained with reference to FIGURE 5.
  • the first column of FIGURE 5 shows from top to bottom a series of successive 9-bit information words, and the second column shows in parenthesis the decimal values of these information words.
  • the third column “state” is the coding state that is to be used for the conversion of the information word. The “state” is laid down when the preceding code word was delivered (i.e., the state direction of the preceding code word).
  • the fourth column “code words” includes the code words assigned to the information words according to the translation table of FIGURES 4A-H.
  • the fifth column “next state” is the state direction associated with the code word in the fourth column and is also determined according to the translation table of FIGURES 4A-H.
  • the first word from the series of information words shown in the first column of FIGURE 5 has a word value of "1" in decimal notation.
  • the coding state is state 1 (S1) when the conversion of the series of information words is initiated. Therefore the first word is translated into code word "0000000000100” according to the state 1 set of code words from the translation table.
  • the next state becomes state 2 (S2) because the state direction assigned to code word "0000000000100” representing decimal value 1 in state 1 is state 2.
  • S2 state 2
  • the next information word (decimal value "3") is going to be translated using the code words in state 2. Consequently, the next information word, having a decimal value of "3”, is translated into code word "0001010001010". Similar to the manner described above, the information words having the decimal values "5", "12” and "19" are converted.
  • n-bit code words in this example 13-bit words
  • FIGURES 4A-4H For the purposes of description, assume that the word values of a series of successive code words received from, for example, a recording medium are "0000000000100", “0001010001010", "0101001001001”. From the translation table of FIGURES 4A-4H, it is found that the first code word "0000000000100” is assigned to the information words "0", “1", “2", "3" and "4" and state directions 1 , 2, 3, 4 and 5, respectively. The next code word value is "0001010001010", and belongs to the set of code words in state 2.
  • the first code word "0000000000100” had a state direction of 2.
  • the first code word "0000000000100” with a state direction of 2 represents the information word having a decimal value of "1". Therefore, it is determined that the first code word represents information word "000000001" having a decimal value of "1".
  • the third code word "0101001001001” is a member of state 4. Therefore, it is determined in the same manner as above that the second code word "0001010001010" represents the information word having the decimal value "3". In the same manner other code words can be decoded. It is noted that both the current code word and the next code words are observed to decode the current code word into a unique information word.
  • FIGURE 3 shows an embodiment for a coding device 124 according to the invention.
  • the coding device 124 includes a converter 50 for converting (m+s) binary input signals to (n+s) binary output signals.
  • the converter 50 includes a read only memory (ROM) storing a translation table according to at least one embodiment of the present invention and address circuitry for addressing the translation table based on the m+s binary input signals.
  • the converter 50 can include a combinatorial logic circuit producing the same results as the translation table according to at least one embodiment of the present invention.
  • m inputs are connected to a first bus 51 for receiving m-bit information words.
  • n outputs are connected to a second bus 52 for delivering n-bit code words.
  • s inputs are connected to an s-bit third bus 53 for receiving a state word that indicates the instantaneous coding state.
  • the state word is delivered by a buffer memory 54 including, for example, s flip-flops.
  • the buffer memory 54 has s inputs connected to a fourth bus 55 for receiving a state direction to be loaded into the buffer memory 54 as the state word. For delivering the state directions to be loaded in the buffer memory 54, the s outputs of the converter 50 are used.
  • the second bus 52 is connected to the parallel inputs of a parallel-to- serial converter 56, which converts the code words received over the second bus 52 to a serial bit string.
  • a signal line 57 supplies the serial bit string to a modulator circuit 58, which converts the bit string into a modulated signal.
  • the modulated signal is then delivered over a line 60.
  • the modulator circuit 58 is any well-known circuit for converting binary data into a modulated signal such as a modula-2 integrator.
  • the coding device includes a clock generating circuit (not shown) of a customary type for generating clock signals for controlling timing of, for example, the parallel/serial converter 58 and the loading of the buffer memory 54.
  • the converter 50 receives m-bit information words and an s- bit state word from the first bus 51 and the third bus 53, respectively.
  • the s-bit state word indicates the state in the translation table to use in converting the m- bit information word. Accordingly, based on the value of the m-bit information word, the n-bit code word is determined from the code words in the state identified by the s-bit state word. Also, the state direction associated with the n- bit code word is determined. The state direction, namely, the value thereof is converted into an s-bit binary word; or alternatively, the state directions are stored in the translation table as s-bit binary words.
  • the converter 50 outputs the n-bit code word on the second bus 52, and outputs the s-bit state direction on fourth bus 55.
  • the buffer memory 54 stores the s-bit state direction as a state word, and supplies the s-bit state word to the converter 50 over the third bus 53 in synchronization with the receipt of the next m-bit information word by the converter 50. This synchronization is produced based on the clock signals discussed above in any well-known manner.
  • n-bit code words on the second bus 52 are converted to serial data by the parallel/serial converter 56, and then the serial data is converted into a modulated signal by the modulator 58.
  • the modulated signal may then undergo further processing for recordation or transmission.
  • FIGURE 6 shows a recording device for recording information that includes the coding device 124 according to the present invention as shown in FIGURE 3.
  • m-bit information is converted into a modulated signal through the coding device 124.
  • the modulated signal produced by the coding device 124 is delivered to a control circuit 123.
  • the control circuit 123 may be any conventional control circuit for controlling an optical pick-up or laser diode 122 in response to the modulated signal applied to the control circuit 123 so that a pattern of marks corresponding to the modulated signal are recorded on the recording medium 110.
  • FIGURE 7 shows by way of example, a recording medium 110 according to the invention.
  • the recording medium 110 shown is a read-only memory (ROM) type optical disc.
  • the recording medium 110 of the present invention is not limited to a ROM type optical disk, but could be any type of optical disk such as a write-once read-many (WORM) optical disk, random accessible memory (RAM) optical disk, etc. Further, the recording medium 110 is not limited to being an optical disk, but could be any type of recording medium such as a magnetic disk, a magneto-optical disk, a memory card, magnetic tape, etc.
  • WORM write-once read-many
  • RAM random accessible memory
  • the recording medium 110 is not limited to being an optical disk, but could be any type of recording medium such as a magnetic disk, a magneto-optical disk, a memory card, magnetic tape, etc.
  • the recording medium 110 includes information patterns arranged in tracks 111 .
  • FIGURE 7 shows an enlarged view of a track 111 along a direction 114 of the track 111.
  • the track 111 includes pit regions 112 and non-pit regions 113.
  • the pit and non-pit regions 112 and 113 represent constant signal regions of the modulated signal 115 (zeros in the code words) and the transitions between pit and non-pit regions represent logic state transitions in the modulated signal 115 (ones in the code words).
  • the recording medium 110 may be obtained by first generating the modulated signal and then recording the modulated signal on the recording medium 110.
  • the recording medium is an optical disc, the recording medium 110 can also be obtained with well-known mastering and replica techniques.
  • FIGURE 8 shows a transmission device for transmitting information that includes the coding device 124 according to the present invention as shown in FIGURE 3. As shown in FIGURE 8, m-bit information words are converted into a modulated signal through the coding device 124. A transmitter 150 then further processes the modulated signal, to convert the modulated signal into a form for transmission depending on the communication system to which the transmitter belongs, and transmits the converted modulated signal over a transmission medium such as air (or space), optical fiber, cable, a conductor, etc.
  • a transmission medium such as air (or space), optical fiber, cable, a conductor, etc.
  • FIGURE 9 illustrates a decoder according to the present invention.
  • the decoder performs the reverse process of the converter of FIGURE 3 and converts n-bit code words of the present invention into m-bit information words.
  • the decoder 100 includes a first look-up table (LUT) 102 and a second LUT 104.
  • the first and second LUTs 102 and 104 store the translation table used to create the n-bit code words being decoded.
  • K refers to time
  • the first LUT 102 receives the (K+1)th n-bit code word
  • the second LUT 104 receives the output of the first LUT 102 and the Kth n-bit code word.
  • the decoder 100 operates as a sliding block decoder. At every block time instant the decoder 100 decodes one n-bit code word into one m-bit information word and proceeds with the next n-bit code word in the serial data (also referred to as the channel bit stream).
  • the first LUT 102 determines the state of the (K+1)th code word from the stored translation table, and outputs the state to the second LUT 104. So the output of the first LUT 102 is a binary number in the range of 1 , 2,..., r (where r denotes the number of states in the translation table).
  • the second LUT 104 determines the possible m-bit information words associated with Kth code word from the Kth code word using the stored translation table, and then determines the specific one of the possible m-bit information words being represented by the n-bit code word using the state information from the first LUT 102 and the stored translation table.
  • n-bit code words are 13-bit code words produced using the translation table of FIGURES 4A-4H. Then, referring to FIGURE 5, if the (K+1)th 13-bit code word is "0001010001010" the first LUT 102 determines the state as state 2. Furthermore, if the Kth 13-bit code word is "0000000000100", then the second LUT 104 determines that the Kth 13-bit code word represents one of the 9-bit information words having a decimal value of 0, 1 , 2, 3 or 4.
  • the second LUT 104 determines that the Kth 13-bit code word represents the 9-bit information word having a decimal value of 1 because the 13-bit code word "0000000000100" associated with a state direction of 2 represents the 9-bit information word having a decimal value of 1.
  • FIGURE 10 illustrates a reproducing device that includes the decoder 100 according to the present invention as shown in FIGURE 9.
  • the reading device includes an optical pick-up 122 of a conventional type for reading a recording medium 110 according to the invention.
  • the recording medium 110 may be any type of recording medium such as discussed previously.
  • the optical pick-up 122 produces an analog read signal modulated according to the information pattern on the recording medium 110.
  • a detection circuit 125 converts this read signal in conventional fashion into a binary signal of the form acceptable to the decoder 100.
  • the decoder 100 decodes the binary signal to obtain the m-bit information words.
  • FIGURE 11 illustrates a receiving device that includes the decoder 100 according to the present invention as shown in FIGURE 9.
  • the receiving device includes a receiver 160 for receiving a signal transmitted over a medium such as air (or space), optical fiber, cable, a conductor, etc.
  • the receiver 160 converts the received signal into a binary signal of the form acceptable to the decoder 100.
  • the decoder 100 decodes the binary signal to obtain the m-bit information words.
  • CODING METHOD ACCORDING TO A SECOND EMBODIMENT FIGURES 12 and 13A-13C illustrate another embodiment of the present invention.
  • the greater than 2/3 rate is achieved by converting 9-bit information words into 13-bit code words; wherein the number of coding states r equals 13, and 8 of the coding states are coding states of the first kind and 5 of the coding states are coding states of the second kind. Also, the code words satisfy a (1 ,k) constraint.
  • code words in subgroups E00 and E10 can be assigned 13 times to different information words, while code words in subgroups E01 and E11 can be assigned 8 times to different information words.
  • FIGURES 13A-13C illustrate the beginning, middle and end portions of the translation table for this second embodiment in the same fashion that FIGURES 4A-4H illustrated the translation table for the first embodiment.
  • FIGURES 14 and 15A-15C illustrate another embodiment of the present invention.
  • the greater than 2/3 rate is achieved by converting 11 -bit information words into 16-bit code words; wherein the number of coding states r equals 13, and 8 of the coding states are coding states of the first kind and 5 of the coding states are coding states of the second kind.
  • the code words satisfy a (1 ,k) constraint.
  • FIGURES 15A-15C illustrate the beginning, middle and end portions of the translation table for the third embodiment in the same fashion that FIGURES 4A-4H illustrated the translation table for the first embodiment.
  • FIGURES 16 and 17A-17C illustrate another embodiment of the present invention.
  • the greater than 2/3 rate is achieved by converting 13-bit information words into 19-bit code words; wherein the number of coding states r equals 5, and 3 of the coding states are coding states of the first kind and 2 of the coding states are coding states of the second kind.
  • FIGURES 17A-17C illustrate the beginning, middle and end portions the
  • 4A-4H illustrated the translation table for the first embodiment.
  • m-bit information words are converted into n-bit code words at a rate greater than 2/3. Consequently, the same amount of information can be recorded in less space, and information density increased.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Signal Processing (AREA)
  • Signal Processing For Digital Recording And Reproducing (AREA)
  • Dc Digital Transmission (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

Dans le dispositif et procédé de codage, des mots d'information sur m bits sont convertis en mots de code sur n bits de façon que le rapport de codage m/n soit supérieur à 2/3. Les mots de code sur n bits sont divisés en un premier type et un second type, et en états de codage d'une première sorte et d'une seconde sorte de façon qu'un mot d'information sur m bits soit converti en mode de code sur n bits de la première ou de la seconde sorte si le mot d'information sur m bits précédent était converti en mot de code sur n bits du premier type, et il est converti en un mot de code sur n bits de la première sorte si le mot d'information sur m bits précédent était converti en un mot de code sur n bits du second type. Dans l'un des modes de réalisation, les mots de code du premier type finissent en zéro, les mots de code sur n bits du second type finissent en un, les mots de code sur n bits de la première sorte commencent par zéro et les mots de code sur n bits de la seconde sorte commencent par zéro ou un. En outre, dans ces modes de réalisations, les mots de code sur n bits satisfont une contrainte dk à (1,k) telle qu'un minimum de 1 zéro et un maximum de k zéros tombent entre des uns consécutifs. Le dispositif et le procédé de codage sont employés pour enregistrer l'information sur un support d'enregistrement et créer ainsi le support d'enregistrement. Le dispositif et le procédé de codage sont également employés pour transmettre l'information. Dans le procédé et appareil de décodage, les mots de code sur n bits sont décodés en mots d'information sur m bits. Le décodage implique la détermination de l'état d'un mot de code sur n bits suivant, et sur la base de la détermination d'état, le mot de code sur n bits courant est converti en mot d'information sur m bits. Le dispositif et le procédé de décodage sont employés pour reproduire l'information à partir d'un support d'enregistrement, et pour recevoir l'information transmise via un support.
PCT/KR2000/001292 2000-11-11 2000-11-11 Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module WO2002041500A1 (fr)

Priority Applications (5)

Application Number Priority Date Filing Date Title
JP2002543791A JP4095440B2 (ja) 2000-11-11 2000-11-11 情報の符号化のための装置及び方法、その符号化された情報を復号するための装置及び方法、変調信号及び記録媒体の製造方法
PCT/KR2000/001292 WO2002041500A1 (fr) 2000-11-11 2000-11-11 Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module
CNB00818304XA CN100474782C (zh) 2000-11-11 2000-11-11 信息编码和解码的方法和设备,记录介质及其制作方法
EP00973254A EP1332561A4 (fr) 2000-11-11 2000-11-11 Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module
AU2001211783A AU2001211783A1 (en) 2000-11-11 2000-11-11 Method and apparatus for coding information, method and apparatus for decoding coded information, method of fabricating a recording medium, the recording mediumand modulated signal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/KR2000/001292 WO2002041500A1 (fr) 2000-11-11 2000-11-11 Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module

Publications (1)

Publication Number Publication Date
WO2002041500A1 true WO2002041500A1 (fr) 2002-05-23

Family

ID=19198294

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2000/001292 WO2002041500A1 (fr) 2000-11-11 2000-11-11 Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module

Country Status (5)

Country Link
EP (1) EP1332561A4 (fr)
JP (1) JP4095440B2 (fr)
CN (1) CN100474782C (fr)
AU (1) AU2001211783A1 (fr)
WO (1) WO2002041500A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2007072277A2 (fr) * 2005-12-19 2007-06-28 Koninklijke Philips Electronics N.V. Codeur et procede permettant de coder des codes avec une attribution de mot complementaire de parite ayant une limitation de d=1, r=2
US7403138B2 (en) 2004-09-15 2008-07-22 Koninklijke Philips Electronics N.V. Coder and a method of coding for codes having a Repeated Maximum Transition Run constraint of 2

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4413251A (en) * 1981-07-16 1983-11-01 International Business Machines Corporation Method and apparatus for generating a noiseless sliding block code for a (1,7) channel with rate 2/3
US5047767A (en) * 1990-05-21 1991-09-10 Eastman Kodak Company Apparatus utilizing a four state encoder for encoding and decoding A sliding block (1,7) code
US5923629A (en) * 1997-11-06 1999-07-13 Caleb Technology Corporation Magnetic recording encoder system for a (1,7) channel having a 2/3 coding rate

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
HU221085B1 (hu) * 1994-02-15 2002-07-29 Koninklijke Philips Electronics N.V. Eljárás m-bites adatszavak modulált jellé való átalakítására, valamint kódoló és dekódoló készülékek, megfelelő jellel és adathordozóval
TW362305B (en) * 1996-10-18 1999-06-21 Koninkl Philips Electronics Nv Apparatus and method for converting a sequence of m-bit information words into a modulated signal
TWI268047B (en) * 2000-03-22 2006-12-01 Lg Electronics Inc Method and apparatus for coding information, method and apparatus for decoding coded information, method of fabricating a recording medium, the recording medium and modulated signal

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4413251A (en) * 1981-07-16 1983-11-01 International Business Machines Corporation Method and apparatus for generating a noiseless sliding block code for a (1,7) channel with rate 2/3
US5047767A (en) * 1990-05-21 1991-09-10 Eastman Kodak Company Apparatus utilizing a four state encoder for encoding and decoding A sliding block (1,7) code
US5923629A (en) * 1997-11-06 1999-07-13 Caleb Technology Corporation Magnetic recording encoder system for a (1,7) channel having a 2/3 coding rate

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7403138B2 (en) 2004-09-15 2008-07-22 Koninklijke Philips Electronics N.V. Coder and a method of coding for codes having a Repeated Maximum Transition Run constraint of 2
WO2007072277A2 (fr) * 2005-12-19 2007-06-28 Koninklijke Philips Electronics N.V. Codeur et procede permettant de coder des codes avec une attribution de mot complementaire de parite ayant une limitation de d=1, r=2
WO2007072277A3 (fr) * 2005-12-19 2007-10-18 Koninkl Philips Electronics Nv Codeur et procede permettant de coder des codes avec une attribution de mot complementaire de parite ayant une limitation de d=1, r=2
US7791507B2 (en) 2005-12-19 2010-09-07 Koninklijke Philips Electronics N.V. Coder and a method of coding for codes with a parity-complementary word assignment having a constraint of d=1 , r=2

Also Published As

Publication number Publication date
CN1423860A (zh) 2003-06-11
JP2004514367A (ja) 2004-05-13
EP1332561A1 (fr) 2003-08-06
JP4095440B2 (ja) 2008-06-04
EP1332561A4 (fr) 2005-11-09
CN100474782C (zh) 2009-04-01
AU2001211783A1 (en) 2002-05-27

Similar Documents

Publication Publication Date Title
US4501000A (en) Method of coding binary data
US7592931B2 (en) Method and apparatus for coding information, method and apparatus for decoding coded information, method of fabricating a recording medium, the recording medium and modulated signal
US5790056A (en) Method of converting a series of m-bit information words to a modulated signal, method of producing a record carrier, coding device, device, recording device, signal, as well as a record carrier
WO1996019044A1 (fr) Procede de codage de donnees et procede de decodage de donnees
US5633632A (en) Data conversion method and apparatus imbedding pilot signal into converted data and reducing error propagation between datawords
US5196848A (en) Code modulation system using modulated data code tables
US6639524B2 (en) Method and apparatus for coding information, method and apparatus for decoding coded information, method of fabricating a recording medium, the recording medium and modulated signal
JP2000502545A (ja) ｍビット情報ワードのシーケンスから変調信号への変換
EP1332561A1 (fr) Procede et appareil de codage d'information, procede et appareil de decodage d'information, procede de fabrication d'un support d'enregistrement, le support d'enregistrement et signal module
US20020009005A1 (en) Device for encoding a stream of databits of a binary source signal into a stream of databits of a binary channel signal, memory means, device for recording information, record carrier, device for coding and device for playing back
KR100575638B1 (ko) 정보 코딩을 위한 장치 및 방법과, 그 코딩된 정보를디코딩하기 위한 장치 및 방법과, 변조 신호 및 기록 매체제조방법
KR100575658B1 (ko) 정보 코딩을 위한 장치 및 방법
KR100470026B1 (ko) 정보를 코딩/디코딩하는 방법 및 장치
KR100945183B1 (ko) 정보어의 신호로의 변환 시스템
TW472464B (en) Method and apparatus for coding information, method and apparatus for decoding coded information, method of fabricating a recording medium, the recording medium and modulated signal
KR100752880B1 (ko) 정보를 코딩/디코딩하는 방법 및 장치
CA2458540A1 (fr) Procede et dispositif de codage
JP2006129506A (ja) 情報の符号化のための装置及び方法、その符号化された情報を復号するための装置及び方法、変調信号及び記録媒体の製造方法
JP2000307431A (ja) 変調装置及び復調装置

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

WWE Wipo information: entry into national phase

Ref document number: 1020027008286

Country of ref document: KR

ENP Entry into the national phase

Ref country code: JP

Ref document number: 2002 543791

Kind code of ref document: A

Format of ref document f/p: F

WWE Wipo information: entry into national phase

Ref document number: 00818304X

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2000973254

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1020027008286

Country of ref document: KR

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWP Wipo information: published in national office

Ref document number: 2000973254

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWG Wipo information: grant in national office

Ref document number: 1020027008286

Country of ref document: KR