Results 241 to 250 of about 143,981 (279)

Construct Parity-check Matrix H of QC LDPC Codes via Arithmetic Progression

Proceedings of the Fifth International Conference on Network, Communication and Computing, 2016
In this correspondence, the construction of quasi-cyclic low-density parity-check(QC LDPC) codes via Arithmetic Progression(AP) is investigated. A mild necessary and sufficient condition is derived for the QC LDPC code to remove specifically circles whose girth equal to 6.
Xue Zhang, Lu Peng, Chenyan Li, Qing Li
openaire   +1 more source

The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes

The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon limit approaching codes opted for digital communication systems that require high reliability.
openaire   +2 more sources

A simple parity check matrix LDPC code for perpendicular magnetic recording channels

2013 10th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, 2013
In LDPC code design, the structure of code's parity check matrix can be very crucial to code performance. In this paper, we have investigated a simple designed parity check matrix when the code is applied to a PMR channel of a storage system. Belief propagation algorithm and min-sum algorithm are two major decoding algorithms used to benchmarked the ...
Sekson Timakul, Somsak Choochuay
openaire   +1 more source

An authentication scheme based on an low-density parity-check matrix

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., 2005
In this paper, an authentication scheme based on an LDPC (low-density parity-check) matrix is presented. Upper bounds on probabilities of impersonate attack and substitution attack have been derived using combinatorial argument on an LDPC ...
openaire   +1 more source

Efficient Memory Parity Check Matrix Optimization for Low Latency Quasi Cyclic LDPC Decoder

, 2020
Mhammed Benhayoun, Mouhcine Razi, A. Mansouri, A. Ahaitouf   +3 more
semanticscholar   +1 more source

Parity Check Matrix Partitioning for Layered Decoding of QC-LDPC Codes

2021 IEEE Globecom Workshops (GC Wkshps), 2021
Teng Lu, Xuan He, Peng Kang, Xiaohu Tang
openaire   +1 more source

Wide-Sense Time-Invariant Block Codes in Their Parity Check Matrix

2014
A wide-sense time-invariant block code in its parity check matrix exhibits more than one parity check polynomial periodically repeating. Quasi-cyclic codes are revisited from this point of view. Reordered forms of quasi-cyclic codes are treated. Shortening or lengthening, with respect to the quasi-cyclic condition, are possible here only with steps of ...
openaire   +1 more source

Strict-Sense Time-Invariant Convolutional Codes in Their Parity Check Matrix

2014
The syndrome former sub-matrix is introduced. The generator matrix of a convolutional code can be constructed by means of a procedure called null ex-OR sum of clusters of syndromes. Inversely, it is possible to operate by means of the column construction of the parity check matrix. The importance of a parity check matrix in minimal form is stressed.
openaire   +1 more source

Comment on "Parity-Check Matrix Calculation for Paraunitary Oversampled DFT Filter Banks

IEEE Transactions on Signal Processing, 2009
In a previous paper, Karp, Kieffer, and Duhamel have presented three methods to calculate the parity-check matrix of paraunitary oversampled DFT filter banks. Here is another.
openaire   +1 more source

Wide-Sense Time-Invariant Convolutional Codes in Their Parity Check Matrix

2014
The circuit for syndrome calculation in a convolutional code is introduced. The most general method for obtaining the parity check matrix in a convolutional code, starting from its generator matrix, is presented. The minimal encoder circuit is discussed. Wide-sense time-invariant convolutional codes form a closed ensemble.
openaire   +1 more source