In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination. For punctured and shortened polar codes, we prove that the partial order by binary domination completely determines both incapable bit patterns (by puncturing) and fixed bit patterns (by shortening). In particular, we give a necessary and sufficient condition for an encoder output bit to be fixed by additionally shortening a single encoder input bit, as well as a necessary and sufficient condition for an encoder input bit to be made incapable by additionally puncturing a single encoder output bit. We also identify all the puncturing bit patterns yielding a given incapable bit pattern. These results provide a guidance to design a practical rate-matching scheme for polar codes. As an example, we present a rate-matching scheme based on our analytical observations. Numerical results show that it performs well over a wide range of code lengths and rates, compared with conventional rate-matching schemes.
7 June 2017 in IEEE Transactions on Wireless Communications
An integer-forcing (IF) linear multiple-input multiple-output (MIMO) receiver has recently been proposed, which is theoretically shown to achieve near capacity with almost the same complexity as that of conventional linear receivers. The key idea is that the receiver attempts to directly decode integer-linear combinations of codewords. To ensure that this sum-decoding operation is feasible, in previous works, lattice codes over Zq were employed. Although those codes can attain good theoretical performance, however, its implementation complexity can be considerably high in practice, especially when q is large to support high-order modulations. In this paper, we propose a practical multilevel coding scheme for IF MIMO, in which multilevel encoding composed of binary linear codes (q = 2) in conjunction with the natural mapping is employed on the transmitter side and multistage decoding adapted to the IF operation is employed on the receiver side. The performance of the proposed scheme is extensively evaluated both analytically and numerically, showing that the gain of IF over conventional receivers is indeed achievable in practical settings with almost the same complexity. Our results imply that the proposed IF MIMO can be an attractive solution for the 5G communications due to its ability of supporting high spectral efficiency with low complexity. Index
25 January 2022 in IEEE Transactions on Communications
This paper presents density evolution (DE) techniques based on reciprocal channel approximation (RCA) for general bit-interleaved coded modulation (BICM) systems. The original RCA-based DE (RCA-DE) technique is implemented under the assumption of binary-input additive white Gaussian noise channels (BI-AWGNCs). In BICM systems, however, $M$ -ary modulation schemes are generally used, and they can be regarded as to be a parallel transmission of $\log _{2} M$ bits. Thus, $\log _{2} M$ separate bit-level channels, which are not Gaussian equivalent, need to be considered. In order to extend the conventional RCA-DE technique to BICM systems, we first establish a model of protograph BICM ensembles. Two methods are developed based on the bit error rate (BER) and the BICM capacity in order to find a corresponding BI-AWGNC that models each of the bit-level channels. Using these methods, we implement the protograph RCA-DE technique for BICM systems and show that it achieves an accurate estimation. As a practical application of the proposed RCA-DE method, we design bit interleavers in order to achieve better BICM performance in the 3GPP New Radio (NR) LDPC coding system. Numerical results show that performance gain of up to 0.3 dB is consistently achieved over a wide range of parameter values.
24 February 2015 in IEEE Transactions on Broadcasting
A new simplified structure of bit-interleaved coded modulation (BICM) for second generation digital video broadcasting (DVB) standards, such as DVB-T2, DVB-C2, and DVB-NGH is proposed. In the BICM of the DVB standards, parity and column-twist interleavers are employed in order to avoid possible performance degradation due to the structural weaknesses of the BICM scheme. In this paper, a new method is proposed of finding permutation-equivalent low-density parity-check codes that eliminate the BICM weaknesses without the column-twist interleaver, thereby simplifying the BICM structure of the DVB standards. The new code descriptions are found by applying a column permutation to the parity check matrices of the original codes in the DVB standards. The codes generated by these new descriptions have the same error correcting capability individually for a binary memoryless channel. However, the resulting BICM has a different structure that is free of weakness, called the less-capable check node.
2 April 2021 in IEEE Transactions on Communications
Concatenated polar codes under successive cancellation list (SCL) decoding have excellent error-correction performance. However, their expected error-detection capability becomes degraded, when we increase the list size of the SCL decoder in order to improve their error-correction performance. In this paper, we propose a configuration design scheme for the SCL decoder and a post-decoding validation check scheme in order to provide a better tradeoff between error-detection and error-correction performance. Firstly, a configuration of the SCL decoder is designed to improve its own error detection capability. Specifically, a part of dynamic frozen bits (also called parity-check bits) is used for path checking during SCL decoding rather than their original purpose of use, path pruning. Furthermore, the number of paths to be checked by the applied cyclic redundancy check (CRC) code is limited. Secondly, a new metric corresponding to the correlation between the received signal vector and the decoded one is presented to check the validity of the decoding result. These proposed schemes are analyzed to provide a proper configuration of the SCL decoder and determine a threshold for post-decoding validation check. Numerical results show that a better tradeoff between error correction and detection is achieved, compared with conventional schemes.
15 May 2020 in IEEE Wireless Communications Letters
The belief propagation (BP) decoding of short low-density parity check codes suffers from short cycles and trapping sets. A number of perturbation schemes have been proposed to overcome the limitation. This letter presents a generalized framework for multi-round BP decoding with input perturbation and proposes an improved perturbation scheme. In particular, the impulsive perturbation which is applied to only a few symbols is proposed, along with a new space selection criterion. The proposed scheme performs better than existing schemes for short codes at lower complexity and supports a parallel implementation.