Sciweavers

397 search results - page 16 / 80
» Overview of LDPC Codes
Sort
View
TIT
2008
108views more  TIT 2008»
13 years 5 months ago
Capacity Achieving LDPC Codes Through Puncturing
The performance of punctured LDPC codes under maximum-likelihood (ML) decoding is studied in this paper via deriving and analyzing their average weight distributions (AWDs) and th...
Chun-Hao Hsu, Achilleas Anastasopoulos
DAC
2004
ACM
14 years 8 months ago
Synthesizing interconnect-efficient low density parity check codes
Error correcting codes are widely used in communication and storage applications. Codec complexity has usually been measured with a software implementation in mind. A recent hardw...
Marghoob Mohiyuddin, Amit Prakash, Adnan Aziz, Way...
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
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 7 months ago
A Combinatorial Family of Near Regular LDPC Codes
Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes a...
K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandr...
TCOM
2008
106views more  TCOM 2008»
13 years 7 months ago
Performance analysis on LDPC-Coded systems over quasi-static (MIMO) fading channels
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
Jingqiao Zhang, Heung-No Lee