Results 201 to 210 of about 21,530 (259)

Constructions of Girth-Eight QC-LDPC Codes with Dual-Diagonal Structure Based on GCD Framework

International Conference on Wireless Communications and Signal Processing, 2023
A novel class of quasi-cyclic (QC) low-density parity-check (LDPC) codes is explicitly proposed without 4-cycles and 6-cycles via the greatest-common-divisor (GCD) framework.
Guohua Zhang, Haiyang Liu, Mengjuan Lou, Yi Fang   +3 more
semanticscholar   +1 more source

Density Evolution Analysis for 5G NR Quasi-Cyclic Low Density Parity Check (QC-LDPC) Codes

2023 International Conference on Artificial Intelligence, Blockchain, Cloud Computing, and Data Analytics (ICoABCD), 2023
In this paper, we analyze the performances of the fifth telecommunication generation (5G) new radio (NR) quasi-cyclic (QC) low-density parity check (QC-LDPC) codes via density evolution (DE) for base graph 2 (BG2) over binary erasure channel (BEC).
Wahidin, Khoirul Anwar, N. Adriansyah
semanticscholar   +1 more source

QC-LDPC Codes With Large Column Weight and Free of Small Size ETSs

IEEE Communications Letters, 2022
An approach to improve the performance of QC-LDPC codes is the removal of harmful trapping sets by increasing the girth. However, constructing these LDPC codes with large column weights and girth more than 8 is not easy.
F. Amirzade, Mohammad-Reza Sadeghi, D. Panario   +2 more
semanticscholar   +1 more source

Some Short-Length Girth-8 QC-LDPC Codes From Primes of the Form t2 + 1

IEEE Communications Letters, 2022
We propose a simple algebraic construction for girth-8 regular QC-LDPC codes of short lengths, a few hundreds, based on the square matrix from some prime integers of the form $t^{2}+1=P$ and a multiplication table method. We generalize the conventional
Inseon Kim, T. Kojima, Hong‐Yeop Song
semanticscholar   +1 more source

A Design of Layered Decoding for QC-LDPC Codes Based on Reciprocal Channel Approximation

International Symposium on Information Theory, 2022
This paper presents an analytically designed layered decoding algorithm for quasi-cyclic low-density parity-check (QC-LDPC) codes in the 5th Generation (5G) New Radio (NR) mobile communication system.
Min Jang, Kyeongyeon Kim, S. Myung, Hongsil Jeong, Kyung-Joong Kim, Sang-Hyo Kim   +5 more
semanticscholar   +1 more source

Mutual Information-Maximizing Quantized Layered Min-Sum Decoding of QC-LDPC Codes

Global Communications Conference, 2022
In this paper, we propose a mutual information-maximizing quantized layered min-sum (MIM-QLMS) decoder for quasi-cyclic low-density parity-check (QC-LDPC) codes.
Cheng Lv, Xuan He, Peng Kang, K. Cai, Jiongyue Xing, Xiaohu Tang   +5 more
semanticscholar   +1 more source

Compressing construction of QC-LDPC codes

2008 11th IEEE Singapore International Conference on Communication Systems, 2008
Two 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

Construction of QC-LDPC Codes from Sidon Sequence Using Permutation and Segmentation

IEEE Communications Letters, 2022
By utilizing a Sidon sequence, two new methods are proposed to construct quasi-cyclic (QC) low-density parity-check (LDPC) codes. The first method yields a QC-LDPC code without 4-cycles and the second method gives a QC-LDPC code without 4-cycles and 6 ...
Lintao Zhang, Juhua Wang
semanticscholar   +1 more source

Shortening for irregular QC-LDPC codes

IEEE Communications Letters, 2009
Shortening is a technique to obtain codes of shorter length and lower rate from a given LDPC code by putting infinite reliability on some variable nodes, whose positions are assumed to be available to both encoder and decoder. In this paper, we propose a shortening algorithm suitable for irregular QC-LDPC codes. The efficiency of the proposed algorithm
Xiaojian Liu, Xiaofu Wu, Chunming Zhao
openaire   +1 more source

Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm

IEEE Communications Letters, 2022
In 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, Aleksei Dryakhlov, K. Zavertkin, A. Ovinnikov, E. Likhobabin   +4 more
semanticscholar   +1 more source