Patent US5604497A successfully refreshed from Google Patents.
US5604497A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for increasing density of run length limited block codes without increasing error propagation
Assignee: Avago Technologies International Sales Pte Ltd
•
Filing: 1995-10-10
•
Granted: 1997-02-18
•
Expires: 2015-10-10
Abstract
Abstract The present invention is an apparatus and method for increasing the density of run-length-limited (RLL) block codes without increasing error propagation. By inserting a number of uncoded bytes (M) between each coded byte, the coding density is thereby increased. Starting with an RLL code with a block length (I) which is, for example, a multiple of 8, a number (M) of uncoded bytes may be inserted between each coded byte. The resulting density is: (I+8M)/(J+8M), wherein the resulting k constraint, of the (d,k,l) constraints is increased by 8M, and the resulting l constraint is increased by 4M. For example, starting with an RLL code having a coding density of 8/9 (I=8, J=9) and constraint set of (0,4,4), inserting one uncoded byte between each coded byte (M=1) results in a coding density of 16/17 which is 5.88% greater than the original 8/9 coding density. The constraint set is also increased to (0,12,8), where k is increased by 8 and l is increased by 4. The coding density is significantly increased without increasing the error propagation, since the size of the coded block is not increased.
Inventors
- 👤 Jeffrey L. Sonntag
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 21:19
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426; G11B2020/1434
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
125 words
An apparatus for producing from binary data a run-length-limited block code of preselectable density for encoding of data on a magnetic media, said apparatus comprising: receiving means coupled to an input bit stream for receiving said binary data; encoding means coupled to said receiving means for encoding selected portions of said binary data into block encoded data; control means coupled to said input bit stream operable to select and interleave a predetermined uncoded portion of said binary data between said block encoded data; and output means coupled to said encoding means and said control means, said output means operable to output said predetermined uncoded portion of said binary data between said block encoded data, thereby forming said run-length limited block code of said preselectable density.
Claim 2
Independent Claim
125 words
An apparatus for producing from binary data a run-length-limited block code of preselectable density for encoding of data on a magnetic media, said apparatus comprising: receiving means coupled to an input bit stream for receiving said binary data; encoding means coupled to said receiving means for encoding selected portions of said binary data into block encoded data; control means coupled to said input bit stream operable to select and interleave a predetermined uncoded portion of said binary data between said block encoded data; and output means coupled to said encoding means and said control means, said output means operable to output said predetermined uncoded portion of said binary data between said block encoded data, thereby forming said run-length limited block code of said preselectable density.
Claim 3
Dependent Claim
59 words
The apparatus of claim 1, wherein I is the number of bits in an uncoded block of data, J is the number of channel bits in an encoded block and M is a number of uncoded blocks to be inserted between said encoded blocks, said output means operable to produce a block code with said preselectable density being /(J+MI).
Claim 4
Dependent Claim
70 words
The apparatus of claim 2, wherein said block codes have runlength constraints of (d,k,l), where d is the minimum number of zeroes between ones, k is the maximum number of zeroes between ones and l is the maximum number of zeroes between ones in odd/even substrings, wherein said k constraint is increased by 8M and said l constraint is increased by 4M when compared to an original non-interleaved block code.
Claim 5
Dependent Claim
24 words
The apparatus of claim 2, wherein M has a value of 1 and said preselectable density is 16/17 with a constraint set of (0,12,8).
Claim 6
Dependent Claim
14 words
The apparatus of claim 1, wherein said receiving means includes a shift register device.
Claim 7
Dependent Claim
15 words
The apparatus of claim 4, wherein said output means includes a parallel to serial converter.
Claim 8
Dependent Claim
24 words
The apparatus of claim 6, wherein said control means includes a multiplexer for enabling interleaving of said uncoded data with said block coded data.
Claim 9
Dependent Claim
58 words
The apparatus of claim 7, wherein said control means is operable to output a first and second gapped clock signal for controlling data flow of said shift register and parallel to serial converter, respectively, said control means further adapted to output a multiplexer control signal for selectively alternating inputs of said multiplexer between said uncoded and coded data.
Claim 10
Dependent Claim
24 words
The apparatus of claim 6, wherein said parallel to serial converter includes a direct connection to said shift register for receiving said uncoded data.
Claim 11
Dependent Claim
98 words
A coding apparatus for use in a storage system where I is the number of bits in an uncoded block of data and J is the number of channel bits in a coded block of data, said apparatus comprising: means for inputting I bits of binary data at a time; means for encoding selected bytes of said binary data into a coded block; and means for interleaving a selected multiple of said I bits of uncoded binary data with said encoded block code to thereby form a runlength limited block code of preselectable density without increasing error propagation.
Claim 12
Dependent Claim
98 words
A coding apparatus for use in a storage system where I is the number of bits in an uncoded block of data and J is the number of channel bits in a coded block of data, said apparatus comprising: means for inputting I bits of binary data at a time; means for encoding selected bytes of said binary data into a coded block; and means for interleaving a selected multiple of said I bits of uncoded binary data with said encoded block code to thereby form a runlength limited block code of preselectable density without increasing error propagation.
Claim 13
Dependent Claim
20 words
The apparatus of claim 10, wherein said means for inputting includes a shift register coupled to a serial bit stream.
Claim 14
Dependent Claim
49 words
The apparatus of claim 11, wherein said means for interleaving includes a parallel to serial converter coupled to control means, said control means adapted to select said uncoded data and generate timing signals for control of data flow to and from said shift register and parallel to serial converter.
Claim 15
Dependent Claim
24 words
The apparatus of claim 12, wherein said means for interleaving further includes a multiplexer to enable alternate output of said coded and uncoded data.
Claim 16
Dependent Claim
23 words
The apparatus of claim 12, wherein said parallel to serial converter is directly coupled to said shift register for receiving said uncoded data.
Claim 17
Dependent Claim
18 words
The apparatus of claim 10, wherein said apparatus produces an RLL block code having a density of /(I+MI).
Claim 18
Dependent Claim
19 words
The apparatus of claim 15, wherein M=1 and said coding density is 16/17 with a constraint set of (0,12,8).
Claim 19
Independent Claim
81 words
A method for encoding binary data on a storage medium utilizing run-length-limited block codes, said method comprising the steps of: receiving an input bit stream of said binary data; encoding selected portions of said binary data into block encoded data; interleaving a predetermined uncoded portion of said binary data between said block encoded data; and outputting said block encoded data together with said uncoded portion of block encoded data therebetween, to thereby form a run-length limited block code of increased density.
Claim 20
Independent Claim
81 words
A method for encoding binary data on a storage medium utilizing run-length-limited block codes, said method comprising the steps of: receiving an input bit stream of said binary data; encoding selected portions of said binary data into block encoded data; interleaving a predetermined uncoded portion of said binary data between said block encoded data; and outputting said block encoded data together with said uncoded portion of block encoded data therebetween, to thereby form a run-length limited block code of increased density.
Claim 21
Dependent Claim
60 words
The method of claim 17, wherein I is the number of bits in an uncoded block of data, J is the number of channel bits in an encoded block and M is a number of uncoded bytes to be inserted between said encoded blocks, further including the step of to producing a block code with a preselectable density of /(J+MI).
Claim 22
Dependent Claim
24 words
The method of claim 18, wherein M has a value of 1 and said preselectable density is 16/17 with a constraint set of (0,12,8).
Claim 23
Dependent Claim
70 words
The method of claim 18,, wherein said block codes have runlength constraints of (d,k,l), where d is the minimum number of zeroes between ones, k is the maximum number of zeroes between ones and l is the maximum number of zeroes between ones in odd/even substrings, wherein said k constraint is increased by 8M and said l constraint is increased by 4M when compared to an original non-interleaved block code.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-02-18 | 2000-08-19 | 2001-02-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-02-18 | 2004-08-19 | 2005-02-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-02-18 | 2008-08-19 | 2009-02-18 | $7700.00 | Window Closed / Lapsed |