US5537112A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for implementing run length limited codes in partial response channels
Assignee: Seagate Technology LLC
•
Filing: 1994-01-12
•
Granted: 1996-07-16
•
Expires: 2014-01-12
Abstract
Abstract A method apparatus for encoding segments having a selected number of ordered bits of binary data from a sequence of ordered bits of binary data into corresponding codewords having a selected number of ordered bits of binary data, such that the sequence of ordered bits of binary data is encoded into a sequence of codewords. The apparatus comprises a receiver device for receiving the segments; a separating device for separating the selected number of ordered bits of binary data of each segment into a corresponding first group and a corresponding second group; an encoder mapping device for mapping each first group into a corresponding word having a selected number of ordered bits of binary data; and an interleaving device for interleaving the bits of each corresponding second group with the selected number of ordered bits of binary data of each corresponding word to obtain the corresponding codewords.
Inventors
- 👤 Kinhing P. Tsang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 21:08
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426; G06; G06T; G06T9/00; G06T9/005; H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; G11B20/10009; G11B2020/143; G11B2020/1434; G11B2020/1446
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
263 words
An apparatus for encoding segments having a selected number of ordered bits of binary data, from a sequence of ordered bits of binary data into corresponding codewords, having a selected number of ordered bits of binary data, such that the sequence of ordered bits of binary data is encoded into a corresponding sequence of codewords, the apparatus comprising: receiver means for receiving the segments; separating means for separating the selected number of ordered bits of binary data of each segment into a corresponding first group and a corresponding second group; encoder mapping means for mapping each first group into a corresponding word having a selected number of ordered bits of binary data; and interleaving means for interleaving the bits of each corresponding second group with the selected number of ordered bits of binary data of each corresponding word to obtain codewords corresponding to the segments, such that (a) each codeword has no more than a first preselected number of consecutive zeros therein, (b) adjacent codewords in the sequence of codewords have no more than the first preselected number of consecutive zeros across the boundary therebetween, (c) each codeword comprises two subsequences, one subsequence consisting only of every other bit of the selected number of ordered bits of binary data of the codeword and another subsequence consisting only of the remaining bits with each of the subsequences having no more than a second preselected number of consecutive zeros therein, and (d) adjacent subsequences of codewords within the sequence of codewords have no more that the second preselected number of zeros across the boundary therebetween.
Claim 2
Independent Claim
263 words
An apparatus for encoding segments having a selected number of ordered bits of binary data, from a sequence of ordered bits of binary data into corresponding codewords, having a selected number of ordered bits of binary data, such that the sequence of ordered bits of binary data is encoded into a corresponding sequence of codewords, the apparatus comprising: receiver means for receiving the segments; separating means for separating the selected number of ordered bits of binary data of each segment into a corresponding first group and a corresponding second group; encoder mapping means for mapping each first group into a corresponding word having a selected number of ordered bits of binary data; and interleaving means for interleaving the bits of each corresponding second group with the selected number of ordered bits of binary data of each corresponding word to obtain codewords corresponding to the segments, such that (a) each codeword has no more than a first preselected number of consecutive zeros therein, (b) adjacent codewords in the sequence of codewords have no more than the first preselected number of consecutive zeros across the boundary therebetween, (c) each codeword comprises two subsequences, one subsequence consisting only of every other bit of the selected number of ordered bits of binary data of the codeword and another subsequence consisting only of the remaining bits with each of the subsequences having no more than a second preselected number of consecutive zeros therein, and (d) adjacent subsequences of codewords within the sequence of codewords have no more that the second preselected number of zeros across the boundary therebetween.
Claim 3
Dependent Claim
18 words
The apparatus as in claim 1, wherein the first and second preselected number of consecutive zeros is six.
Claim 4
Dependent Claim
25 words
The apparatus as in claim 1, wherein the first preselected number of consecutive zeros is eight and the second preselected number of zeros is six.
Claim 5
Dependent Claim
37 words
The apparatus as in claim 1, wherein the ratio of the selected number of bits of binary data in each segment to the selected number of ordered bits of binary data in each corresponding codeword is 16/17.
Claim 6
Dependent Claim
23 words
The apparatus as in claim 1, wherein the selected number of bits of binary data in the first and second groups is eight.
Claim 7
Dependent Claim
29 words
The apparatus as in claim 5, wherein the encoder mapping means maps the first group of eight bits of binary data into words having nine bits of binary data.
Claim 8
Dependent Claim
31 words
The apparatus as in claim 1, wherein the selected number of bits in the first group is nine and wherein the selected number of bits in the second group is seven.
Claim 9
Dependent Claim
29 words
The apparatus as in claim 7, wherein the encoder mapping means maps the first group of nine bits of binary data into words having ten bits of binary data.
Claim 10
Dependent Claim
26 words
The apparatus as in claim 1, further comprising decoder means for decoding a selected number of codewords into a selected number of bits of binary data.
Claim 11
Dependent Claim
67 words
The apparatus as in claim 9, wherein the decoder means comprises: receiver means for receiving the sequence of codewords; decoder separating means for separating the selected number of ordered bits of binary data of each codeword back into the corresponding word and into the second group; and decoder mapping means for mapping each corresponding word back into the first group; such that the corresponding segment is formed.
Claim 12
Independent Claim
247 words
A method for encoding a segments having a selected number of ordered bits of binary data, from a sequence of ordered bits of binary data into corresponding codewords, having a selected number of ordered bits of binary data, such that the sequence of ordered bits of binary data is encoded into a sequence of codewords, the method comprising: receiving the segments; separating the selected number of ordered bits of binary data of each segment into a corresponding first group and a corresponding second group; mapping each first group into a corresponding word having a selected number of ordered bits of binary data; and interleaving the bits of each corresponding second group with the selected number of ordered bits of binary data of each corresponding word to obtain codewords corresponding to the segments, such that (a) each codeword has no more than a first preselected number of consecutive zeros therein, (b) adjacent codewords in the sequence of codewords have no more than the first preselected number of consecutive zeros therebetween, (c) each codeword comprises two subsequences, one subsequence consisting only of every other bit of the selected number of ordered bits of binary data of the codeword and another subsequence consisting only of the remaining bits with each of the subsequences having no more than a second preselected number of consecutive zeros therein, and (d) adjacent subsequences of codewords within the sequence of codewords have no more that the second preselected number of zeros across the boundary therebetween.
Claim 13
Independent Claim
247 words
A method for encoding a segments having a selected number of ordered bits of binary data, from a sequence of ordered bits of binary data into corresponding codewords, having a selected number of ordered bits of binary data, such that the sequence of ordered bits of binary data is encoded into a sequence of codewords, the method comprising: receiving the segments; separating the selected number of ordered bits of binary data of each segment into a corresponding first group and a corresponding second group; mapping each first group into a corresponding word having a selected number of ordered bits of binary data; and interleaving the bits of each corresponding second group with the selected number of ordered bits of binary data of each corresponding word to obtain codewords corresponding to the segments, such that (a) each codeword has no more than a first preselected number of consecutive zeros therein, (b) adjacent codewords in the sequence of codewords have no more than the first preselected number of consecutive zeros therebetween, (c) each codeword comprises two subsequences, one subsequence consisting only of every other bit of the selected number of ordered bits of binary data of the codeword and another subsequence consisting only of the remaining bits with each of the subsequences having no more than a second preselected number of consecutive zeros therein, and (d) adjacent subsequences of codewords within the sequence of codewords have no more that the second preselected number of zeros across the boundary therebetween.
Claim 14
Dependent Claim
18 words
The method as in claim 11, wherein the first and second preselected number of consecutive zeros is six.
Claim 15
Dependent Claim
25 words
The method as in claim 11, wherein the first preselected number of consecutive zeros is eight and the second preselected number of zeros is six.
Claim 16
Dependent Claim
36 words
The method as in claim 11, wherein the ratio of the selected number of bits of binary data of each segment to the selected number of ordered bits of binary data in each codeword is 16/17.
Claim 17
Dependent Claim
23 words
The method as in claim 11, wherein the selected number of bits of binary data in the first and second groups is eight.
Claim 18
Dependent Claim
26 words
The method as in claim 15, wherein the first group of eight bits of binary data is mapped into words having nine bits of binary data.
Claim 19
Dependent Claim
31 words
The method as in claim 11, wherein the selected number of bits in the first group is nine and wherein the selected number of bits in the second group is seven.
Claim 20
Dependent Claim
26 words
The method as in claim 17, wherein the first group of nine bits of binary data is mapped into words having ten bits of binary data.
Claim 21
Dependent Claim
26 words
The method as in claim 11, further comprising the step of decoding a selected number of codewords into a selected number of bits of binary data.
Claim 22
Dependent Claim
83 words
The method as in claim 19, wherein the step of decoding further comprises: receiving the sequence of codewords; separating the selected number of ordered bits of binary data of each codeword back into the word having a selected number of ordered bits of binary data and back into the second group of the selected number of bits of binary data; and mapping the first group of selected the word back into the first group of the selected number of bits of binary data.
References Cited (Backward Citations)
US4544962A
Cited
US4707681A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-07-16 | 2000-01-15 | 2000-07-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-07-16 | 2004-01-15 | 2004-07-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-07-16 | 2008-01-15 | 2008-07-16 | $7700.00 | Window Closed / Lapsed |