Codes for digital recorders

Immink, K.E. Schouhamer; Siegel, Paul H.; Wolf, J.K.

doi:10.1109/18.720539

Cited by 200 publications

(46 citation statements)

References 172 publications

(210 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The abscissa indicates different values of the filter coefficient |c 1 |. The three plots correspond to three different patterneliminating codes, namely a) (7, 6), b) (6, 5), and c) (5,4). The vertical lines correspond to filter coefficients for a zero-forcing equalizer and eyemaximization equalizer.…”

Section: Case Study: the High-speed Linkmentioning

confidence: 98%

“…Although a variety of existing communication techniques, such as Tomlinson precoding [1], partialresponse maximum likelihood (PRML) [2], vector coding [3] or distance-enhancing constraint coding [4] among others, combat the ISI to some degree, their complexity/hardware requirements may not be suitable for all applications. Instead, this paper explores the possibility of achieving a performance gain relying only on simplistic encoding and decoding.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels

Blitvic

Zheng

Stojanović

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

This paper introduces low-complexity block codes, termed pattern-eliminating codes (PEC), which achieve a potentially large performance improvement over channels with residual inter-symbol interference (ISI). The codes are systematic, require no decoding and allow for simple encoding. They operate by prohibiting the occurrence of harmful symbol patterns. On some discrete-time communication channels, the (n, n − 1) PEC can prohibit all occurrences of symbol patterns causing worstcase ISI. The effectiveness of a PEC is shown to be uniquely determined by the sign-signature of the channel response, and a simple criterion is given for identifying channels for which the (n, n − 1) code is effective. It is also shown that for most channel signatures, the (n, n − 1) PEC can be augmented by a (0, n − 1) runlength-limiting (RLL) code at no additional coding overhead. This paper also explores properties of the (n, n−b) PEC for b > 1. The simulation results show that the (n, n − 1) PEC can provide error-rate reductions of several orders of magnitude, even with rate penalty taken into account. It is also shown that channel conditioning, such as equalization, can have a large effect on the code performance and potentially large gains can be derived from optimizing the equalizer jointly with a pattern-eliminating code.

show abstract

Section: Case Study: the High-speed Linkmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels

Blitvic

Zheng

Stojanović

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

“…The average code length is: (1,3) This code accepts minimum one '0' and maximum 3 bits '0' between two consecutive bits '1'.…”

Section: Vrmentioning

confidence: 99%

“…If the code rate m:n satisfies the inequality (2), then a finite-state encoder m:n RLL (d, k) with a sliding-block decoder (with finite memory and finite anticipation) exists, and each binary block data is encoded into the (d, k) constraints at the constant rate m: n [2], [3]:…”

Section: Introduction To Rll Codesmentioning

confidence: 99%

Variable-length Run-Length Limited codes

Scripcariu

Frunza

2009

2009 International Symposium on Signals, Circuits and Systems

View full text Add to dashboard Cite

A new type of Run-Length Limited (RLL) codes with variable code length (VLRLL) is presented and a method of design it is developed. Some numerical examples are given in order to explain the proposed design method. We also present and analyze some VLRLL codes and a comparison with fix-to-fix similar RLL codes is made in order to relieve the increase of the code efficiency obtained by variable code length principle.

show abstract

“…Recently, several trellis codes that eliminate the most common error events by using coding constraints have been proposed for PR signaling [8]- [18]. Most common errors in higher order PR channels are caused by sequences of three or more consecutive recorded transitions.…”

Section: B Time-varying Maximum Transition Runlength (Tmtr) Codes Anmentioning

confidence: 99%

Reduced complexity sequence detection for high-order partial response channels

Leung

Nikolić²,

Fu³

et al. 2001

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-Detector hardware complexity of high-order partial response magnetic read channels is a major obstacle to high data rate operation and reduced area and power consumption. The method presented here reduces the complexity of single-step and two-step implementations of the Viterbi detector by applying a distance-enhancing code that eliminates some states from the code trellis. The complexity of the detector is further reduced by eliminating less-probable branches from the trellis. This is accomplished by a simple control mechanism that uses the signs of the consecutive input samples. The reduced set of add-compare-select (ACS) units is dynamically assigned to the detector states, decreasing the complexity of the Viterbi detector by roughly 50%. This method is demonstrated on high-order partial response systems with the E 2 PR4 target and an 11-level/32-state target. The simulation results show negligible bit error rate (BER) degradation for signal-to-noise ratios in the range of operation of contemporary disk drive read channels.

show abstract

Codes for digital recorders

Cited by 200 publications

References 172 publications

Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels

Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels

Variable-length Run-Length Limited codes

Reduced complexity sequence detection for high-order partial response channels

Contact Info

Product

Resources

About