By Topic

An approach to Ungerboeck coding for rectangular signal sets (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

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 2^{n} point basic constellation may be employed to determine exactly the free distance for an Ungerboeck-coded rectangular 2^{m} point set, when m-n-1 bits are uncoded and the remaining bits pass through a rate (n-1)/n convolutionai encoder. It is shown that rate 2/3 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.

Published in:

Information Theory, IEEE Transactions on  (Volume:33 ,  Issue: 2 )