Layered Minimum Sum Decoding Algorithm Improved by Introducing Layer-Weight Ascend Scheduling Strategy

Yu Liu; Lin Bai; Chan Wang; Yaohui Hao; Jiemin Li

doi:10.3788/LOP202259.0706002

Journals >Laser & Optoelectronics Progress >Volume 59 >Issue 7 >Page 0706002 > Article

Laser & Optoelectronics Progress
Vol. 59, Issue 7, 0706002 (2022)

Layered Minimum Sum Decoding Algorithm Improved by Introducing Layer-Weight Ascend Scheduling Strategy

Yu Liu, Lin Bai^*, Chan Wang, Yaohui Hao, and Jiemin Li

Author Affiliations

School of Communications and Information Engineering, Xi'an University of Posts and Telecommunications, Xi'an , Shaanxi 710121, China

show less

DOI: 10.3788/LOP202259.0706002 Cite this Article Set citation alerts

Yu Liu, Lin Bai, Chan Wang, Yaohui Hao, Jiemin Li. Layered Minimum Sum Decoding Algorithm Improved by Introducing Layer-Weight Ascend Scheduling Strategy[J]. Laser & Optoelectronics Progress, 2022, 59(7): 0706002 Copy Citation Text

show less

Comparison of average number of iterations of LS-MS-D, LS-MS-R, and LS-MS-A algorithms with different update orders according to row weight of layer

Fig. 1. Comparison of average number of iterations of LS-MS-D, LS-MS-R, and LS-MS-A algorithms with different update orders according to row weight of layer

Download full size

Fig. 2. Comparison of average iteration times of LS-MS-A and L-MS algorithms with different code lengths

Download full size

Fig. 3. Comparison of average iteration times of LS-MS-A and L-MS algorithms with different code rates

Download full size

Fig. 4. Graph of error code performance

Download full size

Fig. 5. Graph of average number of iterations

Download full size

Calculate row-weight of $H_{M \times N}$ ；

$H_{M \times N}^{s o r t}$ = Sort （ $H_{M \times N}$ ） according to the $D_{k}$ of the $H_{M \times N}$ ，so that the $D_{k}$ of $H_{M \times N}^{s o r t}$ are reordered；