Sciweavers

555 search results - page 32 / 111
» Polar codes are optimal for lossy source coding
Sort
View
TIT
2008
74views more  TIT 2008»
13 years 7 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
DCC
2006
IEEE
14 years 7 months ago
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
Alfredo Viola, Frédérique Bassino, G...
WIOPT
2011
IEEE
12 years 11 months ago
Energy-neutral source-channel coding in energy-harvesting wireless sensors
Abstract—This work addresses the problem of energy allocation over source compression and transmission for a single energy-harvesting sensor. An optimal class of policies is iden...
Paolo Castiglione, Osvaldo Simeone, Elza Erkip, Th...
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
CGO
2009
IEEE
14 years 2 months ago
Transparent Debugging of Dynamically Optimized Code
Debugging programs at the source level is essential in the software development cycle. With the growing importance of dynamic optimization, there is a clear need for debugging sup...
Naveen Kumar, Bruce R. Childers, Mary Lou Soffa