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 SHENZHEN UNIVERSITY SCIENCE AND ENGINEERING

Improved EBF algorithm of Q-ary LDPC codes

Ningning Tong, Danfeng Zhao, WU Yu-ping

Published Oct 14, 2013• 0 citations
Publisher
DOI
10.3724/sp.j.1249.2013.01066

Related papers

Improved EBF algorithm of LDPC codes

WU Yu-ping

EBF algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths,however,the codewords directly designed by such algorithm have high encoding complexity,which hinders the development of LDPC codes in the practical process.The paper presents an improved EBF algorithm based on iterative encoding method with the linear coding complexity,the aim is to make the coding complexity lower through the improvement of coding scheme and the structure of parity-check matrix.The simulation results indicate that,in the condition of BPSK、QPSK and 16QAM modulations,though there are the same error correct performance between the codewords constructed by improved EBF algorithm proposed in this paper and codewords constructed by EBF algorithm,the powerful advantage lies in the lower hardware complexity.

Computer Engineering and Applications Journal•Jan 1, 2012•0 citations

Computer-Based Design of LDPC Codes

W.E. Ryan, Shu Lin

Cambridge University Press eBooks•Sep 17, 2009•0 citations

A Kind of Improved PEG Algorithm of Q-Ary LDPC Codes

Ning Ning Tong, Dan Feng Zhao, Yu Ping Wu

Progressive-edge-growth (PEG) algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths, however, the codes directly designed by such algorithm has high encoding complexity, especially for q-ary LDPC codes, encoding complexity increases with the increase of q value rapidly, which hinder the development of q-ary LDPC code’s implementation seriously. To such problem, the paper presents a improved method based on PEG algorithm which can be encoded by the iterative encoding algorithm with the liner operation complexity. The simulation results indicate: Though the error correcting capability of irregular q-ary LDPC codes constructed by the proposed methods in the paper is basically identical with the codes constructed by the PEG algorithm, but the powerful advantage makes it be easily implemented by the hardware .

Applied Mechanics and Materials•Oct 1, 2011•1 citation

LDPC Codes Satisfying the Constraint

S. Babvey, Stephen McLaughlin

•Jan 1, 2005•0 citations

Investigations on Binary and Non-Binary LDPC Codes

Kuntal Deka

•Jan 1, 2016•0 citations

A simple algorithm to design irregular LDPC codes for finite length

Mehrdad Taki, Mahdi Orooji

A simple and practical algorithm to design an irregular low density parity check (LDPC) codes for finite length applications is introduced. The simulation result will be proved the advantages of designed codes in compare with conventional regular and irregular finite length LDPC codes. Due to the semi-random structure of proposed codes, it will be encoded simpler than the other LDPC codes. Finally, a modified extended bit filling (EBF) is proposed to control rows weight

IEEE International Conference on Communication Systems (ICCS)•Jan 1, 2006•1 citation
EBF algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths,however,the codewords directly designed by such algorithm have high encoding complexity,which hinders the development of LDPC codes in the practical process.The paper presents an improved EBF algorithm based on iterative encoding method with the linear coding complexity,the aim is to make the coding complexity lower through the improvement of coding scheme and the structure of parity-check matrix.The simulation results indicate that,in the condition of BPSK、QPSK and 16QAM modulations,though there are the same error correct performance between the codewords constructed by improved EBF algorithm proposed in this paper and codewords constructed by EBF algorithm,the powerful advantage lies in the lower hardware complexity.
Progressive-edge-growth (PEG) algorithm is one of the best known methods for constructing LDPC codes at short and intermediate block lengths, however, the codes directly designed by such algorithm has high encoding complexity, especially for q-ary LDPC codes, encoding complexity increases with the increase of q value rapidly, which hinder the development of q-ary LDPC code’s implementation seriously. To such problem, the paper presents a improved method based on PEG algorithm which can be encoded by the iterative encoding algorithm with the liner operation complexity. The simulation results indicate: Though the error correcting capability of irregular q-ary LDPC codes constructed by the proposed methods in the paper is basically identical with the codes constructed by the PEG algorithm, but the powerful advantage makes it be easily implemented by the hardware .