Multilevel Coded Modulation With Reduced Latency Decoding Based on Novel Set Partitioning for APSK

Abstract

We address the use of a multilevel coding (MLC) to the amplitude phase-shift keying (APSK) modulations that consist of multiple PSK rings of different radii with a distinct number of constellation points. Such modulations have been adopted in the satellite broadcasting standards since they have a significant advantage over commonly used square-type quadrature amplitude modulations; their signals exhibit lower peak-to-average power ratio and thus enhance the power amplifier efficiency at the transmitter. A common low-complexity approach for decoding of MLC is the multi-stage decoding (MSD). However, MSD in general leads to severe latency at the decoder since the binary decisions on the higher levels should wait for those of the lower levels. Furthermore, this latency issue is even more salient for APSK signaling due to its circular nature of constellations that does not allow its decomposition into in-phase and quadrature components (i.e., I-Q decomposition). Therefore, in this paper we introduce a new MLC design for APSK that enables the decoder to reduce its latency without any increase in terms of complexity. The proposed approach consists of a novel labeling with an unconventional set partitioning that allows the detector to make use of I-Q decomposition. Specifically, the proposed set partitioning results in a quadrature-PSK constellation at the penultimate level, which can be decomposed into a pair of separately decodable binary-PSK constellations at the final level. The resulting decoder consists of a combination of MSD and parallel independent decoding that can be implemented with lower latency. The simulation results together with the theoretical analyses demonstrate that the reduction of not only the decoding latency but also the complexity in bit metric calculation can be achieved without noticeable degradation in terms of error performance compared to the conventional set partitioning approach.