US4760378A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for converting a run length limited code
Assignee: Panasonic Holdings Corp
•
Filing: 1985-04-03
•
Granted: 1988-07-26
•
Expires: 2005-04-03
Abstract
Abstract A systematic method and apparatus for constructing a run length limited code in which the minimum number of continuous bits of the same binary value is constrained to d and the maximum number thereof is constrained to k. In converting m-bit data words to n-bit code words (n>m) to construct the run length limited code, selection means for n-bit code words usable to meet the d, k-constraint and a concatenation rule of the code words selected by the selection means are introduced. The selection means divides each of 2 n n-bit bit sequences into a leading block L having l continuous bits of the same binary value, an end block R having γ continuous bits of the same binary value and an intermediate block B having b(=n-l-γ) bits between the blocks L and R. Only those n-bit bit sequences in which the blocks B thereof completely meet the d, k-constraint and the blocks L and R thereof meet conditions uniquely defined for given d and k are used as the code words. Consequently, a systematic method for constructing the run length limited code is provided.
Inventors
- 👤 Akira Iketani
- 👤 Chojuro Yamamitsu
- 👤 Kunio Suesada
- 👤 Ichiro Ogura
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 22:11
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426
Claims Analysis
Total Claims: 87
Claim 1
Independent Claim
156 words
A method for generating a run length limited code which meets a d, k-constraint in which the minimum number of continuous bits having the same binary value is limited to d and the maximum number of continuous bits having the same binary value is limited to k, by converting m i -bit data words to n i -bit code words, where 1≦i≦i max , to generate 2 ni n i -bit bit patterns, comprising the steps of: dividing each of said bit patterns into a leading block L having l continuous bits of the same binary value, an end block R having γ continuous bits of the same binary value and an intermediate block B having b(=n i -l-γ) bits between the blocks L and R; and selecting as the n i -bit code words to be used in the m i /n i conversion patterns which perfectly meet the d, k-constraint in the block B.
Claim 2
Independent Claim
156 words
A method for generating a run length limited code which meets a d, k-constraint in which the minimum number of continuous bits having the same binary value is limited to d and the maximum number of continuous bits having the same binary value is limited to k, by converting m i -bit data words to n i -bit code words, where 1≦i≦i max , to generate 2 ni n i -bit bit patterns, comprising the steps of: dividing each of said bit patterns into a leading block L having l continuous bits of the same binary value, an end block R having γ continuous bits of the same binary value and an intermediate block B having b(=n i -l-γ) bits between the blocks L and R; and selecting as the n i -bit code words to be used in the m i /n i conversion patterns which perfectly meet the d, k-constraint in the block B.
Claim 3
Dependent Claim
36 words
A method according to claim 1, wherein d=1 and only code words {C10 i } which meet 1≦l≦x and 1≦γ≦k-x, where 1≦x≦k-1 and the code words {CX11 i } which meet x+1≦l≦k and 1≦γ≦k-x are used.
Claim 4
Dependent Claim
122 words
A method according to claim 2, wherein code words which belong to the code words {CX11 i } and have "1" bits in the block L are represented by {C11 i }, a code word C11 i is called a front pattern, a code word having "1"s in the front code C11 i ε{C11 i } changed to "0"s and "0"s in the front code C11 i ε{C11 i } changed to "1"s is called a back pattern C11 i ε{C11 i }, a data word is assigned to each code word C10 i ε{C10 i } the code words C11 i and its back pattern C11 i ε{C11 i } are paired and a data word is assigned to each pair.
Claim 5
Dependent Claim
85 words
A method according to claim 3, wherein the code words are concatenated in accordance with INV i =LB·F 1 where LB is the binary value of the block R of the first code word, F 1 =0 if the second code word belongs to {C10 i }, F 1 =1 if the second code word belongs to {C11 i }, INV 1 =0 if the second code word is the front pattern and INV 1 =1 if the second code word is the back pattern.
Claim 6
Dependent Claim
222 words
A method according to claim 3, wherein a data word is assigned to each of code words C100 i ε{C100 i } of the code words {C10 i } having zero disparity (DP=0) defined by a difference between the numbers of "1"s and "0"s in the code word, a data word is assigned to each two-word set of a code word C110 i ε{C110 i } having DP=0 of the code words {C11 i } and a back pattern C110 i ε{C110 i } thereof, a data word is assigned to each set of a code word C10P i ε{C10P i } having DP>0 of the code words {C10 i } and a back pattern C10P i ε{C10P i } thereof, a data word is assigned to each two-word set of a code word C10m i ε{C10m i } having DP<0 of the code words {C10 i } and a back pattern C10m i ε{C10m i } thereof, and a data word is assigned to each four-word set of a code word C11P i ε{C11P i } having DP>0 of the code words {C11 i }, a back pattern C11P i ε{C11P i } thereof, a code word C11m i ε{C11m i } having DP<0 of the code words {C11 i } and a back pattern C11m i ε{C11m i } thereof.
Claim 7
Dependent Claim
149 words
A method according to claim 5, wherein the code words are concatenated in accordance with SC.sub.1 =P.sub.1 +(DV⊕LB)·P.sub.2 ·F.sub.1 SC.sub.2 =F.sub.1 ·LB+P.sub.1 +(DV⊕P.sub.2) where LB is the binary value of the bits of the block R of the first code word, DV=0 if DSV 1 ≧0 at the last bit of the first code word, DV=1 if DSV 1 <0, P 1 =1 if DP 2 =0 in the second code word, P 1 =0 if DP 2 ≠0, P 2 =0 if DP 2 >0, P 2 =1 if DP 2 <0, SC1=0 if the second code word belongs to {C100 i }, {C110 i }, {C10P i }, {C10m i } or {C11P i }, SC1=1 if the second code word belongs to {C11m i }, CS2=0 if the second code word is the front pattern and SC2=1 if the second code word is the back pattern.
Claim 8
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=4, m=8, n=10 and x=2.
Claim 9
Dependent Claim
14 words
A method according to claim 7, where only code words haviang |DP|≦2 are used.
Claim 10
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=7, m=9, n=10 and x=3.
Claim 11
Dependent Claim
14 words
A method according to claim 9, wherein only code words having |DP|≦4 are used.
Claim 12
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=7, m=9, n=10 and x=4.
Claim 13
Dependent Claim
14 words
A method according to claim 11, wherein only code words having |DP|≦4 are used.
Claim 14
Dependent Claim
27 words
A method according to claim 6, wherein i max =1, d=1, k=6, m=9, n=10, x=3 and the same code word is assigned only to fine data words.
Claim 15
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=6, m=7, n=8 and x=3.
Claim 16
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=7, m=11, n=12 and x=3.
Claim 17
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=7, m=11, n=12 and x=4.
Claim 18
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=4, m=12, n=14 and x=2.
Claim 19
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=5, m=16, n=18 and x=2.
Claim 20
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=5, m=16, n=18 and x=3.
Claim 21
Dependent Claim
16 words
A method according to claim 6, wherein i max =1, d=1, k=6, m=5, n=6 and x=3.
Claim 22
Dependent Claim
23 words
A method according to claim 4, wherein i max m i /n i conversion code are used to perform m/n conversion where ##EQU9##
Claim 23
Dependent Claim
23 words
A method according to claim 6, wherein i max m i /n i conversion code are used to perform m/n conversion where ##EQU10##
Claim 24
Dependent Claim
13 words
A method according to claim 22, wherein n i is an even number.
Claim 25
Dependent Claim
19 words
A method according to claim 23, wherein divergence of DSV is prevented for each m i /n i conversion.
Claim 26
Dependent Claim
24 words
A method according to claim 24, wherein i max =2, d=1, m 1 =7, n 1 =8, n 2 =9 and n 2 =10.
Claim 27
Dependent Claim
55 words
A method according to claim 25, wherein of a 16-bit data word comprising two 8-bit data words, high order 7 bits of the first data word are 7/8 converted and 9 bits consisting of the least significant bit of the first data word and the 8 bits of the second data word are 9/10 converted.
Claim 28
Dependent Claim
53 words
A method according to claim 26, wherein RLL code having d=1, k=7, m 1 =7, n 1 =8 and x=3 in the m 1 /n 1 conversion and RLL code having m 2 =9 and n 2 =10 in the m 2 /n 2 conversion are used, where d=1, k=7, m=16 and n=18.
Claim 29
Dependent Claim
54 words
A method according to claim 26, wherein RLL code having d=1, k=7, m 1 =7, n 1 =8, x=3 and |DP|≦4 in the m 1 /n 1 conversion and RLL code having m 2 =9 and n 2 =10 in the m 2 /n 2 conversion are used, where d=1, k=7, m=16 and n=18.
Claim 30
Dependent Claim
49 words
A method according to claim 26, wherein RLL code having m 1 =7 and n 1 =8 in the m 1 /n 1 conversion and RLL code having m 2 =9 and n 2 =10 in the m 2 /n 2 conversion used, where d=1, k=7, m=16 and n=18.
Claim 31
Dependent Claim
19 words
A method according to claim 1, wherein only the code words having y≦l≦k-d+1 and d-y≦γ≦k-d+1 where 1≦y≦d-1 are used.
Claim 32
Dependent Claim
72 words
A method according to claim 30, wherein a data word is assigned to each two-word set of a code word C20 i ε{C20 i } having l≦d and starting with "1" and a back pattern C20 i ε{C20 i } thereof, and a data word is assigned to each two-word set of a code word C21 i ε{C21 i } having l≦d and a back pattern C21 i ε{C21 i } thereof.
Claim 33
Dependent Claim
93 words
A method according to claim 31, wherein code words are concatenated in accordance with INV 2 =LB⊕(E 2 ·F 2 ) where LB is the binary value of the bits of the block R of the first code word, E 2 =0 if γ≦d-1 in the first code word, E 2 =1 if γ≧d, F 2 =0 if l≦d-1 in the second code word, F 2 =1 if l≧d, INV 2 =0 if the second code word is the front pattern and INV 2 =1if the second code word is the back pattern.
Claim 34
Dependent Claim
17 words
A method according to claim 32, wherein m i =im min and n i =in min .
Claim 35
Dependent Claim
8 words
A method according to claim 33, wherein d≦3.
Claim 36
Dependent Claim
20 words
A method according to claim 34, wherein i max =6, d=5, k=18, m min =2, n min =5 and y=2.
Claim 37
Dependent Claim
20 words
A method according to claim 34, wherein i max =6, d=5, k=18, m min =2, n min =5 and y=3.
Claim 38
Dependent Claim
19 words
A method according to claim 34, wherein i max =4, d=6, k=16, m min =2 and n min =6.
Claim 39
Dependent Claim
19 words
A method according to claim 34, wherein i max =2, d=3, k=12, m min =8 and n min =15.
Claim 40
Dependent Claim
45 words
A method according to claim 33, wherein when k-2d+2≦in min ≦k-d+1 is met, code words having in min bits of the same binary value in one of the blocks L and R are excluded from the code words having no less than (i+1)n min bits.
Claim 41
Dependent Claim
20 words
A method according to claim 39, wherein i max =5, d=2, k=7, m min =2, n min =3 and y=1.
Claim 42
Dependent Claim
19 words
A method according to claim 33, wherein n min -bit code words are not used when n min <d.
Claim 43
Dependent Claim
20 words
A method according to claim 41, wherein i max =3, d=3, k=8, m min =1, n min =2 and y=2.
Claim 44
Dependent Claim
207 words
A method according to claim 31, wherein a data word is assigned to each two-word set of a code word C200 i ε{C200 i } having DP=0 of the code words {C20 i } and a back pattern C200 i ε{C200 i } thereof, a data word is assigned to each set of a code word C210 i ε{C210 i } having DP=0 of the code words {C21 i } and a back pattern C210 i ε{C210 i } thereof, a data word is assigned to each four-word set of a code word C20P i ε{C20P i } having DP>0 of the code words {C20 i }, a back pattern C20P i ε{C20P i } thereof, a code word C20m i ε{C20m i } having DP<0 of the code words {C20 i } and a back pattern C20m i ε{C20m i } thereof, and a data word is assigned to each four-word set of a code word C21P i ε{C21P i } having DP>0 of the code words {C21 i }, a back pattern C21P i ε{C21P i } thereof, a code word C21m i ε{C21m i } having DP<0 of the code words {C21 i } and a back pattern C21m i ε{C21m i } thereof.
Claim 45
Dependent Claim
127 words
A method according to claim 43, wherein the code words are concatenated in accordance with SC2=LB⊕(E.sub.2 ·F.sub.2) SC1=P·(DV⊕SC2) where LB is the binary value of the bits of the block R of the first code word, DV=0 if DSV 1 ≧0 at the last bit of the first code word, DV=1 if DSV 1 <0 P=0 if DP 2 =0 in the second code word, P=1 if DP 2 ≠0, SC1=0 if the second code words belongs to {C200 i }, {C210 i }, {C20 i } or {C21P i }, SC1=1 if the second code word belongs to {C20m i } or {C21m i }, SC2=0 if the second code word is the front pattern, and SC2=1 if the second code word is the back pattern.
Claim 46
Dependent Claim
15 words
A method according to claim 44, wherein i max =1, d=2, k=8, m=8 and n=14.
Claim 47
Dependent Claim
15 words
A method according to claim 44, wherein i max =1, d=2, k=6, m=9 and n=16.
Claim 48
Dependent Claim
180 words
A method according to claim 44, wherein when a maximum number γ max of continuous bits of the same binary value in the block R of the code word is smaller than k-d+1, a data word is assigned to each four-word set of a code word C20P i ε{C20P i }, a back pattern C20P i ε{C20P i } thereof, a code word C21m0 i ε{C21m0 i } and a back pattern C21m0 i ε{C21m0 i } thereof, for the code words {C21P0 i } and {C21m0 i } having d≦l≦k-n+y, of the code words {C21P i } and {C21m i }, and a data word is assigned to each four-word set of a code word C20m i ε{C20m i }, a back pattern C20m i ε{C20m i } thereof, a code word C21P0 i ε{C21P0 i } and a back pattern C21P0 i ε{C21P0 i } thereof, and the code word {C21P0 i } are included in {C20P i } and the code words {C21m0 i } are included in {C20m i } when the code words are concatenated.
Claim 49
Dependent Claim
15 words
A method according to claim 47, wherein i max =1, d=2, k=9, m=4 and n=8.
Claim 50
Dependent Claim
216 words
A code conversion apparatus for generating a run length limited code which meets a d, k-constraint in which the minimum number of continuous bits having the same binary value is limited to d and the maximum number of continuous bits having the same binary value is limited to k, by converting m i -bit data words to n i -bit code words, where 1≦i≦i max , comprising: code word generation means for generating an n i -bit code word having l continuous bits of the same binary value in a leading block L of the code word, γ continuous bit of the same binary value in an end block R and an intermediate block B consisting of b(=n i -l-γ) bits between the blocks L and R which perfectly meets the d, k-constraint; block R information generation means for generating information about the block R of the first code word in concatenating the first code word and the second code word generated by said code word generation means; second code word information generation means for generating information about the second code word; and second code word selection/modification means for selecting or modifying the second code word in accordance with the information from said block R information generation means and said second code word information generation means.
Claim 51
Dependent Claim
216 words
A code conversion apparatus for generating a run length limited code which meets a d, k-constraint in which the minimum number of continuous bits having the same binary value is limited to d and the maximum number of continuous bits having the same binary value is limited to k, by converting m i -bit data words to n i -bit code words, where 1≦i≦i max , comprising: code word generation means for generating an n i -bit code word having l continuous bits of the same binary value in a leading block L of the code word, γ continuous bit of the same binary value in an end block R and an intermediate block B consisting of b(=n i -l-γ) bits between the blocks L and R which perfectly meets the d, k-constraint; block R information generation means for generating information about the block R of the first code word in concatenating the first code word and the second code word generated by said code word generation means; second code word information generation means for generating information about the second code word; and second code word selection/modification means for selecting or modifying the second code word in accordance with the information from said block R information generation means and said second code word information generation means.
Claim 52
Dependent Claim
29 words
A code conversion apparatus according to claim 49, wherein the code words generated by said code word generation means have 1≦l≦x and 1<γ≦k-x or x+1≦l≦k and 1≦γ≦k-x, where 1≦x≦k-1.
Claim 53
Dependent Claim
97 words
A code conversion apparatus according to claim 50, wherein said block R information generation means includes means for holding the binary value LB of the bits of the block R of the first code word, said second code word information generation means includes means for generating F 1 =0 if l≦x and F 1 =1 if l>x+1, and said second code word selection 1 modification means includes means for calculating F 1 ·LB and means for outputting the second code word as it is if F 1 ·LB=0 and in the front pattern if F 1 ·LB=1.
Claim 54
Dependent Claim
194 words
A code conversion apparatus according to claim 50, wherein said block R information generation means includes means for holding the binary value LB of the bits of the block R of the first code word, said second code word information generation means includes means for generating F 1 =0 if l≦x in the second code word and F 1 =1 if l≧x+1, and said second code word selection/modification means includes means for generating DV=0 if DSV 1 >0 at the last bit of the first code word and DV=1 if DSV 1 <0, means for generating P 1 =1 if DP 2 =0 the disparity of the second code word, P 1 =0 and P 2 =0 if DP 2 >0, and P 1 =0 and P 2 =1 if DP 2 <0, means for calculating SC1=P 1 +(DV⊕LB)·P 2 ·F 1 , means for selecting code word having F 1 =1 and DP 2 <0 is the second code word only when SC1=1, means for calculating SC2=F 1 ·LB+P 1 +(DV⊕P 2 ) and means for outputting the second code word as it is if SC2=0 and in the back pattern if SC2=1.
Claim 55
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=4, m=8, n=10 and x=2.
Claim 56
Dependent Claim
16 words
A code conversion apparatus according to claim 53, wherein only code words having |DP|≦2 are used.
Claim 57
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=7, m=9, n=10 and x=3.
Claim 58
Dependent Claim
16 words
Aa code conversion apparatus according to claim 55, wherein only code words having |DP|≦4 are used.
Claim 59
Dependent Claim
18 words
A code conversion apparatus according to claim 55, wherein i max =1, d=1, k=7, m=9, n=10 and x=4.
Claim 60
Dependent Claim
16 words
A code conversion apparatus according to claim 57, wherein only code words having |DP|≦4 are used.
Claim 61
Dependent Claim
29 words
A code conversion apparatus according to claim 52, wherein i max -1, d=1, k=6, m=9, n=10, x=3 and the same code word is assigned only to five data words.
Claim 62
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=6, m=7, n=8 and x=3.
Claim 63
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=7, m=11, n=12 and x=3.
Claim 64
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1 d=1, k=7, m=11, n=12 and x=4.
Claim 65
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=4, m=12, n=14 and x=2.
Claim 66
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=5, m=16, n=18 and x=2.
Claim 67
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=5, m=16, n=18 and x=3.
Claim 68
Dependent Claim
18 words
A code conversion apparatus according to claim 52, wherein i max =1, d=1, k=6, m=5, n=6 and x=3.
Claim 69
Dependent Claim
26 words
A code conversion apparatus according to claim 52, wherein i max =2, d=1, m 1 =7, n 1 =8, n 2 =9 and n 2 =10.
Claim 70
Dependent Claim
57 words
A code conversion apparatus according to claim 67, wherein of a 16-bit data word comprising two 8-bit data words, high order 7 bits of the first data word are 7/8 converted and 9 bits consisting of the least significant bit of the first data word and the 8 bits of the second data word are 9/10 converted.
Claim 71
Dependent Claim
16 words
A code conversion apparatus according to claim 68, wherein only code words having |DP|≦4 are used.
Claim 72
Dependent Claim
25 words
A code conversion apparatus according to claim 49, wherein the code words generated by said code word generation means have y≦l≦k-d+1 and d-y<γ≦k-d+1 when 1≦y≦d-1.
Claim 73
Dependent Claim
153 words
A code conversion apparatus according to claim 70, wherein said block R information generation means includes means for holding the binary value LB of the bits of the block R of the first code word, means for generating E 2 =0 if γ≦d-1 and E 2 =1 if γ≧d where γ is the number of continuous bits of the same binary value in the block R of the first code word, said second code word information generation means includes means for generating F 2 =0 if l≦d-1 and F 2 =1 if l≧d where l is the number of continuous bits of the same binary value in the block L, and said second code word selection 1 modification means includes means for calculating INV 2 =LB⊕(E 2 ·F 2 ) and outputting the second code word in the front pattern when INV 2 =0 and in the back pattern when INV 2 =1.
Claim 74
Dependent Claim
19 words
A code conversion apparatus according to claim 71, wherein m i =im min and n i =in min .
Claim 75
Dependent Claim
22 words
A code conversion apparatus according to claim 72, wherein i max =6, d=5, k=18, m min =2, n min =5 and y=2.
Claim 76
Dependent Claim
23 words
A code conversion apparatus according to claim 72, wherein i max =6, d=5, k=18, m min =2 and n min =5 and y=3.
Claim 77
Dependent Claim
21 words
A code conversion apparatus according to claim 72, wherein i max =4, d=6, k=16, m min =2 and n min =6.
Claim 78
Dependent Claim
21 words
A code conversion apparatus according to claim 72, wherein i max =2, d=3, k=12, m min =8 and n min =15.
Claim 79
Dependent Claim
50 words
A code conversion apparatus according to claim 72, wherein when in min ≦MAX{k-d+1+y-n min , k-2(d-1)+1} is met, code words having in min bits of the same binary value in one of the blocks L and R are excluded from the code words having no less than (i+1)n min bits.
Claim 80
Dependent Claim
22 words
A code conversion apparatus according to claim 77, wherein i max =5, d=2, k=7, m min =2, n min =3 and y=1.
Claim 81
Dependent Claim
21 words
A code conversion apparatus according to claim 72, wherein n min -bit code words are not used when n min <d.
Claim 82
Dependent Claim
22 words
A code conversion apparatus according to claim 79, wherein i max =3, d=3, k=8, m min =1, n min =2 and y=2.
Claim 83
Dependent Claim
106 words
A code conversion apparatus according to claim 71, wherein said second code word selection/modification means includes means for calculating SC2=LB⊕(E 2 ·F 2 ), means for outputting the second code word in the front pattern when SC2=0 and in the back pattern when SC2=1, means for generating DV=0 when DSV 1 ≧0 at the last bit of the first code word and DV=1 when DSV 1 0, means for generating P=0 when DP=0 in the second code word and P=1 when DP≠0, means for calculating SC1=P·(DV⊕CS2), and means for selecting a code word having DP<0 for the front pattern as the second code word when SC1=1.
Claim 84
Dependent Claim
17 words
A code conversion apparatus according to claim 81, wherein i max =1, d=2, k=8, m=8 and n=14.
Claim 85
Dependent Claim
17 words
A code conversion apparatus according to claim 81, wherein i max =1, d=2, k=6, m=9 and n=16.
Claim 86
Dependent Claim
46 words
A code conversion apparatus according to claim 81, wherein when a maximum number γ max of continuous bits of the same binary value in the block R of the code word is smaller than k-d+1, F 2 =0 is imported to the code word having d≦l≦k=n+y.
Claim 87
Dependent Claim
17 words
A code conversion apparatus according to claim 84, wherein i max =1, d=2, k=9, m=4 and n=8.
References Cited (Backward Citations)
US3689899A
Cited
US4146909A
Cited
US4398225A
Cited
US4501000A
Cited
US4554529A
Cited
US4486739A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1991-07-26 | 1992-01-25 | 1992-07-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-07-26 | 1996-01-25 | 1996-07-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-07-26 | 2000-01-25 | 2000-07-26 | $7700.00 | Window Closed / Lapsed |