Results 61 to 70 of about 1,775 (200)
A Class of Quantum LDPC Codes Constructed From Finite Geometries
, 2008 Low-density parity check (LDPC) codes are a significant class of classical codes with many applications. Several good LDPC codes have been constructed using random, algebraic, and finite geometries approaches, with containing cycles of length at least ...
Aly, Salah A.
core +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
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 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
Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint Length
, 2017 In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit suitable ...
Baldi, Marco +4 more
core +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
Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders
, 2017 Polar codes are a recently proposed family of provably capacity-achieving error-correction codes that received a lot of attention. While their theoretical properties render them interesting, their practicality compared to other types of codes has not ...
Balatsoukas-Stimming, Alexios +2 more
core +1 more source
Verification-Based Interval-Passing Algorithm for Compressed Sensing
, 2013 We propose a verification-based Interval-Passing (IP) algorithm for iteratively reconstruction of nonnegative sparse signals using parity check matrices of low-density parity check (LDPC) codes as measurement matrices.
Wu, Xiaofu, Yang, Zhen
core +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 +4 more
openaire +1 more source
Explicit constructions of Type-II QC LDPC codes with girth at least 6 [PDF]
, 2007 Type-II quasi-cyclic (QC) LDPC codes are constructed from combinations of weight-0, weight-1 and weight-2 circulant matrices. The structure of cycles of length 2n are investigated, and necessary and sufficient conditions for a type-II QC LDPC parity ...
Lally, K
core