Results 151 to 160 of about 29,520 (201)
Some of the next articles are maybe not open access.
A Low Complexity PEG-like Algorithm to Construct Quasi-Cyclic LDPC Codes
International Symposium on Turbo Codes and Iterative Information Processing, 2023In this paper, we introduce a modified version of the Progressive Edge-Growth (PEG) algorithm that is used to construct the Tanner graphs of quasi-cyclic (QC) low-density parity-check (LDPC) codes having large girth. In our algorithms, we replace certain
Anthony Gómez-Fonseca +2 more
semanticscholar +1 more source
An Efficient Strategy to Count Cycles in the Tanner Graph of Quasi-Cyclic LDPC Codes
IEEE Journal on Selected Areas in Information Theory, 2023In this paper, we present an efficient strategy to enumerate the number of $k$ -cycles, $g\leq k < 2g$ , in the Tanner graph of a quasi-cyclic low-density parity-check (QC-LDPC) code with girth $g$ using its polynomial parity-check matrix $H$ . This
Anthony Gómez-Fonseca +2 more
semanticscholar +1 more source
Comparative Error Rate Performance Analysis of Quasi Cyclic LDPC Codes For 5G Radio Channel
2023 1st International Conference on Innovations in High Speed Communication and Signal Processing (IHCSP), 2023Fifth Generation New radio (5G) is in final stage for freezing frequency band by Release 16in between 1 GHz to 43 GHz. It is also attracting much attention because of short length and long length data transfer with high speed and low latency time ...
Sonu Lal +2 more
semanticscholar +1 more source
Quasi-Cyclic LDPC Codes With Girth at Least Eight Based on Disjoint Difference Sets
IEEE Communications Letters, 2023A novel relationship between disjoint difference sets (DDS) and QC-LDPC codes without cycles of length up to six is established. Based on DDS with two sets, a class of column-weight-four QC-LDPC codes is constructed with girth at least eight.
Guohua Zhang +3 more
semanticscholar +1 more source
Using Partial Orthomorphisms to Construct Short Quasi-Cyclic LDPC Codes with Girth at Least 6
International Symposium on Turbo Codes and Iterative Information Processing, 2023Since the publication of Fossorier’s work on the necessary and sufficient conditions for a $(k,\ell)$-regular QC-LDPC code to have a desired girth g, many researchers have been attracted to the problem of determining the smallest lifting degree $N_{\text{
Henry Chimal-Dzul +1 more
semanticscholar +1 more source
Image Communication Using Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) Code
2020Proposed quasi-cyclic low-density parity-check code (QC-LDPC) efficiently communicates image at comparable peak signal-to-noise ratio (PSNR) with less signal-to-noise ratio (SNR). Encoding of the image is done using the Gauss–Jordan elimination method while decoding is done using the min-sum iterative message-passing algorithm using the code length ...
Dharmesh Jayantibhai Patel +2 more
openaire +1 more source
Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes for deep space and high data rate applications
2009 International Workshop on Satellite and Space Communications, 2009In this paper we investigate and compare the performance of a selected class of Low-Density Parity-Check (LDPC) codes, i.e. Quasi-Cyclic (QC) LDPC codes, against the currently used turbo codes for deep space and high data rate applications. This is useful in future updates of the channel code option used for such applications by the Consultative ...
Nikoleta Andreadou +3 more
openaire +1 more source
Symplectic Self-Orthogonal Quasi-Cyclic Codes
IEEE Transactions on Information Theory, 2022In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a class of 1 ...
Chaofeng Guan, Ruihu Li, Zhi Ma
semanticscholar +1 more source
A Universal Efficient Circular-Shift Network for Reconfigurable Quasi-Cyclic LDPC Decoders
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2022Quasi-cyclic low-density parity-check (QC-LDPC) codes for modern communication standards usually have multiple code rates and block lengths. Therefore, reconfigurable LDPC decoders have received widespread attention, which require circular-shift networks
Suwen Song, Hangxuan Cui, Zhongfeng Wang
semanticscholar +1 more source
Using Minors to Construct Generator Matrices for Quasi-Cyclic LDPC Codes
International Symposium on Information Theory, 2022This paper gives a simple method to construct generator matrices with polynomial entries (and hence offers an alternative encoding method to the one commonly used) for all quasi-cyclic low-density parity-check (QC-LDPC) codes, even for those that are ...
R. Smarandache +2 more
semanticscholar +1 more source