US5889823A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for compensation of linear or nonlinear intersymbol interference and noise correlation in magnetic recording channels
Assignee: Avago Technologies International Sales Pte Ltd
•
Filing: 1995-12-13
•
Granted: 1999-03-30
•
Expires: 2015-12-13
Abstract
Abstract A method and apparatus for decoding a signal in the presence of linear or nonlinear interference, correlated noise or a combination thereof. The method involves a concatenated decoder comprising an inner decoder and a postprocessor. N most likely paths are generated by the inner decoder, or a combination of the inner decoder and an error event generator. These paths are then presented to the postprocessor which computes metrics for each path based on information about the signal, not considered by the inner decoder. These metrics can be based on linear or nonlinear model of the channel and optionally, a noise whitened signal for noise decorrelation. The path with the best metric is selected as the concatenated decoder output. The postprocessor can also be implemented in the presence of channel codes. It is also shown that the postprocessor is especially suited for a trellis implementation. When applied to magnetic recording channels, the method of the present invention allows for increased recording capacity. In addition, the present invention requires less computation and results in a reduction of the power dissipation of about two orders of magnitude compared to alternative approaches.
Inventors
- 👤 Oscar E. Agazzi
- 👤 Nambirajan Seshadri
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 10:05
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/10; G11B20/10009
Claims Analysis
Total Claims: 30
Claim 1
Independent Claim
113 words
A method for decoding a received digital signal transmitted over a channel, said method comprising: generating N most likely paths representing said received digital signal, each of said N most likely paths having a first type metric associated therewith, said first type metric based on a simplified model of said channel; and postprocessing said N most likely paths for a final most likely path representative of said received digital signal, said most likely path indicated by a best second type metric, said best second type metric based on a comprehensive model of said channel which accounts for at least one source of channel information from a group consisting of intersymbol interference and nonlinearity.
Claim 2
Independent Claim
113 words
A method for decoding a received digital signal transmitted over a channel, said method comprising: generating N most likely paths representing said received digital signal, each of said N most likely paths having a first type metric associated therewith, said first type metric based on a simplified model of said channel; and postprocessing said N most likely paths for a final most likely path representative of said received digital signal, said most likely path indicated by a best second type metric, said best second type metric based on a comprehensive model of said channel which accounts for at least one source of channel information from a group consisting of intersymbol interference and nonlinearity.
Claim 3
Dependent Claim
14 words
A method according to claim 1 wherein said channel is a magnetic recording channel.
Claim 4
Dependent Claim
73 words
A method according to claim 1 wherein said generating step further comprises the steps of: generating a single tentative most likely path representative of said received digital signal; computing a finite number of most likely error events based on said simplified model of said channel; and generating said N most likely paths by combining said tentative most likely path with said finite number of most likely error events using a trellis style implementation.
Claim 5
Dependent Claim
19 words
A method according to claim 3 wherein said most likely error events are based on said first type metric.
Claim 6
Dependent Claim
22 words
A method according to claim 1 wherein said simplified model of said channel does not consider a nonlinear component of said channel.
Claim 7
Dependent Claim
23 words
A method according to claim 1 wherein said simplified model of said channel does not consider a noise correlation component of said channel.
Claim 8
Dependent Claim
20 words
A method according to claim 5 wherein said nonlinearity of said comprehensive model is based on a Volterra series expansion.
Claim 9
Dependent Claim
19 words
A method according to claim 5 wherein said nonlinearity of said comprehensive model is based on a lookup table.
Claim 10
Dependent Claim
17 words
A method according to claim 1 wherein said generating step is implemented with an N-best Viterbi decoder.
Claim 11
Dependent Claim
27 words
A method according to claim 1 wherein said N most likely paths are constrained to paths having a first type metric value less than a predetermined threshold.
Claim 12
Dependent Claim
25 words
A method according to claim 1 wherein said comprehensive model of said channel further accounts for the effect of correlation of noise in said channel.
Claim 13
Dependent Claim
28 words
A method according to claim 1 wherein said received digital signal was transmitted with a channel code and said generating N most likely paths ignores said channel code.
Claim 14
Dependent Claim
42 words
A method according to claim 3 wherein said received digital signal was transmitted with a channel code, said generating a single tentative most likely path step ignores said channel code and said most likely error events are based on said channel code.
Claim 15
Dependent Claim
103 words
A method according to claim 1 wherein said received digital signal is divisible into one or more blocks of data, each of said blocks being constrained under a channel code, further comprising the steps of: determining whether any of said blocks of said N most likely path, violates said channel code; eliminating said paths of said N most likely paths having a channel code violation, said paths of said N most likely paths not eliminated, comprising a set of N' most likely paths; and activating said postprocessing step if said set of N' most likely paths comprises more than one most likely path.
Claim 16
Dependent Claim
17 words
A method according to claim 11 wherein said postprocessing step includes the use of a noise-whitening filter.
Claim 17
Dependent Claim
94 words
A concatenated decoder for decoding a received digital signal transmitted over a channel comprising: an inner N-best Viterbi decoder; and a postprocessor comprising computer implemented means for computing a metric based on a comprehensive model of said channel, said comprehensive model accounting for at least one source of channel information from a group consisting of intersymbol interference and nonlinearity; and computer implemented means for selecting a most likely path representative of said received digital signal, based on said metric, wherein said postprocessor further comprises means for adaptive channel estimation of characteristics of said channel.
Claim 18
Dependent Claim
94 words
A concatenated decoder for decoding a received digital signal transmitted over a channel comprising: an inner N-best Viterbi decoder; and a postprocessor comprising computer implemented means for computing a metric based on a comprehensive model of said channel, said comprehensive model accounting for at least one source of channel information from a group consisting of intersymbol interference and nonlinearity; and computer implemented means for selecting a most likely path representative of said received digital signal, based on said metric, wherein said postprocessor further comprises means for adaptive channel estimation of characteristics of said channel.
Claim 19
Dependent Claim
26 words
A concatenated decoder according to claim 16 wherein said means for estimating channel characteristics of said channel includes means for estimating nonlinear components of said channel.
Claim 20
Dependent Claim
118 words
A concatenated decoder for decoding a received digital signal transmitted over a channel, comprising: an inner decoder for generating N most likely paths representing said received digital signal, each of said N most likely paths having a first type metric associated therewith, said first type metric based on a simplified model of said channel; and a postprocessor for determining a final most likely path from said N most likely paths representative of said received digital signal, said most likely path indicated by a best second type metric, said second type metric based on a comprehensive model of said channel which accounts for at least one source of channel information from the group consisting of intersymbol interference and nonlinearity.
Claim 21
Dependent Claim
118 words
A concatenated decoder for decoding a received digital signal transmitted over a channel, comprising: an inner decoder for generating N most likely paths representing said received digital signal, each of said N most likely paths having a first type metric associated therewith, said first type metric based on a simplified model of said channel; and a postprocessor for determining a final most likely path from said N most likely paths representative of said received digital signal, said most likely path indicated by a best second type metric, said second type metric based on a comprehensive model of said channel which accounts for at least one source of channel information from the group consisting of intersymbol interference and nonlinearity.
Claim 22
Dependent Claim
74 words
A concatenated decoder according to claim 18 wherein said inner decoder further comprises: a decoder having a single tentative most likely path output; means for computing a finite number of most likely error events based on a simplified model of said channel; and means for generating said N most likely paths by combining said single most likely path decoder output with said finite number of most likely error events using a trellis style implementation.
Claim 23
Dependent Claim
105 words
A concatenated decoder according to claim 18, wherein said received digital signal is divisible into one or more blocks of data, and each of said blocks being constrained under a channel code, further comprising: means for determining whether any of said N most likely paths, violates said channel code; means for eliminating said paths of said N most likely paths having a channel code violation, said paths of said N most likely paths not eliminated, comprising a set of N' most likely paths; and means for activating said postprocessing step if said set of N' most likely paths comprises more than one most likely path.
Claim 24
Independent Claim
115 words
A method for decoding a received digital signal transmitted over a channel, said method comprising: generating a single tentative most likely path representative of said received digital signal based on a simplified model of said channel; computing a finite number of most likely error events based on said simplified model of said channel using a trellis implementation; generating N most likely paths by combining said single tentative most likely path with said finite number of most likely error events using said trellis style implementation; computing a second type metric based on a comprehensive model of said channel; and generating a single most likely path based on said second type metric using said trellis style implementation.
Claim 25
Independent Claim
115 words
A method for decoding a received digital signal transmitted over a channel, said method comprising: generating a single tentative most likely path representative of said received digital signal based on a simplified model of said channel; computing a finite number of most likely error events based on said simplified model of said channel using a trellis implementation; generating N most likely paths by combining said single tentative most likely path with said finite number of most likely error events using said trellis style implementation; computing a second type metric based on a comprehensive model of said channel; and generating a single most likely path based on said second type metric using said trellis style implementation.
Claim 26
Dependent Claim
27 words
A method according to claim 21 wherein said trellis style implementation involves one or more states, each of said states representing a different length of error event.
Claim 27
Dependent Claim
30 words
A method according to claim 22 wherein said error event comprises one or more error event types and each of said error event types are represented by a different state.
Claim 28
Dependent Claim
23 words
A method according to claim 22 wherein said channel has a PR IV response and said error events are first order error events.
Claim 29
Dependent Claim
23 words
A method according to claim 23 wherein said channel has an EPR IV response and said error events are first order error events.
Claim 30
Dependent Claim
30 words
A method according to claim 21 wherein said comprehensive model accounts for at least one source of channel information from the group consisting of intersymbol interference, nonlinearity and noise correlation.
References Cited (Backward Citations)
US5228061A
Cited
US5329586A
Cited
US5537444A
Cited
US5488637A
Cited
US5457704A
Cited
US5619539A
Cited
US5521945A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-03-29 | 2002-09-28 | 2003-03-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-29 | 2006-09-28 | 2007-03-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-29 | 2010-09-28 | 2011-03-30 | $7700.00 | Window Closed / Lapsed |