Discrete-time and continuous-time constant modulus algorithm analysis

Author

Wu, Min ; Cornett, Frank

Author_Institution

Tennessee Technol. Univ., Cookeville, TN, USA

fYear

1995

fDate

12-14 Mar 1995

Firstpage

504

Lastpage

508

Abstract

The purpose of this study is to analyze the properties of one of the most common blind adaptive techniques, the Constant Modulus Algorithm, in a mathematical sense. In this paper, the discrete-time and continuous-time Constant Modulus Algorithm is presented. Convergence behavior of two adaptation algorithm, the steepest descent algorithm and the stochastic gradient algorithm, is discussed in both discrete-time and continuous-time cases. The stochastic gradient algorithm performance of each case is characterized and terms of steady state error. The results of computer simulations are presented. Finally, conclusions and recommendations for future research are given

Keywords

adaptive filters; adaptive signal processing; convergence of numerical methods; error analysis; tracking filters; continuous-time constant modulus algorithm analysis; convergence behavior; discrete-time constant modulus algorithm analysis; steady state error; stochastic gradient algorithm performance; Adaptive filters; Algorithm design and analysis; Computer errors; Computer simulation; Cost function; Data communication; Equalizers; Error analysis; Steady-state; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1995., Proceedings of the Twenty-Seventh Southeastern Symposium on

Conference_Location

Starkville, MS

ISSN

0094-2898

Print_ISBN

0-8186-6985-3

Type

conf

DOI

10.1109/SSST.1995.390530

Filename

390530