Christian B. Schlegel, Lance C. Pérez · 2004
It has become apparent over the past few decades that while there are strict limits on the power and bandwidth resources, the complexity of systems could steadily be increased to obtain efficiencies ever closer to these limits. One very successful method of reducing the power requirements without increase in the requirements on bandwidth was introduced by Gottfried Ungerboeck, subsequently termed trellis-coded modulation (TCM). We start this chapter with an illustrative example of this intriguing method of combining coding and modulation. Later, we consider group-trellis codes, the mapping function, construction of codes, lattices, rotational invariance, and geometric uniformity.
Cited by 0
Stephen G. Wilson · 2003
Abstract Trellis‐coded modulation (TCM) is an important practical means of achieving several decibels in link efficiency on Gaussian channels, without bandwidth expansion, and is now a component of numerous wireline and wireless standards. This article surveys the important principles in the design and analysis of such encoders, provides tabulations of best codes, and illustrates with discussion of two standards employing TCM.
Cited by 2
Ungerböck, G. · E-Periodica · 1987
Cited by 0Open access
N. Benvenuto, Giovanni Cherubini · 2002
This chapter contains sections titled: Linear TCM for One- and Two-dimensional Signal Sets Multidimensional TCM Rotationally Invariant TCM Schemes Bibliography
Cited by 1
Gottfried Ungerboeck · 1987
Cited by 0
C.R. Nassar · Elsevier eBooks · 2001
Cited by 1
Eyal Katz, G.L. Stüber · 2002
Systematic trellis-coded modulation (STCM) is a novel approach to coded modulation, which enables symbol-by-symbol detection of trellis-coded data. A set of design rules, which guarantees nonzero coding gain, and codes with asymptotic coding gains of 3.0-5.4 dB are presented. STCM is well suited for operation in a dual-mode receiver. During normal operation the receiver uses a sequence estimation algorithm such as MLSE or SSE. When the channel introduces severe distortion, as is the case during a deep fade, the decoder switches to a systematic decoding algorithm, which is simple to implement, and guarantees BER performance that is better than uncoded modulation. The authors demonstrate the performance of various STCM codes with a dual-mode receiver on multipath fading channels.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 0
Martin H. Weik · 2000
Cited by 0
Patrick Robertson, Thomas Wörz · elib (German Aerospace Center) · 1996
Cited by 4
Encyclopedia of Ocean Engineering · 2022
Cited by 0
W.J. Blackert, S. G. Wilson · 1996
Turbo codes have excited the coding community with the promise of performing near channel capacity by using an iterative decoding technique that relies upon simple constituent codes. However, since the original turbo codes are low rate codes, a significant bandwidth penalty can be incurred by systems which utilize turbo codes. Since the constituent codes that make up turbo codes are convolutional codes, a natural extension of the turbo concept, in order to improve bandwidth efficiency, is its application to Trellis Coded Modulation (TCM) systems. This paper will discuss the conditions under which encoders with parallel transitions can be used as constituent codes in Turbo TCM systems and present results to compare systems with and without parallel transition constituent encoders. 1 Introduction Turbo coding, introduced in [1], is a coding technique that uses an iterative decoding algorithm to give performance near channel capacity. Since Turbo codes use convolutional codes as their co...
Cited by 0
Fabian Schuh, Andreas Schenk, Johannes B. Huber · arXiv (Cornell University) · 2013
In classic trellis-coded modulation (TCM) signal constellations of twice the cardinality are applied when compared to an uncoded transmission enabling transmission of one bit of redundancy per PAM-symbol, i.e., rates of $\frac{K}{K+1}$ when $2^{K+1}$ denotes the cardinality of the signal constellation. In order to support different rates, multi-dimensional (i.e., $\mathcal{D}$-dimensional) constellations had been proposed by means of combining subsequent one- or two-dimensional modulation steps, resulting in TCM-schemes with $\frac{1}{\mathcal{D}}$ bit redundancy per real dimension. In contrast, in this paper we propose to perform rate adjustment for TCM by means of puncturing the convolutional code (CC) on which a TCM-scheme is based on. It is shown, that due to the nontrivial mapping of the output symbols of the CC to signal points in the case of puncturing, a modification of the corresponding Viterbi-decoder algorithm and an optimization of the CC and the puncturing scheme are necessary.
Cited by 4Open access
Mahmoud Abdelaziz, T. Aaron Gulliver · IEEE Access · 2019
Ternary trellis coded modulation (TTCM) is introduced. This combines triangular signal constellations with ternary convolutional codes. The performance of TTCM is presented and compared with binary trellis coded modulation (BTCM) which employs square quadrature amplitude modulation (SQAM) and binary convolutional coding. Ternary set partitioning (TSP) is used for TTCM, and binary-to-ternary conversion is determined that is suitable for TTCM. A construction for <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> -ary triangular QAM (TQAM) which is compatible with TSP is presented. The performance of BTCM is compared with that of TTCM.
Cited by 7Open access
Divsalar, Dariush, Simon, Marvin K. · NASA Technical Reports Server (NASA)
A technique for designing trellis codes to minimize bit error performance for a fading channel. The invention provides a criteria which may be used in the design of such codes which is significantly different from that used for average white Gaussian noise channels. The method of multiple trellis coded modulation of the present invention comprises the steps of: (a) coding b bits of input data into s intermediate outputs; (b) grouping said s intermediate outputs into k groups of s.sub.i intermediate outputs each where the summation of all s.sub.i,s is equal to s and k is equal to at least 2; (c) mapping each of said k groups of intermediate outputs into one of a plurality of symbols in accordance with a plurality of modulation schemes, one for each group such that the first group is mapped in accordance with a first modulation scheme and the second group is mapped in accordance with a second modulation scheme; and (d) outputting each of said symbols to provide k output symbols for each b bits of input data.
Cited by 0Open access
Erwin Janssen, Arthur van Roermund · Analog circuits and signal processing/Analog circuits and signal processing series · 2011
Cited by 0
S. X. Ng, F. Guo, L. Hanzo · 2015
Reversible Variable Length Codes (RVLCs) is proposed. With the aid of efficient iterative decoding, the proposed scheme is capa-ble of providing full transmit diversity and a near channel capac-ity performance. The performance of the proposed scheme was evaluated when communicating over uncorrelated Rayleigh fad-ing channels. Explicitly, significant iteration gains were achieved by the proposed scheme, which was capable of performing within 2 dB from the channel capacity. 1.
Cited by 0
Chin Kiong Wang, Gwenaël Doërr, Ingemar J. Cox · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2007
Lattice codes and quantization-based techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in volume of a song, or re-quantization, e.g. JPEG compression. Hence, it is reasonable to investigate alternative codes which may offer the potential for superior performance. In previous work, we designed a new class of codes, called dirty paper trellis codes (DPTC), which are by construction immune to valuemetric scaling. Although DPTC have shown themselves to be resistant to certain classes attacks, the trellises were generated randomly, thus leading to suboptimal codes. In this paper, Ungerboeck's work on trellis coded modulation (TCM) is exploited to significantly improve the performance of the DPTC. Experimental results show that the resulting trellises significantly outperform the original design.
Cited by 11
Chin, KW, Doërr, G, Cox, I · UCL Discovery (University College London) · 2007
Lattice codes and quantization-based techniques have received considerable attention as a method of digital watermarking with side information. However, these algorithms are also recognized to be highly sensitive to common signal processing primitives such as valuemetric scaling, e.g. changes in volume of a song, or re-quantization, e.g. JPEG compression. Hence, it is reasonable to investigate alternative codes which may offer the potential for superior performance. In previous work, we designed a new class of codes, called dirty paper trellis codes (DPTC), which are by construction immune to valuemetric scaling. Although DPTC have shown themselves to be resistant to certain classes attacks, the trellises were generated randomly, thus leading to suboptimal codes. In this paper, Ungerboeck's work on trellis coded modulation (TCM) is exploited to significantly improve the performance of the DPTC. Experimental results show that the resulting trellises significantly outperform the original design. © 2007 SPIE-IS&T.
Cited by 1
Sergio Benedetto, D. Divsalar, G. Montorsi et al. · 2002
In this paper, we propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable bit by bit iterative decoding structure. Examples are given for throughput 2 and 4 bits/sec/Hz with 8 PSK, 16 QAM, and 64 QAM modulations. For parallel concatenated trellis codes in the examples, rate 2/3 and 4/5, 8, and 16-state binary convolutional codes with Ungerboeck mapping by set partitioning (natural mapping), a reordered mapping, and Gray code mapping are used. The performance of these codes is within 1 dB from the Shannon limit at a bit error probability of 10/sup -7/ for a given throughput, which outperforms the performance of all codes reported in the past for the same throughput.
Cited by 181
Călin Vlădeanu · 2012
In this paper, a turbo trellis-coded spatial modulation (TTCSM) transmission scheme is proposed. In trellis-coded spatial modulation (TCSM) scheme, the information bits used to select the transmit antenna index are encoded. In order to increase the performances of the TCSM scheme, a parallel concatenated encoding scheme can be used. Therefore, the TCSM scheme is modified by introducing two identical convolutional encoders, with proper interleaving and puncturing, as in the case of conventional parallel turbo trellis-coded modulation (TTCM) scheme. The punctured TTCSM scheme, using the symbol-by-symbol log-MAP iterative decoding algorithm in the receiver, is developed. The bit error rate (BER) is estimated by simulations for PSK-TCSM transmissions over stationary Rayleigh, Rician, and spatially correlated (SC) fading channels with additive white Gaussian noise (AWGN). As an example, a scheme with a spectral efficiency of 3b/s/Hz using eight transmit and receive antennas and a BPSK signal is considered. It is shown that the TTCSM scheme offers a coding gain over the corresponding non-iterative TCSM scheme of at least 6 dB for the Rayleigh fading channel, 3 dB for the Rician channel, and 2 dB for the SC fading channel, respectively.
Cited by 24