Results 131 to 140 of about 1,996 (184)

Joint Design of QC‐LDPC Codes for Coded Relay Cooperation

Chinese Journal of Electronics, 2016
This 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
Lei Tang, Fengfan Yang, Shunwai Zhang, Ejaz Saqib, Lin Luo   +4 more
openaire   +1 more source

Flexible decoder architectures for irregular QC-LDPC codes

2008 51st Midwest Symposium on Circuits and Systems, 2008
A flexible and power-efficient decoder architecture employing the layered-decoding message-passing algorithm and the low-complexity offset-based Min-Sum check algorithm for irregular QC-LDPC codes is presented in this paper. The architecture is verified by implementing a programmable decoder chip compliant with the QC-LDPC codes in Mobile WiMAX ...
Tzu-Chieh Kuo, Alan N. Willson
openaire   +1 more source

A QC-LDPC Code Based Digital Signature Algorithm

2018 International Conference on Networking and Network Applications (NaNA), 2018
CFS digital signature algorithm, which proposed in 2001, is the most important code based digital signature algorithm and can resist the known attack of quantum algorithms. But the efficiency of CFS is very low because of the extremely low signing speed and the large public key size. In this paper, a variation of CFS algorithm is presented.
Fang Ren, Xuefei Yang, Dong Zheng
openaire   +1 more source

Low Complexity Decoding Algorithm of QC-LDPC Code

2010 IEEE Asia-Pacific Services Computing Conference, 2010
Through the research on the decoding algorithm of low-density parity-check (LDPC) code, a low complexity decoding algorithm suitable for quasi-cyclic LDPC (QC-LDPC) code is proposed in this paper. The algorithm adopts layered decoding (LD), and the sub-minimum is replaced by the sum of an optimal correction factor and the minimum during the process of ...
Fanglong Yi, Pengjun Wang
openaire   +1 more source

Analysis of balanced cycles of QC-LDPC codes

2011 Eighth International Conference on Wireless and Optical Communications Networks, 2011
In this paper, we analyze balanced cycles of quasi-cyclic low-density parity-check (QC-LDPC) codes. We show the structure of balanced cycles and their necessary and sufficient existence conditions. Furthermore, we determine the minimal matrices of balanced cycle. Meanwhile we propose the property of B-girth in its mother matrix.
Gao Xiao, Zhang Nan
openaire   +1 more source

A new construction of UEP QC-LDPC codes

2010 IEEE International Symposium on Information Theory, 2010
In 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-Jen Wu, Chung-Hsuan Wang, Chi-chao Chao   +2 more
openaire   +1 more source

Row Division Method to Generate QC-LDPC Codes

2009 Fifth Advanced International Conference on Telecommunications, 2009
To cut down the hardware implementation cost this paper presents an efficient method to construct large girth Quasi-Cyclic low density parity check (QC-LDPC) codes. The row groups are paired two times the row weight, which has the complexity as compared to the connection of individual columns and rows.
Abid Yahya, Othman Sidek, M. F. M. Salleh, Farid Ghani   +3 more
openaire   +1 more source

Obtaining structured generator matrices for QC-LDPC codes

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, Paolo Santini, Marco Baldi, Giovanni Cancellieri   +3 more
openaire   +1 more source

Construction of QC-LDPC Codes on Combinatorial Sequences

2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics, 2013
Based 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

QC-LDPC Code-Based Cryptosystems

2014
In 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