Results 41 to 50 of about 45,321 (190)
On the girth of Tanner (3,7) quasi-cyclic LDPC codes [PDF]
Transactions on Combinatorics, 2012 S. Kim, et al, have been analyzed the girth of some algebraically structured quasi-cyclic (QC) low-density parity-check (LDPC) codes, i.e. Tanner (3,5) of length 5p, where p is a prime of the form 15m+1. In this paper, by extension this method to Tanner (
Mohammad Gholami +1 more
doaj
On the Construction of Sparse Matrices From Expander Graphs
Frontiers in Applied Mathematics and Statistics, 2018 We revisit the asymptotic analysis of probabilistic construction of adjacency matrices of expander graphs proposed in Bah and Tanner [1]. With better bounds we derived a new reduced sample complexity for d, the number of non-zeros per column of these ...
Bubacarr Bah, Bubacarr Bah, Jared Tanner
doaj +1 more source
Low-Density Spreading Codes for NOMA Systems and a Gaussian Separability-Based Design
IEEE Access, 2021 Improved low-density spreading (LDS) code designs based on the Gaussian separability criterion are conceived. We show that the bit error rate (BER) hinges not only on the minimum distance criterion, but also on the average Gaussian separability margin ...
Michel Kulhandjian +3 more
doaj +1 more source
Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation
Tongxin xuebao, 2017 Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 ...
Qing ZHU +4 more
doaj +2 more sources
Necessary and Sufficient Girth Conditions for Tanner Graphs of Quasi-Cyclic LDPC Codes [PDF]
, 2021 Roxana Smarandache, David G. M. Mitchell
openalex +2 more sources
Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code
Tongxin xuebao, 2008 Based on doubly-extended RS codes and cyclic MDS codes,two construction schemes were proposed for ap-plied quasi-cyclic LDPC codes whose Tanner graph is free of 4-cycles.In the first approach,all the nonzero codewords within a doubly-extended RS code ...
ZHANG Guo-hua, WANG Xin-mei
doaj +2 more sources
IEEE Access, 2018 In this paper, a new systematic construction of optimized protograph generalized low-density parity-check codes with good decoding threshold and low error floor is proposed.
Jianrong Bao, Bin Jiang, Chao Liu
doaj +1 more source
Tight bounds for LDPC and LDGM codes under MAP decoding
, 2005 A new method for analyzing low density parity check (LDPC) codes and low density generator matrix (LDGM) codes under bit maximum a posteriori probability (MAP) decoding is introduced.
Montanari, Andrea
core +2 more sources
Optimized Design of Distributed Quasi-Cyclic LDPC Coded Spatial Modulation
Sensors, 2023 We propose a distributed quasi-cyclic low-density parity-check (QC-LDPC) coded spatial modulation (D-QC-LDPCC-SM) scheme with source, relay and destination nodes. At the source and relay, two distinct QC-LDPC codes are used.
Chunli Zhao +4 more
doaj +1 more source
Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization
, 2013 An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The
Bazarsky, Alex +2 more
core +1 more source