The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Adaptive equalization
Abstract
Bandwidth-efficient data transmission over telephone and radio channels is made possible by the use of adaptive equalization to compensate for the time dispersion introduced by the channel Spurred by practical applications, a steady research effort over the last two decades has produced a rich body of literature in adaptive equalization and the related more general fields of reception of digital signals, adaptive filtering, and system identification. This tutorial paper gives an overview of the current state of the art in adaptive equalization. In the first part of the paper, the problem of intersymbol interference (ISI) and the basic concept of transversal equalizers are introduced followed by a simplified description of some practical adaptive equalizer structures and their properties. Related applications of adaptive filters and implementation approaches are discussed. Linear and nonlinear receiver structures, their steady-state performance and sensitivity to timing phase are presented in some depth in the next part. It is shown that a fractionally spaced equalizer can serve as the optimum receive filter for any receiver. Decision-feedback equalization, decision-aided ISI cancellation, and adaptive filtering for maximum-likelihood sequence estimation are presented in a common framework. The next two parts of the paper are devoted to a discussion of the convergence and steady-state properties of least mean-square (LMS) adaptation algorithms, including digital precision considerations, and three classes of rapidly converging adaptive equalization algorithms: namely, orthogonalized LMS, periodic or cyclic, and recursive least squares algorithms. An attempt is made throughout the paper to describe important principles and results in a heuristic manner, without formal proofs, using simple mathematical notation where possible.
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
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Linear prediction: A tutorial review
Makhoul, J. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9792 · Cited by 4,023
WIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
Adaptive noise cancelling: Principles and applications
Widrow, B., Glover, J. R., McCool, J. M., Kaunitz, J., Williams, C. S., Hearn, R. H., Zeidler, J. R., Eugene Dong, Jr., & Goodlin, R. C. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.10036 · Cited by 3,939
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Certain Topics in Telegraph Transmission Theory
Nyquist, H. (1928) · Transactions of the American Institute of Electrical Engineers · doi:10.1109/t-aiee.1928.5055024 · Cited by 3,089
Self-Recovering Equalization and Carrier Tracking in Two-Dimensional Data Communication Systems
Godard, D. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094608 · Cited by 2,530
Forney, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054829 · Cited by 2,461
Toeplitz Forms and Their Applications
Grenander, U., & Szego, G. (1958) · University of California Press eBooks · doi:10.1525/9780520355408 · Cited by 1,526
Stationary and nonstationary learning characteristics of the LMS adaptive filter
Widrow, B., McCool, J. M., Larimore, M. G., & Johnson, C. R. (1976) · Proceedings of the IEEE · doi:10.1109/proc.1976.10286 · Cited by 1,268
Cited by
Orthogonal least squares learning algorithm for radial basis function networks
Chen, S., Cowan, C. F. N., & Grant, P. M. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80341 · Cited by 3,362
Frequency domain equalization for single-carrier broadband wireless systems
Falconer, D., Ariyavisitakul, S. L., Benyamin-Seeyar, A., & Eidson, B. (2002) · IEEE Communications Magazine · doi:10.1109/35.995852 · Cited by 2,172
Fundamentals of Adaptive Filtering
Ramirez, P. S. (2002) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4757-3637-3_2 · Cited by 1,958
Fundamentals of Coherent Optical Fiber Communications
Kikuchi, K. (2016) · Journal of Lightwave Technology · doi:10.1109/jlt.2015.2463719 · Cited by 1,041
Space-time processing for wireless communications
Paulraj, A. J., & Papadias, C. B. (1997) · IEEE Signal Processing Magazine · doi:10.1109/79.637317 · Cited by 1,030
Medard, M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841172 · Cited by 931
Coherent detection in optical fiber systems
Ip, E., Lau, A. P. T., Barros, D. J. F., & Kahn, J. M. (2008) · Optics Express · doi:10.1364/oe.16.000753 · Cited by 901
New criteria for blind deconvolution of nonminimum phase systems (channels)
Shalvi, O., & Weinstein, E. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.52478 · Cited by 863
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
Fast, recursive-least-squares transversal filters for adaptive filtering
Cioffi, J., & Kailath, T. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164334 · Cited by 730
Information Theoretic Learning
Erdogmus, D., & Principe, J. C. (2009) · Encyclopedia of Artificial Intelligence · doi:10.4018/978-1-59904-849-9.ch133 · Cited by 506
Benvenuto, N., Dinis, R., Falconer, D., & Tomasin, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2031562 · Cited by 406
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
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
Adaptive frequency-domain equalization and diversity combining for broadband wireless communications
Clark, M. V. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.730448 · Cited by 254
Metadata
- Authors
- Qureshi, S.
- Venue
- IEEE Communications Magazine
- Published
- 1982-03
- Volume
- 20
- Issue
- 2
- Pages
- 9-16
- ISSN
- 0163-6804 (ISSN-L)
- OpenAlex
- W2296108426
- Cited by
- 1,457
- References
- 30
- FWCI
- 5.33
- 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.