Subscribe Now Subscribe Today
Science Alert
Curve Top
Information Technology Journal
  Year: 2007 | Volume: 6 | Issue: 5 | Page No.: 776-779
DOI: 10.3923/itj.2007.776.779
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

A Huffman Decoding Algorithm in Mobile Robot Platform

R. Ponalagusamy, E. Kannan and Michael Arock

In the field of mobile robotics, data is transmitted from the robot over low bandwidth channels or incrementally in short bursts to a host, where it can be further processed for visualization. JPEG-LS is the one of the image and file compressions, in which the Huffman decoding is used to compress the result of quantization stage. In the recent production and management scenario, advanced factories require first an increasing degree of automation to reduce the product cost and, second, availability of greater flexibility of output and product types. To meet such requirements in near future, the factories need to link the flow of material, energy and information together more efficiently. In order to link the flow of information with other entities, we have to involve data compression, coding and decoding techniques. The speed is very demanding for such applications which in turn motivate to develop a fast decoding algorithm to meet the challenges arising in the field of predicting collision free path for robot. Huffman decoding has been widely used in data, image and video compression. This motivates the present work. For a Concurrent Read and Exclusive Write (CREW), Parallel Random Access Machine (PRAM) model with N processors, we propose a parallel algorithm for Huffman decoding in this paper. The algorithm employs (N+1)-ary search, which is parallel version of binary search. Its time complexity amounts to O (log N+1 (n+1)), where n is the number of symbols in a Huffman tree.
PDF Fulltext XML References Citation Report Citation
How to cite this article:

R. Ponalagusamy, E. Kannan and Michael Arock, 2007. A Huffman Decoding Algorithm in Mobile Robot Platform. Information Technology Journal, 6: 776-779.

DOI: 10.3923/itj.2007.776.779






Curve Bottom