Sciweavers

52 search results - page 3 / 11
» Iterative Quantization Using Codes On Graphs
Sort
View
VTC
2008
IEEE
115views Communications» more  VTC 2008»
13 years 11 months ago
Graph-Based Turbo DeCodulation with LDPC Codes
—Turbo DeCodulation is the combination of iterative demodulation and iterative source-channel decoding in a multiple Turbo process. The receiver structures of bit-interleaved cod...
Birgit Schotsch, Laurent Schmalen, Peter Vary, Tho...
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 4 months ago
Zig-zag and Replacement Product Graphs and LDPC Codes
It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used ...
Christine A. Kelley, Deepak Sridhara, Joachim Rose...
ICC
2007
IEEE
192views Communications» more  ICC 2007»
13 years 11 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...
DCC
1995
IEEE
13 years 8 months ago
Constrained-Storage Vector Quantization with a Universal Codebook
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...
Sangeeta Ramakrishnan, Kenneth Rose, Allen Gersho
IPPS
1998
IEEE
13 years 9 months ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka