2015/01/28 by Ahmed A. Emran, Emran, Ahmed A., Maha Elsabrouty +1 · 2 citations
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Telecommunications and Broadcasting Technologies
paper · pdf · doi:10.48550/arxiv.1501.07336
openalex publication_date 2015/01/28 · openalex created_date 2022/09/08 · openalex updated_date 2026/07/28
In this paper, we propose a novel low complexity scaling strategy of min-sum\ndecoding algorithm for irregular LDPC codes. In the proposed method, we\ngeneralize our previously proposed simplified Variable Scaled Min-Sum\n(SVS-min-sum) by replacing the sub-optimal starting value and heuristic update\nfor the scaling factor sequence by optimized values. Density evolution and\nNelder-Mead optimization are used offline, prior to the decoding, to obtain the\noptimal starting point and per iteration updating step size for the scaling\nfactor sequence of the proposed scaling strategy. The optimization of these\nparameters proves to be of noticeable positive impact on the decoding\nperformance. We used different DVB-T2 LDPC codes in our simulation. Simulation\nresults show the superior performance (in both WER and latency) of the proposed\nalgorithm to other Min-Sum based algorithms. In addition to that, generalized\nSVS-min-sum algorithm has very close performance to LLR-SPA with much lower\ncomplexity.\n