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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
