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

中国邮电高校学报:英文版

Modified min-sum SCAN decoding algorithm for polar codes

Yuan Fang, Bin Tian

Published Dec 30, 2018• 0 citations
Publisher
DOI
10.19682/j.cnki.1005-8885.2018.1031

Related papers

Novel modified min-sum decoding algorithm for low-density parity-check codes

Haiyang Liu, Wenze Qu, Bin Liu +3 more

中国邮电高校学报:英文版•Aug 1, 2010•8 citations

A modified Min Sum decoding algorithm based on LMMSE for LDPC codes

Zijing Wu, Kaixiong Su, Liting Guo

AEU - International Journal of Electronics and Communications•May 10, 2014•10 citations

Single-Scan Min-Sum Algorithms for Fast Decoding of LDPC Codes

Xiaofei Huang

Many implementations for decoding LDPC codes are based on the (normalized/offset) min-sum algorithm due to its satisfactory performance and simplicity in operations. Usually, each iteration of the min-sum algorithm contains two scans, the horizontal scan and the vertical scan. This paper presents a single-scan version of the min-sum algorithm to speed up the decoding process. It can also reduce memory usage or wiring because it only needs the addressing from check nodes to variable nodes while the original min-sum algorithm requires that addressing plus the addressing from variable nodes to check nodes. To cut down memory usage or wiring further, another version of the single-scan min-sum algorithm is presented where the messages of the algorithm are represented by single bit values instead of using fixed point ones. The software implementation has shown that the single-scan min-sum algorithm is more than twice as fast as the original min-sum algorithm

arXiv:cs/0609090•IEEE Information Theory Workshop (ITW)•Oct 1, 2006•7 citations

Optimization and Hardware Implementation of Learning Assisted Min-Sum Decoders for Polar Codes

Ning Lyu, Bin Dai, Hongfei Wang +1 more

Journal of Signal Processing Systems•Jun 27, 2020•2 citations

Multi-stack Decoding of Polar Codes

Dongsheng Wu, Qingshuang Zhang, Yingxian Zhang

Lecture notes in electrical engineering•Jan 1, 2016•0 citations

Look-Up-Table Decoding and Architecture Optimization for Scale-Min-Sum Polar Decoders

Xiumin Wang, Rui Gu, Jun Li +2 more

As to realize believe propagation (BP) for polar decoding, the scaled min-sum (SMS) algorithm is widely used in hardware realization for polar decoders. However, the decoding performance of SMS algorithm is still not good as the length of polar codes increase, and its computing architecture,which called processing elements (PE) needs to be further optimized due to its long critical path. In this paper, referring to the method used in LDPC/Turbo decoding, a look-up-table (LUT) algorithm and its modified version called LUT-SMS are proposed for polar decoding. The simulation result shows that, compared with the SMS algorithm, the proposed LUT-SMS algorithm can lead to 0.3 dB extra decoding gain when the code length up to 2048. For a different trade-off, a new SMS computing architecture which has shorter computing path is proposed to solve the long delay of the polar decoders. The hardware implementation result shows that, the optimized SMS computing architecture can also achieve more than 32% increase in throughput for the case of (256,128) polar decoder without much extra hardware consumption. As a result, both these two optimization schemes have good promotion for polar decoding.

International Conference on Information Technology in Medicine and Education•Oct 1, 2018•0 citations
Many implementations for decoding LDPC codes are based on the (normalized/offset) min-sum algorithm due to its satisfactory performance and simplicity in operations. Usually, each iteration of the min-sum algorithm contains two scans, the horizontal scan and the vertical scan. This paper presents a single-scan version of the min-sum algorithm to speed up the decoding process. It can also reduce memory usage or wiring because it only needs the addressing from check nodes to variable nodes while the original min-sum algorithm requires that addressing plus the addressing from variable nodes to check nodes. To cut down memory usage or wiring further, another version of the single-scan min-sum algorithm is presented where the messages of the algorithm are represented by single bit values instead of using fixed point ones. The software implementation has shown that the single-scan min-sum algorithm is more than twice as fast as the original min-sum algorithm
As to realize believe propagation (BP) for polar decoding, the scaled min-sum (SMS) algorithm is widely used in hardware realization for polar decoders. However, the decoding performance of SMS algorithm is still not good as the length of polar codes increase, and its computing architecture,which called processing elements (PE) needs to be further optimized due to its long critical path. In this paper, referring to the method used in LDPC/Turbo decoding, a look-up-table (LUT) algorithm and its modified version called LUT-SMS are proposed for polar decoding. The simulation result shows that, compared with the SMS algorithm, the proposed LUT-SMS algorithm can lead to 0.3 dB extra decoding gain when the code length up to 2048. For a different trade-off, a new SMS computing architecture which has shorter computing path is proposed to solve the long delay of the polar decoders. The hardware implementation result shows that, the optimized SMS computing architecture can also achieve more than 32% increase in throughput for the case of (256,128) polar decoder without much extra hardware consumption. As a result, both these two optimization schemes have good promotion for polar decoding.