Results 291 to 300 of about 196,265 (325)

High throughput hardware architecture for (1440,1344) low-density parity-check code utilizing quasi-cyclic structure

2008 5th International Symposium on Turbo Codes and Related Topics, 2008
High throughput architecture of an encoder and a decoder for a quasi-cyclic low-density parity-check (LDPC) code is proposed. A new systematic encoding method is carried out by polynomial manipulation.
Hiroyuki Yamagishi, Makoto Noda
semanticscholar   +1 more source

Modified Belief Propagation Decoding Algorithm for Low-Density Parity Check Code Based on Oscillation

IEEE Vehicular Technology Conference, 2006
A low-density parity check (LDPC) code with the belief propagation (BP) or the log-likelihood ratio belief propagation (LLR-BP) can achieve good bit error rate (BER) performance approaching the Shannon limit.
S. Gounai, T. Ohtsuki, T. Kaneko
semanticscholar   +1 more source

Low Density Parity Check Codes

2020
A linear code with a check matrix in which each column has few non-zero entries is called a low density parity check code or, for brevity, an LDPC code. These codes were introduced in the 1960s by Gallager who proved that probabilistic constructions of such matrices produce asymptotically good linear codes. Moreover, he observed that LDPC codes perform
openaire   +2 more sources

Low Density Parity Check Codes

2016
Besides the turbo codes, there is one more class of linear block codes that makes possible to approach to the Shannon bound. These are Low Density Parity Check (LDPC) codes. They were proposed by Gallager [83]. In principle they have a sparse parity - check matrix.
Predrag Ivanis, Dušan Drajić
openaire   +2 more sources

On circulant low density parity check codes

Proceedings IEEE International Symposium on Information Theory,, 2003
This paper presents three classes of low density parity check codes constructed based on the cyclic structure of lines in finite geometries. Codes in these classes are either cyclic or quasi-cyclic, and they perform well with iterative decoding.
Yu Kou, Heng Tang, Khaled Abdel-Ghaffar, Shu Lin, Jun Xu   +4 more
openaire   +2 more sources

Low Density Parity Check Codes

2014
The Tanner graph is described. A girth in the Tanner graph is equivalent to a short cycle of 1- symbols in the parity check matrix. The condition called row-column constraint is introduced, in order to allow practical decoding procedures. They are based on the sum-product algorithm, which is briefly outlined.
openaire   +4 more sources

Design of Low-Density Parity-Check Codes

IEEE Vehicular Technology Magazine, 2011
This article provides an overview of the conflicting design tradeoffs of low-density parity-check (LDPC) codes and thus advocates a more holistic approach to their design for wireless channels. We reveal some of the intricate interdependencies of the LDPC code parameters and hence recommend designing codes that strike an attractive tradeoff concerning ...
N. Bonello, Sheng Chen, Lajos Hanzo
openaire   +2 more sources

Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels

IEEE J. Sel. Areas Commun., 2001
A numerical method has been presented to determine the noise thresholds of low density parity-check (LDPC) codes that employ the message passing decoding algorithm on the additive white Gaussian noise (AWGN) channel. In this paper, we apply the technique
J. Hou, P. Siegel, L. Milstein
semanticscholar   +1 more source

Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes

IEEE Advanced Information Technology, Electronic and Automation Control Conference, 2018
A compact encoding process with three phases is proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. A back substitution circuit is shared at the first and third phases.
Tingting Liang, Peng Zhang, Changyin Liu, Jin Liu   +3 more
semanticscholar   +1 more source

Near optimum universal belief propagation based decoding of low-density parity check codes

IEEE Transactions on Communications, 2002
In this paper, we propose a belief-propagation (BP)-based decoding algorithm which utilizes normalization to improve the accuracy of the soft values delivered by a previously proposed simplified BP-based algorithm.
Jinghu Chen, M. Fossorier
semanticscholar   +1 more source