The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference
Abstract
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, The structure comprises a sampled linear filter, called a whitened matched filter, and a recursive nonlinear processor, called the Viterbi algorithm. The outputs of the whitened matched filter, sampled once for each input symbol, are shown to form a set of sufficient statistics for estimation of the input sequence, a fact that makes obvious some earlier results on optimum linear processors. The Viterbi algorithm is easier to implement than earlier optimum nonlinear processors and its performance can be straightforwardly and accurately estimated. It is shown that performance (by whatever criterion) is effectively as good as could be attained by any receiver structure and in many cases is as good as if intersymbol interference were absent. Finally, a simplified but effectively optimum algorithm suitable for the most popular partial-response schemes is described.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
Detection, Estimation, and Modulation Theory, Part I
Van Trees, H. L. (2001) · John Wiley & Sons, Inc. eBooks · doi:10.1002/0471221082 · Cited by 3,891
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Convolutional Codes and Their Performance in Communication Systems
Viterbi, A. (1971) · IEEE Transactions on Communication Technology · doi:10.1109/tcom.1971.1090700 · Cited by 1,012
Principles of data communication
Lucky, R. W., Weldon, E. J., & Salz, J. (1968) · CERN Document Server (European Organization for Nuclear Research) · Cited by 754
An Adaptive Decision Feedback Equalizer
George, D., Bowen, R. R., & Storey, J. (1971) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1971.1090652 · Cited by 148
Solutions of the Shortest-Route Problem—A Review
Pollack, M., & Wiebenson, W. (1960) · Operations Research · doi:10.1287/opre.8.2.224 · Cited by 114
Finite Graphs and Networks, An Introduction with Applications.
Harary, F., Busacker, R. G., & Saaty, T. L. (1967) · American Mathematical Monthly · doi:10.2307/2314099 · Cited by 104
Cited by
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Self-citationFading channels: information-theoretic and communications aspects
Biglieri, E., Proakis, J., & Shamai, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720551 · Cited by 1,931
Spatio-temporal coding for wireless communication
Raleigh, G. G., & Cioffi, J. M. (1998) · IEEE Transactions on Communications · doi:10.1109/26.662641 · Cited by 1,460
Qureshi, S. (1982) · IEEE Communications Magazine · doi:10.1109/mcom.1982.1090994 · Cited by 1,457
Transmit beamforming for physical-layer multicasting
Sidiropoulos, N. D., Davidson, T. N., & Luo, Z.-Q. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872578 · Cited by 1,335
Blind identification and equalization based on second-order statistics: a time domain approach
Tong, L., Xu, G., & Kailath, T. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.312157 · Cited by 1,078
Beyond Massive MIMO: The Potential of Data Transmission With Large Intelligent Surfaces
Hu, S., Rusek, F., & Edfors, O. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2816577 · Cited by 892
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
Yang, S., & Hanzo, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2475242 · Cited by 814
Chen, S., Mulgrew, B., & Grant, P. M. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238312 · Cited by 797
Adaptive Maximum-Likelihood Receiver for Carrier-Modulated Data-Transmission Systems
Ungerboeck, G. (1974) · IEEE Transactions on Communications · doi:10.1109/tcom.1974.1092267 · Cited by 653
Modulation and coding for linear Gaussian channels
Forney, G. D., & Ungerboeck, G. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720542 · Cited by 597
Self-citationA statistical discrete-time model for the WSSUS multipath channel
Hoeher, P. (1992) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.182598 · Cited by 591
Sage, D., Neumann, F. R., Hediger, F., Gasser, S. M., & Unser, M. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.852787 · Cited by 456
A new approach to blind identification and equalization of multipath channels
Tong, L., Xu, G., & Kailath, T. (2002) · [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers · doi:10.1109/acssc.1991.186568 · Cited by 438
Koetter, R., Singer, A. C., & Tuchler, M. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267050 · Cited by 423
Joint data and channel estimation using blind trellis search techniques
Seshadri, N. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.580208 · Cited by 257
Metadata
- Authors
- Forney, G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1972-05
- Volume
- 18
- Issue
- 3
- Pages
- 363-378
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2131086249
- Cited by
- 2,461
- References
- 8
- FWCI
- 41.49
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.