The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A pragmatic approach to trellis-coded modulation
Abstract
Since the early 1970s, for power-limited applications, the convolutional code constraint length K=7 and rate 1/2, optimum in the sense of maximum free distance and minimum number of bit errors caused by remerging paths at the free distance, has become the de facto standard for coded digital communication. This was reinforced when punctured versions of this code became the standard for rate 3/4 and 7/8 codes for moderately bandlimited channels. Methods are described for using the same K=7, rate 1/2 convolutional code with signal phase constellations of 8-PSK and 160PSK and quadrature amplitude constellations of 16-QASK, 64-QASK, and 256-QASK to achieve, respectively, 2 and 3, and 2, 4, and 6 b/s/Hz bandwidth efficiencies while providing power efficiency that in most cases is virtually equivalent to that of the best Ungerboeck codes for constraint length 7 or 64 states. This pragmatic approach to all coding applications permits the use of a single basic coder and decoder to achieve respectable coding (power) gains for bandwidth efficiencies from 1 b/s/Hz to 6 b/s/Hz.>
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
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Principles of digital communication and coding
Viterbi, A. J., & Omura, J. K. (1979) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,427
Self-citationError-Correction Coding for Digital Communications
Clark, G. C., & Cain, J. B. (1981) · Springer eBooks · doi:10.1007/978-1-4899-2174-1 · Cited by 1,317
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
Trellis-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
High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding
Yasuda, Y., Kashiki, K., & Hirata, Y. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096047 · Cited by 344
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
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
Self-citationPunctured Convolutional Codes of Rate (n - 1)/n and Simplified Maximum Likelihood Decoding
Graupe, D. (1979) · Cited by 175
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
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
8-PSK trellis codes for a Rayleigh channel
Zehavi, E. (1992) · IEEE Transactions on Communications · doi:10.1109/26.141453 · Cited by 1,018
Self-citationCoded orthogonal frequency division multiplex [TV broadcasting]
Le Floch, B., Alard, M., & Berrou, C. (1995) · Proceedings of the IEEE · doi:10.1109/5.387096 · Cited by 629
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
Metadata
- Authors
- Viterbi, A. J., Wolf, J. K., Zehavi, E., & Padovani, R.
- Venue
- IEEE Communications Magazine
- Published
- 1989-07
- Volume
- 27
- Issue
- 7
- Pages
- 11-19
- ISSN
- 0163-6804 (ISSN-L)
- OpenAlex
- W2161351989
- Cited by
- 259
- References
- 9
- FWCI
- 5.97
- 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.