Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

Enhanced Adaptive Normalized Min-Sum Algorithm for Layered Scheduling of 5G-NR LDPC codes

Ziqi Zhou, Kewu Peng, Aleksei E. Krylov, Рашич Андрей Валерьевич, Dmitry A. Tkachenko, Fengshuang Li, Chao Zhang, Jian Song

Published Oct 27, 2020• 9 citations
Publisher

Abstract

5G new radio low density parity check (5G-NR LDPC) codes specified by the 3rd generation partnership project (3GPP), a representative class of multi-edge-type, quasi-cyclic and raptor-like LDPC codes with rate-compatible and length-scalable capability, could meet with high-throughput demands. The corresponding decoding algorithm and implementation should support low complexity, high performance and scaleinvariance to channel variations and receiver imperfections. Flooding scheduling is usually used for the prevalent decoding algorithms and architecture of LDPC codes, but it is inefficient and inflexible compared with layered scheduling. This paper proposes a new simplification method where the sub-groups with similar fitting functions of normalization factors are incorporated into the same type, and enhanced adaptive normalized min-sum algorithm (enhanced ANMSA) for layered scheduling is further proposed for the implementation of 5G-NR LDPC codes. Based on the new simplification method, the proposed algorithm defines three types of check nodes for base graph 2 (BG2) in 5G-NR LDPC codes, and then obtains three look-up tables for BG2 by training. Simulation results demonstrate that the proposed algorithm can achieve excellent performance for 5G-NR LDPC codes of different rates and lengths over Binary-input AWGN channel and Rayleigh channel.

DOI
10.1109/bmsb49480.2020.9379739

Related papers

Adaptive Quantized and Normalized MSA Based on Modified MET-DE and Its Application for 5G-NR LDPC Codes

Xia An, Chao Zhang, Kewu Peng +2 more

5G new radio (5G-NR) enhanced Mobile Broadband (eMBB) scenario demands a high data throughput of up to 20Gb/s, leading to an urgent need for low complexity and high throughput decoding algorithms for 5G-NR low-density parity-check (LDPC) codes, the coding scheme of 5G eMBB data channel. Quantization of input and intermediate signals enables the data throughput enhancement and the computation and storage overhead reduction of LDPC decoder, but confronts the problem of performance degradation. In addition, conventional analysis tools show limitation on the accurate asymptotic performance prediction of quantized and normalized LDPC decoding algorithms. In this paper, we first introduce modified multi-edge type density evolution (MET-DE) to the asymptotic performance prediction of quantized and adaptive normalized min-sum algorithm (ANMSA). Then we adopt adaptive asymmetric quantization strategy for MET LDPC codes, combine it with conventional adaptive normalization technique, and further propose adaptive quantized and normalized min-sum algorithm (AQNMSA), which significantly alleviates the performance degradation of fixed quantized and normalized min-sum algorithm (NMSA) with negligible increment of computational complexity. Concurrently, we provide a novel look-up table design algorithm for AQNMSA based on the analysis tool of modified MET-DE. Finally, we apply AQNMSA to 5G-NR LDPC codes with a very low quantization bit-width of 4 bits for intermediate signals, and observe a comparable or superior decoding performance compared with its float-point non-adaptive counterparts under multiple code rates.

IEEE Access•Jan 1, 2023•4 citations

DE-aided ANMSA with edge classification and its application for 5G-NR LDPC codes

Ziqi Zhou, Kewu Peng, Jian Song +1 more

Belief propagation (BP) provides the basis for the design of 5G new radio low density parity check (5G-NR LDPC) codes, which in turn require a BP-based decoding algorithm. The min-sum algorithm (MSA), the simplification of sum-product algorithm (SPA), should hardly be regarded as a BP-based decoding algorithm because of its minimization. To remedy this, this paper adopts the multi-edge-type density evolution (MET-DE) as the main analysis tool, and introduces the concept of Kullback-Leibler divergence. Then the least Kullback-Leibler divergence criterion is proposed to identify the optimal normalization factors. Finally, Density-Evolution-aided Adaptive Normalization Min-Sum Algorithm (DE-aided ANMSA) with edge classification is further proposed for the decoding implementation of 5G-NR LDPC codes. Simulation results demonstrate that the proposed decoding algorithm can achieve excellent performance, while the greatest advantage is that its factors could be obtained more flexibly and accurately than traditional training methods. In addition, the optimal factors for base graph 2 in 5G-NR LDPC codes are provided as well.

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)•Aug 4, 2021•1 citation

