Results 161 to 170 of about 139,535 (196)
Some of the next articles are maybe not open access.
A new construction of UEP QC-LDPC codes
2010 IEEE International Symposium on Information Theory, 2010In this paper, a new construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed. We first give a new class of UEP block codes. QC-LDPC codes with binomial-term parity-check matrices which can avoid girths less than 8 and achieve an enlarged upper bound on the minimum distance are also introduced.
Chi-chao Chao +2 more
openaire +2 more sources
Construction of high-rate QC-LDPC codes
The 2011 International Conference on Advanced Technologies for Communications (ATC 2011), 2011In this paper, we construct high-rate quasi-cyclic low-density parity-check (QC-LDPC) codes with girth-10 based on shortened array codes. First, we derive analytic results on the maximum number of columns for shortened array codes of different girths. A code construction method inspired by the analysis is proposed for column-weight-three codes and is ...
Xu Chen, Francis C. M. Lau
openaire +2 more sources
Layered TPMP Decoding for QC-LDPC Codes
Applied Mechanics and Materials, 2012This paper presents a layered two-phase message passing (L-TPMP) decoding algorithm for general quasi-cyclic low-density parity-check (QC-LDPC) codes, which not only achieves high hardware utilization efficiency (HUE), but also brings in great memory block reduction.
Yi Hou, Ling Zhao, Rongke Liu
openaire +2 more sources
Construction of QC-LDPC Codes on Combinatorial Sequences
2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics, 2013Based on the properties of pell sequences, hanoi sequences and lucas sequences, three methods are proposed to construct new families of quasi cyclic low density parity check codes. Furthermore, we will prove that the designed QC-LDPC codes have no circles shorter than six. The performance of the codes is also investigated.
Fu Chenghua, Li Xiuli
openaire +2 more sources
Design of masking matrix for QC-LDPC codes
2013 IEEE Information Theory Workshop (ITW), 2013The masking matrix plays an important role in constructing new classes of regular and irregular quasi-cyclic low density parity check (QC-LDPC) codes. By coupling two identical graphs in a special way, we present a new structure of the masking matrix, whose Tanner graph can be seen as a protograph.
Ying Li, Yang Liu
openaire +2 more sources
Generalization of floor lifting for QC-LDPC codes
2017 IEEE East-West Design & Test Symposium (EWDTS), 2017The given paper presents a method for constructing a QC-LDPC code of shorter length by length adaption from a given QC-LDPC code of maximal length. The proposed method can be considered as a generalization of floor lifting. Making some offline calculation it is possible to construct a sequence of QC-LDPC codes with different circulant sizes generated ...
Sergey Egorov, Vasiliy Usatyuk
openaire +2 more sources
A class of invertible circulant matrices for QC-LDPC codes
2008 International Symposium on Information Theory and Its Applications, 2008This paper presents a new class of easily invertible circulant matrices, defined by exploiting the isomorphism from the ring Mn of n times n circulant matrices over GF(p) to the ring Rn = GF(p)[x]/(xn - 1) of the polynomials modulo (xn - 1). Such class contains matrices free of 4-length cycles that, if sparse, can be included in the parity check matrix
Baldi M., Bambozzi F., Chiaraluce F.
openaire +2 more sources
Joint Design of QC‐LDPC Codes for Coded Relay Cooperation
Chinese Journal of Electronics, 2016This paper proposes an effective method to jointly design girth-4 cycle-free Quasi-cyclic (QC) Low-density parity-check (LDPC) codes for multi-relay cooperation in a Rayleigh fading channel, where the joint iterative decoding by Min-sum algorithm (MSA) based on the introduced joint Tanner graph is also presented at the destination. Theoretical analysis
Lin Luo +5 more
openaire +2 more sources
Obtaining structured generator matrices for QC-LDPC codes [PDF]
2019 AEIT International Annual Conference (AEIT), 2019 In this paper we propose an efficient and general method to obtain structured generator matrices for QC-LDPC codes. Moreover, we devote particular attention to the family of fully-connected monomial codes and perform a statistical analysis of their low-weight unavoidable codewords, whose weight gives an upper bound on their minimum distance.
Massimo Battaglioni +3 more
openaire +1 more source
Efficient encoding of QC-LDPC codes related to cyclic MDS codes
IEEE Journal on Selected Areas in Communications, 2008In this paper, we present an efficient systematic encoding algorithm for quasi-cyclic (QC) low-density parity check (LDPC) codes that are related to cyclic maximum-distance separable (MDS) codes. The algorithm offers linear time complexity, and it can be easily implemented by using polynomial multiplication and division circuits.
Norifumi Kamiya, E. Sasaki
openaire +3 more sources