By Topic

Finite alphabet generator with parameterized Markov chain transition matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mariem Kallel Smaoui ; Signals and Systems research Unit, National Engineering School of Tunis, BP 37, Le Belvédère, 1002, Tunisia ; Yousra Ben Jemaa ; Meriem Jaidane

The finite alphabet approach is a method proposed to analyze exactly adaptive algorithms/structures. The performances are related to the choice of the transition matrix, corresponding to the Markov chain that models the inputs. When increasing the alphabet cardinality, the algebraic method uses matrices with prohibitive dimensions, so the definition of the corresponding transition matrix becomes complicated, and the determination of signal statistics becomes rather unfeasible. The contribution of this paper deals with proposition of a method allowing to generate finite alphabet sets, at any cardinality, operating on certain characteristics of the finite alphabet set (correlation, high order statistics), in order to carry out exact analytical results.

Published in:

Electronics, Circuits and Systems, 2008. ICECS 2008. 15th IEEE International Conference on

Date of Conference:

Aug. 31 2008-Sept. 3 2008