Check-ratio-aided Layer-based Rescaling ANMSA and Its Application for 5G-NR LDPC Codes

Ziqi Zhou, Kewu Peng, Zhitong He

As a kind of iterative decoding algorithms based on belief propagation (BP), sum-product algorithm (SPA) is capacity-approaching but scale-variant. Currently, however, excellent performance and great stability are still incompatible for min-sum algorithm (MSA) and its improvements. To remedy above problems, we firstly introduce the concept of rescaling, and disclose the causes of the performance loss of MSA. Then introduce the asymptotic optimal decoding algorithm, as well as the suboptimal one. Finally, a more practicable algorithm is proposed, called check-ratio-aided layer-based rescaling adaptive normalized MSA (CL-RANMSA). Compared with the first two algorithms, CL-RANMSA is both capacity-approaching and characteristically robust. In particular, the practicably optimal factors for base graph 2 in 5G new radio low-density parity check (5G-NR LDPC) codes are provided. Simulations are also carried out whose results depict its scale-invariance and excellent performance.

International Wireless Communications and Mobile Computing Conference (IWCMC)•May 30, 2022•1 citation

A Deep Learning based Multi-edge-type decoding algorithm for 5G NR LDPC codes

Tianyu Du, Hao Ju, Yin Xu +2 more

Low-density parity-check(LDPC) code has been selected as the channel coding method by 5G NR because of its excellent error-correcting performance. To further improve the performance of LDPC decoding, this paper proposes a neural normalized min-sum(NNMS) algorithm based on multi-edge-type(MET). Based on the LLR convergence analysis of the protograph matrix of 5G NR, the base matrix is divided into several independent regions. Each part is assigned a unique scaling factor at different iterations. To verify the effectiveness of the proposed algorithm, We use two parity-check matrixes(PCM) derived from different base graphs in simulations. The results show that the proposed algorithm performs at most 0.45dB better than BP, 0.37dB better than NMS, and 0.25dB better than OMS, respectively, when the frame error rate (FER) is at 1$0^{-5}$ level over additive white Gaussian noise (AWGN) channels using BPSK modulation.

International Wireless Communications and Mobile Computing Conference (IWCMC)•Jun 19, 2023•6 citations

Low-Complexity High-Throughput QC-LDPC Decoder for 5G New Radio Wireless Communication

Tram Thi Bao Nguyen, Tuy Tan Nguyen, Hanho Lee

This paper presents a pipelined layered quasi-cyclic low-density parity-check (QC-LDPC) decoder architecture targeting low-complexity, high-throughput, and efficient use of hardware resources compliant with the specifications of 5G new radio (NR) wireless communication standard. First, a combined min-sum (CMS) decoding algorithm, which is a combination of the offset min-sum and the original min-sum algorithm, is proposed. Then, a low-complexity and high-throughput pipelined layered QC-LDPC decoder architecture for enhanced mobile broadband specifications in 5G NR wireless standards based on CMS algorithm with pipeline layered scheduling is presented. Enhanced versions of check node-based processor architectures are proposed to improve the complexity of the LDPC decoders. An efficient minimum-finder for the check node unit architecture that reduces the hardware required for the computation of the first two minima is introduced. Moreover, a low complexity a posteriori information update unit architecture, which only requires one adder array for their operations, is presented. The proposed architecture shows significant improvements in terms of area and throughput compared to other QC-LDPC decoder architectures available in the literature.

Electronics•Feb 22, 2021•41 citations

Improving the Performance of Layered Iterative minsum Approximation Message Passing Decoding Algorithm for 5G NR LDPC Codes

P. Vigneswari, S. Sivakumari

