Coded data on a record carrier and method for encoding same

• US 4,534,031 A
• Filed: 11/29/1982
• Issued: 08/06/1985
• Est. Priority Date: 08/02/1982
• Status: Expired due to Fees

• Current Assignee: News LOG International Incorporated
• Original Assignee: News LOG International Incorporated
• Inventors: Jewer, Alan A.
• Primary Examiner(s): ATKINSON, CHARLES
• Application Number:
  US06/445,241
• Time in Patent Office: 981 Days
• Field of Search: 371/38, 371/39, 371/40, 371/2, 360/49, 369/18, 369/30, 369/58, 369/93, 369/97, 369/284, 235/437, 235/464, 235/494
• US Class Current: 714/758
• CPC Class Codes: G06K 19/06037 multi-dimensional coding
• CPC Class Codes: G06K 19/06075 the marking containing means for error correction
• CPC Class Codes: G11B 20/12 Formatting, e.g. arrangement of data block or words on the record carriers within interface between computers and data recorders G06F3/06
• CPC Class Codes: G11B 20/1403 characterised by the use of two levels
• CPC Class Codes: G11B 20/1833 by adding special lists or symbols to the coded information G11B20/1806, G11B20/1866 take precedence
• CPC Class Codes: G11B 27/3027 used signal is digitally coded
• CPC Class Codes: G11B 7/0033 with cards or other card-like flat carriers, e.g. flat sheets of optical film
• CPC Class Codes: G11B 7/013 for discrete information, i.e. where each information unit is stored in a distinct discrete location , e.g. digital information formats within a data block or sector

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).

Claims

1. 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.

2. The method of claim 1 wherein each data byte comprises an eight bit data byte and the parity field section includes four parity bits.

3. 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.

4. The method of claim 3 wherein said cyclic redundancy checksum word includes an eight bit byte.

5. The method of claim 3 wherein said cyclic redundancy checksum word is comprised of the eight least significant bits of a 16 bit word.

6. 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.

7. The method of claim 3 wherein said cyclic redundancy checksum word includes a thirteen bit byte.

8. 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.

9. 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.

10. The method of claim 1 wherein each said coded group includes a field of 96 bits of data.

11. The method of claim 1 wherein each said coded group includes a field of 105 bits of data.

12. The method of claim 1 wherein each said coded group includes seven fifteen-bit quasi-data words.

13. The method of claim 12 wherein each fifteen-bit quasi-word includes a four bit parity field.

14. 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.

15. The method of claim 1 wherein said data bits in each coded group are multiplexed.

16. 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.

17. The method of claim 1 wherein each track has from three to twenty-one coded groups therein.

18. 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.

19. 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.

20. 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.

21. 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.

22. 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.

23. The method of claim 22 wherein each track address comprises eight data bits.

24. The method of claim 22 wherein said back track address section is a mirror image of the front track address section.

25. 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.

26. 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.

27. A data record carrier made by the method of claim 1.

28. A data record carrier made by the method of claim 2.

29. A data record carrier made by the method of claim 4.

30. A data record carrier made by the method of claim 5.

31. A data record carrier made by the method of claim 6.

32. A data record carrier made by the method of claim 7.

33. A data record carrier made by the method of claim 9.

34. A data record carrier made by the method of claim 10.

35. A data record carrier made by the method of claim 11.

36. A data record carrier made by the method of claim 13.

37. A data record carrier made by the method of claim 14.

38. A data record carrier made by the method of claim 15.

39. A data record carrier made by the method of claim 16.

40. A data record carrier made by the method of claim 18.

41. A data record carrier made by the method of claim 20.

42. A data record carrier made by the method of claim 21.

43. A data record carrier made by the method of claim 22.

44. A data record carrier made by the method of claim 24.

45. A data record carrier made by the method of claim 26.

46. 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.

47. 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.

48. 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.

49. 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.

50. The data record carrier of claim 49 wherein said cyclic redundancy checksum word includes an eight bit byte.

51. 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.

52. 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.

53. The data record carrier of claim 49 wherein said cyclic redundancy checksum word includes a thirteen bit byte.

54. 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.

55. 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.

56. The data record carrier of claim 47 wherein each said coded group includes a field of 96 bits of data.

57. The data record carrier of claim 47 wherein each said coded group includes a field of 105 bits of data.

58. The data record carrier of claim 47 wherein each said coded group includes seven fifteen-bit quasi-data words.

59. The data record carrier of claim 58 wherein each fifteen-bit quasi-data word includes a four bit parity field.

60. 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.

61. The data record carrier of claim 47 wherein said data bits in each coded group are multiplexed.

62. 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.

63. The data record carrier of claim 47 wherein each track has from three to twenty-one coded groups therein.

64. 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.

65. 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.

66. 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.

67. 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.

68. 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.

69. The data record carrier of claim 68 wherein each track address comprises eight data bits.

70. The data record carrier of claim 68 wherein said back track address section is a mirror image of the front track address section.

71. 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.

72. 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.

73. 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.