The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Channel Equalization Using a Kalman Filter for Fast Data Transmission
Abstract
This paper shows how a Kalman filter may be applied to the problem of setting the tap gains of transversal equalizers to minimize mean-square distortion. In the presence of noise and without prior knowledge about the channel, the filter algorithm leads to faster convergence than other methods, its speed of convergence depending only on the number of taps. Theoretical results are given and computer simulation is used to corroborate the theory and to compare the algorithm with the classical steepest descent method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
New Results in Linear Filtering and Prediction Theory
Kalman, R. E., & Bucy, R. S. (1961) · Journal of Basic Engineering · doi:10.1115/1.3658902 · Cited by 6,387
Principles of data communication
Lucky, R. W., Weldon, E. J., & Salz, J. (1968) · CERN Document Server (European Organization for Nuclear Research) · Cited by 754
Adaptive Equalization of Highly Dispersive Channels for Data Transmission
Gersho, A. (1969) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1969.tb01106.x · Cited by 203
Cited by
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
Self-citationQureshi, S. (1982) · IEEE Communications Magazine · doi:10.1109/mcom.1982.1090994 · Cited by 1,457
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
A state-space approach to adaptive RLS filtering
Sayed, A. H., & Kailath, T. (1994) · IEEE Signal Processing Magazine · doi:10.1109/79.295229 · Cited by 449
A fast sequential algorithm for least-squares filtering and prediction
Carayannis, G., Manolakis, D., & Kalouptsidis, N. (1983) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1983.1164224 · Cited by 272
Metadata
- Authors
- Godard, D.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1974-05
- Volume
- 18
- Issue
- 3
- Pages
- 267-273
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W2093356003
- Cited by
- 254
- References
- 3
- FWCI
- 2.13
- 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.