The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Joint data and channel estimation using blind trellis search techniques
Abstract
A novel method of maximum likelihood sequence estimation is proposed for data that are transmitted over unknown linear channels. This procedure does not require a startup sequence for estimating the channel impulse response. Rather, the data and the channel are simultaneously estimated. It is implemented without any loss of optimality by a trellis search algorithm which searches for the best data sequence from among a number of hypothesized trellises which are constructed from the observed sequence. The number of states in each trellis and the number of trellises grow exponentially with the channel memory. A suboptimal trellis search algorithm is proposed whose complexity at best is slightly higher than that of the adaptive Viterbi algorithm operating with a known channel response. A simplified channel estimation algorithm when the number of data alphabets is greater than 2 is also proposed. Fast convergence of the algorithm in estimating the channel is demonstrated for binary pulse amplitude modulation over a variety of channels. Convergence over a wide range of SNR occurs within 100 symbols. The channel estimation algorithm for multi-level signals converges within 500-1000 symbols. We finally present an application of this algorithm to the problem of sequence estimation in the presence of rapidly time-varying intersymbol interference. The algorithm provides reliable zero-delay decisions which results in a better channel tracking algorithm when compared to previously proposed schemes.>
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
An Algorithm for Vector Quantizer Design
Linde, Y., Buzo, A., & Gray, R. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094577 · Cited by 7,201
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
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
Qureshi, S. (1982) · IEEE Communications Magazine · doi:10.1109/mcom.1982.1090994 · Cited by 1,457
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
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
Benveniste, A., & Goursat, M. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096163 · Cited by 441
The segmental K-means algorithm for estimating parameters of hidden Markov models
Juang, B.-H., & Rabiner, L. R. (1990) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.60082 · Cited by 409
Optimal quantization of LSP parameters
Soong, F. K., & Juang, B.-H. (1993) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.221364 · Cited by 163
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
Multichannel blind identification: from subspace to maximum likelihood methods
Tong, L., & Perreau, S. (1998) · Proceedings of the IEEE · doi:10.1109/5.720247 · Cited by 572
List Viterbi decoding algorithms with applications
Seshadri, N., & Sundberg, C.-E. W. (1994) · IEEE Transactions on Communications · doi:10.1109/tcomm.1994.577040 · Cited by 371
Self-citationFast maximum likelihood for blind identification of multiple FIR channels
Hua, Y. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.489039 · Cited by 307
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Metadata
- Authors
- Seshadri, N.
- Venue
- IEEE Transactions on Communications
- Published
- 1994-02
- Volume
- 42
- Issue
- 2/3/4
- Pages
- 1000-1011
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2492256567
- Cited by
- 257
- References
- 12
- FWCI
- 8.78
- 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.