A Universal Low-Complexity Demapping Algorithm for Non-Uniform Constellations

A non-uniform constellation (NUC) can effectively reduce the gap between bit-interleaved coded modulation (BICM) capacity and Shannon capacity, which has been utilized in recent wireless broadcasting systems. However, the soft demapping algorithm needs a lot of Euclidean distance (ED) calculations and comparisons, which brings great demapping complexity to NUC. A universal low-complexity NUC demapping algorithm is proposed in this paper, which creates subsets based on the quadrant of the two-dimensional NUC (2D-NUC) received symbol or the sign of the in-phase (I)/quadrature (Q) component of the one-dimensional NUC (1D-NUC) received symbol. ED calculations and comparisons are only carried out on the constellation points contained in subsets. To further reduce the number of constellation points contained in subsets, the proposed algorithm takes advantage of the condensation property of NUC and regards a constellation cluster containing several constellation points as a virtual point. Analysis and simulation results show that, compared with the Max-Log-MAP algorithm, the proposed algorithm can greatly reduce the demapping complexity of NUC with negligible performance loss.

THIẾT KẾ BỘ XÁO TRỘN CHO HỆ THỐNG BICM-ID TRUYỀN DẪN QUA KÊNH PHA ĐINH

Bài viết đề xuất một xáo bộ trộn bít (gọi là New-block) sử dụng trong hệ thống BICM-ID (Bit-Interleaved Coded Modulation with Iterative Decoding) trên kênh pha đinh Rayleigh. Nó mang lại cho hệ thống giá trị hiệu suất BER (Tỷ lệ lỗi bit) xấp xỉ với bộ xáo trộn bít giả ngẫu nhiên ở vùng sàn lỗi, nhưng có phần cứng đơn giản hơn.

Design of a Labeling Scheme for 32-QAM Delayed Bit-Interleaved Coded Modulation

It is very challenging to design the capacity-approaching labeling schemes for large constellations, such as 32-QAM, in delayed bit-interleaved coded modulation (DBICM). In this paper, we investigate the labeling design for 32-QAM DBICM with various numbers of bits delayed by one time slot. In particular, we aim to obtain the labeling schemes with a high DBICM channel capacity by searching the possible labeling schemes. To reduce the search space of the candidate labeling schemes, we propose the criteria that are necessary for good labeling. Based on the proposed criteria, a three-step search algorithm is proposed to obtain the candidate labeling efficiently. Numerical results demonstrate that the DBICM with our proposed labeling scheme can approach the capacity of 32-QAM within 0.015 dB at an information rate greater than 2.5 bits/symbol.