Results 51 to 60 of about 250 (178)

Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

IEEE Access, 2017
For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code.
Xue-Qin Jiang, Han Hai, Hui-Ming Wang, Moon Ho Lee   +3 more
doaj   +1 more source

Energy‐Efficiency Maximization in Backscatter Communication‐Based Non‐Orthogonal Multiple Access System: Dinkelbach and Successive Convex Approximation Approaches

IET Signal Processing, Volume 2024, Issue 1, 2024.
This paper investigates a backscatter communication (BackCom) based non‐orthogonal multiple access (NOMA) system in a multiple‐input and single‐output (MISO) scenario, where two decoding methods are deployed, including the sum‐capacity approach and QR decomposition.
Dingjia Lin, Tianqi Wang, Kaidi Wang, Zhiguo Ding, Hasan Mir   +4 more
wiley   +1 more source

Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution

IEEE Access
This paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang, Jingping Che, Huaan Li, Zhen Luo, Bo Zhang, Hui Liu   +5 more
doaj   +1 more source

A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes

Electronics Letters, Volume 60, Issue 2, January 2024.
This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved condition. Compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a
Hengzhou Xu, Xiao‐Dong Zhang, Huaan Li, Hai Zhu, Bo Zhang, Hui Liu   +5 more
wiley   +1 more source

Counting short cycles of QC‐LDPC codes in base graph

Electronics Letters, Volume 60, Issue 2, January 2024.
Here, a method for using the base matrix to count the number of short cycles of quasi‐cyclic low‐density parity‐check codes is proposed. The time complexity of the proposed algorithm is not directly related to the length of the codes, but only to the number of edges in the base graph. Moreover, as the lifting degree of the codes increases, the proposed
Liqian Wang, Jingke Zou, Miao Zhu, Yatong Zhao   +3 more
wiley   +1 more source

Girth-Eight Reed-Solomon Based QC-LDPC Codes [PDF]

2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018
This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs ...
Xin Xiao 0001, Bane Vasic, Shu Lin 0001, Khaled A. S. Abdel-Ghaffar, William E. Ryan   +4 more
openaire   +1 more source

On the lifting degree of girth-8 QC-LDPC codes

Designs, Codes and Cryptography
The lifting degree and the deterministic construction of quasi-cyclic low-density parity-check (QC-LDPC) codes have been extensively studied, with many construction methods in the literature, including those based on finite geometry, array-based codes, computer search, and combinatorial techniques.
Haoran Xiong, Guanghui Wang 0002, Zhiming Ma, Guiying Yan   +3 more
openaire   +2 more sources

Construction and Encoding of QC-LDPC Codes Using Group Rings [PDF]

IEEE Transactions on Information Theory, 2017
Quasi-cyclic (QC) low-density parity-check (LDPC) codes which are known as QC-LDPC codes, have many applications due to their simple encoding implementation by means of cyclic shift registers. In this paper, we construct QC-LDPC codes from group rings.
Hassan Khodaiemehr, Dariush Kiani
openaire   +2 more sources

Novel construction of QC-LDPC codes with modified 2-D GRS codes

Tongxin xuebao, 2015
The construction method for QC-LDPC (quasi-cyclic low density parity-check) code with modified two-dimensional generalized reed-solomon (2-D GRS) code is proposed using the generator polynomial of GRS code,so thus the constructed code can have better ...
Ming ZHAO, Xiao-lin ZHANG
doaj   +2 more sources

Type-II QC-LDPC Codes From Multiplicative Subgroup of Prime Field

IEEE Access, 2020
A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel
Guohua Zhang, Yulin Hu, Defeng Ren, Yuanhua Liu, Yang Yang   +4 more
doaj   +1 more source