A compression algorithm for compressing functional vectors using binary arithmetic coding is presented here. A Markov model is used for generating probability statistics for the input binary files. Experiments are performed on several SPEC2000 benchmark programs compiled for ARM, MIPS (PISA) and x86 microprocessors. Decompression is performed in software requiring no hardware overhead and can be used to compress both deterministic functional tests and self test programsElectrical and Computer Engineerin
This paper presents a new test data compression technique based on a compressioncode that uses exact...
textSequential linear decompressors are widely used to implement test compression. Bits stored on th...
Data compression is important in the computing process because it helps to reduce the space occupied...
The object of research is the methods of compressive coding, which are used for economical presentat...
We present an algorithm based on arithmetic coding that allows decompression to start at any point i...
The object of research is the methods of compressive coding, which are used for economical presentat...
Modern semiconductor design methods makes it possible to design increasingly complex system-on-a-chi...
Abstract. The paper is focused on the statistical com-parison of the selected compression methods wh...
textThis thesis proposes an approach to improve test compression using sequential linear decompresso...
The study of compressed data structures strives to represent information on a computer concisely — u...
textThis paper investigates the cost-tradeoffs of implementing a test data compression technique pr...
textThis dissertation considers the problem of reducing the storage as well as the bandwidth (data ...
We present a new test data compression and decompression architecture based on a novel and efficient...
In scientific computing environments, large amounts of floating-point data often need to be transfer...
Since its inception, data compression has been practised mostly as an experimental science. Althoug...
This paper presents a new test data compression technique based on a compressioncode that uses exact...
textSequential linear decompressors are widely used to implement test compression. Bits stored on th...
Data compression is important in the computing process because it helps to reduce the space occupied...
The object of research is the methods of compressive coding, which are used for economical presentat...
We present an algorithm based on arithmetic coding that allows decompression to start at any point i...
The object of research is the methods of compressive coding, which are used for economical presentat...
Modern semiconductor design methods makes it possible to design increasingly complex system-on-a-chi...
Abstract. The paper is focused on the statistical com-parison of the selected compression methods wh...
textThis thesis proposes an approach to improve test compression using sequential linear decompresso...
The study of compressed data structures strives to represent information on a computer concisely — u...
textThis paper investigates the cost-tradeoffs of implementing a test data compression technique pr...
textThis dissertation considers the problem of reducing the storage as well as the bandwidth (data ...
We present a new test data compression and decompression architecture based on a novel and efficient...
In scientific computing environments, large amounts of floating-point data often need to be transfer...
Since its inception, data compression has been practised mostly as an experimental science. Althoug...
This paper presents a new test data compression technique based on a compressioncode that uses exact...
textSequential linear decompressors are widely used to implement test compression. Bits stored on th...
Data compression is important in the computing process because it helps to reduce the space occupied...