Semi-random LDPC codes with efficient encoding

X Jiang, MH Lee - Electronics letters, 2009 - search.proquest.com
An approach to construct semi-random low-density parity-check (SR-LDPC) codes, is
introduced. These codes are designed with the progressive edge-growth algorithm and can …

Construction of girth 8 ldpc codes based on multidimensional finite lattices

J Craddock, M Flanagan, SJ Redmond… - 2007 12th IEEE …, 2007 - ieeexplore.ieee.org
This paper presents a novel method for constructing low density parity check (LDPC) codes
with a girth of up to 8. These codes are based on the structural properties of finite lattices …

An improved decoding algorithm for low-density parity-check codes over the binary erasure channel

BN Vellambi, F Fekri - GLOBECOM'05. IEEE Global …, 2005 - ieeexplore.ieee.org
This paper presents a new improved decoding algorithm for low-density parity-check
(LDPC) codes over the binary erasure channel (BEC). The proposed algorithm combines …

On finite precision implementation of low density parity check codes decoder

T Zhang, Z Wang, KK Parhi - … on Circuits and Systems (Cat. No …, 2001 - ieeexplore.ieee.org
In this paper, we analyze the finite precision effects on the decoding performance of
Gallager's low density parity check (LDPC) codes and develop optimal finite word lengths of …

Eliminating small stopping sets in irregular low-density parity-check codes

X Jiao, J Mu, J Song, L Zhou - IEEE communications letters, 2009 - ieeexplore.ieee.org
We present a novel scheme to eliminate small stopping sets in irregular low-density parity-
check (LDPC) codes. By adding several new check nodes and having their edges …

Error floor investigation and girth optimization for certain types of low-density parity check codes

L Sun, H Song, BVKV Kumar - Proceedings.(ICASSP'05). IEEE …, 2005 - ieeexplore.ieee.org
Low-density parity check (LDPC) codes with their near-Shannon capacity limit error
correcting performance and iterative decoding algorithm are being evaluated for digital …

A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel

SJ Johnson - IEEE transactions on information theory, 2008 - ieeexplore.ieee.org
A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure
Channel Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1 …

Structured low-density parity-check code design for next generation digital video broadcast

M Eroz, LN Lee - MILCOM 2005-2005 IEEE Military …, 2005 - ieeexplore.ieee.org
We describe a novel design for low-density parity-check (LDPC) codes that eliminates the
routing problem associated with LDPC decoder implementation resulting in a small silicon …

[引用][C] Performance of irregular LDPC Codes on Rician-fading channels

J Lin, W Wu - ACTA Electron. Sin, 2005

On algebraic construction of Gallager and circulant low-density parity-check codes

H Tang, J Xu, Y Kou, S Lin… - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
This correspondence presents three algebraic methods for constructing low-density parity-
check (LDPC) codes. These methods are based on the structural properties of finite …