The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Modulation and coding for linear Gaussian channels
Abstract
Shannon's determination of the capacity of the linear Gaussian channel has posed a magnificent challenge to succeeding generations of researchers. This paper surveys how this challenge has been met during the past half century. Orthogonal minimum-bandwidth modulation techniques and channel capacity are discussed. Binary coding techniques for low-signal-to-noise ratio (SNR) channels and nonbinary coding techniques for high-SNR channels are reviewed. Recent developments, which now allow capacity to be approached on any linear Gaussian channel, are surveyed. These new capacity-approaching techniques include turbo coding and decoding, multilevel coding, and combined coding/precoding for intersymbol-interference channels.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Communication in the presence of noise
Shannon, C. E. (1949) · Proceedings of the IRE · doi:10.1109/jrproc.1949.232969 · Cited by 6,539
Multirate Systems and Filter Banks
Vaidyanathan, P. P. (1992) · CaltechAUTHORS (California Institute of Technology) · Cited by 5,457
Optimal 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
Communication In The Presence Of Noise
Shannon, C. E. (1998) · Proceedings of the IEEE · doi:10.1109/jproc.1998.659497 · Cited by 4,804
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Self-citationMulticarrier modulation for data transmission: an idea whose time has come
Bingham, J. A. C. (1990) · IEEE Communications Magazine · doi:10.1109/35.54342 · Cited by 3,438
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Baum, L. E., & Petrie, T. (1966) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177699147 · Cited by 2,775
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1997) · Electronics Letters · doi:10.1049/el:19970362 · Cited by 2,678
Forney, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054829 · Cited by 2,461
Self-citationBit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1996) · Electronics Letters · doi:10.1049/el:19961141 · Cited by 1,923
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Lee, E. A., & Messerschmitt, D. G. (1994) · Springer eBooks · doi:10.1007/978-1-4615-3136-4 · Cited by 1,683
Papoulis, A. (1977) · Cited by 1,572
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7 · Cited by 1,532
Principles of digital communication and coding
Viterbi, A. J., & Omura, J. K. (1979) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,427
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
Benedetto, S., Divsalar, D., Montorsi, G., & Pollara, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.669119 · Cited by 1,261
Low-density parity check codes over GF(q)
Davey, M. C., & MacKay, D. (1998) · IEEE Communications Letters · doi:10.1109/4234.681360 · Cited by 1,199
Communications in the presence of noise
Shannon, C. E. (1949) · Medical Entomology and Zoology · Cited by 1,198
Unveiling turbo codes: some results on parallel concatenated coding schemes
Benedetto, S., & Montorsi, G. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485713 · Cited by 1,142
Class of algorithms for decoding block codes with channel measurement information
Chase, D. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054746 · Cited by 1,105
Sipser, M., & Spielman, D. A. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556667 · Cited by 931
Probability of Error for Optimal Codes in a Gaussian Channel
Shannon, C. E. (1959) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1959.tb03905.x · Cited by 807
Trellis-coded modulation with redundant signal sets Part I: Introduction
Ungerboeck, G. (1987) · IEEE Communications Magazine · doi:10.1109/mcom.1987.1093542 · Cited by 802
Self-citationTrellis-coded modulation with redundant signal sets Part II: State of the art
Ungerboeck, G. (1987) · IEEE Communications Magazine · doi:10.1109/mcom.1987.1093541 · Cited by 692
Self-citationAdaptive 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
Self-citationOptimal nonuniform signaling for Gaussian channels
Kschischang, F. R., & Pasupathy, S. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256499 · Cited by 503
Gray, R. M. (2011) · Entropy and Information Theory · doi:10.1007/978-1-4419-7970-4_14 · Cited by 392
Digital filtering by polyphase network:Application to sample-rate alteration and filter banks
Bellanger, M., Bonnerot, G., & Coudreuse, M. (1976) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1976.1162788 · Cited by 379
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
On the performance evaluation of trellis codes
Zehavi, E., & Wolf, J. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057292 · Cited by 200
Sphere Packings and Error-Correcting Codes
Leech, J., & Sloane, N. J. A. (1971) · Canadian Journal of Mathematics · doi:10.4153/cjm-1971-081-3 · Cited by 199
Low density parity check codes over GF(q)
Davey, M. C., & MacKay, D. J. C. (2002) · 1998 Information Theory Workshop (Cat. No.98EX131) · doi:10.1109/itw.1998.706440 · Cited by 181
A fast algorithm for computing distance spectrum of convolutional codes
Cedervall, M., & Johannesson, R. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.45271 · Cited by 150
Generalized Decision-Feedback Equalization for Packet Transmission with ISI and Gaussian Noise
Cioffi, J. M., & Forney, G. D. (1997) · Springer eBooks · doi:10.1007/978-1-4615-6281-8_4 · Cited by 89
Self-citationLang, G. R., & Longstaff, F. M. (1989) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.29618 · Cited by 89
Cited by
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
Zheng, L., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810646 · Cited by 4,258
Capacity Limits of Optical Fiber Networks
Essiambre, R.-J., Kramer, G., Winzer, P. J., Foschini, G. J., & Goebel, B. (2010) · Journal of Lightwave Technology · doi:10.1109/jlt.2009.2039464 · Cited by 2,362
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
Bit-interleaved coded modulation
Caire, G., Taricco, G., & Biglieri, E. (2002) · Proceedings of IEEE International Symposium on Information Theory · doi:10.1109/isit.1997.613011 · Cited by 1,927
Metadata
- Authors
- Forney, G. D., & Ungerboeck, G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 6
- Pages
- 2384-2415
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2103604544
- Cited by
- 597
- References
- 45
- FWCI
- 7.77
- 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.