Results 161 to 170 of about 595,487 (209)
Some of the next articles are maybe not open access.
Constructions of QC LDPC codes based on integer sequences
Science China Information Sciences, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lijun Zhang, Bing Li, Lee Lung Cheng
openaire +2 more sources
Low power decoder design for QC-LDPC codes
Proceedings of 2010 IEEE International Symposium on Circuits and Systems, 2010This paper presents a low-power decoder design approach for generic quasi-cyclic low-density parity-check (QC-LDPC) codes based on the layered min-sum decoding algorithm. To reduce the energy consumption, a novel message length-shortening scheme is explored.
Kai He +3 more
openaire +1 more source
Combinatorial optimization for improving QC LDPC codes performance
2013 IEEE International Symposium on Information Theory, 2013Techniques for searching for good quasi-cyclic (QC) LDPC block codes of short and moderate lengths which are suitable for practical purposes are studied. To facilitate implementations only codes whose parity-check matrices having bidiagonal structure of their submatrices and consequently having low encoding complexity are considered.
Irina E. Bocharova +2 more
openaire +2 more sources
Efficient Decoding of QC-LDPC Codes Using GPUs
2011In this work, we propose an efficient quasi-cyclic LDPC (QCLDPC) decoder simulatorwhich runs on graphics processing units(GPUs). We optimize the data structures of the messages used in the decoding process such that both the read and write processes can be performed in a highly parallel manner by the GPUs.
Yue Zhao 0011 +4 more
openaire +2 more sources
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, Eisaku Sasaki
openaire +2 more sources
Efficient Decoder Implementation for QC-LDPC Codes
2006 International Conference on Communications, Circuits and Systems, 2006Channel coding is an important building block in communication systems. Low-density parity-check codes is one kind of prominent error correcting codes being considered in next generation industry standards. This paper presents a memory efficient, very high speed decoder architecture suited for quasi-cyclic low-density parity-check codes using modified ...
Jin Sha +4 more
openaire +1 more source
QC-LDPC Code-Based Cryptosystems
2014In this chapter, the use of QC-LDPC codes in public key cryptosystems inspired to the McEliece and Niederreiter systems is studied. Both the case in which the private and the public code are permutation equivalent and that in which such an equivalence is absent are considered.
openaire +1 more source
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 ...
null Xu Chen, Francis C.M. Lau
openaire +1 more source
An Efficient Layered Decoding Architecture for Nonbinary QC-LDPC Codes
IEEE Transactions on Circuits and Systems I: Regular Papers, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yeong-Luh Ueng +5 more
openaire +3 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 +1 more source

