Results 1 to 10 of about 21,382 (243)

Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution

IEEE Access
This paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang, Jingping Che, Huaan Li, Zhen Luo, Bo Zhang, Hui Liu   +5 more
doaj   +1 more source

Time-Invariant Spatially Coupled Low-Density Parity-Check Codes with Small Constraint Length

, 2016
We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedures ...
Baldi, Marco, Battaglioni, Massimo, Cancellieri, Giovanni, Chiaraluce, Franco   +3 more
core   +1 more source

Girth-Eight Reed-Solomon Based QC-LDPC Codes [PDF]

2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018
This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs ...
Xin Xiao 0001, Bane Vasic, Shu Lin 0001, Khaled A. S. Abdel-Ghaffar, William E. Ryan   +4 more
openaire   +1 more source

Explicit constructions of Type-II QC LDPC codes with girth at least 6 [PDF]

, 2007
Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and weight-2 circulant matrices. The structure of cycles of length 2n are investigated, and necessary and sufficient conditions for a type-II QC LDPC parity ...
Lally, K
core  

Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance

, 2017
Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel are studied ...
A Orlitsky, AS Asratian, C Di, CE Shannon, ER Berlekamp, G Poltyrev, H Pishro-Nik, H Pishro-Nik, I Sason, IE Bocharova, J Feldman, J Zumbrägel, M Baldi, M Jianjun, M Schwartz, N Varnica, RG Gallager, S Litsyn, T Hehn, T Richardson   +19 more
core   +1 more source

Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth

, 2018
We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches.
Baldi, Marco, Battaglioni, Massimo, Chiaraluce, Franco, Tadayon, Mohammad H., Tasdighi, Alireza   +4 more
core   +1 more source

On the lifting degree of girth-8 QC-LDPC codes

Designs, Codes and Cryptography
The lifting degree and the deterministic construction of quasi-cyclic low-density parity-check (QC-LDPC) codes have been extensively studied, with many construction methods in the literature, including those based on finite geometry, array-based codes, computer search, and combinatorial techniques.
Haoran Xiong, Guanghui Wang 0002, Zhiming Ma, Guiying Yan   +3 more
openaire   +2 more sources

Array Convolutional Low-Density Parity-Check Codes

, 2013
This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density parity-check (LDPC)
Baldi, Marco, Cancellieri, Giovanni, Chiaraluce, Franco   +2 more
core   +1 more source

Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization

, 2013
An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The
Bazarsky, Alex, Litsyn, Simon, Presman, Noam   +2 more
core   +1 more source

Type-II QC-LDPC Codes From Multiplicative Subgroup of Prime Field

IEEE Access, 2020
A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel
Guohua Zhang, Yulin Hu, Defeng Ren, Yuanhua Liu, Yang Yang   +4 more
doaj   +1 more source