Trellis Coding

Schlegel, Christian

doi:10.1002/0471219282.eot118

Cited by 4 publications

(9 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The union bound constitutes a popular code design technique [63], [119], [139]- [143], which may also be used for assisting us in analysing the error floor of turbo-like codes. In this section we derive the union bound of an SECCC scheme for communications over both AWGN and uncorrelated Rayleigh fading channels.…”

Section: Union Bounds Of Self-concatenated Convolutional Codesmentioning

confidence: 99%

Self-Concatenated Code Design and its Application in Power-Efficient Cooperative Communications

Butt

Hanzo

2011

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

Abstract-In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions.

show abstract

Section: Union Bounds Of Self-concatenated Convolutional Codesmentioning

confidence: 99%

Self-Concatenated Code Design and its Application in Power-Efficient Cooperative Communications

Butt

Hanzo

2011

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…In doing so, we will show results of trellis codes that perform very close to the channel capacity, even with moderate state-space sizes. In this work we only consider codes that may be represented by a regular time-invariant trellis [16] and, therefore, are completely specified by a single trellis section. Though the input and output symbols of a trellis code can be vectors of arbitrary length from any field, here we consider trellises that map binary k-tuples of information bits to transmitted vectors.…”

Section: A Matched Information Rate Trellis Codesmentioning

confidence: 99%

Approaching the capacity of the MIMO Rayleigh flat-fading channel with QAM constellations, independent across antennas and dimensions

Bellorado

Ghassemzadeh

Kavcic

2006

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

In this study we consider the challenge of reliable communication over a wireless Rayleigh flat-fading channel using multiple transmit and receive antennas. Since modern digital communication systems employ signal sets of finite cardinality, we examine the use of the Quadrature Amplitude Modulation (QAM) constellation to approach the capacity of this channel. By restricting the channel input to the M-QAM subset of the complex-plane, the maximum achievable information rate (C M-QAM ) is strictly bounded away from the channel capacity (C). We utilize a modified version of the Arimoto-Blahut algorithm to determine C M-QAM and the probability distribution over the channel input symbols that achieves it. The results of this optimization procedure numerically indicate that the optimal input symbol distribution factors into the product of identical distributions over each real dimension of the transmitted signal. This is shown to vastly reduce the computational complexity of the optimization algorithm. Furthermore, we utilize the computed optimal channel input probability mass function (pmf) to construct capacity approaching trellis codes. These codes are implemented independent across all antennas and symbol dimensions and, if used as inner codes to outer low-density parity check (LDPC) codes, can achieve arbitrarily small error rates at signal-to-noise ratios very close to the channel capacity C M-QAM . Examples are given for a 2-transmit/2-receive antenna (2 × 2) system. academic year.His research interests include the design of capacity approaching codes for the wireless MIMO channel, signal and code design for time-hopping and direct-sequence Ultra-Wideband (UWB) communication systems, modelling of the 3.1-10.6 GHz UWB channel, and decoding algorithms for Reed-Solomon Codes.

show abstract

“…Trellis Coded Modulation (TCM) is a method, introduced by Ungerboeck in [1], of reduction of power requirements of a communication system without increase in the requirements on bandwidth. The trellis encoder consists of two parts; the first is called Finite State Machine (FSM) that is also called Wide-Sense Homomorphic Encoder [2], [3], [4]; the second part is called signal mapper, [2], and essentially it is a memoryless application between the trellis section of the FSM and one constellation of signals. The FSM is a quintuple (U, S, Y, ν, ω) where U , S, and Y are finite groups, and ν and ω are group homomorphisms.…”

Section: Introductionmentioning

confidence: 99%

“…Normally the set D g0 has one or very few elements. The matching maps satisfying the Definition 1 are called regular signal mappers and a quasi-regular signal mapper of the Definition 2 is a generalization of regular signal mappers, [2]. The regular matchings have obvious advantages over the quasi-regular matchings such as the resulting codes always will be geometrically uniform.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Comparação entre abordagens multi-hopde IP Fast Reroute: E-CER nível SIG x ED-NotVia

Barreto¹,

Wille²

2011

Anais De XXIX Simpósio Brasileiro De Telecomunicações

View full text Add to dashboard Cite

A trellis code is the image of a signal mapper from a time invariant group code produced by a Finite State Machine, FSM. Group codes can be described as dynamical systems and good group codes must be necessarily well behaved dynamical systems. For instance good group codes must be controllable and observable, among other properties of well-behaved systems. In this paper we work with trellis codes produced by Finite State Machines over non-abelian groups. The necessity of non-abelian groups on FSM is because there no exist any regular signal mapper between the outputs of a classical binary convolutional encoder and a M − P SK signal set. Also, it has been shown that the capacity of an AWGN channel using abelian group codes is upper bounded by the capacity of the same channel using PSK modulation eventually with different energies per symbol. We will show that when the trellis section group is non-abelian and the input group of the FSM is a cyclic group Z p = {0, 1, . . . , p − 1}, p prime, then the trellis code produced by the FSM is noncontrollable.

show abstract

Trellis Coding

Cited by 4 publications

References 37 publications

Self-Concatenated Code Design and its Application in Power-Efficient Cooperative Communications

Self-Concatenated Code Design and its Application in Power-Efficient Cooperative Communications

Approaching the capacity of the MIMO Rayleigh flat-fading channel with QAM constellations, independent across antennas and dimensions

Comparação entre abordagens multi-hopde IP Fast Reroute: E-CER nível SIG x ED-NotVia

Contact Info

Product

Resources

About