Results 161 to 170 of about 21,382 (243)
Some of the next articles are maybe not open access.
Analysis of balanced cycles of QC-LDPC codes
2011 Eighth International Conference on Wireless and Optical Communications Networks, 2011In 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
Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm
IEEE Communications Letters, 2022In this letter we propose a new approach to generation of regular QC-LDPC codes with girth up to 12. The aim of the proposed smart exhaustive search (SES) algorithm is to construct codes with the desired lifting factor or to check whether codes with this
Aleksei V. Kharin +4 more
semanticscholar +1 more source
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 ...
Vasiliy Usatyuk, Sergey Egorov
openaire +1 more source
On the Construction of QC-LDPC Codes Based on Integer Sequence With Low Error Floor
IEEE Communications Letters, 2022Quasi-cyclic low-density parity-check (QC-LDPC) codes have efficient hardware implementation and excellent correcting performance. However, the existence of trapping sets can affect the decoding performance. In this letter, a novel class of QC-LDPC codes
Xiongfei Tao, Xin Chen, Bifang Wang
semanticscholar +1 more source
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.
Yang Liu, Ying Li
openaire +1 more source
Compressing construction of QC-LDPC codes
2008 11th IEEE Singapore International Conference on Communication Systems, 2008Two compressing construction methods of quasi-cyclic LDPC (QC-LDPC) codes are proposed, which can be called recursive-compressing and single-compressing respectively. Selecting a good QC-LDPC code as the Mother, the son codes constructed through the compressing methods are still good codes, i.e., have high girth and few short cycles, moreover, they ...
null Shuqi Sun, null Wuyang Zhou
openaire +1 more source
Performance Analysis of QC-LDPC codes constructed by using Golomb rulers
Asia-Pacific Conference on Communications, 2022In this paper, we analyzes performance of girth-8 regular QC-LDPC codes constructed using Golomb ruler. We conducted simulations to measure FER performance of QC-LDPC codes constructed by changing the last mark of some optimal Golomb ruler and found the ...
Daekyeong Kim +4 more
semanticscholar +1 more source
Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor
IEEE Transactions on Communications, 2021In this article, we design finite-length irregular protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with good waterfall performance and low error floor.
Bashirreza Karimi, A. Banihashemi
semanticscholar +1 more source
Row Division Method to Generate QC-LDPC Codes
2009 Fifth Advanced International Conference on Telecommunications, 2009To 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 +3 more
openaire +1 more source
Low Error Floor QC-LDPC Codes Construction Using Modified Cole's Trapping Sets Enumerating
2023 25th International Conference on Digital Signal Processing and its Applications (DSPA), 2023In order to count the number of trapping sets (TS), we changed Cole's Importance Sampling (IS) approach, which led to a message-passing decoder problem. Several concepts have been combined to suggest improvements to Cole's IS: utilizing short cycles and ...
V. Usatyuk
semanticscholar +1 more source