Patent US5095484A successfully refreshed from Google Patents.
US5095484A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Phase invariant rate 8/10 matched spectral null code for PRML
Assignee: International Business Machines Corp
•
Filing: 1991-08-19
•
Granted: 1992-03-10
•
Expires: 2011-08-19
Abstract
Abstract A method for coding a binary data string for a partial-response channel having a transfer function with a spectral null at zero frequency to provide a coding rate 8/10 and an output which is invariant to 180-degree phase shifts in the channel output signal. A finite-state machine is created having two pairs of states and a plurality of codewords each corresponding to a respective binary data byte. The binary data string is encoded by said machine into a string of binary codewords having a power spectrum value of zero for a frequency of zero. In response to each successive data byte in the binary data string, there is generated one of two complementary codewords from the one of that pair of the states designated by said machine as corresponding to the data byte for the then current state of the machine. The sequence of said one complementary codewords is so decoded as to provide the same data output for said codeword sequence and its complement, irrespective of which of said complementary codewords was generated. The next state of said machine is preselected according to the value of the data byte and current state, and the next state for one element of a pair is the complement of the next state for the other element of the same pair.
Inventors
- 👤 Razmik Karabed
- 👤 Paul H. Siegel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 20:21
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; H03M13/00; H03M13/31; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; G11B2020/1438
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
240 words
A method for coding a binary data string for a partial-response channel having a transfer function with a spectral null at zero frequency, said method comprising the steps of: (a) providing from a matched spectral null canonical state diagram a code which does not generate quasi-catastrophic sequences and having a coding rate and an output which is invariant to 180- degree phase shifts in a channel output signal; (b) creating a finite-state machine having a plurality of pairs of states and a plurality of codewords each corresponding to a respective binary data byte; (c) responsive to a data byte in the binary data string, generating one of two complementary codewords from the one of that pair of said states designated by said machine as corresponding to said data byte for a then current state of the machine for thereby encoding the binary data string into a string of binary codewords having a spectral null constraint producing a power spectrum value of zero for a frequency of zero; (d) providing a Viterbi detector; (e) matching a trellis in the Viterbi detector to the spectral null constraint for generating from a potentially noisy channel output signal an estimate of the most probable sequence of binary codewords produced by said finite-state machine; and (f) without look-ahead or look-back, decoding said one complementary codeword in such manner as to provide the same data byte output irrespective of which of said complementary codewords was generated.
Claim 2
Independent Claim
240 words
A method for coding a binary data string for a partial-response channel having a transfer function with a spectral null at zero frequency, said method comprising the steps of: (a) providing from a matched spectral null canonical state diagram a code which does not generate quasi-catastrophic sequences and having a coding rate and an output which is invariant to 180- degree phase shifts in a channel output signal; (b) creating a finite-state machine having a plurality of pairs of states and a plurality of codewords each corresponding to a respective binary data byte; (c) responsive to a data byte in the binary data string, generating one of two complementary codewords from the one of that pair of said states designated by said machine as corresponding to said data byte for a then current state of the machine for thereby encoding the binary data string into a string of binary codewords having a spectral null constraint producing a power spectrum value of zero for a frequency of zero; (d) providing a Viterbi detector; (e) matching a trellis in the Viterbi detector to the spectral null constraint for generating from a potentially noisy channel output signal an estimate of the most probable sequence of binary codewords produced by said finite-state machine; and (f) without look-ahead or look-back, decoding said one complementary codeword in such manner as to provide the same data byte output irrespective of which of said complementary codewords was generated.
Claim 3
Dependent Claim
54 words
The method of claim 1, including the step of: (g) preselecting a next state of said machine dependent upon which of the states in said pair is the current state, said next state for the element of a pair being the complement of the next state for the other element of the same pair.
Claim 4
Dependent Claim
18 words
The method of claim 1, including implementing step (f) by decoding said one complementary codeword by table lookup.
Claim 5
Dependent Claim
21 words
The method of claim 1, wherein the channel is a dicode (1-D) channel, and the output has an 8/10 coding rate.
Claim 6
Independent Claim
261 words
A method for coding a binary data string for a partial-response channel having a transfer function with a spectral null at zero frequency, said method comprising the steps of: (a) providing from a matched spectral null canonical state diagram a code which does not generate quasi-catastrophic sequences and having a coding rate and an output which is invariant to 180-degree phase shifts in a channel output signal; (b) creating a fininte-state machine having a plurality of pairs of states and a plurality of codewords each corresponding to a respective binary data byte; (c) responsive to a data byte in the binary data string, generating one of two complementary codewords from the one of that pair of said states designated by said machine as corresponding to said data byte for a then current state of the machine for thereby encoding the binary data string into a string of binary codewords having a spectral null constraint producing a power spectrum value of zero for a frequency of zero; (d) repeating step (c) for successive bytes of the binary data string to generate a sequence of codewords; and (e) providing a Viterbi detector having a finite path memory; (f) matching a trellis in the Viterbi detector to the spectral null constraint for generating from a potentially noisy channel output signal an estimate of the most probable sequence of binary codewords produced by said finite-state machine; and (g) decoding said sequence of codewords in a decoder requiring no look-ahead or look-back for providing the same binary data string output for said sequence or its complement.
Claim 7
Independent Claim
261 words
A method for coding a binary data string for a partial-response channel having a transfer function with a spectral null at zero frequency, said method comprising the steps of: (a) providing from a matched spectral null canonical state diagram a code which does not generate quasi-catastrophic sequences and having a coding rate and an output which is invariant to 180-degree phase shifts in a channel output signal; (b) creating a fininte-state machine having a plurality of pairs of states and a plurality of codewords each corresponding to a respective binary data byte; (c) responsive to a data byte in the binary data string, generating one of two complementary codewords from the one of that pair of said states designated by said machine as corresponding to said data byte for a then current state of the machine for thereby encoding the binary data string into a string of binary codewords having a spectral null constraint producing a power spectrum value of zero for a frequency of zero; (d) repeating step (c) for successive bytes of the binary data string to generate a sequence of codewords; and (e) providing a Viterbi detector having a finite path memory; (f) matching a trellis in the Viterbi detector to the spectral null constraint for generating from a potentially noisy channel output signal an estimate of the most probable sequence of binary codewords produced by said finite-state machine; and (g) decoding said sequence of codewords in a decoder requiring no look-ahead or look-back for providing the same binary data string output for said sequence or its complement.
Claim 8
Dependent Claim
24 words
The method of claim 5, including implementing step (g) by decoding the codewords of a sequence one codeword at a time by table lookup.
Claim 9
Dependent Claim
21 words
The method of claim 5, wherein the channel is a dicode (1-D) channel, and the output has an 8/10 coding rate.
References Cited (Backward Citations)
GB2099263A
Cited
EP0104700A1
Cited
US4620311A
Cited
US4779072A
Cited
US4775985A
Cited
EP0333321A2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-03-10 | 1995-09-09 | 1996-03-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-03-10 | 1999-09-09 | 2000-03-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-03-10 | 2003-09-09 | 2004-03-10 | $7700.00 | Window Closed / Lapsed |