← Back to Patent Explorer
US4369472A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for encoding digital data

Assignee: Sony Corp
•
Filing: 1981-01-02
•
Granted: 1983-01-18
•
Expires: 2001-01-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals are encoded such that successive binary bits of the first or second values are represented by predetermined separations between succeeding transitions. A first transition is produced at a first reference point in a bit cell when a binary bit of the second value changes over to a binary bit of the first value. When successive binary bits of the first value are sensed, a respective second transition is produced at a second reference point in a bit cell after sensing every 2 or 3 binary bits of the first value. When successive binary bits of the second value are sensed, a respective second transition is produced at the second reference point in a bit cell when at least two successive binary bits of the first value are followed by a binary bit of the second value and also after sensing every 3 or 4 successive binary bits of the second value, such that the last-mentioned second transition at the second reference point is separated from the closest first transition thereto by at least 1.5 bit cell intervals but no more than 4.5 bit cell intervals and successive ones of the second transitions are separated from each other by no more than 4 bit cell intervals.

Inventors

  • 👤 Masato Tanaka
  • 👤 Shunsuke Furukawa

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 15:05
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426

Claims Analysis

Total Claims: 31
Claim 1
Independent Claim 208 words
A method of encoding digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising the steps of: producing a first transition at a first reference point in a bit cell when a binary bit of said second value changes over to a binary bit of said first value; sensing successive binary bits of said first value and producing a respective second transition at a second reference point in a bit cell after sensing every n successive binary bits of said first value (n=2 or 3); and sensing successive binary bits of said second value and producing a respective second transition at said second reference point in a bit cell when at least two successive binary bits of said first value are followed by a binary bit of said second value and also after sensing every m successive binary bits of said second value (m=3 or 4), such that said last-mentioned second transition at said second reference point is separated from a said first transition by at least 1.5 bit cell intervals but no more than 4.5 bit cell intervals and successive ones of said second transitions are separated from each other by no more than 4 bit cell intervals.
Claim 2
Independent Claim 208 words
A method of encoding digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising the steps of: producing a first transition at a first reference point in a bit cell when a binary bit of said second value changes over to a binary bit of said first value; sensing successive binary bits of said first value and producing a respective second transition at a second reference point in a bit cell after sensing every n successive binary bits of said first value (n=2 or 3); and sensing successive binary bits of said second value and producing a respective second transition at said second reference point in a bit cell when at least two successive binary bits of said first value are followed by a binary bit of said second value and also after sensing every m successive binary bits of said second value (m=3 or 4), such that said last-mentioned second transition at said second reference point is separated from a said first transition by at least 1.5 bit cell intervals but no more than 4.5 bit cell intervals and successive ones of said second transitions are separated from each other by no more than 4 bit cell intervals.
Claim 3
Dependent Claim 21 words
The method of claim 1 wherein said first reference point substantially coincides with the middle portion of a bit cell interval.
Claim 4
Dependent Claim 21 words
The method of claim 1 wherein said second reference point substantially coincides with the trailing edge of a bit cell interval.
Claim 5
Dependent Claim 95 words
The method of claim 1 wherein said step of producing a respective second transition after sensing every n successive binary bits of said first value comprises producing a said second transition after every 2 binary bits if the total number of successive binary bits of said first value is an even number; and if the total number of successive binary bits of said first value is an odd number greater than 3, producing a said second transition after every 2 binary bits and a said second transition after the final 3 binary bits are sensed.
Claim 6
Dependent Claim 75 words
The method of claim 4 wherein, if the total number of binary bits of said first value is greater than 3, then the minimum separation between succeeding transitions is no less than 1.5 bit cell intervals, and the separation between remaining succeeding transitions is substantially equal to 2 bit cell intervals and for an odd number of successive binary bits the separation between the final two transitions is substantially equal to 3 bit cell intervals.
Claim 7
Dependent Claim 102 words
The method of claim 1 wherein said step of producing a respective second transition after sensing every n successive binary bits of said first value comprises determining if the total number of said successive binary bits is odd or even and, if odd and greater than 3, producing a said second transition after sensing the first 3 successive binary bits and thereafter producing a said second transition after sensing each 2 successive binary bits, and if the total number of said successive binary bits is even and greater than 3, producing a said second transition after sensing each 2 successive binary bits.
Claim 8
Dependent Claim 57 words
The method of claim 1 wherein said step of producing a respective second transition after sensing every n successive binary bits of said first value comprises producing said second transition at the trailing edge of the last bit cell of said successive binary bits if the total number of said successive binary bits is less than 4.
Claim 9
Dependent Claim 59 words
The method of claim 1 wherein said step of producing a respective second transition after sensing every m successive binary bits of said second value comprises producing a said second transition following the production of a first transition after 3 successive binary bits have been sensed if the total number of said successive binary bits is greater than 3.
Claim 10
Dependent Claim 47 words
The method of claim 8 wherein said step of producing a respective second transition after sensing every m successive binary bits of said second value further comprises producing additional second transitions after each 4 successive binary bits, following the first 3 successive binary bits, have been sensed.
Claim 11
Dependent Claim 78 words
The method of claim 1 wherein said step of producing a respective second transition after sensing m successive binary bits of said second value comprises producing a first of said second transitions after 3 successive binary bits have been sensed and succeeding ones of said second transitions after every 4 successive binary bits have been sensed thereafter, provided that said successive binary bits of said second value are preceded by a single binary bit of said first value.
Claim 12
Dependent Claim 45 words
The method of claim 10, further comprising the step of inhibiting the production of a second transition after 4 successive binary bits have been sensed if said last mentioned second transition would be separated from any other transition by less than 1.5 bit cell intervals.
Claim 13
Dependent Claim 29 words
The method of claim 1 wherein m=4 if said successive binary bits of said second value are preceded by at least two successive binary bits of said first value.
Claim 14
Dependent Claim 44 words
The method of claim 12 further comprising the step of inhibiting the production of a second transition after 4 successive binary bits have been sensed if said last-mentioned second transition would be separated from any other transition by less than 1.5 bit cell intervals.
Claim 15
Independent Claim 277 words
A method of encoding digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising the steps of: producing a first transition at a first reference point in a bit cell occupied by a binary bit of said first value when a binary bit of said second value changes over to said binary bit of said first value; sensing successive binary bits of said first value, producing a second transition at a second reference point in the bit cell occupied by the last of said successive binary bits of said first value, producing a respective second transition at a second reference point in a bit cell after sensing every 2 successive binary bits of said first value, and detecting if the total number of said successive binary bits of said first value is an odd number in excess of 3 and, if so, dividing the last 5 of said successive binary bits into respective groups of 2 and 3 bits and producing a said second transition at a said second reference point between said groups; and sensing successive binary bits of said second value and producing a respective second transition at said second reference point in a bit cell when at least two successive binary bits of said first value are followed by a binary bit of said second value and also after sensing every 3 successive binary bits of said second value, such that said last-mentioned second transition is separated from a said first transition by at least 1.5 bit cell intervals and is separated from the next-following second transition by no more than 3 bit cell intervals.
Claim 16
Independent Claim 277 words
A method of encoding digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising the steps of: producing a first transition at a first reference point in a bit cell occupied by a binary bit of said first value when a binary bit of said second value changes over to said binary bit of said first value; sensing successive binary bits of said first value, producing a second transition at a second reference point in the bit cell occupied by the last of said successive binary bits of said first value, producing a respective second transition at a second reference point in a bit cell after sensing every 2 successive binary bits of said first value, and detecting if the total number of said successive binary bits of said first value is an odd number in excess of 3 and, if so, dividing the last 5 of said successive binary bits into respective groups of 2 and 3 bits and producing a said second transition at a said second reference point between said groups; and sensing successive binary bits of said second value and producing a respective second transition at said second reference point in a bit cell when at least two successive binary bits of said first value are followed by a binary bit of said second value and also after sensing every 3 successive binary bits of said second value, such that said last-mentioned second transition is separated from a said first transition by at least 1.5 bit cell intervals and is separated from the next-following second transition by no more than 3 bit cell intervals.
Claim 17
Dependent Claim 35 words
The method of claim 14 comprising the step of inhibiting the production of a second transition if said last-mentioned second transition would be separated from any other transition by less than 1.5 bit cell intervals.
Claim 18
Dependent Claim 222 words
Apparatus for encoding an input digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising: first transition generating means for producing a first transition at a first reference point in a bit cell when a binary bit of said second value changes over to a binary bit of said first value; sensing means for sensing successive binary bits of said first value and for sensing successive binary bits of said second value; and second transition generating means for producing a respective second transition at a second reference point in a bit cell after said sensing means senses every n successive binary bits of said first value (n=2 or 3); said second transition generating means further producing a respective second transition at said second reference point in a bit cell when said sensing means senses at least two successive binary bits of said first value and also after sensing every m successive binary bits of said second value (m=3 or 4), such that said last-mentioned second transition at said second reference point is separated from a said first transition by at least 1.5 bit cell intervals but no more than 4.5 bit cell intervals and successive ones of said second transitions are separated from each other by no more than 4 bit cell intervals.
Claim 19
Dependent Claim 222 words
Apparatus for encoding an input digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising: first transition generating means for producing a first transition at a first reference point in a bit cell when a binary bit of said second value changes over to a binary bit of said first value; sensing means for sensing successive binary bits of said first value and for sensing successive binary bits of said second value; and second transition generating means for producing a respective second transition at a second reference point in a bit cell after said sensing means senses every n successive binary bits of said first value (n=2 or 3); said second transition generating means further producing a respective second transition at said second reference point in a bit cell when said sensing means senses at least two successive binary bits of said first value and also after sensing every m successive binary bits of said second value (m=3 or 4), such that said last-mentioned second transition at said second reference point is separated from a said first transition by at least 1.5 bit cell intervals but no more than 4.5 bit cell intervals and successive ones of said second transitions are separated from each other by no more than 4 bit cell intervals.
Claim 20
Dependent Claim 20 words
The apparatus of claim 16 wherein said first reference point coincides with the middle portion of a bit cell interval.
Claim 21
Dependent Claim 21 words
The apparatus of claim 16 wherein said second reference point substantially coincides with the trailing edge of a bit cell interval.
Claim 22
Dependent Claim 94 words
The apparatus of claim 16 wherein said second transition generating means comprises means for producing a said second transition after every 2 binary bits of said first value if the total number of successive binary bits of said first value is an even number; means for determining when the total number of successive binary bits of said first value is an odd number greater than 3, and means for producing a said second transition after every 2 binary bits and a said second transition after said sensing means senses the first 3 binary bits.
Claim 23
Dependent Claim 106 words
The apparatus of claim 16 wherein said second transition generating means comprises means for determining if the total number of said successive binary bits of said first value is odd or even; means for producing a said second transition after sensing the first 3 successive binary bits and thereafter producing a said second transition after sensing each 2 successive binary bits if said total number of said successive binary bits is odd and greater than 3; and means for producing a said second transition after sensing each 2 successive binary bits if said total number of said successive binary bits is even and greater than 3.
Claim 24
Dependent Claim 48 words
The apparatus of claim 16 wherein said second transition generating means comprises means for producing said second transition at the trailing edge of the last bit cell of said successive binary bits of said first value if the total number of successive binary bits is less than 4.
Claim 25
Dependent Claim 51 words
The apparatus of claim 16 wherein said second transition generating means comprises means for producing a said second transition following the production of a first transition after 3 successive binary bits of said second value have been sensed if the total number of said successive binary bits is greater than 3.
Claim 26
Dependent Claim 35 words
The apparatus of claim 22 wherein said second transition generating means further comprises means for producing additional second transitions after each 4 successive binary bits, following the first 3 successive binary bits, have been sensed.
Claim 27
Dependent Claim 79 words
The apparatus of claim 16 wherein said second transition generating means comprises means for producing a first of said second transitions after 3 successive binary bits of said second value have been sensed, and means for producing succeeding ones of said second transitions after every 4 successive binary bits have been sensed thereafter, provided that said sensing means senses that said successive binary bits of said second value are preceded by a single binary bit of said first value.
Claim 28
Dependent Claim 45 words
The apparatus of claim 24, further comprising inhibit means for inhibiting the production of a second transition after 4 successive binary bits have been sensed if said last mentioned second transition would be separated from any other transition by less than 1.5 bit cell intervals.
Claim 29
Dependent Claim 318 words
Apparatus for encoding input digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising: first transition generating means for producing a first transition at a first reference point in a bit cell occupied by a binary bit of said first value when a binary bit of said second value changes over to said binary bit of said first value; sensing means for sensing successive binary bits of said first value and for sensing successive binary bits of said second value; second transition generating means for producing a second transition at a second reference point in the bit cell occupied by the last of said successive binary bits of said first value, and for producing a respective second transition at a second reference point in a bit cell after said sensing means senses every 2 successive binary bits of said first value; detecting means for detecting if the total number of said successive binary bits of said first value is an odd number in excess of 3, means for dividing the last 5 of said successive binary bits into respective groups of 2 and 3 binary bits if said total number is an odd number in excess of 3 such that said producing means produces a said second transition at a said second reference point between said groups; and said second transition generating means produces a respective second transition at said second reference point in a bit cell when at least two successive binary bits of said first value are followed by a binary bit of said second value and also after said sensing means senses every 3 successive bits of said second value, such that said last-mentioned second transition is separated from a said first transition by at least 1.5 bit cell intervals and is separated from the next-following second transition by no more than 3 bit cell intervals.
Claim 30
Dependent Claim 318 words
Apparatus for encoding input digital data formed of binary bits of first and second values occupying consecutive bit cells of predetermined intervals, comprising: first transition generating means for producing a first transition at a first reference point in a bit cell occupied by a binary bit of said first value when a binary bit of said second value changes over to said binary bit of said first value; sensing means for sensing successive binary bits of said first value and for sensing successive binary bits of said second value; second transition generating means for producing a second transition at a second reference point in the bit cell occupied by the last of said successive binary bits of said first value, and for producing a respective second transition at a second reference point in a bit cell after said sensing means senses every 2 successive binary bits of said first value; detecting means for detecting if the total number of said successive binary bits of said first value is an odd number in excess of 3, means for dividing the last 5 of said successive binary bits into respective groups of 2 and 3 binary bits if said total number is an odd number in excess of 3 such that said producing means produces a said second transition at a said second reference point between said groups; and said second transition generating means produces a respective second transition at said second reference point in a bit cell when at least two successive binary bits of said first value are followed by a binary bit of said second value and also after said sensing means senses every 3 successive bits of said second value, such that said last-mentioned second transition is separated from a said first transition by at least 1.5 bit cell intervals and is separated from the next-following second transition by no more than 3 bit cell intervals.
Claim 31
Dependent Claim 36 words
The apparatus of claim 26 further comprising inhibit means for inhibiting the production of a second transition if said last-mentioned second transition would be separated from any other transition by less than 1.5 bit cell intervals.

References Cited (Backward Citations)

US3560947A Cited
US3905029A Cited
US4323931A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1986-01-17 1986-07-19 1987-01-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1990-01-17 1990-07-19 1991-01-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1994-01-17 1994-07-19 1995-01-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag