Channel coding with multilevel/phase signals

Ungerboeck, G.

doi:10.1109/tit.1982.1056454

Cited by 3,290 publications

(1,493 citation statements)

References 7 publications

Supporting

Mentioning

1,407

Contrasting

Unclassified

Order By: Relevance

“…For the trellis pair (T 1 , T 2 ) and the alphabet pair (S 1 , S 2 ), the destination views an equivalent SISO AWGN channel with a virtual source equipped with the trellis, T sum labelled with the elements of S sum . Recall that for a SISO AWGN channel, if the source is equipped with a trellis, T and an alphabet S, the following design rules have been suggested in [5] to construct good trellis codes.…”

Section: Trellis Coded Modulation (Tcm) For Amentioning

confidence: 99%

“…Subsequently, a K-user GMAC model with no random phase offsets in the channel has been considered in [4] and codes based on Trellis Coded Modulation (TCM) [5] have been proposed wherein the UD (Uniquely Decodable) property at the destination is achieved by employing distinct alphabets for all the users. In particular, an alphabet of size KM (example : KM -PSK or KM -QAM) is chosen and it is appropriately partitioned in to K groups such that every user uses one of the groups as its code alphabet.…”

Section: Introductionmentioning

confidence: 99%

“…For a SISO AWGN channel, Ungerboeck labelling on the trellis maximizes the guaranteed minimum squared Euclidean distance, d 2 g,min of the trellis and hence such a labelling scheme has become a systematic method of generating trellis codes to approach the capacity [5]. However, when TCM based trellis codes are employed for a two-user GMAC, it is not known whether Ungerboeck labelling on T 1 and T 2 using S 1 and S 2 respectively induces an Ungerboeck labelling on T sum using S sum .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Coding for two-user Gaussian MAC with PSK and PAM signal sets

Harshan

Rajan

2009

2009 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-Constellation Constrained (CC) capacity regions of a two-user Gaussian Multiple Access Channel (GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with M -PSK and M -PAM alphabet pairs, for arbitrary values of M, to achieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M -PSK and M -PAM alphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M -PAM alphabet pairs are employed with almost no loss in the sum capacity.

show abstract

Section: Trellis Coded Modulation (Tcm) For Amentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Coding for two-user Gaussian MAC with PSK and PAM signal sets

Harshan

Rajan

2009

2009 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

show abstract

“…We note a superficial similarity between spinal code and Trellis Coded Modulation (TCM) [18,17] because TCM codes bits to symbols. TCM was crafted specifically to achieve high minimum distance between codewords under a sparse constellation for convolutional codes, whereas spinal codes aim to attain higher average distance, obviating the need for sparse constellations.…”

Section: Related Workmentioning

confidence: 99%

Rateless spinal codes

Perry

Balakrishnan

Shah

2011

Proceedings of the 10th ACM Workshop on Hot Topics in Networks

View full text Add to dashboard Cite

A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary with time. An ideal solution is a rateless wireless system, in which the sender encodes data without any explicit estimation or adaptation, implicitly adapting to the level of noise or interference. In this paper, we present a novel rateless code, the spinal code, which uses a hash function over the message bits to produce pseudo-random bits that in turn can be mapped directly to a dense constellation for transmission. Results from theoretical analysis and simulations show that spinal codes essentially achieve Shannon capacity, and out-perform bestknown fixed rate block codes.

show abstract

“…To compensate, Chatzigeorgiou et al (2008) proposed a high-order modulation scheme to be employed in the cooperative system. Later, the authors proposed Trellis Coded Modulation (TCM) scheme (Ungerboeck, 1982), achieving better coding gains for high spectral efficiency systems (Chen et al, 2009). Laneman and Wornell (2003) showed that better diversity gains can be achieved if cooperation is performed in a distributed manner, meaning more relays are involved for signal retransmission.…”

Section: Introductionmentioning

confidence: 99%

Distributed Amplify and Forward Cooperation While Maintaining Transmission Freedom

Arwa¹

2011

American Journal of Engineering and Applied Sciences

View full text Add to dashboard Cite

Problem statement:This study proposes a novel Distributed Amplify and-Forward (DAF) cooperative scheme, achieving higher diversity order and yet maintaining the same transmission freedom as the conventional Amplify-and-Forward (AF) scheme. In the DAF scheme, a user's transmitted symbols are partitioned into several sequences in order to be relayed by different users. Approach: In the cooperative network, each user still uses half of their transmission for relaying others' signals. But instead of relaying one user's entire transmitted sequence, it helps different users for the relaying. Theoretical analysis of the DAF scheme is carried out in order to justify its advantages over the existing schemes. The outage behavior and Diversity-Multiplexing Tradeoff (DMT) analyses of the DAF scheme are presented. Results: Through outage behavior analysis, it is shown the DAF scheme achieves substantial diversity gains over the AF scheme. Furthermore, the DMT analysis justices both the scheme's achievable diversity gains and its ability to maintain the same multiplexing gain as the AF scheme. The theoretical analyses are then extended to a general cooperative network consisting of N (N≥2) relays, showing the diversity order can be increased with respect to the number of relays but not at the expense of each user's multiplexing gain. Conclusion: Finally, a practical coded cooperative system that integrates the DAF scheme with the concatenated Reed-Solomon Convolution Codes (RSCC) is proposed, validating the achievable performance gain offered by the DAF scheme.

show abstract

Channel coding with multilevel/phase signals

Cited by 3,290 publications

References 7 publications

Coding for two-user Gaussian MAC with PSK and PAM signal sets

Coding for two-user Gaussian MAC with PSK and PAM signal sets

Rateless spinal codes

Distributed Amplify and Forward Cooperation While Maintaining Transmission Freedom

Contact Info

Product

Resources

About