Patent US4888779A successfully refreshed from Google Patents.
US4888779A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Matched spectral null trellis codes for partial response channels
Assignee: International Business Machines Corp
•
Filing: 1988-03-18
•
Granted: 1989-12-19
•
Expires: 2008-03-18
Abstract
Abstract A method is disclosed for coding input strings for a partial response channel to provide an output having a reliability determined by a preselectable coding gain. This method involves determining each frequency at which there is a zero in the transfer function of the partial response channel, and then encoding an input string into a binary code string having a power spectrum value of zero for each such frequency. A channel output sequence is generated responsively to transmission of the code string through the channel. The most probable sequence among those having a power spectrum value of zero is then calculated from the channel output sequence and decoded to provide the output.
Inventors
- 👤 Razmik Karabed
- 👤 Paul H. Siegel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 12:32
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/497
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
77 words
A method for coding an input string for a partial response channel having a transfer function to provide an output having a preselectable coding rate with an improved coding gain, said method comprising the steps of: (a) determining each frequency at which there is a zero in the transfer function of the partial response channel; and (b) encoding an input string into a binary code string having a power spectrum value of zero for each such frequency.
Claim 2
Independent Claim
77 words
A method for coding an input string for a partial response channel having a transfer function to provide an output having a preselectable coding rate with an improved coding gain, said method comprising the steps of: (a) determining each frequency at which there is a zero in the transfer function of the partial response channel; and (b) encoding an input string into a binary code string having a power spectrum value of zero for each such frequency.
Claim 3
Dependent Claim
62 words
The method of claim 1, including the further steps of: (c) generating a channel output sequence responsively to transmission of the code string through the channel; and (d) calculating from the channel output sequence the most probable sequence among those having power spectrum values of zero for providing an output string substantially identical with the binary code string generated in step (b).
Claim 4
Dependent Claim
48 words
The method of claim 2, wherein the code sequence has a spectral content, and step (d) is executed by recursively updating the spectral content of the code sequence for reducing the complexity of calculation of the most probable channel output sequence having zero power at each such frequency.
Claim 5
Dependent Claim
36 words
The method of claim 2, wherein step (d) is executed by deriving a trellis diagram from a finite state diagram that depicts input sequences and corresponding channel output sequences having zero power at each such frequency.
Claim 6
Dependent Claim
21 words
The method of claim 2, including the additional step of: decoding the calculated most probable code sequence to provide the output.
Claim 7
Dependent Claim
20 words
The method of claim 5, wherein the decoding step is performed by a sliding block decoder providing limited error propagation.
Claim 8
Dependent Claim
16 words
The method of claim 1, wherein the encoding step is performed by a finite state machine.
Claim 9
Dependent Claim
24 words
The method of claim 1, wherein during the encoding step the only binary code strings produced are those having a predetermined level of reliability.
Claim 10
Dependent Claim
39 words
The method of claim 1, wherein during the encoding step the only binary code strings produced are those having less than a predetermined number of consecutive zeroes in their channel output sequence, for thereby improving timing and gain control.
Claim 11
Independent Claim
120 words
A method for coding an input string for a partial response channel having a transfer function to provide an output having a preselectable coding rate and a reliability determined by a preselectable coding gain, comprising the steps of: (a) determining each frequency at which there is a zero in the transfer function of the partial response channel; (b) concurrently determining how many consecutive derivatives of the transfer functions which zero at each of said frequencies; and (c) encoding an input string into a code string having a power spectrum value of zero for each such frequency and with a number of consecutive derivatives of the power spectrum which are zero, the last-mentioned number being determined by the coding gain preselected.
Claim 12
Independent Claim
120 words
A method for coding an input string for a partial response channel having a transfer function to provide an output having a preselectable coding rate and a reliability determined by a preselectable coding gain, comprising the steps of: (a) determining each frequency at which there is a zero in the transfer function of the partial response channel; (b) concurrently determining how many consecutive derivatives of the transfer functions which zero at each of said frequencies; and (c) encoding an input string into a code string having a power spectrum value of zero for each such frequency and with a number of consecutive derivatives of the power spectrum which are zero, the last-mentioned number being determined by the coding gain preselected.
Claim 13
Dependent Claim
24 words
The method of claim 10, wherein during the encoding step the only binary code strings produced are those having a predetermined level of reliability.
Claim 14
Dependent Claim
39 words
The method of claim 10, wherein during the encoding step the only binary code strings produced are those having less than a predetermined number of consecutive zeroes in its channel output sequence, for thereby improving timing and gain control.
Claim 15
Dependent Claim
15 words
The method of claim 10, wherein coding gains of up to 7 dB are achieved.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-12-18 | 1993-06-19 | 1993-12-19 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-12-18 | 1997-06-19 | 1997-12-19 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-12-18 | 2001-06-19 | 2001-12-19 | $7700.00 | Window Closed / Lapsed |