A New Recursive Algorithm for Universal Coding of Integers

Journal Title: Journal of Information Systems and Telecommunication - Year 2015, Vol 3, Issue 1

Abstract

In this paper, we aim to encode the set of all positive integers so that the codewords not only be uniquely decodable but also be an instantaneous set of binary sequences. Elias introduces three recursive algorithms for universal coding of positive integers where each codeword contains binary representation of the integer plus an attachment portion that gives some information about the first part [1]. On the other hand, Fibonacci coding which is based on Fibonacci numbers is also introduced by Apostolico and Fraenkel for coding of integers [2]. In this paper, we propose a new lossless recursive algorithm for universal coding of positive integers based on both recursive algorithms and Fibonacci coding scheme without using any knowledge about the source statistics [3].The coding schemes which don’t use the source statistics is called universal coding, in these universal coding schemes we should use a universal decoding scheme in the receiver side of communication system. All of these encoding and decoding schemes assign binary streams to positive integers and conversely, without any need of use to probability masses over positive integers. We show that if we use Fibonacci coding in the first part of each codeword we can achieve shorter expected codeword length than Elias Omega code. In addition, our proposed algorithm has low complexity of encoding and decoding procedures.

Authors and Affiliations

Mehdi Nangir, Hamid Behroozi, Mohammad Reza Aref

Keywords

Related Articles

A New Calibration Method for SAR Analog-to-Digital Converters Based on All Digital Dithering

In this paper a new digital background calibration method for successive approximation register analog to digital converters is presented. For developing, a perturbation signal is added and also digital offset is injecte...

BER Performance Analysis of MIMO-OFDM Communication Systems Using Iterative Technique Over Indoor Power Line Channels in an Impulsive Noise Environment

This paper addresses the performance of MIMO-OFDM communication system in environments where the interfering noise exhibits non-Gaussian behavior due to impulsive phenomena. It presents the design and simulation of an it...

Online Signature Verification: a Robust Approach for Persian Signatures

In this paper, the specific trait of Persian signatures is applied to signature verification. Efficient features, which can discriminate among Persian signatures, are investigated in this approach. Persian signatures, in...

Statistical Analysis of Different Traffic Types Effect on QoS of Wireless Ad Hoc Networks

IEEE 802.11 based wireless ad hoc networks are highly appealing owing to their needless of infrastructures, ease and quick deployment and high availability. Vast variety of applications such as voice and video transmissi...

Parameter Estimation in Hysteretic Systems Based on Adaptive Least-Squares

In this paper, various identification methods based on least-squares technique to estimate the unknown parameters of structural systems with hysteresis are investigated. The Bouc-Wen model is used to describe the behavio...

Download PDF file
  • EP ID EP184733
  • DOI 10.7508/jist.2015.01.001
  • Views 113
  • Downloads 0

How To Cite

Mehdi Nangir, Hamid Behroozi, Mohammad Reza Aref (2015). A New Recursive Algorithm for Universal Coding of Integers. Journal of Information Systems and Telecommunication, 3(1), 1-6. https://europub.co.uk/articles/-A-184733