Sciweavers

1270 search results - page 167 / 254
» Improving Code Density Using Compression Techniques
Sort
View
ITA
2007
13 years 10 months ago
An algorithm for deciding if a polyomino tiles the plane
: For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate f...
Ian Gambini, Laurent Vuillon
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
14 years 2 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik
ICCAD
2002
IEEE
152views Hardware» more  ICCAD 2002»
14 years 6 months ago
Efficient instruction encoding for automatic instruction set design of configurable ASIPs
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
Jong-eun Lee, Kiyoung Choi, Nikil Dutt
AINA
2007
IEEE
14 years 4 months ago
Symbiotic Audio Communication on Interactive Transport
Congestion control for compressed audio is a nontrivial pursuit. Audio perception is highly susceptible to disturbance in temporal quality. We recently proposed and implemented a ...
Javed I. Khan, Olufunke I. Olaleye
IWANN
2005
Springer
14 years 3 months ago
Robust Blind Image Watermarking with Independent Component Analysis: A Embedding Algorithm
Abstract. The authors propose a new solution to the blind robust watermarking of digital images. In this approach we embed the watermark into the independent components of the imag...
Juan José Murillo-Fuentes, Rafael Boloix-To...