Sciweavers

1270 search results - page 2 / 254
» Improving Code Density Using Compression Techniques
Sort
View
CASES
2005
ACM
13 years 8 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
ISCAS
2005
IEEE
152views Hardware» more  ISCAS 2005»
13 years 12 months ago
Dictionary-based program compression on transport triggered architectures
— Program code size has become a critical design constraint of embedded systems. Large program codes require large memories, which increase the size and cost of the chip. Poor co...
Jari Heikkinen, Andrea G. M. Cilio, Jarmo Takala, ...
CASES
2003
ACM
13 years 11 months ago
Compiler optimization and ordering effects on VLIW code compression
Code size has always been an important issue for all embedded applications as well as larger systems. Code compression techniques have been devised as a way of battling bloated co...
Montserrat Ros, Peter Sutton
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 10 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
ICDE
1995
IEEE
98views Database» more  ICDE 1995»
14 years 7 months ago
Relational Database Compression Using Augmented Vector Quantization
Data compression is one way to alleviate the 1/0bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the ...
Wee Keong Ng, Chinya V. Ravishankar