Channel coding with multilevel/phase signals
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
A coding technique is described which improves error performance of synchronous data links without sacrificing data rate or requiring more bandwidth. This is achieved by channel coding with expanded sets of multilevel/phase signals in a manner which increases free Euclidean distance. Soft maximum--likelihood (ML) decoding using the Viterbi algorithm is assumed. Following a discussion of channel capacity, simple hand-designed trellis codes are presented for 8 phase-shift keying (PSK) and 16 quadrature amplitude-shift keying (QASK) modulation. These simple codes achieve coding gains in the order of 3-4 dB. It is then shown that the codes can be interpreted as binary convolutional codes with a mapping of coded bits into channel signals, which we call "mapping by set partitioning." Based on a new distance measure between binary code sequences which efficiently lower-bounds the Euclidean distance between the corresponding channel signal sequences, a search procedure for more powerful codes is developed. Codes with coding gains up to 6 dB are obtained for a variety of multilevel/phase modulation schemes. Simulation results are presented and an example of carrier-phase tracking is discussed.
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
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
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Cited by
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
Pursley, M. B. (2002) · Reference Data for Engineers · doi:10.1016/b978-075067291-7/50026-1 · Cited by 2,779
Near optimum error correcting coding and decoding: turbo-codes
Berrou, C., & Glavieux, A. (1996) · IEEE Transactions on Communications · doi:10.1109/26.539767 · Cited by 2,761
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
Digital Watermarking and Steganography
(2008) · Elsevier eBooks · doi:10.1016/b978-0-12-372585-1.x5001-3 · Cited by 1,656
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Qureshi, S. (1982) · IEEE Communications Magazine · doi:10.1109/mcom.1982.1090994 · Cited by 1,457
OFDM and MC‐CDMA for Broadband Multi‐User Communications, WLANs and Broadcasting
Hanzo, L., Münster, M., Choi, B. J., & Keller, T. (2003) · Wiley eBooks · doi:10.1002/9780470861813 · Cited by 1,095
8-PSK trellis codes for a Rayleigh channel
Zehavi, E. (1992) · IEEE Transactions on Communications · doi:10.1109/26.141453 · Cited by 1,018
Phase change memory technology
Burr, G. W., Breitwisch, M. J., Franceschini, M., Garetto, D., Gopalakrishnan, K., Jackson, B., Kurdi, B., Lam, C., Lastras, L. A., Padilla, A., et al. (2010) · Journal of Vacuum Science & Technology B, Nanotechnology and Microelectronics: Materials, Processing, Measurement, and Phenomena · doi:10.1116/1.3301579 · Cited by 916
Adaptive coded modulation for fading channels
Goldsmith, A. J., & Chua, S.-G. (1998) · IEEE Transactions on Communications · doi:10.1109/26.668727 · Cited by 903
Nested linear/lattice codes for structured multiterminal binning
Zamir, R., Shamai, S., & Erez, U. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003821 · Cited by 876
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-citationCompression via channel coding - Distributed source coding for sensor networks
Xiong, Z., Liveris, A. D., & Cheng, S. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1328091 · Cited by 739
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
Self-citationPerformance analysis of deliberately clipped OFDM signals
Ochiai, H., & Imai, H. (2002) · IEEE Transactions on Communications · doi:10.1109/26.975762 · Cited by 667
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Channel estimation for wireless ofdm systems
Ozdemir, M., & Arslan, H. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.382406 · Cited by 641
Coded 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
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
Self-citationDistributed compression in a dense microsensor network
Pradhan, S. S., Kusuma, J., & Ramchandran, K. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985684 · Cited by 537
Optimal nonuniform signaling for Gaussian channels
Kschischang, F. R., & Pasupathy, S. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256499 · Cited by 503
Turbo Coding, Turbo Equalisation and Space‐Time Coding: For Transmission over Fading Channels
Hanzo, L., Liew, T. H., & Yeap, B. L. (2002) · Wiley eBooks · doi:10.1002/047085474x · Cited by 449
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
Channel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 408
The Art of Error Correcting Coding
Morelos‐Zaragoza, R. H. (2002) · Wiley eBooks · doi:10.1002/0470847824 · Cited by 376
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
Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
Kudekar, S., Richardson, T., & Urbanke, R. L. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2280915 · Cited by 360
Scalar costa scheme for information embedding
Eggers, J. J., Bauml, R., Tzschoppe, R., & Girod, B. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.809366 · Cited by 357
Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels
Wilson, R., Tse, D., & Scholtz, R. A. (2007) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2007.902666 · Cited by 332
Johnson, M., Ishwar, P., Prabhakaran, V., Schonberg, D., & Ramchandran, K. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.833860 · Cited by 319
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
On the Achievable Rate of OFDM With Index Modulation
Wen, M., Cheng, X., Ma, M., Jiao, B., & Poor, H. V. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2500880 · Cited by 282
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
Trellis Coded Modulation for 4800-9600 bits/s Transmission Over a Fading Mobile Satellite Channel
Divsalar, D., & Simon, M. (1987) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.1987.1146526 · Cited by 253
Achievable Information Rates for Fiber Optics: Applications and Computations
Alvarado, A., Fehenberger, T., Chen, B., & Willems, F. M. J. (2018) · Journal of Lightwave Technology · doi:10.1109/jlt.2017.2786351 · Cited by 189
“Ungerboeck’s celebrated trellis-coded modulation [5] was very popular because the receiver could find the most likely coded sequence using a single low-complexity decoder that exploited the nonbinary (NB) trellis structure of the code.”
Background
Metadata
- Authors
- Ungerboeck, G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1982-01
- Volume
- 28
- Issue
- 1
- Pages
- 55-67
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2165205968
- Cited by
- 3,751
- References
- 4
- FWCI
- 14.81
- 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.