DocumentCode
942731
Title
An approach to Ungerboeck coding for rectangular signal sets (Corresp.)
Author
Pottie, Greg ; Taylor, D.
Volume
33
Issue
2
fYear
1987
fDate
3/1/1987 12:00:00 AM
Firstpage
285
Lastpage
290
Abstract
A method of finding good Ungerboeck codes for large rectangular [quadrature amplitude modulation (QAM)] signal sets is described. Using the concept of Euclidean weights due to Ungerboeck, we prove that a
point basic constellation may be employed to determine exactly the free distance for an Ungerboeck-coded rectangular
point set, when
bits are uncoded and the remaining bits pass through a rate
convolutionai encoder. It is shown that rate
encoders may be used to achieve most of the theoretically possible coding gain in the proposed scheme where the effect of the error coefficient on the coding gain has been considered.
point basic constellation may be employed to determine exactly the free distance for an Ungerboeck-coded rectangular
point set, when
bits are uncoded and the remaining bits pass through a rate
convolutionai encoder. It is shown that rate
encoders may be used to achieve most of the theoretically possible coding gain in the proposed scheme where the effect of the error coefficient on the coding gain has been considered.Keywords
Coding/decoding; Convolutional coding; Quadrature amplitude modulation; Convolution; Convolutional codes; Councils; Decoding; Digital communication; Labeling; Polynomials; Quadrature amplitude modulation; Signal mapping; Telephony;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1987.1057289
Filename
1057289
Link To Document