Sciweavers

65 search results - page 5 / 13
» Synthesizing interconnect-efficient low density parity check...
Sort
View
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 1 months ago
Quantization Effects in Low-Density Parity-Check Decoders
−A class of combinatorial structures, called absorbing sets, strongly influences the performance of low-density paritycheck (LDPC) decoders. In particular, the quantization schem...
Zhengya Zhang, Lara Dolecek, Martin J. Wainwright,...
GLOBECOM
2007
IEEE
14 years 1 months ago
A Bit-Node Centric Architecture for Low-Density Parity-Check Decoders
Abstract—A bit-node centric decoder architecture for lowdensity parity-check codes is proposed. This architecture performs the optimum sum-product algorithm. A bit node processin...
Ruwan N. S. Ratnayake, Erich F. Haratsch, Gu-Yeon ...
VLSISP
2010
140views more  VLSISP 2010»
13 years 6 months ago
A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders
A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions. The proposed method signific...
Tinoosh Mohsenin, Bevan M. Baas
TIT
2002
89views more  TIT 2002»
13 years 7 months ago
Upper bounds on the rate of LDPC Codes
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
David Burshtein, Michael Krivelevich, Simon Litsyn...
TIT
2002
146views more  TIT 2002»
13 years 7 months ago
Bounds on the performance of belief propagation decoding
We consider Gallager's soft decoding (belief propagation) algorithm for decoding low density parity check (LDPC) codes, when applied to an arbitrary binary-input symmetric-ou...
David Burshtein, Gadi Miller