This paper examines the use of arithmetic coding in conjunction with the error resilient entropy code (EREC). The constraints on the coding model are discussed and simulation results are presented and compared to those obtained using Huffman coding. These results show that without the EREC, arithmetic coding is less resilient than Huffman coding, while with the EREC both systems yield comparabl...

This paper presents a new characterization of provably recursive functions of first-order arithmetic. We consider functions defined by sets of equations. The equations can be arbitrary, not necessarily defining primitive recursive, or even total, functions. The main result states that a function is provably recursive iff its totality is provable (using natural deduction) from the defining set o...

An edge coding scheme based on chain code representation in a multiresolution image coding context is presented. Our method enhances the coding schemes that describe the source structure with Markov models, by using also an a priori knowledge from the previous decoded resolution images. Experiments using adaptive arithmetic coding have shown up to a 5% improvement for the bitrate compared to a ...

structure). Now it will be shown how the enrichment of the definition of algebraic structures is possible, thus giving rise to abstract structures in which computing methods become available components. In fact as far as method abstraction is concerned, the inheritance allows us to use the code provided for a higher structure in all its subdomains, without any redefinition, as (Limongelli et al...

Recently, arithmetic coding has attracted the attention of many scholars because of its high compression capability. Accordingly, in this paper, a method that adds secrecy to this well-known source code is proposed. Finite state arithmetic code is used as source code to add security. Its finite state machine characteristic is exploited to insert some random jumps during source coding process. I...

Numerical simulation is used more and more frequently in the analysis of physical phenomena. A simulation requires several phases. The first phase consists of constructing a physical model based on the results of experimenting with the phenomena. Next, the physical model is approximated by a mathematical model. Generally, the mathematical model contains algebraic expressions, ordinary or partia...

In processors that do not support floating-point instructions, using fixed-point arithmetic instead of floating-point emulation trades off computation accuracy for execution speed. This trade-off is often profitable. In many cases, like embedded systems, low-cost and speed bounds make it the only acceptable option. We present an environment supporting fixed-point code generation from C programs...

Introduction Embedded DSP (digital signal processing) applications are typically implemented using fixed point arithmetic; in hardware to reduce area requirements and increase throughput, but also in software since most embedded processors do not provide floating point arithmetic. Consequently, the developer is confronted with the difficult task of deciding on the fixed point format, i.e., the ...

In this paper we present a VHDL code generator for a complex multiplier. The complex multiplier is based on a bit-parallel version of distributed arithmetic which reduces the hardware by nearly half compared to a straightforward implementation based on real multipliers. We choose an Overturned-Stairs adder tree to perform the summations in distributed arithmetic. The tree has a regular structur...

This paper introduces a new concept by which it is possible to design and implement arithmetic processors using permutation networks. To demonstrate this concept, several optoelectronic arithmetic units combining optical directional coupler switches and cyclic permutation networks are designed. The designs show that addition, subtraction, and multiplication can all be performed in O(log n) time...