In this paper, a novel maximum a posteriori (MAP) technique for the decoding of arithmetic codes in the presence of transmission errors is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted codeword. The viability of the proposed approach is demonstrated in the binary symmetric channel case in terms of both pe...

– Abstract – In the variable-length source coding, we may consider vary zestful problem as follows: If each code symbol is given prescribed cost to transmit or record, what code is optimal? This problem is substantial from not only theoretical viewpoints but also engineering points of view. Because, in practical systems of communication or recording , it may reasonable to consider unequal costs...

Lossless variable-length source coding with codeword cost is considered for general sources. The problem setting, where we impose on unequal costs on code symbols, is called the variablelength coding with codeword cost. In this problem, the infimum of average codeword cost have been determined for general sources. On the other hand, overflow probability, which is defined as the probability of c...

The increased capacity and enhanced features of modern FPGAs opens new opportunities for their use as application accelerators. However, for FPGAs to be accepted as mainstream acceleration solutions, long design cycles must be shortened by using high-level synthesis tools in the design process. Current HLS tools targeting FPGAs have several limitations including the inefficient use of deeply pi...

The concept of geometric-arithmetic indices (GA) was put forward in chemical graph theory very recently. In spite of this, several works have already appeared dealing with these indices. In this paper we present lower and upper bounds on the second geometric-arithmetic index (GA2) and characterize the extremal graphs. Moreover, we establish Nordhaus-Gaddum-type results for GA2.

A arithmetic coder architecture with a high throughput memory efficient for set partitioning in hierarchical trees is proposed in this paper. This paper also presents a throughput efficient image compression using ‘Set Partitioning in Hierarchical Trees’ (SPIHT) algorithm for compression of images. The SPIHT use inherent redundancy among wavelet coefficients and suited for both gray and color i...

A universal lossless data compression code called the multilevel pattern matching code (MPM code) is introduced. In processing a finite-alphabet data string of length , the MPM code operates at (log log ) levels sequentially. At each level, the MPM code detects matching patterns in the input data string (substrings of the data appearing in two or more nonoverlapping positions). The matching pat...

Joint source-channel turbo techniques have recently been explored a lot in literature as one promising possibility to lower the end-to-end distortion, with fixed length codes, variable length codes, and (quasi) arithmetic codes. Still, many issues remain to be clarified before production use. This short contribution clarifies very concisely several issues that arise with EXIT charts and nonunif...

In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a quotient ring of a (non commutative) skew polynomial ring. The paper shows how existence and properties of such codes are linked to arithmetic properties of skew polynomials. This class of codes is a generalization of the θ-cyclic codes discussed in [1]. However θ-cyclic codes are performant repr...

Arithmetic operations over binary extension fields GF(2 m ) have many important applications in domains such as cryptography, code theory and digital signal processing. These must be fast, so low-delay implementations of arithmetic circuits are required. Among operations, field multiplication is...