Results 131 to 140 of about 253 (177)

Efficient encoding of QC-LDPC codes related to cyclic MDS codes

IEEE Journal on Selected Areas in Communications, 2008
In 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   +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

An Efficient Layered Decoding Architecture for Nonbinary QC-LDPC Codes

IEEE Transactions on Circuits and Systems I: Regular Papers, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yeong-Luh Ueng, Chen-Yap Leong, Chung-Jay Yang, Chung-Chao Cheng, Kuo-Hsuan Liao, Shu-Wei Chen   +5 more
openaire   +2 more sources

Efficient Decoding of QC-LDPC Codes Using GPUs

2011
In 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, Xu Chen 0018, Chiu-Wing Sham, Wai Man Tam, Francis Chung-Ming Lau   +4 more
openaire   +1 more source

Construction of high-rate QC-LDPC codes

The 2011 International Conference on Advanced Technologies for Communications (ATC 2011), 2011
In 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

Layered TPMP Decoding for QC-LDPC Codes

Applied Mechanics and Materials, 2012
This 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.
Ling Zhao, Yi Hou, Rong Ke Liu
openaire   +1 more source

Construction of high-girth QC-LDPC codes

2008 5th International Symposium on Turbo Codes and Related Topics, 2008
We describe a hill-climbing algorithm that constructs high-girth quasi-cyclic low-density parity check (QC-LDPC) codes. Given a desired girth, the algorithm can find QC-LDPC codes of shorter block-length in much less time compared with the previously proposed ldquoguess-and-testrdquo algorithm.
null Yige Wang, J.S. Yedidia, S.C. Draper   +2 more
openaire   +1 more source

Efficient Decoder Implementation for QC-LDPC Codes

2006 International Conference on Communications, Circuits and Systems, 2006
Channel 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, Minglun Gao, Zhongjin Zhang, Li li, Zhongfeng Wang   +4 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 codes from various Golomb Rulers

2023 14th International Conference on Information and Communication Technology Convergence (ICTC), 2023
Daekyeong Kim, Hyojeong Choi, Hong-Yeop Song   +2 more
openaire   +1 more source