The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A clustering technique for digital communications channel equalization using radial basis function networks
Abstract
The application of a radial basis function network to digital communications channel equalization is examined. It is shown that the radial basis function network has an identical structure to the optimal Bayesian symbol-decision equalizer solution and, therefore, can be employed to implement the Bayesian equalizer. The training of a radial basis function network to realize the Bayesian equalization solution can be achieved efficiently using a simple and robust supervised clustering algorithm. During data transmission a decision-directed version of the clustering algorithm enables the radial basis function network to track a slowly time-varying environment. Moreover, the clustering scheme provides an automatic compensation for nonlinear channel and equipment distortion. Computer simulations are included to illustrate the analytical results.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
(1991) · Springer eBooks · doi:10.1007/978-3-7091-2840-4 · Cited by 5,095
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Fast Learning in Networks of Locally-Tuned Processing Units
Moody, J., & Darken, C. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.281 · Cited by 4,194
Radial Basis Functions, Multi-Variable Functional Interpolation and Adaptive Networks
Broomhead, D. S., & Lowe, D. (1988) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3,443
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
Self-citationNetworks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
Alexander, S. T. (1986) · Springer eBooks · doi:10.1007/978-1-4612-4978-8 · Cited by 2,646
Forney, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054829 · Cited by 2,461
Qureshi, S. (1982) · IEEE Communications Magazine · doi:10.1109/mcom.1982.1090994 · Cited by 1,457
Cited by
Karnik, N. N., Mendel, J. M., & Liang, Q. (1999) · IEEE Transactions on Fuzzy Systems · doi:10.1109/91.811231 · Cited by 1,643
An Adaptive Learning System Based on Learner’s Knowledge Level
AL-Chalabi, H. K. M., Hussein, A. M. A., & Apoki, U. C. (2021) · 2021 13th International Conference on Electronics, Computers and Artificial Intelligence (ECAI) · doi:10.1109/ecai52376.2021.9515158 · Cited by 19
Metadata
- Authors
- Chen, S., Mulgrew, B., & Grant, P. M.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1993-07
- Volume
- 4
- Issue
- 4
- Pages
- 570-590
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2127221278
- Cited by
- 797
- References
- 15
- FWCI
- 13.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A clustering technique for digital communications channel equalization using radial basis function networks. https://app.cochat.ai/papers/10.1109/72.238312
- The paper
- Chen, S., Mulgrew, B., & Grant, P. M. (1993). A clustering technique for digital communications channel equalization using radial basis function networks. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.238312
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.