A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Filters
Design of Nonbinary Quasi-Cyclic LDPC Cycle Codes
2007
2007 IEEE Information Theory Workshop
First, we construct a special class of nonbinary LDPC cycle codes with low error floors. ...
Our construction utilizes the cycle elimination algorithm to remove short cycles in the normal graph and to select nonzero elements in the parity-check matrix to reduce the number of low-weight codewords ...
Based on this idea, we propose a novel sparse encoding method for nonbinary QC LDPC cycle codes. ...
doi:10.1109/itw.2007.4313042
fatcat:mx6wzqekejgodmahj26ysqysbu
Quasi-cyclic low-density parity-check codes based on decoder optimised progressive edge growth for short blocks
2012
2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
A novel construction for quasi-cyclic (QC) regular and irregular low-density parity-check (LDPC) codes based on a modification of the QC Progressive Edge Growth (PEG) algorithm is presented. ...
The proposed QC-LDPC codes provide an inherent trade-off between code performance and encoding/decoding complexity. ...
The code produced then had length 4 cycles removed, as is standard practice with randomly generated codes. ...
doi:10.1109/icassp.2012.6288543
dblp:conf/icassp/HealyL12
fatcat:qmcrhy4khfcunoz7a5obs6bhc4
Cycle analysis of time-variant LDPC convolutional codes
2010
2010 6th International Symposium on Turbo Codes & Iterative Information Processing
Time-variant Low-Density Parity-Check convolutional codes (LDPCccs) can be derived from unwrapping Quasi-Cyclic (QC) LDPC block codes. ...
According to the relationship of cycle structures between time-and polynomialdomain syndrome formers, we present a cycle counter algorithm to analyze cycle properties in time-variant LDPCccs as well as ...
In this paper, we investigate the cycle formation in time and polynomial domains for time-variant LDPC convolutional codes, and we propose a novel algorithm to track cycles in the polynomial syndrome former ...
doi:10.1109/istc.2010.5613871
fatcat:2idgmuy4zbc3bolfsjx2iwbrmq
Highly flexible design of multi-rate multi-length quasi-cyclic LDPC codes
2014
2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)
Pursuing this need, we present a design method for the construction of quasi-cyclic (QC) LDPC codes supporting arbitrarily many block lengths and code rates using only a single common mother code. ...
The design of Low-Density Parity-Check (LDPC) codes with fixed code rate and block length for a fixed channel condition has been well investigated and very close-to-capacity performance can be achieved ...
QUASI-CYCLIC LDPC CODES
A. ...
doi:10.1109/istc.2014.6955081
dblp:conf/istc/BeermannWV14
fatcat:656svpktivbu3felsqo3fxfqka
Structured Nonbinary Rate-Compatible Low-Density Parity-Check Codes
2011
IEEE Communications Letters
While existing works on rate-compatible low-density parity-check (RC-LDPC) codes, either binary or nonbinary, all focus on random-like construction, we in this letter present a novel method to construct ...
The resultant codes are qualified as nonbinary quasi-cyclic LDPC (QC-LDPC) codes which are amenable to high-speed implementation of encoder/decoder. ...
With circulant permutation applied to each protograph edge in our design, the constructed codes are qualified as nonbinary quasi-cyclic LDPC (QC-LDPC) codes and thus amenable to high-speed implementation ...
doi:10.1109/lcomm.2011.072911.110981
fatcat:blwjg5gw4rhxbee2nnvappqj2m
Block-Circulant Low-Density Parity-Check Codes for Optical Communication Systems
2004
IEEE Journal of Selected Topics in Quantum Electronics
A novel family of structured low-density parity-check (LDPC) codes with block-circulant parity-check matrices that consist of permutation blocks is proposed. ...
The codes from this family are based on new combinatorial objects termed cycle-invariant difference sets, and they have low storage requirements, fast encoding algorithms, and girth of at least six. ...
Rao for helping them obtain the simulation results for two curves shown in Fig. 1 . ...
doi:10.1109/jstqe.2004.827832
fatcat:m5dnd6a3pjdcdcqswoe35wzeoa
New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes
2012
IEEE Transactions on Communications
Experimental results on decoding performance with the sum-product algorithm show that the novel codes offer substantial practical application potential, for instance, in high-speed applications in magnetic ...
This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. ...
ACKNOWLEDGMENT The authors thank the anonymous referees for their careful reading and valuable insights that helped improving the presentation of the paper. ...
doi:10.1109/tcomm.2012.070912.110164
fatcat:24apwtjezzegvhgnzveu6mjj7i
Next Generation FEC for High-Capacity Communication in Optical Transport Networks
2009
Journal of Lightwave Technology
Codes on graphs of interest for next generation forward error correction (FEC) in high-speed optical networks, namely turbo codes and low-density parity-check (LDPC) codes, are described in this invited ...
Also, we describe an LDPC-coded turbo-equalizer as a candidate for dealing simultaneously with fiber nonlinearities, PMD, and residual chromatic dispersion. ...
The TE is based on a quasi-cyclic LDPC(11936,10819) code of code rate 0.906 and girth-10, with 5 outer and 25 sum-product decoding algorithm iterations. ...
doi:10.1109/jlt.2009.2022044
fatcat:s32zftfqhndtjhia5yhprvfz24
Hierarchical and High-Girth QC LDPC Codes
2013
IEEE Transactions on Information Theory
Our methodology starts by defining a new class of "hierarchical" quasi-cyclic (HQC) LDPC codes that generalizes the structure of quasi-cyclic (QC) LDPC codes. ...
in a high-girth QC LDPC code, although not a hierarchical one. ...
In Section V we will generalize these codes and introduce a novel hierarchical family of QC LDPC codes. Quasi-cyclic LDPC codes are defined in terms of circulant permutation matrices. ...
doi:10.1109/tit.2013.2253512
fatcat:2cvhofikwfhvvjf3im4nldipxa
Efficient Search and Elimination of Harmful Objects in Optimized QC SC-LDPC Codes
[article]
2019
arXiv
pre-print
In this paper, we propose a general procedure based on edge spreading that enables the design of quasi-cyclic (QC) spatially coupled low-density parity-check codes (SC-LDPCCs) that are derived from QC-LDPC ...
This procedure relies on a novel algorithm that greedily spans the search space of potential candidates to reduce the multiplicity of the target harmful object(s) in the Tanner graph. ...
To the best of the authors' knowledge, a general scheme enabling the construction of optimized quasi-cyclic SC-LDPCCs (QC-SC-LDPCCs) (with respect to minimization of harmful objects) from QC-LDPC block ...
arXiv:1904.07158v1
fatcat:lgd4nllmfnc2pkryeo3iguzfsy
Application of Nonbinary LDPC Cycle Codes to MIMO Channels
2008
IEEE Transactions on Wireless Communications
The PSE code, consisting of a quasi-cyclic (QC) LDPC cycle code and a simple tree code, has the attractive feature that it is not only linearly encodable, but also allows parallel encoding which can reduce ...
We construct a special class of nonbinary LDPC cycle codes called the parallel sparse encodable (PSE) codes. ...
Each PSE code consists of a quasi-cyclic (QC) LDPC cycle code and a simple tree code. ...
doi:10.1109/twc.2008.070057
fatcat:gndxswkgxzdlvbp234lmm6dthq
Block-Layered Decoder Architecture for Quasi-Cyclic Nonbinary LDPC Codes
2013
Journal of Signal Processing Systems
This paper presents a block-layered decoder architecture and efficient design techniques for quasi-cyclic nonbinary low-density parity-check (QC-NB-LDPC) codes. ...
Based on a Min-Max decoding algorithm, an efficient block-layered decoder architecture for QC-NB-LDPC codes is proposed for fast decoder convergence. ...
In this paper, an efficient block-layered decoder architecture for quasi-cyclic NB-LDPC (QC-NB-LDPC) codes is presented. ...
doi:10.1007/s11265-013-0816-5
fatcat:ptyf7axw2nhbfpp5uvbweh3mdy
Iteratively decodable codes on m flats for WDM high-speed long-haul transmission
2005
Journal of Lightwave Technology
In an earlier paper, we reported that the low-density parity-check (LDPC) codes from finite planes outperform any other known forward error-correction (FEC) scheme for optical communications. ...
As a natural extension of the prior work, in this paper, we consider LDPC codes on m flats derived from projective and affine geometries, which outperform codes from finite planes. ...
Although several methods have been proposed to construct "good" LDPC codes, the complexity of LDPC encoders and decoders can be considerably reduced by allowing cyclic or quasi-cyclic structures in the ...
doi:10.1109/jlt.2005.857736
fatcat:lko5gq2e2vbljgary6ptdox3ii
Quantum LDPC Codes from Balanced Incomplete Block Designs
2008
IEEE Communications Letters
We present a series of structured LDPC codes suitable for use in quantum error correction. Those codes belong to the class of dual-containing Calderbank-Shor-Steane (CSS) codes. ...
To improve the BER performance, we employed the method of removing the cycles of length four in corresponding bipartite graph. ...
elements from GF(4), while in [6] they were designed in quasi-cyclic fashion. ...
doi:10.1109/lcomm.2008.080083
fatcat:35bcv3yiefeh5bxptnygomh65q
Systematic construction, verification and implementation methodology for LDPC codes
2012
EURASIP Journal on Wireless Communications and Networking
In this article, a novel and systematic Low-density parity-check (LDPC) code construction, verification and implementation methodology is proposed. ...
Compared to the traditional ways, this methodology enables us to construct both decoding-performance-aware and hardware-efficiency-aware LDPC codes in a short time. ...
Quasi-cyclic LDPC codes (QC-LDPC) is a popular class of structured LDPC codes, which is defined by its base matrix H b , whose elements satisfying −1 ≤ H b j,i < z f .z f is called the expansion factor ...
doi:10.1186/1687-1499-2012-84
fatcat:nhbsafybhbh3hanrdld4ix5xiy
« Previous
Showing results 1 — 15 out of 174 results