US4554529A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for converting binary data train
Assignee: Pioneer Corp
•
Filing: 1982-10-28
•
Granted: 1985-11-19
•
Expires: 2002-10-28
Abstract
Abstract In order to obtain sufficiently long values of T min and T w data conversion, and to reduce the dc or the low frequency component, a method for converting a binary data train comprises a first step for dividing the binary data train into a plurality of successive blocks each having M (M being a natural number) bit data, a second step for converting the M bit data into N (N being a natural number, and where N≧M+1), and a third step for converting the N bit data in every L (L being a natural number) blocks into J (J being a natural number) bit data.
Inventors
- 👤 Yoshiaki Moriyama
- 👤 Kenji Yamagata
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 20:31
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426; H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
237 words
A method for converting a binary data train into recording data and recording the same on a recording medium comprising: a first step for dividing said binary data train into a plurality of successive M-bit (M being a natural number) data blocks; a second step for converting each of said M-bit data blocks into an N-bit (N being a natural number and N≧M+1) data block, said N-bit data block being one of a plurality of bit patterns corresponding respectively to bit patterns of said M-bit data blocks; a third step for converting a predetermined data block in every L (L being a natural number) data blocks of said N-bit data block into a J-bit (J being a natural number and J≧N+1) data block, said J-bit data block being one of a plurality of bit patterns corresponding to said bit patterns of N-bit data block; and a step for recording a recording signal obtained through the data conversion of said first through third steps on a recording medium; wherein at least a predetermined bit pattern of said N-bit data block corresponds to at least two bit patterns of said J-bit data block, and said third step includes a step for selecting one of said at least two bit patterns of J-bit data block corresponding to said predetermined bit pattern of the N-bit data block so that the dc and low frequency components of said recording signal are minimized.
Claim 2
Independent Claim
237 words
A method for converting a binary data train into recording data and recording the same on a recording medium comprising: a first step for dividing said binary data train into a plurality of successive M-bit (M being a natural number) data blocks; a second step for converting each of said M-bit data blocks into an N-bit (N being a natural number and N≧M+1) data block, said N-bit data block being one of a plurality of bit patterns corresponding respectively to bit patterns of said M-bit data blocks; a third step for converting a predetermined data block in every L (L being a natural number) data blocks of said N-bit data block into a J-bit (J being a natural number and J≧N+1) data block, said J-bit data block being one of a plurality of bit patterns corresponding to said bit patterns of N-bit data block; and a step for recording a recording signal obtained through the data conversion of said first through third steps on a recording medium; wherein at least a predetermined bit pattern of said N-bit data block corresponds to at least two bit patterns of said J-bit data block, and said third step includes a step for selecting one of said at least two bit patterns of J-bit data block corresponding to said predetermined bit pattern of the N-bit data block so that the dc and low frequency components of said recording signal are minimized.
Claim 3
Dependent Claim
148 words
A method as recited in claim 1, wherein said M-bit data block and said N-bit data block are respectively a 2-bit data block and a 3-bit data block, and data of said 2-bit data block comprises a first data, a second data, a third data, and a fourth data, and wherein said first step comprises a step for converting said first, second, third, and fourth data into binary bit patterns of "010", "001", "100", and "101", respectively, when each adjacent two data blocks of said M-bit data block are not any one of combinations of "second data.third data", "second data.fourth data", "fourth data.third data", and "fourth data.fourth data", and when said adjacent two data blocks are one of said combinations, converting said one of said combinations into corresponding one of binary bit patterns of "010·000", "001·000", "100·000", and "101·000" which are, respectively, corresponding to each of said combinations.
Claim 4
Dependent Claim
25 words
A method as recited in claim 2, wherein said first, second, third and fourth data are bit patterns of "00", "01", "10", and "11" respectively.
Claim 5
Dependent Claim
79 words
A method as recited in claim 1 wherein said N-bit data block and J-bit data block are a 3-bit data block and a 4-bit data block, respectively, and wherein said third step comprises a step for converting bit patterns of "010", "001", "100", "000", and "101" of said 3-bit data block into bit patterns of one of "0010" and "0000", one of "0101" and "0001", one of "1010" and "1000", "0100", and "1001", of said 4-bit data block respectively.
Claim 6
Dependent Claim
90 words
A method as recited in claim 1, wherein said N-bit data block and said J-bit block are a 3-bit data block and a 5-bit data block respectively, and wherein said third step comprises a step for converting bit patterns of "010", "001", "100", "000", and "101" of said 3-bit data block into bit patterns of one of "01010", "00010" and "01000", one of "00101", "01001" and "00001", one of "10100", "10010" and "10000", one of "00100" and "00000", and one of "10101" and "10001" of said 5-bit data block respectively.
Claim 7
Independent Claim
164 words
A method for converting a binary data train into recording data and recording the same on a recording medium comprising: a first step for dividing said binary data train into a plurality of successive 2-bit data blocks respectively consisting of any one of first, second, third, and fourth data; a second step for converting said first, second, third and fourth data of said 2-bit data blocks respectively into bit patterns of "010", "001", "100" and "101" when each adjacent two of said 2-bit data blocks are not combinations of "second data.third data", "second data.fourth data", "fourth data.third data", and "fourth data.fourth data", and when said adjacent two of said 2-bit data block are any one of said combinations, converting said one of said combinations into a corresponding one of binary bit patterns "010·000", "001·000", "100·000" and "101·000" which correspond to each of said combinations respectively; and recording a recording signal obtained through a conversion of said first and second steps, on a recording medium.
Claim 8
Independent Claim
164 words
A method for converting a binary data train into recording data and recording the same on a recording medium comprising: a first step for dividing said binary data train into a plurality of successive 2-bit data blocks respectively consisting of any one of first, second, third, and fourth data; a second step for converting said first, second, third and fourth data of said 2-bit data blocks respectively into bit patterns of "010", "001", "100" and "101" when each adjacent two of said 2-bit data blocks are not combinations of "second data.third data", "second data.fourth data", "fourth data.third data", and "fourth data.fourth data", and when said adjacent two of said 2-bit data block are any one of said combinations, converting said one of said combinations into a corresponding one of binary bit patterns "010·000", "001·000", "100·000" and "101·000" which correspond to each of said combinations respectively; and recording a recording signal obtained through a conversion of said first and second steps, on a recording medium.
Claim 9
Dependent Claim
25 words
A method as recited in claim 6, wherein said first, second, third, and fourth data are bit patterns of "00", "01", "10", and "11", respectively.
References Cited (Backward Citations)
US3564557A
Cited
US4352129A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-11-18 | 1989-05-20 | 1989-11-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-11-18 | 1993-05-20 | 1993-11-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-11-18 | 1997-05-20 | 1997-11-19 | $7700.00 | Window Closed / Lapsed |