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

Time-varying maximum-transition-run codes for data channels

Assignee: Maxtor Corp
•
Filing: 1997-01-13
•
Granted: 1999-09-07
•
Expires: 2017-01-13
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A data channel, such as a magnetic recording/playback channel implements a time-varying maximum-transition-run code such that the code allows three consecutive transitions while it removes a dominant plus-minus-plus error-event and does not permit of four or more consecutive transitions.

Inventors

  • 👤 Kelly K. Fitzpatrick
  • 👤 Cory Modlin

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 09:48
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/10009; G11B20/10046; G11B20/10055; G11B20/14; G11B20/1403; G11B20/1423; G11B20/1426; H; H03; H03M; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; G11B2020/1434

Claims Analysis

Total Claims: 27
Claim 1
Independent Claim 41 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of: ##EQU8##
Claim 2
Dependent Claim 41 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of: ##EQU8##
Claim 3
Dependent Claim 40 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of:
Claim 4
Dependent Claim 40 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of:
Claim 5
Dependent Claim 38 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein code has a state transition matrix of:
Claim 6
Dependent Claim 38 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein code has a state transition matrix of:
Claim 7
Dependent Claim 22 words
The data channel set forth in claim 3 wherein the code is a rate 8/9 block code with a (d=0, k=11) constraint.
Claim 8
Dependent Claim 99 words
The data channel set forth in claim 4 wherein within the block code there are at most: five consecutive zeros at the start of a nine-bit code word, six consecutive zeros at the end of a nine-bit code word, seven consecutive zeros within a nine-bit code word, a single one at the start of a nine-bit code word, and two consecutive ones at the end at the end of a nine-bit code word, wherein a zero represents absence of a flux transition within a bit cell, and a one represents presence of a flux transition within a bit cell.
Claim 9
Dependent Claim 41 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of: ##EQU9##
Claim 10
Dependent Claim 41 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of: ##EQU9##
Claim 11
Dependent Claim 40 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of:
Claim 12
Dependent Claim 40 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the block code has a state transition matrix of:
Claim 13
Dependent Claim 39 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the code has a state transition matrix of:
Claim 14
Dependent Claim 39 words
A data channel implementing a time-varying maximal-transition-run code that allows up to three consecutive transitions while removing a plus-minus-plus error-event and which does not permit four or more consecutive transitions wherein the code has a state transition matrix of:
Claim 15
Dependent Claim 21 words
The data channel set forth in claim 8 wherein the code is a rate 8/9 code with constraint (d=0, G=13, I=9).
Claim 16
Dependent Claim 92 words
A magnetic recording channel including: an encoder for encoding a binary data block to be recorded into encoded data code words in accordance with a predetermined time-varying maximal-transition-run code that allows up to three consecutive magnetic flux transitions while removing a plus-minus-plus error-event and which does not allow four or more consecutive magnetic flux transitions, a write driver for converting encoded data code words into a write current, and a write element for converting the write current into a flux pattern on a magnetic storage medium moving relatively to the write element.
Claim 17
Dependent Claim 92 words
A magnetic recording channel including: an encoder for encoding a binary data block to be recorded into encoded data code words in accordance with a predetermined time-varying maximal-transition-run code that allows up to three consecutive magnetic flux transitions while removing a plus-minus-plus error-event and which does not allow four or more consecutive magnetic flux transitions, a write driver for converting encoded data code words into a write current, and a write element for converting the write current into a flux pattern on a magnetic storage medium moving relatively to the write element.
Claim 18
Dependent Claim 108 words
The magnetic recording channel set forth in claim 10 further comprising: a playback element for detecting the flux pattern on the magnetic storage medium as a minute electrical signal, an analog read channel for amplifying an equalizing to a desired spectrum the minute electrical signal to provide an amplified electrical signal, a sampler for synchronously sampling the amplified electrical signal to produce discrete data samples, a time varying detector for detecting maximum likelihood code sequences from the discrete data samples in accordance with an inverse of the predetermined time-varying maximal-transition-run code, and a decoder for decoding the sequences into a play back sequence of the binary data block.
Claim 19
Dependent Claim 21 words
The magnetic recording channel set forth in claim 10 wherein the predetermined time-varying maximal-transition-run code is a rate 8/9 block code.
Claim 20
Dependent Claim 19 words
The magnetic recording channel set forth in claim 12 wherein the rate 8/9 block code has constraint (d=0, k=11).
Claim 21
Dependent Claim 20 words
The magnetic recording channel set forth in claim 12 wherein the rate 8/9 block code has constraint (d=0, G=13, I=9).
Claim 22
Dependent Claim 19 words
The data channel set forth in claim 1 wherein the channel comprises a magnetic data storage and retrieval channel.
Claim 23
Dependent Claim 19 words
The data channel set forth in claim 2 wherein the channel comprises a magnetic data storage and retrieval channel.
Claim 24
Dependent Claim 19 words
The data channel set forth in claim 3 wherein the channel comprises a magnetic data storage and retrieval channel.
Claim 25
Dependent Claim 19 words
The data channel set forth in claim 6 wherein the channel comprises a magnetic data storage and retrieval channel.
Claim 26
Dependent Claim 19 words
The data channel set forth in claim 7 wherein the channel comprises a magnetic data storage and retrieval channel.
Claim 27
Dependent Claim 19 words
The data channel set forth in claim 8 wherein the channel comprises a magnetic data storage and retrieval channel.

References Cited (Backward Citations)

US5731768A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-09-06 2003-03-08 2003-09-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-09-06 2007-03-08 2007-09-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-09-06 2011-03-08 2011-09-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag