Sciweavers

Share
4 search results - page 1 / 1
» A Lower Bound on the Redundancy of Arithmetic-Type Delay Con...
Sort
View
DCC
2008
IEEE
11 years 29 days ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
DCC
2007
IEEE
11 years 29 days ago
Bounds on Redundancy in Constrained Delay Arithmetic Coding
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
TIT
2008
72views more  TIT 2008»
10 years 1 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
ISCAS
2007
IEEE
94views Hardware» more  ISCAS 2007»
10 years 7 months ago
Fundamental Bounds on Power Reduction during Data-Retention in Standby SRAM
Abstract— We study leakage-power reduction in standby random access memories (SRAMs) during data-retention. An SRAM cell requires a minimum critical supply voltage (DRV) above wh...
Animesh Kumar, Huifang Qin, Prakash Ishwar, Jan M....
books