The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Bit-interleaved coded modulation
Abstract
It has been shown by Zehavi (1992) that the performance of coded modulation with a Rayleigh fading channel can be improved by bit-wise interleaving at the encoder output, and by using an appropriate soft-decision metric as an input to a Viterbi decoder. In this paper we present a unified theory of bit-interleaved coded modulation, provide tools for performance analysis and give guidelines for its design.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Fundamentals of Wireless Communication
Tse, D., & Viswanath, P. (2005) · doi:10.1017/cbo9780511807213 · Cited by 13,162
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
Tarokh, V., Seshadri, N., & Calderbank, A. R. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661517 · Cited by 7,039
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
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
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
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
Convergence behavior of iteratively decoded parallel concatenated codes
ten Brink, S. (2001) · IEEE Transactions on Communications · doi:10.1109/26.957394 · Cited by 2,386
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
Self-citationPrinciples 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
Spectral efficiency in the wideband regime
Verdu, S. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003824 · Cited by 1,214
Mutual Information and Minimum Mean-Square Error in Gaussian Channels
Guo, D., Shamai, S., & Verdu, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844072 · Cited by 1,201
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
Information theoretic considerations for cellular mobile radio
Ozarow, L. H., Shamai, S. S., & Wyner, A. D. (1994) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.293655 · Cited by 1,090
8-PSK trellis codes for a Rayleigh channel
Zehavi, E. (1992) · IEEE Transactions on Communications · doi:10.1109/26.141453 · Cited by 1,018
Saddle point approximation for the distribution of the sum of independent random variables
Lugannani, R., & Rice, S. (1980) · Advances in Applied Probability · doi:10.1017/s0001867800050278 · Cited by 782
A general formula for channel capacity
Verdu, S., & Han, T. S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335960 · Cited by 779
Extrinsic information transfer functions: model and erasure channel properties
Ashikhmin, A., Kramer, G., & ten Brink, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836693 · Cited by 756
Modulation and coding for linear Gaussian channels
Forney, G. D., & Ungerboeck, G. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720542 · Cited by 597
Convergence of iterative decoding
ten Brink, S. (1999) · Electronics Letters · doi:10.1049/el:19990555 · Cited by 575
Coding theorems for 'turbo-like' codes
Divsalar, D. (1998) · Medical Entomology and Zoology · Cited by 524
Saddlepoint Approximations with Applications
Butler, R. W. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511619083 · Cited by 418
On information rates for mismatched decoders
Merhav, N., Kaplan, G., Lapidoth, A., & Shamai Shitz, S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340469 · Cited by 409
Good lattice constellations for both Rayleigh fading and Gaussian channels
Boutros, J. J., Viterbo, E., Rastello, C., & Belfiore, J.-C. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485720 · Cited by 329
Punctured convolutional codes of rate(n-1)/nand simplified maximum likelihood decoding (Corresp.)
Cain, J. B., Clark, G., & Geist, J. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055999 · Cited by 318
Iterative multiuser joint decoding: unified framework and asymptotic analysis
Boutros, J., & Caire, G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013125 · Cited by 314
Self-citationAnantharam, V., & Verdu, S. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481773 · Cited by 290
Hou, J., Siegel, P. H., Milstein, L. B., & Pfister, H. D. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.815777 · Cited by 290
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels
Bennatan, A., & Burshtein, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862080 · Cited by 267
A pragmatic approach to trellis-coded modulation
Viterbi, A. J., Wolf, J. K., Zehavi, E., & Padovani, R. (1989) · IEEE Communications Magazine · doi:10.1109/35.31452 · Cited by 259
Design of repeat-accumulate codes for iterative detection and decoding
ten Brink, S., & Kramer, G. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.818250 · Cited by 258
Bit-Interleaved Coded Modulation
Guillén i Fàbregas, A., Martinez, A., & Caire, G. (2008) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000019 · Cited by 235
Self-citationCoded diversity on block-fading channels
Malkamaki, E., & Leib, H. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749028 · Cited by 220
Design of Serially Concatenated Systems Depending on the Block Length
Tuchler, M. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.822697 · Cited by 210
Kavcic, A., Ma, X., & Mitzenmacher, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813563 · Cited by 208
Coded modulation in the block-fading channel: coding theorems and code construction
Guillen I Fabregas, A., & Caire, G. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860414 · Cited by 180
Self-citationFinite-Length Scaling for Iteratively Decoded LDPC Ensembles
Amraoui, A., Montanari, A., Richardson, T., & Urbanke, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009580 · Cited by 173
Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes
Brännström, F., Rasmussen, L. K., & Grant, A. J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.853312 · Cited by 170
Soft-input soft-output lattice sphere decoder for linear channels
Boutros, J. J., Gresset, N., Brunel, L., & Fossorier, M. P. C. (2005) · Globecom · doi:10.1109/glocom.2003.1258504 · Cited by 137
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
Boutros, J. J., Fàbregas, A. G. I., Biglieri, E., & Zémor, G. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2053890 · Cited by 122
Self-citationExtremes of Information Combining
Sutskover, I., Shamai, S. S., & Ziv, J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844077 · Cited by 90
Information-theoretic analysis of a family of additive energy channels
Martinez, A. (. (2008) · TU/e Research Portal · doi:10.6100/ir632385 · Cited by 2
Cited by
Survey on Free Space Optical Communication: A Communication Theory Perspective
Khalighi, M. A., & Uysal, M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2329501 · Cited by 2,466
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
Self-citationWireless Information-Theoretic Security
Bloch, M., Barros, J., Rodrigues, M. R. D., & McLaughlin, S. W. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.921908 · Cited by 1,847
Space-Time Block Coding for Wireless Communications
Larsson, E. G., & Stoica, P. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511550065 · Cited by 1,035
Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation
Bocherer, G., Steiner, F., & Schulte, P. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2494016 · Cited by 828
Metadata
- Authors
- Caire, G., Taricco, G., & Biglieri, E.
- Venue
- Proceedings of IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2002-11-22
- Pages
- 96
- OpenAlex
- W2138208223
- Cited by
- 1,927
- References
- 52
- FWCI
- 122.86
- Type
- conference paper
- 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.