Abstract
Abstract A ( 3 × 2 m )-ary QAM scheme maps a binary symbol into two-consecutive signal points (signal vector). It provides very lower PAPR than the conventional QAM because it removes corner signal points. For the scheme, this paper discusses an exact analysis of log-likelihood ratio calculation of the signal vector and signal point, and an approximated method to reduce hardware complexity for the channel coding. Numerical results show that the approximated method provides lower hardware complexity and small performance gap compared to exact one. Also, the PAPR and error performances of ( 3 × 2 m )-ary QAM are compared with the one of conventional QAM.
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.
