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

Abstract:

Article Preview

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 .

Info:

Periodical:

Edited by:

Han Zhao

Pages:

3032-3035

DOI:

10.4028/www.scientific.net/AMM.130-134.3032

Citation:

N. N. Tong et al., "A Kind of Improved PEG Algorithm of Q-Ary LDPC Codes", Applied Mechanics and Materials, Vols. 130-134, pp. 3032-3035, 2012

Online since:

October 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.