The use of arithmetic coding for binary image compression achieves a high compression ratio while the running time remains rather slow. A composite modelling method presented in this paper reduces the size of the data to be coded by arithmetic coding. The method is to code the uniform areas with less computation and apply arithmetic coding to the areas with more variation.

In this paper we present an environment supporting fixed-point arithmetic in C programs. It allows the specification of the position of the binary point in the source code and code generation for architectures with hardware support for the fixed-point arithmetic. Our tools are implemented on the top of the SUIF C compiler[1] and do not require any special adaptations. We demonstrate the validit...

Currently, nearly all methods for proving termination of imperative programs apply an unsound and incomplete abstraction by treating bitvectors and bitvector arithmetic as (unbounded) integers and integer arithmetic, respectively. This abstraction ignores the wraparound behavior caused by underand overflows in bitvector arithmetic operations. This is particularly problematic in the termination ...

This report presents a design space mapping of common arithmetic units with a 0.13 μm CMOS process technology. A behavioural vs. structural (gate-level logic) code comparison is made on key arithmetic functions, binary modulo arithmetic is studied and a brief complexity evaluation is made.

A proposal is made to provide compiler support for interval arithmetic with inline code generation and nonstop exception handling. The proposal satisses the fundamental containment requirement of interval arithmetic and produces sharp results without sacriicing performance whenever possible .

A cyclic arithmetic code is a subgroup of Z/(rn − 1)Z, where the weight of a word x is the minimal number of nonzero coefficients in the representation x ≡ ∑n−1 i=0 cir with |ci| < r for all i. A code is called equidistant if all codewords have the same weight. In this paper necessary conditions for the existence of equidistant codes are given. By relating these conditions to character sums on ...

A comprehensive library of arithmetic units written in synthesizable VHDL code has been developed. The library contains components for a variety of arithmetic operations and for different speed requirements. The library components are implemented as circuit generators in parameterized structural VHDL code. Their modular and well-documented source code allows for simple usage and easy customizat...

Motivated by recent results in multiple description image coding over wireless networks, we propose a scheme for transmission of multiple descriptions through hybrid packet loss and additive white Gaussian noise channel. Each description is coded into multiple bitstreams by applying SPIHT coding on wavelet trees along spatial orientations and each stream is further compressed using arithmetic c...

Given an available number of arithmetic operations per data sample, the tandem connection of a transform source code and a Reed-Solomon channel code is optimized to minimize meansquared error when transmitting Gauss-Markov data across a binary symmetric channel. The goal is to learn how well-designed systems allocate complexity, i.e. arithmetic operations, between source and channel coding. The...