Sciweavers

75 search results - page 6 / 15
» Message passing algorithms and improved LP decoding
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
High-performance scheduling algorithm for partially parallel LDPC decoder
In this paper, we propose a new scheduling algorithm for the overlapped message passing decoding, which can be applied to general low-density parity check (LDPC) codes. The partia...
Cheng-Zhou Zhan, Xin-Yu Shih, An-Yeu Wu
INFOCOM
2009
IEEE
14 years 2 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
TIT
2002
54views more  TIT 2002»
13 years 7 months ago
Joint message-passing decoding of LDPC Codes and partial-response channels
Ideas of message passing are applied to the problem of removing the effects of intersymbol interference (ISI) from partial-response channels. Both bit-based and state-based paralle...
Brian M. Kurkoski, Paul H. Siegel, Jack K. Wolf
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
14 years 7 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
ICIP
2005
IEEE
14 years 1 months ago
Low complexity resolution progressive image coding algorithm: progres (progressive resolution decompression)
A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm avoids the multiple passes of bit-plane coding for speed impro...
Yushin Cho, William A. Pearlman, Amir Said