Sciweavers

168 search results - page 13 / 34
» Binary Codes for Non-Uniform Sources
Sort
View
TCAD
2008
127views more  TCAD 2008»
13 years 7 months ago
Speculative Loop-Pipelining in Binary Translation for Hardware Acceleration
Abstract--Multimedia and DSP applications have several computationally intensive kernels which are often offloaded and accelerated by application-specific hardware. This paper pres...
Sejong Oh, Tag Gon Kim, Jeonghun Cho, Elaheh Bozor...
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
A One-to-One Code and Its Anti-Redundancy
One-to-one codes are "one shot" codes that assign a distinct codeword to source symbols and are not necessarily prefix codes (more generally, uniquely decodable). For ex...
Wojciech Szpankowski
CORR
2006
Springer
131views Education» more  CORR 2006»
13 years 7 months ago
Analysis of LDGM and compound codes for lossy compression and binning
Abstract-- Recent work has suggested that low-density generator matrix (LDGM) codes are likely to be effective for lossy source coding problems. We derive rigorous upper bounds on ...
Emin Martinian, Martin J. Wainwright
CISS
2011
IEEE
12 years 11 months ago
Secret key generation through OFDM multipath channel
—We analyze the fundamental limits of key generation and describe an implementation based on error correcting codes. We show that key extraction based on channel coefficients si...
Yanpei Liu, Stark C. Draper, Akbar M. Sayeed
CORR
2007
Springer
155views Education» more  CORR 2007»
13 years 7 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian