Results 61 to 70 of about 1,996 (184)

Low-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes

open access: yes, 2012
This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we ...
Huang, Qin, Liu, Keke, Wang, Zulin
core  

A Class of Quantum LDPC Codes Constructed From Finite Geometries

open access: yes, 2008
Low-density parity check (LDPC) codes are a significant class of classical codes with many applications. Several good LDPC codes have been constructed using random, algebraic, and finite geometries approaches, with containing cycles of length at least ...
Aly, Salah A.
core   +1 more source

Construction Method of QC-LDPC Codes with Big Girth for Fast Encoding [PDF]

open access: yesJisuanji gongcheng, 2018
The sub-matrices on both diagonals of the right half of the check matrix are unit matrices.Existence of the deterministic unit matrix not only destroys the randomness of Quasie Cyclic-Low Density Parity Check(QC-LDPC) code,it leads to a certain loss of ...
PENG Haiying,YANG Jian,SUN Lijun
doaj  

Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes

open access: yes, 2010
This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constructed based on cyclic subgroups of finite fields.
Abdel-Ghaffar, Khaled   +4 more
core  

Concatenated Turbo/LDPC codes for deep space communications: performance and implementation [PDF]

open access: yes, 2013
Deep space communications require error correction codes able to reach extremely low bit-error-rates, possibly with a steep waterfall region and without error floor. Several schemes have been proposed in the literature to achieve these goals.
Condo, Carlo
core  

Optimized Puncturing of the Check Matrix for Rate-Compatible LDPC Codes

open access: yesMATEC Web of Conferences, 2018
In the wireless communication system, it is necessary to change the transmitted code word or code rate in real time according to the channel environment, designing and implementing rate compatible codes is of great practical significance.
Zhang Liang, Meng Jiahui, Zhao Danfeng
doaj   +1 more source

Mutual Information-Maximizing Quantized Belief Propagation Decoding of Regular LDPC Codes

open access: yes, 2020
In mutual information-maximizing lookup table (MIM-LUT) decoding of low-density parity-check (LDPC) codes, table lookup operations are used to replace arithmetic operations.
Cai, Kui, He, Xuan, Mei, Zhen
core  

Girth Analysis of Tanner’s (3, 17)-Regular QC-LDPC Codes Based on Euclidean Division Algorithm

open access: yesIEEE Access, 2019
In this paper, the girth distribution of the Tanner’s (3, 17)-regular quasi-cyclic LDPC (QC-LDPC) codes with code length $17p$ is determined, where $p$ is a prime and $p \equiv 1~(\bmod ~51)$ .
Hengzhou Xu   +3 more
doaj   +1 more source

Low Complexity Encoder of High Rate Irregular QC-LDPC Codes for Partial Response Channels

open access: yesAdvances in Electrical and Computer Engineering, 2011
High rate irregular QC-LDPC codes based on circulant permutation matrices, for efficient encoder implementation, are proposed in this article. The structure of the code is an approximate lower triangular matrix.
IMTAWIL, V., MEESOMBOON, A., KUPIMAI, M.
doaj   +1 more source

Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices

open access: yesIEEE Access, 2018
In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with
Farzane Amirzade, Mohammad-Reza Sadeghi
doaj   +1 more source

Home - About - Disclaimer - Privacy