US5844507A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Rate 16/17 ENDEC with independent high/low byte decoding
Assignee: LAKE CHEROKEE HARD DRIVE TECHNOLOGIES LLC
•
Filing: 1997-10-15
•
Granted: 1998-12-01
•
Expires: 2017-10-15
Abstract
Abstract A rate 16/17 ENDEC is disclosed which encodes 16 bit input data words into 17 bit codewords according to at least one predetermined code constraint, such as an RLL (d,k) constraint. The encoder encodes the high and low byte of the input data word using the same mapping circuitry which reduces its cost and complexity. The codewords are transferred through a communication channel, such as a computer disc storage device, and upon reception (or readback) the first 8 bits of the 17 bit codeword are decoded independent from the last 8 bits which prevents error propagation. That is, the first 8 bits of the codeword are decoded into a high byte of the decoded data word, and the last 8 bits of the codeword are decoded into a low byte of the decoded data word independent from one another. Thus, errors that occur in the received data sequence which affect only the first 8 bits of the codeword will not propagate to the decoded low byte, and errors affecting only the last 8 bits of the codeword will not propagate to the decoded high byte. Furthermore, the decoder uses the same mapping circuitry to decode the low and high byte of the output data words, thereby reducing its cost and complexity.
Inventors
- 👤 Christopher P. Zook
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 21:43
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0057; G; G11; G11B; G11B20/00; G11B20/10; G11B20/10009; G11B20/10046; G11B20/10055; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; H04L1/0045; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
151 words
A m/n ENDEC for decoding a n-bit codeword into a m-bit data word, comprising a decoder for decoding a predetermined first number of bits out of the n-bit codeword into a first symbol of the data word and for decoding a predetermined second number of bits out of the n-bit codeword into a second symbol of the data word, wherein: (a) the decoder decodes the first symbol of the data word independent from decoding the second symbol of the data word, and the decoder decodes the second symbol of the data word independent from decoding the first symbol of the data word; and (b) errors in decoding the first symbol of the data word do not induce errors in decoding the second symbol of the data word, and errors in decoding the second symbol of the data word do not induce errors in decoding the first symbol of the data word.
Claim 2
Dependent Claim
151 words
A m/n ENDEC for decoding a n-bit codeword into a m-bit data word, comprising a decoder for decoding a predetermined first number of bits out of the n-bit codeword into a first symbol of the data word and for decoding a predetermined second number of bits out of the n-bit codeword into a second symbol of the data word, wherein: (a) the decoder decodes the first symbol of the data word independent from decoding the second symbol of the data word, and the decoder decodes the second symbol of the data word independent from decoding the first symbol of the data word; and (b) errors in decoding the first symbol of the data word do not induce errors in decoding the second symbol of the data word, and errors in decoding the second symbol of the data word do not induce errors in decoding the first symbol of the data word.
Claim 3
Dependent Claim
31 words
The m/n ENDEC as recited in claim 1, wherein the decoder operates according to the same decoding logic when decoding the first symbol and the second symbol of the data word.
Claim 4
Dependent Claim
17 words
The m/n ENDEC as recited in claim 1, wherein the decoder operates according to Table 5 above.
Claim 5
Dependent Claim
51 words
The m/n ENDEC as recited in claim 1, further comprising: (a) a means for interrogating a mapping bit out of the n-bit codeword; and (b) a means for selectively decoding the first symbol of the data word and the second symbol of the data word in response to the mapping bit.
Claim 6
Dependent Claim
26 words
The m/n ENDEC as recited in claim 1, further comprising a bit-wise reverse circuit for bit-wise reversing a predetermined number of the codeword bits before decoding.
Claim 7
Dependent Claim
24 words
The m/n ENDEC as recited in claim 1, wherein the decoder decodes 9 bits of the codeword into 8 bits of the data word.
Claim 8
Dependent Claim
21 words
The m/n ENDEC as recited in claim 4, wherein n=17 and the mapping bit is a middle bit of the codeword.
Claim 9
Dependent Claim
37 words
The m/n ENDEC as recited in claim 7, further comprising a means for encoding the user data such that a non-zero sample value occurs in both interleaves of a received data stream of codewords within k bits.
Claim 10
Independent Claim
96 words
A method for decoding a n-bit codeword into a m-bit data word, comprising the steps of: (a) first decoding a predetermined first number of bits out of the n-bit codeword into a first symbol of the m-bit data word; (b) second decoding a predetermined second number of bits out of the n-bit codeword into a second symbol of the data word, wherein the second decoding operates independent from the first decoding such that errors in decoding the first symbol of the data word do not induce errors in decoding the second symbol of the data word.
Claim 11
Independent Claim
96 words
A method for decoding a n-bit codeword into a m-bit data word, comprising the steps of: (a) first decoding a predetermined first number of bits out of the n-bit codeword into a first symbol of the m-bit data word; (b) second decoding a predetermined second number of bits out of the n-bit codeword into a second symbol of the data word, wherein the second decoding operates independent from the first decoding such that errors in decoding the first symbol of the data word do not induce errors in decoding the second symbol of the data word.
Claim 12
Dependent Claim
20 words
The method as recited in claim 9, wherein the first and second decoding operate according to the same decoding logic.
Claim 13
Dependent Claim
26 words
The method as recited in claim 9, wherein the first and second decoding decode 9 bits of the codeword into 8 bits of the data word.
Claim 14
Dependent Claim
19 words
The method as recited in claim 9, wherein the first and second decoding operate according to Table 5 above.
Claim 15
Dependent Claim
46 words
The method as recited in claim 9, further comprising the steps of: (a) interrogating a mapping bit out of the n-bit codeword; and (b) selectively decoding the first symbol of the data word and the second symbol of the data word in response the mapping bit.
Claim 16
Dependent Claim
21 words
The method as recited in claim 9, further comprising the step of bit-wise reversing a predetermined number of the codeword bits.
Claim 17
Dependent Claim
22 words
The method as recited in claim 13, wherein n=17 and the mapping bit is a middle bit of the 17 bit codeword.
Claim 18
Dependent Claim
36 words
The method as recited in claim 15, further comprising the step of encoding the user data such that a non-zero sample value occurs in both interleaves of a received data stream of codewords within k bits.
References Cited (Backward Citations)
US5757822A
Cited
US5717395A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-11-30 | 2002-06-01 | 2002-12-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-30 | 2006-06-01 | 2006-12-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-30 | 2010-06-01 | 2010-12-01 | $7700.00 | Window Closed / Lapsed |