Node-Wise Scheduling Algorithm of ADMM Decoding Based on Line Segment Projection

Xia, Qiaoqiao; He, Pinquan; Wang, Xin; Liu, Huiyang; Zhang, Qinglin

doi:10.1109/lcomm.2022.3143235

Cited by 5 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, approximate projection algorithms with lower complexity have been proposed by scholars. Xia et al proposed the even-vertex projection algorithm (EVA) [11], [12] and the line-segment algorithm (LSA) [13], [14], respectively projecting onto the closest even-vertex and the line-segment consisting of the two closest vertices of the polytope. Asadzadeh et al proposed the sparse affine projection algorithm (SAPA) [15], projecting onto the affine hull of a small number of vertices of the polytope.…”

Section: Introductionmentioning

confidence: 99%

Triangle Projection Algorithm in ADMM-LP Decoding of LDPC Codes

JIANG,

LIU,

JIAO

et al. 2024

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

In this letter, a novel projection algorithm is proposed in which projection onto a triangle consisting of the three even-vertices closest to the vector to be projected replaces check polytope projection, achieving the same FER performance as exact projection algorithm in both highiteration and low-iteration regime. Simulation results show that compared with the sparse affine projection algorithm (SAPA), it can improve the FER performance by 0.2 dB as well as save average number of iterations by 4.3%.

show abstract

Section: Introductionmentioning

confidence: 99%

Triangle Projection Algorithm in ADMM-LP Decoding of LDPC Codes

JIANG,

LIU,

JIAO

et al. 2024

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

show abstract

“…For example, the horizontal layered (HL) scheduling [12], vertical layered (VL) scheduling [13], and the node-wise scheduling [14] can achieve the above result to varying degrees. By adopting the approximate line segment projection algorithm, Xia et al designed the modified node-wise scheduling algorithm that can simplify the node-wise scheduling ADMM decoding method [15].…”

Section: Introductionmentioning

confidence: 99%

Horizontal Layered Scheduling ADMM Penalized Decoder Based on the Improved Penalty Function for LDPC

Wang

2022

IEEE Access

View full text Add to dashboard Cite

For low-density parity-check (LDPC) codes, reducing the number of Euclidean projections, choosing a suitable scheduling strategy, and devising an improved penalty function are three effective ways to increase the alternating direction method of multipliers (ADMM) penalized decoding speed. By combining the above three ways, this paper proposes a horizontal layered scheduling ADMM penalized decoder based on the improved penalty function to speed up decoding. The experimental data indicate that the proposed decoder can obtain better performance and lower average number of iterations than the existing ADMM penalized decoders.INDEX TERMS Horizontal layered scheduling, alternating direction method of multipliers, penalized decoding, low-density parity-check codes

show abstract