Patent US4881076A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4881076A Expired / Lapsed US ⏱️ 0.0 years remaining

Encoding for pit-per-transition optical data recording

Assignee: International Business Machines Corp
•
Filing: 1987-12-01
•
Granted: 1989-11-14
•
Expires: 2007-12-01
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Encoding method for data to be recorded on optical disks using the pit-per-transition technique or return-to-zero techniques whereby the characteristics of the encoded bits produce a stable, low frequency spectral notch and minimum interference with associated focus and tracking servomechanisms. RLL (d,k) code words are selected so that the ratio of the lengths of pits and lands approximate some nonzero fraction less than one-half which depends on the (d,k) code employed. For example, a fraction of 1/3 is appropriate for RLL (2,7).

Inventors

  • 👤 Jonathan J. Ashley
  • 👤 Mark G. Call
  • 👤 Paul H. Siegel

Bibliographic Details

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

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 63 words
A method of generating y-bit words especially suitable for PPT or RZ recording techniques comprising the steps of: selecting from the set of 2 y possible y=bit words a subset to be recorded using pit-per-transition recording techniques according to predetermined characteristics including adjacency requirements; and choosing from said subset code words producing a predetermined gray scale greater than zero and less than one-half.
Claim 2
Independent Claim 63 words
A method of generating y-bit words especially suitable for PPT or RZ recording techniques comprising the steps of: selecting from the set of 2 y possible y=bit words a subset to be recorded using pit-per-transition recording techniques according to predetermined characteristics including adjacency requirements; and choosing from said subset code words producing a predetermined gray scale greater than zero and less than one-half.
Claim 3
Dependent Claim 37 words
The method claimed in claim 1 including an intermediate step of determining a gray scale as a desired ratio of a shorter recording interval of a binary value to the recording interval of the other binary value.
Claim 4
Independent Claim 107 words
A method of encoding x=bit data words to y-bit encoded words, where y is greater than x, according to predetermined (d,k) characteristics, comprising the steps of: eliminating from all possible y-bit encoded words those not meeting a given criteria to form a first remaining subset; selecting from said first remaining subset those words having adjacency characteristics to form a second remaining subset, said adjacency characteristics including at least one leading zero and at least one trailing zero; and choosing from the second remaining subset a third remaining subset having a ratio of binary ones in a recorded stream of encoded words substantially equal to a given ratio.
Claim 5
Independent Claim 107 words
A method of encoding x=bit data words to y-bit encoded words, where y is greater than x, according to predetermined (d,k) characteristics, comprising the steps of: eliminating from all possible y-bit encoded words those not meeting a given criteria to form a first remaining subset; selecting from said first remaining subset those words having adjacency characteristics to form a second remaining subset, said adjacency characteristics including at least one leading zero and at least one trailing zero; and choosing from the second remaining subset a third remaining subset having a ratio of binary ones in a recorded stream of encoded words substantially equal to a given ratio.
Claim 6
Dependent Claim 22 words
The method claimed in claim 3 wherein the given ratio in said choosing step is less than one-half and greater than zero.
Claim 7
Dependent Claim 16 words
The method claimed in claim 4 wherein said given ratio is maintained for each encoded word.
Claim 8
Dependent Claim 17 words
The method claimed in claim 3 wherein the given ratio in said choosing step is substantially one-third.
Claim 9
Dependent Claim 16 words
The method claimed in claim 6 wherein said given ratio is maintained for e encoded word.
Claim 10
Dependent Claim 38 words
The method as claimed in claim 3 wherein said eliminating step employs a (d,k) characteristic as said given criteria that eliminates each encoded word having fewer then d zeros and more than k zeros between adjacent binary ones.

References Cited (Backward Citations)

US4539691A Cited
US4486739A Cited
US4672362A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-11-13 1993-05-15 1993-11-14 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-11-13 1997-05-15 1997-11-14 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-11-13 2001-05-15 2001-11-14 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag