Back to Search
Start Over
A Low Complexity Decoding Algorithm Design Based on Quasi-Cyclic LDPC Codes
- Source :
- 2020 International Conference on Computing, Electronics & Communications Engineering (iCCECE).
- Publication Year :
- 2020
- Publisher :
- IEEE, 2020.
-
Abstract
- Entering the 5G era, the hardware design of low-density parity-check (LDPC) codes under the new standard has increasingly higher requirements on throughput. According to the geometric characteristics of the check matrices of the quasi-cyclicQC) LDCP codes under the CCSDS standard, this paper designs a layered dynamic normalized minimum sum algorithm(LDNMSA) under the pre-termination decoding based on de-layering scheme. The check matrix structure of this code is easy for hardware design and the storage resource consumption is low. The approximate replacement of the minimum sum algorithm(MSA) reduces the computational complexity of the check node update process. The determination of correction factors and inter-layer deletion thresholds through computer simulation improves the decoding performance and the speed of a single iteration, and adopt the layered scheduling scheme with optimized update order reduces the number of iterations required for decoding. Experimental results show that when the bit error rate(BER) is 10-5, the designed algorithm has a gain of approximately 0.5 dB compared to the MSA. The speed and calculation amounts to a single iteration are much lower than the log-likelihood-ratio(LLR) belief propagation(BP) algorithm and the performance is only less than 0.1dB.
Details
- Database :
- OpenAIRE
- Journal :
- 2020 International Conference on Computing, Electronics & Communications Engineering (iCCECE)
- Accession number :
- edsair.doi...........5a8788bd2101c1846210e256c2dca22d