Abstract
Classically, adaptive equalization algorithms are analyzed in terms of two possible steady state behaviors: convergence to a fixed point and divergence to infinity. This twofold scenario suits well the modus operandi of linear supervised algorithms, but can be rather restrictive when unsupervised methods are considered, as their intrinsic use of higher-order statistics gives rise to nonlinear update expressions. In this work, we show, using different analytical tools belonging to dynamic system theory, that one of the most emblematic and studied unsupervised approaches – the decision-directed algorithm – is potentially capable of presenting behaviors, like convergence to limit-cycles and chaos, that transcend the aforementioned dichotomy. These results also indicate theoretical possibilities concerning step-size selection and initialization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Nonlinear Science and Numerical Simulation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
