US4534031A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Coded data on a record carrier and method for encoding same
Assignee: COMMUNICATIONS STANDARDS PARTNERSHIP A MINNESOTA GENERAL PARTNERSHIP
•
Filing: 1982-11-29
•
Granted: 1985-08-06
•
Expires: 2002-11-29
Abstract
Abstract The coded data (12) on the record carrier (10) and the method for encoding such data (12) in tracks (14) provide a relatively simple and yet very effective means for making the data record carrier (10), and particularly the data (12) recorded thereon, highly tolerant of errors such as "burst errors" where one or more spots of data on the data record carrier (10) are obliterated. The data (12) is recorded on the data record carrier (10) in arcuate nested tracks (14), each track (14) comprising a stream of data bits. The stream of data bits includes an encoded front track address (32) and encoded back track address (44) with coded groups or so-called Hamming type coded groups (52) of data bits therebetween each of which can comprise 96 or 105 data bits. Error correction is provided by including in the coded groups data words which include a data byte and a field of parity bits, typically an eight bit data byte followed by a four bit parity field. Also a cyclic redundancy checksum byte is provided in the group as a further check of the data therein. Further, this data is multiplexed. Additionally, one or two redundant groups are provided in each track (14) for recreating missing groups and a cyclic redundancy checksum field is provided for error detection in each track (14).
Inventors
- 👤 Alan A. Jewer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 18:25
CPC Classifications
G; G06; G06K; G06K19/00; G06K19/06; G06K19/06009; G06K19/06046; G06K19/06075; G06K19/06037; G11; G11B; G11B20/00; G11B20/10; G11B20/12; G11B20/14; G11B20/1403; G11B20/18; G11B20/1833; G11B27/00; G11B27/10; G11B27/19; G11B27/28; G11B27/30; G11B27/3027; G11B7/00; G11B7/002; G11B7/0033; G11B7/007; G11B7/013
Claims Analysis
Total Claims: 77
Claim 1
Independent Claim
237 words
A method for encoding digital data which is recorded in arcuate tracks without timing or synchronization data on a planar substrate to form a data record carrier with a plurality of arcuate tracks thereon, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data record carrier and is arranged in a nested manner relative to adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track address section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction tranverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell, said method of encoding providing error correction and including the steps of: providing in each coded group a plurality of coded words, each word comprising a byte of data bits and a field of parity bits for error correction.
Claim 2
Independent Claim
237 words
A method for encoding digital data which is recorded in arcuate tracks without timing or synchronization data on a planar substrate to form a data record carrier with a plurality of arcuate tracks thereon, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data record carrier and is arranged in a nested manner relative to adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track address section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction tranverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell, said method of encoding providing error correction and including the steps of: providing in each coded group a plurality of coded words, each word comprising a byte of data bits and a field of parity bits for error correction.
Claim 3
Dependent Claim
24 words
The method of claim 1 wherein each data byte comprises an eight bit data byte and the parity field section includes four parity bits.
Claim 4
Dependent Claim
26 words
The method of claim 1 wherein each said coded group also includes a cyclic redundancy checksum word formed by invoking a residue add and shift technique.
Claim 5
Dependent Claim
16 words
The method of claim 3 wherein said cyclic redundancy checksum word includes an eight bit byte.
Claim 6
Dependent Claim
24 words
The method of claim 3 wherein said cyclic redundancy checksum word is comprised of the eight least significant bits of a 16 bit word.
Claim 7
Dependent Claim
45 words
The method of claim 3 wherein said cyclic redundancy checksum word is formed by exclusive ORing the eight least significant bits with the eight most significant bits of an original 16 bit cyclic redundancy checksum word to obtain the eight bit cyclic redundancy checksum byte.
Claim 8
Dependent Claim
16 words
The method of claim 3 wherein said cyclic redundancy checksum word includes a thirteen bit byte.
Claim 9
Dependent Claim
27 words
The method of claim 1 wherein each said coded group comprises seven data words each comprising an eight bit data byte and a four bit parity field.
Claim 10
Dependent Claim
29 words
The method of claim 8 wherein each said coded group further includes an eighth word comprising an eight bit cyclic redundancy checksum byte and a four bit parity field.
Claim 11
Dependent Claim
18 words
The method of claim 1 wherein each said coded group includes a field of 96 bits of data.
Claim 12
Dependent Claim
18 words
The method of claim 1 wherein each said coded group includes a field of 105 bits of data.
Claim 13
Dependent Claim
15 words
The method of claim 1 wherein each said coded group includes seven fifteen-bit quasi-data words.
Claim 14
Dependent Claim
15 words
The method of claim 12 wherein each fifteen-bit quasi-word includes a four bit parity field.
Claim 15
Dependent Claim
44 words
The method of claim 12 wherein said first eleven bits of the seven quasi-data words or 77 bits include eight eight-bit data bytes and a thirteen bit cyclic redundancy checksum byte comprised of the 13 least significant bits of a cyclic redundancy checksum word.
Claim 16
Dependent Claim
15 words
The method of claim 1 wherein said data bits in each coded group are multiplexed.
Claim 17
Dependent Claim
62 words
The method of claim 15 wherein said multiplexing is achieved by recording the data bits in a stream which defines columns of data bits which are arrangeable in an array or matrix to form data words in rows across the array or matrix of the adjacent columns of data bits retrieved from the data record carrier in the field of the array.
Claim 18
Dependent Claim
16 words
The method of claim 1 wherein each track has from three to twenty-one coded groups therein.
Claim 19
Dependent Claim
88 words
The method of claim 1 wherein each track is provided with at least one cyclic redundancy checksum field section obtain by applying a residue add and shift technique to all the data bits in the coded groups using a CCITT polynomial, the result of which is a cyclic redundancy checksum word, such as a 16-bit cyclic redundancy checksum word, whereby the residue add and shift technique can be applied to the data retrieved from the coded groups and compared with the cyclic redundancy checksum word to detect errors.
Claim 20
Dependent Claim
28 words
The method of claim 1 wherein said cyclic redundancy checksum field section is situated between the last coded group on the track and the back track address section.
Claim 21
Dependent Claim
66 words
The method of claim 1 wherein each track is provided with at least one redundant coded group which is the result of sequential exclusive ORing, residue add, or comparing, of all the data bits in the coded groups such that if a coded group is found to be missing, the exclusive ORing of the groups retrieved and the redundant group will result in the missing group.
Claim 22
Dependent Claim
85 words
The method of claim 20 wherein two redundant coded groups are provided in each track, one such redundant group being positioned on the track at the beginning of the coded groups and being a resultant redundant group of all the odd or even coded groups, and the second such redundant group being positioned in the track at the end of the coded groups and being a resultant redundant group of all the even or odd coded groups whereby two lost adjacent groups can be recreated.
Claim 23
Dependent Claim
69 words
The method of claim 1 wherein each track address has half the data bits of the bit positions in a front track address section and the address is placed on the track in proper order in the first half of the bit positions and the second half of the bit positions of the address section are filled with the inversion or compliment of the track address in reverse order.
Claim 24
Dependent Claim
13 words
The method of claim 22 wherein each track address comprises eight data bits.
Claim 25
Dependent Claim
21 words
The method of claim 22 wherein said back track address section is a mirror image of the front track address section.
Claim 26
Dependent Claim
59 words
The method of claim 1 wherein two identical cyclic redundancy checksum field sections are provided, one at the beginning of each track and one at the end of each track and each such cyclic redundancy checksum field section is combined with a track address and placed in the front track address section or the back track address section respectively.
Claim 27
Dependent Claim
45 words
The method of claim 25 wherein said combined track address byte and cyclic redundancy checksum field byte are each encoded with a parity field, a cyclic redundancy checksum word is formed therefrom to form another data byte and all the resulting data bits are multiplexed.
Claim 28
Dependent Claim
11 words
A data record carrier made by the method of claim 1.
Claim 29
Dependent Claim
11 words
A data record carrier made by the method of claim 2.
Claim 30
Dependent Claim
11 words
A data record carrier made by the method of claim 4.
Claim 31
Dependent Claim
11 words
A data record carrier made by the method of claim 5.
Claim 32
Dependent Claim
11 words
A data record carrier made by the method of claim 6.
Claim 33
Dependent Claim
11 words
A data record carrier made by the method of claim 7.
Claim 34
Dependent Claim
11 words
A data record carrier made by the method of claim 9.
Claim 35
Dependent Claim
11 words
A data record carrier made by the method of claim 10.
Claim 36
Dependent Claim
11 words
A data record carrier made by the method of claim 11.
Claim 37
Dependent Claim
11 words
A data record carrier made by the method of claim 13.
Claim 38
Dependent Claim
11 words
A data record carrier made by the method of claim 14.
Claim 39
Dependent Claim
11 words
A data record carrier made by the method of claim 15.
Claim 40
Dependent Claim
11 words
A data record carrier made by the method of claim 16.
Claim 41
Dependent Claim
11 words
A data record carrier made by the method of claim 18.
Claim 42
Dependent Claim
11 words
A data record carrier made by the method of claim 20.
Claim 43
Dependent Claim
11 words
A data record carrier made by the method of claim 21.
Claim 44
Dependent Claim
11 words
A data record carrier made by the method of claim 22.
Claim 45
Dependent Claim
11 words
A data record carrier made by the method of claim 24.
Claim 46
Dependent Claim
11 words
A data record carrier made by the method of claim 26.
Claim 47
Independent Claim
295 words
A method for encoding digital data which is recorded in arcuate tracks without timing or synchronization data on a planar substrate to form a data record carrier with a plurality of arcuate tracks thereon, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data carrier and is arranged in a nested manner relative to adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction transverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell, said method of encoding providing error detection and/or correction of a track address in the front track address section and/or the back track address section and including the steps of: providing, in at least one of the front or back track address sections, bit positions twice the number of bit positions in the track address, placing the track address bits in the proper order in the first half of the bit positions in that track address section and placing an inversion or compliment of the address in reverse order in the remaining bit positions in that track address section.
Claim 48
Independent Claim
295 words
A method for encoding digital data which is recorded in arcuate tracks without timing or synchronization data on a planar substrate to form a data record carrier with a plurality of arcuate tracks thereon, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data carrier and is arranged in a nested manner relative to adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction transverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell, said method of encoding providing error detection and/or correction of a track address in the front track address section and/or the back track address section and including the steps of: providing, in at least one of the front or back track address sections, bit positions twice the number of bit positions in the track address, placing the track address bits in the proper order in the first half of the bit positions in that track address section and placing an inversion or compliment of the address in reverse order in the remaining bit positions in that track address section.
Claim 49
Dependent Claim
226 words
A data record carrier having digital data encoded in a plurality of arcuate tracks without timing or synchronization data on a planar substrate, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data record carrier and is arranged in a nested manner relative to the adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track address section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction transverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell and each coded group having error correction coded therein such that each coded group comprises a plurality of coded words and each word comprises a byte of data bits and a field of parity bits for error correction.
Claim 50
Dependent Claim
226 words
A data record carrier having digital data encoded in a plurality of arcuate tracks without timing or synchronization data on a planar substrate, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data record carrier and is arranged in a nested manner relative to the adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track address section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction transverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell and each coded group having error correction coded therein such that each coded group comprises a plurality of coded words and each word comprises a byte of data bits and a field of parity bits for error correction.
Claim 51
Dependent Claim
26 words
The data record carrier of claim 47 wherein each data byte comprises an eight bit data byte and the parity field section includes four parity bits.
Claim 52
Dependent Claim
28 words
The data record carrier of claim 47 wherein each said coded group also includes a cyclic redundancy checksum word formed by invoking a residue add and shift technique.
Claim 53
Dependent Claim
18 words
The data record carrier of claim 49 wherein said cyclic redundancy checksum word includes an eight bit byte.
Claim 54
Dependent Claim
26 words
The data record carrier of claim 49 wherein said cyclic redundancy checksum word is comprised of the eight least significant bits of a 16 bit word.
Claim 55
Dependent Claim
47 words
The data record carrier of claim 49 wherein said cyclic redundancy checksum word is formed by exclusive ORing the eight least significant bits with the eight most significant bits of an original 16 bit cyclic redundancy checksum word to obtain the eight bit cyclic redundancy checksum byte.
Claim 56
Dependent Claim
18 words
The data record carrier of claim 49 wherein said cyclic redundancy checksum word includes a thirteen bit byte.
Claim 57
Dependent Claim
29 words
The data record carrier of claim 49 wherein each said coded group comprises seven data words each comprising an eight bit data byte and a four bit parity field.
Claim 58
Dependent Claim
30 words
The data record carrier of claim 54 wherein said coded group further includes an eighth word comprising an eight bit cyclic redundancy checksum byte and a four bit parity field.
Claim 59
Dependent Claim
20 words
The data record carrier of claim 47 wherein each said coded group includes a field of 96 bits of data.
Claim 60
Dependent Claim
20 words
The data record carrier of claim 47 wherein each said coded group includes a field of 105 bits of data.
Claim 61
Dependent Claim
17 words
The data record carrier of claim 47 wherein each said coded group includes seven fifteen-bit quasi-data words.
Claim 62
Dependent Claim
18 words
The data record carrier of claim 58 wherein each fifteen-bit quasi-data word includes a four bit parity field.
Claim 63
Dependent Claim
46 words
The data record carrier of claim 58 wherein said first eleven bits of the seven quasi-data words or 77 bits include eight eight-bit data bytes and a thirteen bit cyclic redundancy checksum byte comprised of the 13 least significant bits of a cyclic redundancy checksum word.
Claim 64
Dependent Claim
17 words
The data record carrier of claim 47 wherein said data bits in each coded group are multiplexed.
Claim 65
Dependent Claim
52 words
The data record carrier of claim 61 wherein said multiplexing is achieved by recording the data bits in streams which define columns of data bits which are arrangeable in an array or matrix of the adjacent columns of data bits retrieved from the data record carrier in the field of the array.
Claim 66
Dependent Claim
18 words
The data record carrier of claim 47 wherein each track has from three to twenty-one coded groups therein.
Claim 67
Dependent Claim
99 words
The data record carrier of claim 47 wherein each track is provided with at least one cyclic redundancy checksum field section obtained by invoking a CCITT polynomial for all the data bits in the coded groups which invoking consists of an application of a residue add and shift technique to all the data bits, the result of which is a cyclic redundancy checksum word, such as a 16-bit cyclic redundancy checksum word, whereby the residue add and shift technique can be applied to the data retrieved from the coded groups and compared with the checksum word to detect errors.
Claim 68
Dependent Claim
30 words
The data record carrier of claim 47 wherein said cyclic redundancy checksum field section is situated between the last coded group on the track and the back track address section.
Claim 69
Dependent Claim
68 words
The data record carrier of claim 47 wherein each track is provided with at least one redundant coded group which is the result of sequential exclusive ORing, residue add, or comparing, of all the data bits in the coded groups such that if a coded group is found to be missing, the exclusive ORing of the groups retrieved and the redundant group will result in the missing group.
Claim 70
Dependent Claim
87 words
The data record carrier of claim 66 wherein two redundant coded groups are provided in each track, one such redundant group being positioned on the track at the beginning of the coded groups and being a resultant redundant group of all the odd or even coded groups, and the second such redundant group being positioned in the track at the end of the coded groups and being a resultant redundant group of all the even or odd coded groups whereby two lost adjacent groups can be recreated.
Claim 71
Dependent Claim
66 words
The data record carrier of claim 47 wherein each track address has half the data bits of the bit positions in a track address section and the address is placed on the track in proper order in the first half of the bit positions and the second half of the bit positions are filled with the inversion or compliment of the track address in reverse order.
Claim 72
Dependent Claim
15 words
The data record carrier of claim 68 wherein each track address comprises eight data bits.
Claim 73
Dependent Claim
23 words
The data record carrier of claim 68 wherein said back track address section is a mirror image of the front track address section.
Claim 74
Dependent Claim
61 words
The data record carrier of claim 47 wherein two identical cyclic redundancy checksum field sections are provided, one at the beginning of each track and one at the end of each track and each such cyclic redundancy checksum field section is combined with a track address and placed in the front track address section or the back track address section respectively.
Claim 75
Dependent Claim
47 words
The data record carrier of claim 71 wherein said combined track address byte and cyclic redundancy checksum field byte are each encoded with a parity field, a cyclic redundancy checksum word is formed therefrom to form another data byte and all the resulting data bits are multiplexed.
Claim 76
Dependent Claim
279 words
A data record carrier having digital data encoded in a plurality of arcuate tracks without timing or synchronization data on a planar substrate, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data record carrier and is arranged in a nested manner relative to adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track address section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction transverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell a track address being encoded in said front or back address section by having in at least one of the front or back track address sections, bit positions equal to twice the number of bit positions in the track address, with the track address bits placed in proper order in the first half of the bit positions in said front or back track address section and with an inversion or compliment of the track address bits placed in reverse order in the remaining bit positions in said front and back address section.
Claim 77
Dependent Claim
279 words
A data record carrier having digital data encoded in a plurality of arcuate tracks without timing or synchronization data on a planar substrate, each track being spaced from an adjacent track by a predetermined distance along a common centerline of the tracks, each track having the same radius throughout the arcuate path of said track such that each track extends in an arcuate manner across the data record carrier and is arranged in a nested manner relative to adjacent tracks along said common centerline, each track having a plurality of data cells therein and each track having a front track address section, a back track address section and groups of encoded data bits referred to as coded groups therebetween, each cell having the same cell length in the direction of each track for each bit of data stored in each cell and having the same cell width in a direction transverse to the direction of each track, each cell for one form of logic (0 or 1) being a non-transition cell and each cell for the other form of logic (1 or 0) being a transition cell a track address being encoded in said front or back address section by having in at least one of the front or back track address sections, bit positions equal to twice the number of bit positions in the track address, with the track address bits placed in proper order in the first half of the bit positions in said front or back track address section and with an inversion or compliment of the track address bits placed in reverse order in the remaining bit positions in said front and back address section.
References Cited (Backward Citations)
US3186707A
Cited
US3198527A
Cited
US3543007A
Cited
US3387293A
Cited
US3549826A
Cited
US3657699A
Cited
US3675930A
Cited
US3961315A
Cited
US3868632A
Cited
US3800281A
Cited
US3811108A
Cited
US3899629A
Cited
US4102569A
Cited
US4292684A
Cited
US4375100A
Cited
US4410877A
Cited
US4441184A
Cited
US4416001A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-08-05 | 1989-02-04 | 1989-08-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-08-05 | 1993-02-04 | 1993-08-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-08-05 | 1997-02-04 | 1997-08-06 | $7700.00 | Window Closed / Lapsed |