Sciweavers

17 search results - page 3 / 4
» A Modified Bit-Flipping Decoding Algorithm for Low-Density P...
Sort
View
ISMVL
2007
IEEE
112views Hardware» more  ISMVL 2007»
14 years 1 months ago
Survey of Stochastic Computation on Factor Graphs
Stochastic computation is a new alternative approach for iterative computation on factor graphs. In this approach, the information is represented by the statistics of the bit stre...
Saeed Sharifi Tehrani, Shie Mannor, Warren J. Gros...
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
ICC
2007
IEEE
192views Communications» more  ICC 2007»
14 years 1 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
TIT
2008
129views more  TIT 2008»
13 years 7 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
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...