R.K. Martin, J. Balakrishnan, W.A. Sethares, and C.R. Johnson, Jr.
This paper exploits the cyclic prefix to create a blind, adaptive, globally convergent channel shortening algorithm, with a complexity like LMS. The cost function is related to that of the Shortening SNR solution of Melsa, Younce, and Rohrs, and simulations are provided to demonstrate the performance of the algorithm.