The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Blind Equalizers
Abstract
Blind equalizers do not require any known training sequence for the startup period, but can rather perform at any time the equalization directly on the data stream. In this paper, a general approach is presented for designing efficient blind equalizers for one and two independent carrier transmission systems; a special algorithm is given for the CCITT V29 constellation.
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
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
Analysis of recursive stochastic algorithms
Ljung, L. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101561 · Cited by 1,467
A Method of Self-Recovering Equalization for Multilevel Amplitude-Modulation Systems
Sato, Y. (1975) · IEEE Transactions on Communications · doi:10.1109/tcom.1975.1092854 · Cited by 861
Principles of data communication
Lucky, R. W., Weldon, E. J., & Salz, J. (1968) · CERN Document Server (European Organization for Nuclear Research) · Cited by 754
Benveniste, A., Goursat, M., & Ruget, G. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102343 · Cited by 496
Self-citationOn positive real transfer functions and the convergence of some recursive schemes
Ljung, L. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101552 · Cited by 406
Self-Orthogonalizing Adaptive Equalization Algorithms
Gitlin, R. D., & Magee, F. R., Jr. (1977) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1977.1093886 · Cited by 103
Albert Benveniste, A., Goursat, M., & Ruget, G. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102497 · Cited by 79
Self-citation
Cited by
Fading 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
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
Cichocki, A., & Amari, S. (2002) · Wiley eBooks · doi:10.1002/0470845899 · Cited by 1,863
Subspace methods for the blind identification of multichannel FIR filters
Moulines, E., Duhamel, P., Cardoso, J.-F., & Mayrargue, S. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.348133 · Cited by 1,501
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
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
Metadata
- Authors
- Benveniste, A., & Goursat, M.
- Venue
- IEEE Transactions on Communications
- Published
- 1984-08
- Volume
- 32
- Issue
- 8
- Pages
- 871-883
- ISSN
- 0096-2244 (ISSN-L)
- OpenAlex
- W2293708794
- Cited by
- 441
- References
- 8
- FWCI
- 2.24
- 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.