Journal ArticleDOI
Large girth cycle codes for partial response channels
TLDR
A general approach for constructing high-rate cycle codes having girth 12 which achieve the lower bound on the block length is presented and an efficient encoding algorithm is proposed for this class of codes.Abstract:
In this paper, we present a general approach for constructing high-rate cycle codes having girth 12 which achieve the lower bound on the block length. An efficient encoding algorithm is also proposed for this class of codes. We estimate the word error rate of the cycle codes for additive white Gaussian noise (AWGN) channels under maximum likelihood decoding, using the minimum distance and its multiplicity. These estimates are compared to simulation results with iterative soft decoding. The performance of these codes for partial response channels is studied under iterative soft decoding using computer simulations.read more
Citations
More filters
Journal ArticleDOI
Design of cages with a randomized progressive edge-growth algorithm
TL;DR: This letter proposes some improvements in the PEG algorithm which greatly improve the girth properties of the resulting graphs, and focuses on regular column-weight two graphs (dv = 2), although the algorithm can be applied to any graph connectivity.
Proceedings Article
Face recognition from sketches using advanced correlation filters using hybrid eigenanalysis for face synthesis
TL;DR: This work proposes to generate a realistic face image from the composite sketch using a Hybrid subspace method and then build an illumination tolerant correlation filter which can recognize the person under different illumination variations.
Journal ArticleDOI
Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set
TL;DR: This letter proposes a construction of nonbinary quasi-cyclic LDPC cycle codes based on Singer perfect difference set and shows that constructed codes have exactly a minimum symbol Hamming distance 6.
Journal ArticleDOI
Geometrically-structured maximum-girth LDPC block and convolutional codes
TL;DR: Four classes of maximum-girth geometrically structured column-weight-two regular quasi-cyclic (QC) low-density parity-check (LDPC) codes are introduced and simulation results on AWGN channel confirm that, from BER performance perspective, the constructed LDPC codes are superior to the column- Weight-two LDPC code constructed by the previously reported methods.
Journal ArticleDOI
Design LDPC codes without cycles of length 4 and 6
Jun Fan,Yang Xiao,Kiseon Kim +2 more
TL;DR: An approach for constructing LDPC codes without cycles of length 4 and 6 is presented, which verifies that the BER of the proposed code is close to those of Mackay's random codes and Tanner's QC codes, and the good BER performance can remain at high code rates.
References
More filters
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Codes and Decoding on General Graphs
TL;DR: It is showed that many iterative decoding algorithms are special cases of two generic algorithms, the min-sum and sum-product algorithms, which also include non-iterative algorithms such as Viterbi decoding.
Journal ArticleDOI
Error Correcting Codes
TL;DR: The authors state that because there has been so much new work published in error-correcting codes, the preparation of this second edition proved to be a much greater task than writing the original book.
Journal ArticleDOI
On the performance of high-rate TPC/SPC codes and LDPC codes over partial response channels
TL;DR: Simulation results for practical block lengths show that TPC/SPC codes perform as well as LDPC codes in terms of bit error rate, but possess better burst error statistics which is important in the presence of an outer Reed-Solomon code.