Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CORR
2008
Springer

favoriteEmaildiscussreport

138views Education» more CORR 2008»

Efficient Implementation of the Generalized Tunstall Code Generation Algorithm

13 years 4 months ago

Efficient Implementation of the Generalized Tunstall Code Generation Algorithm

Download hkn.eecs.berkeley.edu

A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, including Markov sources, which use a suboptimal generalization of Tunstall's algorithm proposed by Savari and analytically examined by Tabus and Rissanen. In general, if n is the total number of output leaves across all Tunstall trees, s is the number of trees (states), and D is the number of leaves of each internal node, then this method takes O((1+(log s)/D)n) time and O(n) space.

Michael B. Baer

Real-time Traffic

CORR 2008 | Education | Linear Time | Output Items | Tunstall Code |

claim paper

Related Content

» Optimal Parsing Trees for RunLength Coding of Biased Data

» Efficient electronic integrals and their generalized derivatives for object oriented imple...

» Implementation of a Novel Efficient Multiwavelet Based Video Coding Algorithm

» FPGA Implementation of LS Code Generator for CDM Based MIMO Channel Sounder

» VLSI Implementation of the Multistage Detector for Next Generation Wideband CDMA Receivers

» Messagepassing code generation for nonrectangular tiling transformations

» Synthesizing interconnectefficient low density parity check codes

» The Design and Implementation of a Successful General Game Playing Agent

» Efficient hardware code generation for FPGAs

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Michael B. Baer

Comments (0)