Results 51 to 60 of about 285 (176)
Some variations of Tanner's construction for short length QC‐LDPC codes
Electronics Letters, Volume 60, Issue 3, February 2024.We propose a variation of Tanner's construction for quasi‐cyclic low‐density parity‐check codes in a way that allows us to use NON‐prime lifting sizes by using some arithmetic sequences instead of geometric sequences. We prove two theorems on the values of this lifting sizes so that the resulting code has girth at least 8.
Wonjun Kim +3 more
wiley +1 more source
Derived dynamic scheduling for belief propagation decoding of LDPC codes
Electronics Letters, Volume 60, Issue 4, February 2024.Our article introduces two innovative dynamic scheduling strategies, derived informed variable‐to‐check residual belief propagation and derived variable‐node and variable‐to‐check‐edge residual belief propagation, for low‐density parity‐check (LDPC) codes.
Xiaotian Xu, Hua Zhou, Jiayi Zhao
wiley +1 more source
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 +4 more
wiley +1 more source
Efficient Helicopter-Satellite Communication Scheme Based on Check-Hybrid LDPC Coding
Tsinghua Science and Technology, 2018 When implementing helicopter-satellite communications, periodical interruption of the received signal is a challenging problem because the communication antenna is intermittently blocked by the rotating blades of the helicopter.
Ping Wang, Liuguo Yin, Jianhua Lu
doaj +1 more source
IEEE Access, 2020 Considering code-based cryptography, quasi-cyclic low-density parity-check (QC-LDPC) codes are foreseen as one of the few solutions to design post-quantum cryptosystems.
Davide Zoni +2 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 +5 more
wiley +1 more source
A massively parallel implementation of QC-LDPC decoder on GPU [PDF]
2011 IEEE 9th Symposium on Application Specific Processors (SASP), 2011 The graphics processor unit (GPU) is able to provide a low-cost and flexible software-based multi-core architecture for high performance computing. However, it is still very challenging to efficiently map the real-world applications to GPU and fully utilize the computational power of GPU. As a case study, we present a GPU-based implementation of a real-
Guohui Wang +3 more
openaire +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 +3 more
wiley +1 more source
A construction of the high-rate regular quasi-cyclic LDPC codes
EURASIP Journal on Wireless Communications and Networking, 2019 In this paper, a scheme to construct the high-rate regular quasi-cyclic low-density parity-check (QC-LDPC) codes is developed based on the finite geometry low-density parity-check (LDPC) codes.
Qi Meng +3 more
doaj +1 more source
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