The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Simulation-Based Computation of Information Rates for Channels With Memory
Abstract
The information rate of finite-state source/channel models can be accurately estimated by sampling both a long channel input sequence and the corresponding channel output sequence, followed by a forward sum–product recursion on the joint source/channel trellis. This method is extended to compute upper and lower bounds on the information rate of very general channels with memory by means of finite-state approximations. Further upper and lower bounds can be computed by reduced-state methods.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Discrete-Time Signal Processing
Oppenheim, A. V., & Schafer, R. W. (1989) · Cited by 12,566
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 2×
“(This graph is a Forney-style factor graph, see [14], [25]; add a circle on each branch to obtain a factor graph as in [23].”
Self-citationOptimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055186 · Cited by 5,208
Discrete-time Signal Processing
Williamson, D. (1999) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0541-1 · Cited by 4,858
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
ASH, R. B. (1966) · Cited by 3,990
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
An Introduction to factor graphs
Loeliger, H. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267047 · Cited by 905
Self-citationAn algorithm for computing the capacity of arbitrary discrete memoryless channels
Arimoto, S. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054753 · Cited by 838
Ephraim, Y., & Merhav, N. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003838 · Cited by 798
Codes on graphs: normal realizations
Forney, G. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910573 · Cited by 642
Maximum-likelihood estimation for hidden Markov models
Leroux, B. G. (1992) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(92)90141-c · Cited by 421
A Probabilistic Distance Measure for Hidden Markov Models
Juang, B.-H., & Rabiner, L. R. (1985) · AT&T Technical Journal · doi:10.1002/j.1538-7305.1985.tb00439.x · Cited by 375
Probabilistic Functions of Finite State Markov Chains
Petrie, T. (1969) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697807 · Cited by 158
A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels
Vontobel, P. O., Kavcic, A., Arnold, D. M., & Loeliger, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.920243 · Cited by 118
Self-citationCapacity and information rates of discrete-time channels with memory
Hirt, W. (1988) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-000518487 · Cited by 59
Computation of Information Rates from Finite-State Source/Channel Models
Arnold, D., Loeliger, H., & Vontobel, P. O. (2002) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 29
Self-citation
Cited by
Energy Harvesting Wireless Communications: A Review of Recent Advances
Ulukus, S., Yener, A., Erkip, E., Simeone, O., Zorzi, M., Grover, P., & Huang, K. (2015) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2391531 · Cited by 805
Banelli, P., Buzzi, S., Colavolpe, G., Modenini, A., Rusek, F., & Ugolini, A. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2337391 · Cited by 475
Finite-state Markov modeling of fading channels - a survey of principles and applications
Sadeghi, P., Kennedy, R., Rapajic, P., & Shams, R. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2008.926683 · Cited by 473
Throughput Analysis of Massive MIMO Uplink With Low-Resolution ADCs
Jacobsson, S., Durisi, G., Coldrey, M., Gustavsson, U., & Studer, C. (2017) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2017.2691318 · Cited by 406
Quantized Precoding for Massive MU-MIMO
Jacobsson, S., Durisi, G., Coldrey, M., Goldstein, T., & Studer, C. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2723000 · Cited by 367
Metadata
- Authors
- Arnold, D. M., Loeliger, H.-A., Vontobel, P. O., Kavcic, A., & Zeng, W.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-08
- Volume
- 52
- Issue
- 8
- Pages
- 3498-3508
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2165808853
- Cited by
- 563
- References
- 18
- FWCI
- 31.19
- 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.