Journal Article10.1109/TIT.1971.1054689
Correlative level coding and maximum-likelihood decoding
TL;DR: An application of the maximum-likelihood decoding (MLD) algorithm, which was originally proposed by Viterbi in decoding convolutional codes, is discussed and it is shown that a substantial performance gain is attainable by this probabilistic decoding method.
read more
Abstract: Modems for digital communication often adopt the so-called correlative level coding or the partial-response signaling, which attains a desired spectral shaping by introducing controlled intersymbol interference terms. In this paper, a correlative level encoder is treated as a linear finite-state machine and an application of the maximum-likelihood decoding (MLD) algorithm, which was originally proposed by Viterbi in decoding convolutional codes, is discussed. Asymptotic expressions for the probability of decoding error are obtained for a class of correlative level coding systems, and the results are confirmed by computer simulations. It is shown that a substantial performance gain is attainable by this probabilistic decoding method.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The viterbi algorithm
Jr. G.D. Forney
- 01 Mar 1973
TL;DR: This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
6.5K
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
TL;DR: In this paper, a maximum likelihood sequence estimator for a digital pulse-amplitude-modulated sequence in the presence of finite intersymbol interference and white Gaussian noise is developed, which comprises a sampled linear filter, called a whitened matched filter, and a recursive nonlinear processor, called the Viterbi algorithm.
2.6K
Decision feedback equalization
C.A. Belfiore,J.H. Park +1 more
- 01 Aug 1979
TL;DR: It is shown that the linear equalizer is in fact a portion of the D FE receiver and that the processing done by the DFE is exactly equivalent to the general problem of linear prediction.
511
A PRML system for digital magnetic recording
TL;DR: The realization of a digital recording system using partial-response class-IV signaling with maximum-likelihood sequence detection (MLSD) and a simple implementation of the Viterbi detector based on a difference-metric algorithm is developed.
467
Patent
System and method for error correcting a received data stream in a concatenated system
Hisashi Kobayashi,Jan Bajcsy +1 more
- 28 Apr 1997
TL;DR: In this article, a concatenation of an outer coder, a permutation and an inner coder is proposed to eliminate or reduce the erasures in a received signal.
284
References
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
TL;DR: The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R_{0} and whose performance bears certain similarities to that of sequential decoding algorithms.
7.6K
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
TL;DR: In this paper, a maximum likelihood sequence estimator for a digital pulse-amplitude-modulated sequence in the presence of finite intersymbol interference and white Gaussian noise is developed, which comprises a sampled linear filter, called a whitened matched filter, and a recursive nonlinear processor, called the Viterbi algorithm.
2.6K
Application of partial-response channel coding to magnetic recording systems
Hisashi Kobayashi,D. T. Tang +1 more
TL;DR: A conventional NRZI method of recording is shown to be equivalent to the "precoding" of this particular partial-response channel, the purpose of which is to limit the propagation of error in the channel output, and an error detection scheme is presented that takes full advantage of the inherent redundancy in the three-level channel output.
273
Generalization of a Techinque for Binary Data Communication
TL;DR: A technique for binary data transmission is described, in which each binary symbol is chosen to be a prescribed superposition of n impulses of form (sin 2\piFt)/2\ piFt , spaced at intervals 1/2F.
239