A finite-interval constant modulus algorithm

Abstract

A finite-interval constant modulus algorithm is developed which is vastly simpler than the Analytic Constant Modulus Algorithm and, unlike that algorithm, can claim to minimize a constant modulus criterion. It requires one QR decomposition of a data matrix, followed by a power iteration. Step size bounds which ensure monotonic convergence are obtained in analytic form, and proper tuning leads to an algorithm which converges typically within a few iterations. The algorithm thus gives a computationally feasible method for implementing constant modulus signal restoration in packet-based transmission systems.

DOI: 10.1109/ICASSP.2002.5745101

Extracted Key Phrases

2 Figures and Tables

Statistics

0102030'02'04'06'08'10'12'14'16
Citations per Year

56 Citations

Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Regalia2002AFC, title={A finite-interval constant modulus algorithm}, author={Phillip A. Regalia}, journal={2002 IEEE International Conference on Acoustics, Speech, and Signal Processing}, year={2002}, volume={3}, pages={III-2285-III-2288} }