Abstract
This paper proposes a mapping strategy and a code construction method for 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> -ary polar-coded modulation. In order to find a good mapping for a polar code in an efficient way, we reduce a search space for mapping patterns by exploiting the properties of its polarizing matrix. Once a mapping is selected, the set of unfrozen information bits to define a polar code is automatically determined. Numerical results show that our approach can provide a performance gain of about 0.3-0.5 dB over a conventional approach using random mapping and the polar code optimized for binary phase-shift keying (BPSK) modulation, when pulse-amplitude modulation (PAM) with Gray labelling is employed.
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.
