Abstract

In this paper, we propose a framework to attain the integrated design of polar coding and spatial modulation (SM) such that the performance of coded SM-MIMO system can be efficiently improved. This Polar-SM framework recognizes SM and polar coding from a unified perspective of polarization by which the original SM-MIMO channel is split into a series of bit polarized subchannels under the three-stage channel transform, i.e., index-symbol→modulation→bit partitions. This paradigm exploits the underlying weak polarization effect within the SM signal, then concatenates with the binary polarization in polar coding, forming a signal-coding cascaded polarization framework. In particular, the first stage channel transform serially decomposes the original SM-MIMO channel into the index subchannel and the symbol subchannel. This mechanism follows the chain rule of mutual information, which preserves the capacity and maximizes the polarization effect. Combining with modulation and bit partitions, we prove the capacity-achieving property of Polar-SM. From the point of practicality, we propose a rate-filling method to realize a fast and low-complexity code construction of Polar-SM. Guided by the three-stage channel transform, we design a glued successive cancellation list (gSCL) decoding algorithm at the receiver to integrate SM detection and polar decoding as a collaborative ensemble. Simulation results validate the performance gain of Polar-SM over state-of-the-art polar-coded MIMO systems and LDPC-coded SM systems.

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 call

Disclaimer: 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.