Uniquely decomposable constellation group-based sparse vector coding for short packet communications

Sparse vector coding (SVC) is emerging as a potential technology for short packet communications. To further improve the block error rate (BLER) performance, a uniquely decomposable constellation group-based SVC (UDCG-SVC) is proposed in this article. Additionally, in order to achieve an optimal BLER performance of UDCG-SVC, a problem to optimize the coding gain of UDCG-based superimposed constellation is formulated. Given the energy of rotation constellations in UDCG, this problem is solved by converting it into finding the maximized minimum Euclidean distance of the superimposed constellation. Simulation results demonstrate the validness of our derivation. We also find that the proposed UDCG-SVC has better BLER performance compared to other SVC schemes, especially under the high order modulation scenarios.