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

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

Replica horizontal-shuffled iterative decoding of low-density parity-check codes

Yang Yang, Jianzhong Huang, Sheng Tong, Xinmei Wang

Published Dec 1, 2010• 6 citations
Publisher
DOI
10.1016/s1005-8885(09)60522-7

Related papers

Horizontal-Shuffled Scheduling for the Low Density Parity Check Codes Decoding for WiMAX Application

Mouhcine Razi, Anas Mansouri, Abdessalam Aït Madi +1 more

Lecture notes in electrical engineering•Aug 1, 2018•1 citation

Accelerating BP-Based Iterative Low-Density Parity-Check Decoding by Modified Vertical and Horizontal Processes

陈婧文, 仰枫帆, 罗琳 +2 more

西南交通大学学报:英文版•Jan 1, 2009•0 citations

Majority-based and hybrid iterative decoding of low-density parity-check codes

Pirouz Zarrinkhat

•Jan 1, 2005•0 citations

Low-density parity-check codes with 2-state trellis decoding

Mao‐Ching Chiu

A class of low-density parity-check (LDPC) codes with a simple 2-state trellis structure is presented. For LDPC decoding, the conventional belief propagation (BP) algorithm consists of numerous sub-decoders of single-parity check codes and exchanges information between sub-decoders in an iterative manner. If the single-parity check codes can be constructed and grouped in a proper way, the decoder can be decomposed into few identical 2-state trellis decoders. Therefore, instead of numerous sub-decoders of single-parity check codes, an iterative decoding algorithm based on few sub-decoders over 2-state trellis is proposed. The proposed decoding algorithm improves the efficiency of message passing between sub-decoders and hence provides a fast convergent rate as compared to the standard BP algorithm. Simulation results show that the proposed scheme provides a better performance and a fast convergent rate as compared to those of standard BP algorithm. The result also shows that the proposed algorithm has a similar performance as that of asynchronous replica shuffled BP algorithm and has a slightly inferior performance than that of synchronous replica shuffled BP algorithm. However, complexity analysis shows that our proposed algorithm has complexity that is lower than that of the replica shuffled BP algorithm.

IEEE Transactions on Communications•Jan 1, 2009•2 citations

A Non-Disjoint Group Shuffled Decoding for LDPC Codes

Yen-Cheng Hsu, Tofar C.-Y. Chang, Yu T. Su +1 more

To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing iteration into a sequence of sub-iterations, have been proposed. The so-called group horizontal shuffled BP algorithm partitions the check nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes a new grouping technique to accelerate the message-passing rate. Performance of the proposed algorithm is analyzed by a Gaussian approximation approach. Both analysis and numerical experiments verify that the new algorithm does yield a convergence rate faster than that of existing conventional or group shuffled BP decoder with the same computing complexity constraint.

arXiv:1202.1060•Feb 6, 2012•0 citations

Improvement of decoding algorithms for low-density parity-check codes

Junho Cho

•Jan 1, 2010•0 citations
A class of low-density parity-check (LDPC) codes with a simple 2-state trellis structure is presented. For LDPC decoding, the conventional belief propagation (BP) algorithm consists of numerous sub-decoders of single-parity check codes and exchanges information between sub-decoders in an iterative manner. If the single-parity check codes can be constructed and grouped in a proper way, the decoder can be decomposed into few identical 2-state trellis decoders. Therefore, instead of numerous sub-decoders of single-parity check codes, an iterative decoding algorithm based on few sub-decoders over 2-state trellis is proposed. The proposed decoding algorithm improves the efficiency of message passing between sub-decoders and hence provides a fast convergent rate as compared to the standard BP algorithm. Simulation results show that the proposed scheme provides a better performance and a fast convergent rate as compared to those of standard BP algorithm. The result also shows that the proposed algorithm has a similar performance as that of asynchronous replica shuffled BP algorithm and has a slightly inferior performance than that of synchronous replica shuffled BP algorithm. However, complexity analysis shows that our proposed algorithm has complexity that is lower than that of the replica shuffled BP algorithm.
To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing iteration into a sequence of sub-iterations, have been proposed. The so-called group horizontal shuffled BP algorithm partitions the check nodes of the code graph into groups to perform group-by-group message-passing decoding. This paper proposes a new grouping technique to accelerate the message-passing rate. Performance of the proposed algorithm is analyzed by a Gaussian approximation approach. Both analysis and numerical experiments verify that the new algorithm does yield a convergence rate faster than that of existing conventional or group shuffled BP decoder with the same computing complexity constraint.