Sciweavers

60 search results - page 3 / 12
» Analysis of Low Density Codes and Improved Designs Using Irr...
Sort
View
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
APPT
2007
Springer
13 years 9 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
SECON
2007
IEEE
14 years 1 months ago
INPoD: In-Network Processing over Sensor Networks based on Code Design
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
Kiran Misra, Shirish S. Karande, Hayder Radha
ISCAS
1994
IEEE
96views Hardware» more  ISCAS 1994»
13 years 11 months ago
Analysis and Design of Adaptive Self-Trimming Technique for A/D Converters
A novel self-trimming algorithm for A/D converters [1,2] has been presented which continually trims thresholds in the flash A/D subconverters of two-stage and pipelined A/D conver...
Zhiqiang Gu, W. Martin Snelgrove
AAECC
2006
Springer
122views Algorithms» more  AAECC 2006»
13 years 11 months ago
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
Shadi Abu-Surra, Gianluigi Liva, William E. Ryan