← Back to Patent Explorer
US4833470A Expired / Lapsed US ⏱️ 0.0 years remaining

Code conversion apparatus

Assignee: Panasonic Holdings Corp
•
Filing: 1987-07-14
•
Granted: 1989-05-23
•
Expires: 2007-07-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Each of data words has m bits. The m-bit data words are converted into corresponding n-bit code words. The n-bit code words are concatenated to form a bit sequence where the number of successive bits having a same binary value is limited to a range of a smaller value d to a larger value k. A code work W1 and also a following code word W2 are controlled to satisfy the limitation defined by the values d and k. The number of different code words forming an RLL code system is relatively large. For example, in respect of a first available RLL code word system, 8-bit data words are directly converted into 12-bit code words (Tw=0.667T) and the limitation defined by the values d and k equal to 2 and 10 respectively are satisfied. In respect of a second available RLL code word system, 6-bit data words are directly converted into 9-bit code words (Tw=0.667T) and the limitation defined by the values d and k equal to 2 and 23 respectively are satisfied.

Inventors

  • 👤 Akira Iketani

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 18:52
CPC Classifications
H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 138 words
A code conversion apparatus for generating run length limited codes wherein m-bit data words are converted into n-bit code words which are concatenated to form a bit sequence where a number of successive bits having a same binary value is limited to a range of a smaller value d to a larger value k, the apparatus comprising: (a) means for classifying the code words into groups corresponding to the respective data words, wherein each of the groups includes at least one code word and any code words in respective different groups are different from each other; and (b) means for correcting selection of a code word W1 from a group containing the code word W1 in accordance with only selection of a code word W2, following the code word W1, from a group containing the code word W2.
Claim 2
Dependent Claim 138 words
A code conversion apparatus for generating run length limited codes wherein m-bit data words are converted into n-bit code words which are concatenated to form a bit sequence where a number of successive bits having a same binary value is limited to a range of a smaller value d to a larger value k, the apparatus comprising: (a) means for classifying the code words into groups corresponding to the respective data words, wherein each of the groups includes at least one code word and any code words in respective different groups are different from each other; and (b) means for correcting selection of a code word W1 from a group containing the code word W1 in accordance with only selection of a code word W2, following the code word W1, from a group containing the code word W2.
Claim 3
Dependent Claim 236 words
A code coversion apparatus for generating run length limited codes wherein m-bit data words are converted into n-bit code words which are concatenated to form a bit sequence where a number of successive bits having a same binary value is limited to a range of a smaller value d to a larger value k, the apparatus comprising: (a) first generation means for generating an n-bit code word W2a corresponding to an inputted m-bit data word; (b) second generation mean for generating an n-bit code word W2b corresponding to the inputted m-bit data word; (c) first replacement means for replacing the code word W2a by a code word W2a' in accordance with information related to a code word W1 preceding the code word W2 and with information related to the code word W2a, wherein the code word W2a' is precombined with the code word W2a; (d) second replacement means for replacing the code word W2b by a code word W2b' precombined with the code word W2b; (e) first delay means for delaying the code word W2a or 22a'; (f) second delay means for delaying the code word W2b or W2b'; and (g) means for selecting one of code words outputted from the first and second delay means in accordance with information related to the code word outputted from the first delay mean and with information related to the code word W2a outputted from the first generation means.
Claim 4
Dependent Claim 236 words
A code coversion apparatus for generating run length limited codes wherein m-bit data words are converted into n-bit code words which are concatenated to form a bit sequence where a number of successive bits having a same binary value is limited to a range of a smaller value d to a larger value k, the apparatus comprising: (a) first generation means for generating an n-bit code word W2a corresponding to an inputted m-bit data word; (b) second generation mean for generating an n-bit code word W2b corresponding to the inputted m-bit data word; (c) first replacement means for replacing the code word W2a by a code word W2a' in accordance with information related to a code word W1 preceding the code word W2 and with information related to the code word W2a, wherein the code word W2a' is precombined with the code word W2a; (d) second replacement means for replacing the code word W2b by a code word W2b' precombined with the code word W2b; (e) first delay means for delaying the code word W2a or 22a'; (f) second delay means for delaying the code word W2b or W2b'; and (g) means for selecting one of code words outputted from the first and second delay means in accordance with information related to the code word outputted from the first delay mean and with information related to the code word W2a outputted from the first generation means.
Claim 5
Dependent Claim 22 words
The apparatus of claim 2 wherein the values d, k, m, and n are equal to 2, 10, 8, and 12 respectively.
Claim 6
Dependent Claim 22 words
The apparatus of claim 2 wherein the values d, k, m, and n are equal to 2, 12, 6, and 9 respectively.
Claim 7
Dependent Claim 33 words
The apparatus of claim 2 wherein output of the selecting means consists of the output from the first generation means when there is a single code word corresponding to the inputted data word.
Claim 8
Dependent Claim 36 words
The apparatus of claim 2 wherein output of the selecting means consists of the output from the first replacement means when there are only two code words W2a and W2a' corresponding to the inputted data word.
Claim 9
Dependent Claim 40 words
The apparatus of claim 2 wherein output of the selecting means consists of one of the outputs from the first and second generation means when there are only two code words W2a and W2b corresponding to the inputted data word.
Claim 10
Dependent Claim 93 words
The apparatus of claim 2 further comprising: (a) means for inserting a synchronous pattern allowing block synchronization; (b) means for dividing the n-bit code word into first and second sub code words; (c) first preliminary coding means for generating information identifying the first sub code word; (d) second preliminary coding means for generating information identifying the second sub code word; and (e) final coding means for deriving a m-bit data word, corresponding to the n-bit code word inputted into the dividing means, from the outputs of the first and second preliminary coding means.
Claim 11
Dependent Claim 116 words
The apparatus of claim 8 wherein code words of a first type are used to correspond to data words and code words of a second type are used as synchronous patterns, wherein an absolute value of a difference between a number of bits having a binary value 1 and a number of bits having a binary value 0 is equal to or smaller than 6 in each of the first type code words, and wherein an absolute value of a difference between a number of bits having a binary value 1 and a number of bits having a binary value 0 is equal to or greater than 8 in each of the second type code words.
Claim 12
Dependent Claim 110 words
A code conversion apparatus for generating run length limited codes wherein data words are converted into code words which are concatenated to form a bit sequence where a number of successive bits having a same binary value is limited to a preset range, the apparatus comprising: (a) means for generating a group of signals representing respective code words corresponding to a first data word; (b) means for generating a signal representing a code word corresponding to a second data word following the first data word; and (c) means for selecting one of the signals in the group in accordance with only the code word corresponding to the second data word.
Claim 13
Dependent Claim 110 words
A code conversion apparatus for generating run length limited codes wherein data words are converted into code words which are concatenated to form a bit sequence where a number of successive bits having a same binary value is limited to a preset range, the apparatus comprising: (a) means for generating a group of signals representing respective code words corresponding to a first data word; (b) means for generating a signal representing a code word corresponding to a second data word following the first data word; and (c) means for selecting one of the signals in the group in accordance with only the code word corresponding to the second data word.

References Cited (Backward Citations)

US3689899A Cited
US3852687A Cited
US4486739A Cited
US4598326A Cited
US4677421A Cited
US4688016A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-05-22 1992-11-21 1993-05-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-05-22 1996-11-21 1997-05-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-05-22 2000-11-21 2001-05-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag