Matched spectral-null codes for partial-response channels
نویسندگان
چکیده
A new family of codes is described that improve the reliability of digital communication over noisy, partial-response channels. The codes are intended for use on channels where the input alphabet size is limited. These channels arise in the context of digital data recording and certain data transmission applications. The codes-called matched-spectral-null codes -satisfy the property that the frequencies at which the code power spectral density vanishes correspond precisely to the frequencies at which the channel transfer function is zero. It is shown that matched-spectral-nul1 sequences provide a distance gain on the order of 3 dB and higher for a broad class of partial-response channels, including many of those of primary interest in practical applications. The embodiment of the matched-spectral-null coded partial-response system incorporates a sliding-block code and a Viterbi detector based upon a reduced-complexity trellis structure, both derived from canonical diagrams that characterize spectral-null sequences. The detectors are shown to achieve the same asymptotic average performance as maximum-likelihood sequence-detectors, and the sliding-block codes exclude quasicatastrophic trellis sequences in order to reduce the required path memory length and improve “worst-case” detector performance. Several examples are described in detail. Index Terms -Spectral-null codes, partial-response channels.
منابع مشابه
Improved Trellis-Coding for Partial-Response Channels
New code design methods and Viterbi detector architectures are presented for high-rate trelliscoded partialresponse (TCPR) systems. The methods, which extend the matched-spectral-null (MSN) coding technique, use novel code constraints and time-varying detector trellis structures to reduce path memory requirements by as much as a factor of two, relative to previously reported codes, while retain...
متن کاملUnified error analysis of DQPSK in fading channels - Electronics Letters
1 HAGENAUER, I., and HOEHER. P : 'A Viterbi algorithm with softdecision outputs and its applications'. Proc. GLOBECOM'89, Dallas, TX, USA, 1989 2 OLCER. s.: 'Concatenated d i n g for hinary partial-response channels'. Proc. ICC'94, New Orleans, LA, USA, 1994 3 YASUDA, Y., KASHIKI, K., and HIRATA, Y : 'High-rate punctured convolutional codes for soft decision Viterbi decoding', IEEE Trans., 1984...
متن کاملLee-metric BCH codes and their application to constrained and partial-response channels
We show that each code in a certain class of BCH codes over GF (p), specified by a code length n ≤ p−1 and a runlength r ≤ (p−1)/2 of consecutive roots in GF (p), has minimum Lee distance ≥ 2r. For the very high-rate range these codes approach the sphere-packing bound on the minimum Lee distance. Furthermore, for a given r, the length range of these codes is twice as large as that attainable by...
متن کاملA multilevel approach to constructing trellis-matched codes for binary-input partial-response channels
The multilevel coding approach of Imai and Hirakawa is used to construct trellis-matched codes for binary-input partial-response channels. For the codes to be trellis-matched, the signal constellations are selected according to certain constraints, but no conditions are imposed on the component codes. New codes for the (1 D) (1 + D)n channel compare favorably to existing codes.
متن کاملA 30-MHz Trellis Codec Chip for Partial-Response Channels
We present a rate 8/10 matched-spectral-null Write Channel (MSN) trellis codec chip which can increase noise tolerance in partial-response channels applicable to digital magnetic recording. The Viterbi detector in this codec features an area-efficient pipelined architecture and a modulo metric normalization technique. The chip was implemented in a 1.2-pm CMOS process with a die size of 22 mm’. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 37 شماره
صفحات -
تاریخ انتشار 1991