US5274510A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Track address pattern for a disk memory apparatus
Assignee: Sony Corp
•
Filing: 1991-05-20
•
Granted: 1993-12-28
•
Expires: 2011-05-20
Abstract
Abstract A track address pattern suitable for being applied to a magnetic disk apparatus which positions a head to a track with a desired address by a sector servo system, for example, wherein a gray code of a plurality of bits corresponding to a track address of the magnetic disk apparatus is divided per 2 bits thereof into groups, the respective groups of 2 bits are converted into codes of 3 bits (001), (010), (100) and (111) depending on the values thereof, respectively, whereby the converted codes are recorded on the magnetic disk as the track address pattern.
Inventors
- 👤 Junkichi Sugita
- 👤 Masami Kashiwagi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 22:43
CPC Classifications
G; G11; G11B; G11B21/00; G11B5/00; G11B5/48; G11B5/58; G11B5/596; G11B5/59633
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
75 words
A track address pattern for a magnetic disk apparatus, wherein a gray code of a plurality of bits corresponding to a track address of the magnetic disk apparatus is divided per 2 bits thereof into groups, the respective groups of 2 bits are converted into codes of 3 bits, namely (001), (010), (100) or (111), depending on the value thereof, whereby the converted codes are recorded on the magnetic disk as the track address pattern.
Claim 2
Dependent Claim
75 words
A track address pattern for a magnetic disk apparatus, wherein a gray code of a plurality of bits corresponding to a track address of the magnetic disk apparatus is divided per 2 bits thereof into groups, the respective groups of 2 bits are converted into codes of 3 bits, namely (001), (010), (100) or (111), depending on the value thereof, whereby the converted codes are recorded on the magnetic disk as the track address pattern.
Claim 3
Dependent Claim
189 words
A track address pattern for a magnetic disk apparatus, wherein a gray code of m bits, where m is an integer not less than 2, corresponding to a track address of the magnetic disk apparatus is divided into a code Gx of one bit and codes Gm-2, Gm-1, . . . , G0 of m-1 bits, and the code of 1 bit is converted into codes C11, C10 of 2 bits according to a rule A and the codes of m-1 bits are converted into codes C2m-1, C2m-2, . . . , C21, C20 of m bits according to a rule B, whereby a code which is converted from the gray code of m bits into a code of m+2 bits is recorded on the magnetic disk as the track address pattern, the rule A making the code C1j, where j=0, 1, correspond to Gx or Gx⊕1, where ⊕ means an exclusive-OR operation, and the rule B making the code C20 correspond to G0 or G0⊕1, the code C2j, where j=1, . . . , m-2, to G(j-1)⊕Gj or G(j-1)⊕Gj⊕1, and the code C2m-1 to G(m-2) or G(m-2)⊕1, respectively.
Claim 4
Dependent Claim
189 words
A track address pattern for a magnetic disk apparatus, wherein a gray code of m bits, where m is an integer not less than 2, corresponding to a track address of the magnetic disk apparatus is divided into a code Gx of one bit and codes Gm-2, Gm-1, . . . , G0 of m-1 bits, and the code of 1 bit is converted into codes C11, C10 of 2 bits according to a rule A and the codes of m-1 bits are converted into codes C2m-1, C2m-2, . . . , C21, C20 of m bits according to a rule B, whereby a code which is converted from the gray code of m bits into a code of m+2 bits is recorded on the magnetic disk as the track address pattern, the rule A making the code C1j, where j=0, 1, correspond to Gx or Gx⊕1, where ⊕ means an exclusive-OR operation, and the rule B making the code C20 correspond to G0 or G0⊕1, the code C2j, where j=1, . . . , m-2, to G(j-1)⊕Gj or G(j-1)⊕Gj⊕1, and the code C2m-1 to G(m-2) or G(m-2)⊕1, respectively.
Claim 5
Dependent Claim
99 words
A track address pattern for a magnetic disk apparatus wherein a gray code of a plurality of bits corresponding to a track address of the magnetic disk is divided into two sets, a code of one of the divided two sets is converted into a code according to the conversion rule A recited in claim 2, a code of the other set is converted into a code according to the rule B recited in claim 2, and the two codes obtained by these conversions are combined to thereby be recorded on the magnetic disk as the track address pattern.
Claim 6
Independent Claim
79 words
A method of providing a track address pattern for a magnetic disk apparatus, comprising the steps of: dividing a gray code of a plurality of bits corresponding to a track address of the magnetic disk apparatus per 2 bits thereof into groups, converting the respective groups of 2 bits into codes of 3 bits, namely (001), (010), (100) or (111), depending on the value thereof, and recording the converted codes on the magnetic disk as the track address pattern.
Claim 7
Independent Claim
79 words
A method of providing a track address pattern for a magnetic disk apparatus, comprising the steps of: dividing a gray code of a plurality of bits corresponding to a track address of the magnetic disk apparatus per 2 bits thereof into groups, converting the respective groups of 2 bits into codes of 3 bits, namely (001), (010), (100) or (111), depending on the value thereof, and recording the converted codes on the magnetic disk as the track address pattern.
Claim 8
Independent Claim
192 words
A method of providing a track address pattern for a magnetic disk apparatus comprising the steps of: dividing a gray code of m bits, where m is an integer not less than 2, corresponding to a track address of the magnetic disk apparatus, into a code Gx of one bit and codes Gm-2, Gm-1, . . . , G0 of m-1 bits, and converting the code of 1 bit into codes C11, C10 of 2 bits according to a rule A, converting the codes of m-1 bits into codes C2m-1, C2m-2, . . . , C21, C20 of m bits according to a rule B, and recording a code which is converted from the gray code of m bits into a code of m+2 bits on the magnetic disk as the track address pattern, wherein the rule A making the code C1j, where j=0, 1, correspond to Gx or Gx⊕1, were ⊕ means an exclusive-OR operation, and the rule B making the code C20 correspond to G0 or G0⊕1, the code C2j, where j=1, . . . , m-2, to G(j-1)⊕Gj or G(j-1)⊕Gj⊕1, and the code C2m-1 to G(m-2) or G(m-2)-1, respectively.
Claim 9
Independent Claim
192 words
A method of providing a track address pattern for a magnetic disk apparatus comprising the steps of: dividing a gray code of m bits, where m is an integer not less than 2, corresponding to a track address of the magnetic disk apparatus, into a code Gx of one bit and codes Gm-2, Gm-1, . . . , G0 of m-1 bits, and converting the code of 1 bit into codes C11, C10 of 2 bits according to a rule A, converting the codes of m-1 bits into codes C2m-1, C2m-2, . . . , C21, C20 of m bits according to a rule B, and recording a code which is converted from the gray code of m bits into a code of m+2 bits on the magnetic disk as the track address pattern, wherein the rule A making the code C1j, where j=0, 1, correspond to Gx or Gx⊕1, were ⊕ means an exclusive-OR operation, and the rule B making the code C20 correspond to G0 or G0⊕1, the code C2j, where j=1, . . . , m-2, to G(j-1)⊕Gj or G(j-1)⊕Gj⊕1, and the code C2m-1 to G(m-2) or G(m-2)-1, respectively.
References Cited (Backward Citations)
US4032984A
Cited
US4530019A
Cited
US4777542A
Cited
EP0269381A2
Cited
US4823212A
Cited
EP0295979A1
Cited
EP0335517A2
Cited
US4977472A
Cited
EP0353767A2
Cited
US5047880A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-12-27 | 1997-06-28 | 1997-12-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-12-27 | 2001-06-28 | 2001-12-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-12-27 | 2005-06-28 | 2005-12-28 | $7700.00 | Window Closed / Lapsed |