19 December 2022 in IEEE Transactions on Information Theory
Decoding via sequentially guessing the error pattern in a received noisy sequence has received attention recently, and ORBGRAND has been proposed as one such decoding algorithm that is capable of utilizing the soft information embedded in the received noisy sequence. An information theoretic study is conducted for ORBGRAND, and it is shown that the achievable rate of ORBGRAND using independent and identically distributed random codebooks almost coincides with the channel capacity, for an additive white Gaussian noise channel under antipodal input. For finite-length codes, improved guessing schemes motivated by the information theoretic study are proposed that attain lower error rates than ORBGRAND, especially in the high signal-to-noise ratio regime.
12 April 2018 in IEEE Wireless Communications Letters
In this letter, we propose a class of rate-compatible raptor-like protographs, which is aimed at the design of low-rate low-density parity-check (LDPC) codes with short length and fast convergence for ultra-reliable and low-latency communications in 5G. In the proposed protographs, the connection degrees can be progressively optimized by the protograph-based extrinsic information transfer analysis with a limited number of iterations. Following the protograph optimization, we construct the rate-compatible LDPC codes by a simplified error minimization progressive edge-growth algorithm and carry out simulations for performance comparisons. The simulation results show that our proposed LDPC codes have noticeable advantages over the existing low-rate LDPC codes with short length and limited numbers of decoding iterations.
22 October 2012 in IEEE Communications Letters
The demand for flexible broadband wireless services makes the pruning technique, including both shortening and puncturing, an indispensable component of error correcting codes. The analysis of the pruning process for structured low-density parity-check (LDPC) codes can be considerably simplified with their equivalent representations through base-matrices or protographs. In this letter, we evaluate the thresholds of the pruned base-matrices by using protograph based on extrinsic information transfer (PEXIT). We also provide an efficient method to optimize the pruning patterns, which can significantly improve the thresholds of both the full-length patterns and the sub-patterns. Numerical results show that the structured LDPC codes pruned by the improved patterns outperform those with the existing patterns.
10 October 2019 in IEEE Transactions on Communications
7 September 2012 in IEEE Communications Letters
A parity-check stopping (PCS) criterion for turbo decoding is proposed in , which shows its priority compared with the stopping criteria of Sign Change Ratio (SCR), Sign Difference Ratio (SDR), Cross Entropy (CE) and improved CE-based (Yu) method. But another well-known simple stopping criterion named Hard-Decision-Aided (HDA) criterion has not been compared in . In this letter, through analysis we show that using max-log-MAP algorithm, PCS is equivalent to HDA; while simulations demonstrate that using log-MAP algorithm, PCS has nearly the same performance as HDA.