Finite alphabet generator with parameterized Markov chain transition matrix

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.

[1]  Sofiane Cherif,et al.  Design of decision feedback equalizer with short training sequence , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[2]  George C. Sponsler.  First-order Markov process representation of binary radar data sequences , 1957, IRE Trans. Inf. Theory.

[4]  Saleem A. Kassam,et al.  Asymmetric signaling constellations for phase estimation , 2000, Proceedings of the Tenth IEEE Workshop on Statistical Signal and Array Processing (Cat. No.00TH8496).

[5]  Vassilis Anastassopoulos.  Statistical and spectral properties of irreducible Markov chains , 2002, 2002 14th International Conference on Digital Signal Processing Proceedings. DSP 2002 (Cat. No.02TH8628).

[6]  B. Widrow,et al.  Statistical theory of quantization , 1996 .

[7]  Carlo S. Regazzoni,et al.  Higher-order-statistics-based sharpness evaluation of a generalized Gaussian PDF model in impulsive noisy environments , 1998, Ninth IEEE Signal Processing Workshop on Statistical Signal and Array Processing (Cat. No.98TH8381).

[8]  Luciano Alparone,et al.  Estimation based on entropy matching for generalized Gaussian PDF modeling , 1999, IEEE Signal Processing Letters.

[9]  Hichem Besbes,et al.  On exact convergence results of adaptive filters: the finite alphabet case , 2000, Signal Process..

[10]  M. Jaidane,et al.  Adaptive PLL performances analysis for digital transmission context , 2004, First International Symposium on Control, Communications and Signal Processing, 2004..