Video compression is a process of eliminating redundancy and irrelevant information for efficient storage and transmission. Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are the popular transforms used for efficient compression. DCT has high energy compaction and requires less computational resources. In this paper, a novel method is proposed combining DCT, DWT and Arithm...

We present an algorithm based on arithmetic coding that allows decompression to start at any point in the compressed le. This random access requirement poses some restrictions on the implementation of arithmetic coding and on the model used. Our main application area is executable code compression for computer systems where machine instructions are decompressed on-they before execution. We focu...

The aim of this paper is FPGA implementation of architecture of floating point arithmetic core and analysis of area and timing performances of that arithmetic core. The basic concept behind designing such a core is to optimally utilize the algorithms of floating point arithmetic operations, i.e., addition, subtraction, multiplication and division and to enhance the operational speed of these ca...

This paper contributes to code clone detection by providing an algorithm that calculates canonical forms of arithmetic and conditional expressions. An experimental evaluation shows the relevance of such expressions in real code. The proposed normalization can be used in addition to dataflow normalizations.

This paper presents a versatile, Matlab-based simulation and analysis code for electric power systems. The code was created for basic research and designed from a control/dynamical systems perspective. Full advantage was taken of Matlab’s inherent cell arrays, structures, vectorizedcalculations, ODE solvers with event handling and complex arithmetic. Design features that make the code easy to u...

We give a detailed algorithm for fast text compression. Our algorithm, related to the PPM method, simpli es the modeling phase by eliminating the escape mechanism and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. We provide details of the use of quasi-arithmetic code tables, and analyze their compression performance. Our Fast PPM method is shown experimenta...

This paper extends the result of earlier work on the application of arithmetic codes to the constrained channel problem. We specifically present a general length-based $xed rate implementation technique which performs the arithmetic coding recursions during each channel time unit. This technique is superior to an earlier unpublished code for general constrained channels. The approach permits th...

We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementation combines the efficiency of linear programming for solving the arithmetic part with the efficiency of a SAT solver to reason about the boolean structure. We evaluate the efficiency of our tool on benchmarks from s...

Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against function contracts, which are expressed in terms of pre-, post-, and frame conditions using first-order predicates. Vx86 takes the annotated assembler code, translates it into C code simulating the processor, and then uses an exist...

This development provides a formal model of IEEE-754 floatingpoint arithmetic. This formalization, including formal specification of the standard and proofs of important properties of floating-point arithmetic, forms the foundation for verifying programs with floating-point computation. There is also a code generation setup for floats so that we can execute programs using this formalization in ...