Abstract In order to cater to the needs of the 5G standard, one of the prominent solutions in terms of high coding gain, high throughput and low power dissipation is the 5G NR LDPC (New Radio Low Density Parity Check) codes which have been adopted by 5G Standard. LDPC codes are the successful Third Generation Forward Error Correcting codes. An Efficient decoder is the key to the success of any Error Correcting Code. LDPC codes are one whose parity check matrix have a very few non zero entries. 5G NR LDPC codes are constructed by Protographs or base graphs and are block structured. This paper improves the performance of Layered Iterative minsum Approximation Message Passing decoding Algorithm using Rate Matching, Fixed Point Quantization and Offset minsum techniques. Rate Matching is to maintain the exact number of encoded blocks with in the TTI. Simulation of this algorithm with BPSK encoding over AWGN channel shows that BER of 10-3 gives Eb/No of~2 dB for the block length of 105.

Journal of Physics Conference Series•Jun 1, 2021•0 citations
5G new radio low density parity check (5G-NR LDPC) codes specified by the 3rd generation partnership project (3GPP), a representative class of multi-edge-type, quasi-cyclic and raptor-like LDPC codes with rate-compatible and length-scalable capability, could meet with high-throughput demands. The corresponding decoding algorithm and implementation should support low complexity, high performance and scaleinvariance to channel variations and receiver imperfections. Flooding scheduling is usually used for the prevalent decoding algorithms and architecture of LDPC codes, but it is inefficient and inflexible compared with layered scheduling. This paper proposes a new simplification method where the sub-groups with similar fitting functions of normalization factors are incorporated into the same type, and enhanced adaptive normalized min-sum algorithm (enhanced ANMSA) for layered scheduling is further proposed for the implementation of 5G-NR LDPC codes. Based on the new simplification method, the proposed algorithm defines three types of check nodes for base graph 2 (BG2) in 5G-NR LDPC codes, and then obtains three look-up tables for BG2 by training. Simulation results demonstrate that the proposed algorithm can achieve excellent performance for 5G-NR LDPC codes of different rates and lengths over Binary-input AWGN channel and Rayleigh channel.
5G new radio (5G-NR) enhanced Mobile Broadband (eMBB) scenario demands a high data throughput of up to 20Gb/s, leading to an urgent need for low complexity and high throughput decoding algorithms for 5G-NR low-density parity-check (LDPC) codes, the coding scheme of 5G eMBB data channel. Quantization of input and intermediate signals enables the data throughput enhancement and the computation and storage overhead reduction of LDPC decoder, but confronts the problem of performance degradation. In addition, conventional analysis tools show limitation on the accurate asymptotic performance prediction of quantized and normalized LDPC decoding algorithms. In this paper, we first introduce modified multi-edge type density evolution (MET-DE) to the asymptotic performance prediction of quantized and adaptive normalized min-sum algorithm (ANMSA). Then we adopt adaptive asymmetric quantization strategy for MET LDPC codes, combine it with conventional adaptive normalization technique, and further propose adaptive quantized and normalized min-sum algorithm (AQNMSA), which significantly alleviates the performance degradation of fixed quantized and normalized min-sum algorithm (NMSA) with negligible increment of computational complexity. Concurrently, we provide a novel look-up table design algorithm for AQNMSA based on the analysis tool of modified MET-DE. Finally, we apply AQNMSA to 5G-NR LDPC codes with a very low quantization bit-width of 4 bits for intermediate signals, and observe a comparable or superior decoding performance compared with its float-point non-adaptive counterparts under multiple code rates.
Belief propagation (BP) provides the basis for the design of 5G new radio low density parity check (5G-NR LDPC) codes, which in turn require a BP-based decoding algorithm. The min-sum algorithm (MSA), the simplification of sum-product algorithm (SPA), should hardly be regarded as a BP-based decoding algorithm because of its minimization. To remedy this, this paper adopts the multi-edge-type density evolution (MET-DE) as the main analysis tool, and introduces the concept of Kullback-Leibler divergence. Then the least Kullback-Leibler divergence criterion is proposed to identify the optimal normalization factors. Finally, Density-Evolution-aided Adaptive Normalization Min-Sum Algorithm (DE-aided ANMSA) with edge classification is further proposed for the decoding implementation of 5G-NR LDPC codes. Simulation results demonstrate that the proposed decoding algorithm can achieve excellent performance, while the greatest advantage is that its factors could be obtained more flexibly and accurately than traditional training methods. In addition, the optimal factors for base graph 2 in 5G-NR LDPC codes are provided as well.
As a kind of iterative decoding algorithms based on belief propagation (BP), sum-product algorithm (SPA) is capacity-approaching but scale-variant. Currently, however, excellent performance and great stability are still incompatible for min-sum algorithm (MSA) and its improvements. To remedy above problems, we firstly introduce the concept of rescaling, and disclose the causes of the performance loss of MSA. Then introduce the asymptotic optimal decoding algorithm, as well as the suboptimal one. Finally, a more practicable algorithm is proposed, called check-ratio-aided layer-based rescaling adaptive normalized MSA (CL-RANMSA). Compared with the first two algorithms, CL-RANMSA is both capacity-approaching and characteristically robust. In particular, the practicably optimal factors for base graph 2 in 5G new radio low-density parity check (5G-NR LDPC) codes are provided. Simulations are also carried out whose results depict its scale-invariance and excellent performance.
Low-density parity-check(LDPC) code has been selected as the channel coding method by 5G NR because of its excellent error-correcting performance. To further improve the performance of LDPC decoding, this paper proposes a neural normalized min-sum(NNMS) algorithm based on multi-edge-type(MET). Based on the LLR convergence analysis of the protograph matrix of 5G NR, the base matrix is divided into several independent regions. Each part is assigned a unique scaling factor at different iterations. To verify the effectiveness of the proposed algorithm, We use two parity-check matrixes(PCM) derived from different base graphs in simulations. The results show that the proposed algorithm performs at most 0.45dB better than BP, 0.37dB better than NMS, and 0.25dB better than OMS, respectively, when the frame error rate (FER) is at 10−50^{-5}0−5 level over additive white Gaussian noise (AWGN) channels using BPSK modulation.
This paper presents a pipelined layered quasi-cyclic low-density parity-check (QC-LDPC) decoder architecture targeting low-complexity, high-throughput, and efficient use of hardware resources compliant with the specifications of 5G new radio (NR) wireless communication standard. First, a combined min-sum (CMS) decoding algorithm, which is a combination of the offset min-sum and the original min-sum algorithm, is proposed. Then, a low-complexity and high-throughput pipelined layered QC-LDPC decoder architecture for enhanced mobile broadband specifications in 5G NR wireless standards based on CMS algorithm with pipeline layered scheduling is presented. Enhanced versions of check node-based processor architectures are proposed to improve the complexity of the LDPC decoders. An efficient minimum-finder for the check node unit architecture that reduces the hardware required for the computation of the first two minima is introduced. Moreover, a low complexity a posteriori information update unit architecture, which only requires one adder array for their operations, is presented. The proposed architecture shows significant improvements in terms of area and throughput compared to other QC-LDPC decoder architectures available in the literature.
Abstract In order to cater to the needs of the 5G standard, one of the prominent solutions in terms of high coding gain, high throughput and low power dissipation is the 5G NR LDPC (New Radio Low Density Parity Check) codes which have been adopted by 5G Standard. LDPC codes are the successful Third Generation Forward Error Correcting codes. An Efficient decoder is the key to the success of any Error Correcting Code. LDPC codes are one whose parity check matrix have a very few non zero entries. 5G NR LDPC codes are constructed by Protographs or base graphs and are block structured. This paper improves the performance of Layered Iterative minsum Approximation Message Passing decoding Algorithm using Rate Matching, Fixed Point Quantization and Offset minsum techniques. Rate Matching is to maintain the exact number of encoded blocks with in the TTI. Simulation of this algorithm with BPSK encoding over AWGN channel shows that BER of 10-3 gives Eb/No of~2 dB for the block length of 105.