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

Xuewan Zhang

doi:10.23919/JCC.fa.2022-0253.202305

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

2023-05-01

3

PRE

AI

DOI：10.23919/JCC.fa.2022-0253.202305

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Static VAr compensators

Modulation

Indexes

Channel coding

Reliability

Codes

Decoding

ultra-reliable and low latency communications

sparse vector coding

uniquely decomposable constellation group

constellation rotation

short packet communications

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

Abstract

Journal

Organization