Comparison of various constructions of binary LDPC codes based on permutation matrices

Ensembles of low-density parity check codes based on permutation matrices are considered. Algorithms for generation of check matrices of such codes are proposed. The results of simulation of the obtained code constructions for an iterative belief propagation (sum-product) decoding algorithm applied...

Full description

Saved in:
Bibliographic Details
Published in:Journal of communications technology & electronics 2012-08, Vol.57 (8), p.932-945
Main Authors: Zyablov, V. V., Ivanov, F. I., Potapov, V. G.
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Articles from the Russian Journal Informatsionnye Protsessy
Channels
Codes
Communications Engineering
Communications networks
Communications technology
Comparative analysis
Computer simulation
Construction
Engineering
Gaussian
Low density parity check codes
Mathematical analysis
Matrices
Matrix methods
Mutation
Networks
Permutations
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ensembles of low-density parity check codes based on permutation matrices are considered. Algorithms for generation of check matrices of such codes are proposed. The results of simulation of the obtained code constructions for an iterative belief propagation (sum-product) decoding algorithm applied in the case of transmission of a code word via a binary channel with an additive Gaussian white noise are presented.
ISSN:1064-2269
1555-6557
DOI:10.1134/S1064226912080086