Sciweavers

73 search results - page 4 / 15
» Low density codes achieve the rate-distortion bound
Sort
View
TIT
2002
146views more  TIT 2002»
14 years 9 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
ICIP
2002
IEEE
15 years 11 months ago
Matching pursuits video coding using generalized bit-planes
The Matching Pursuits (MP) coding method has been employed successfully in video coding. In it, the motion compensated frame difference is decomposed on an overcomplete dictionary...
Alexandre G. Ciancio, Eduardo A. B. da Silva, Rog&...
CORR
2006
Springer
105views Education» more  CORR 2006»
14 years 9 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...
HAIS
2010
Springer
15 years 1 months ago
A GPU-Based DVC to H.264/AVC Transcoder
Mobile to mobile video conferencing is one of the services that the newest mobile network operators can offer to users. With the apparition of the distributed video coding paradigm...
Alberto Corrales-García, Rafael Rodrí...
EWSN
2012
Springer
13 years 5 months ago
Low Power or High Performance? A Tradeoff Whose Time Has Come (and Nearly Gone)
Abstract. Some have argued that the dichotomy between high-performance operation and low resource utilization is false – an artifact that will soon succumb to Moore’s Law and c...
JeongGil Ko, Kevin Klues, Christian Richter, Wanja...