Results 171 to 180 of about 139,535 (196)

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

Protograph design for QC LDPC codes with large girth [PDF]

2010 International Conference on Information and Communication Technology Convergence (ICTC), 2010
In this paper, all subgraph patterns of protographs which prevent quasi-cyclic (QC) low-density parity-check (LDPC) codes from having large girth are searched in allowance with multiple edges based on graph theoretic approach. A systematic construction of protograph with multiple edges using combinatorial design is proposed for QC LDPC codes with girth
Jong-Seon No, Hosung Park, Dong-Joon Shin, Seokbeom Hong   +3 more
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, Dong Zheng, Xuefei Yang
openaire   +2 more sources

Circulant search algorithm for the construction of QC-LDPC codes

2011 4th IEEE International Conference on Broadband Network and Multimedia Technology, 2011
A circulant permutation search algorithm is present in this paper, which can be employed to search appopriate circulant permutation to construct QC-LDPC codes with desired girth. The algorithm is based on a tree expansion mechanism and a select-and-discard procedure. By proposed method, a practical (3, 4) code with code length n=37368 and girth g=18 is
Xiaofeng Zhou, Lixin Zheng, Xiongfei Tao, Deyu Feng   +3 more
openaire   +2 more sources

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   +2 more sources

Improved PEG construction of large girth QC-LDPC codes

2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2016
In this paper, we present an improvement of the PEG algorithm for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes with large girth. We introduce the concept of PEG-undetectable cycles on the computation tree in the PEG algorithm for QC-LDPC codes and give a predictive method to avoid these undetected cycles. The aim is to select only
Diouf, Madiagne, Declercq, David, Fossorier, Marc, Ouya, Samuel, Vasic, Bane   +4 more
openaire   +4 more sources

Constructions of QC LDPC codes based on integer sequences

Science China Information Sciences, 2014
Based on difference sequence and Hoey sequence, three types of (2, F) and (3, F) quasi cyclic (QC) low-density parity-check (LDPC) codes are constructed. All 4-cycles and even 6-cycles are removed in the Tanner graph, and the girth is not less than six. The decoding complexity as well as extension to irregular case is analyzed.
L. L. Cheng, Bing Li, Lijun Zhang
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.
Othman Sidek, Mohd Fadzli Mohd Salleh, Abid Yahya, Farid Ghani   +3 more
openaire   +2 more sources

A fast and efficient encoding structure for QC-LDPC codes

2008 International Conference on Communications, Circuits and Systems, 2008
Parallel-input parallel-output (PIPO) structure for quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed in this paper to implement a faster and more efficient QC-LDPC encoder than that based on conventional serial-input parallel-output (SIPO) or parallel-input serial-output (PISO) structure.
Jian Fu, Qiuliang Xie, Kewu Peng, Zhixing Yang   +3 more
openaire   +2 more sources

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   +2 more sources