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

Journal of Jilin University

Class of irregular LDPC codes with low encoding complexity

WU Yu-ping

Published Jan 1, 2009• 0 citations
OpenAlex

Related papers

Improved Min-Sum Decoding of Irregular LDPC Codes

Juntan Zhang, M.P.C. Fossorier, Daqing Gu +1 more

IEICE Technical Report; IEICE Tech. Rep.•May 19, 2005•0 citations

Serial Concatenate LDPC Codes

Shuiqing Li

This paper mainly discusses the design of a family of irregular LDPC codes with low encoding complexity. This class of LDPC codes concatenates multiple single bit parity check block codes in serial, and it makes encoding complexity much lower than in usual ways. Furthermore, using a AWGN channel, it demonstrates that this class of LDPC codes have very good decoding performance.

Journal of Information Engineering University•Jan 1, 2004•0 citations

Reduced Complexity of LDPC Codes using Hard Decision Decoder

Allu Swamy Naidu, Appala Naidu Tentu, Ajeet Pratap Singh

Lecture notes on data engineering and communications technologies•Jan 1, 2022•1 citation

A family of irregular LDPC codes with low encoding complexity

Sarah J. Johnson, Steven R. Weller

We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.

IEEE Communications Letters•Feb 1, 2003•108 citations

Construction of the cyclic block-type LDPC codes for low complexity hardware implementation

Kuang-Hao Lin, KyungHi Chang, Chien‐Lin Huang +1 more

In this paper, we construct the cyclic block-type low-density parity-check (CB-LDPC) codes for low complexity hardware implementation. The CB-LDPC code, which is a special class of quasi-cyclic LDPC (QC-LDPC), has an efficient encoding algorithm due to the simple structure of their parity-check matrices. A distribution of irregular parity-check matrix for the CB-LDPC is developed so that we can obtain an area-efficient decoder design, good error correction performance, and low complexity architecture implementation. The CB-LDPC code decoding uses the iterative min-sum algorithm (MSA) and the block parallel connection design to improve the hardware architecture complexity and area.

IEEE International Conference on Electronics, Circuits and Systems (ICECS)•Aug 1, 2008•2 citations

Configurable LDPC Decoder Architectures for Regular and Irregular Codes

Marjan Karkooti, Predrag Radosavljevic, Joseph R. Cavallaro

Journal of Signal Processing Systems•May 9, 2008•15 citations
In this paper, we construct the cyclic block-type low-density parity-check (CB-LDPC) codes for low complexity hardware implementation. The CB-LDPC code, which is a special class of quasi-cyclic LDPC (QC-LDPC), has an efficient encoding algorithm due to the simple structure of their parity-check matrices. A distribution of irregular parity-check matrix for the CB-LDPC is developed so that we can obtain an area-efficient decoder design, good error correction performance, and low complexity architecture implementation. The CB-LDPC code decoding uses the iterative min-sum algorithm (MSA) and the block parallel connection design to improve the hardware architecture complexity and area.