Answers are grounded in this paper and cite their sources.
This letter exploits the cyclic prefix to create a blind adaptive globally convergent channel-shortening algorithm, with a complexity like least mean squares. The cost function is related to that of the shortening signal-to-noise solution of Melsa et al. (see IEEE Trans. Commun., vol.44, p.1662-72, Dec. 1996), and simulations are provided to demonstrate the performance of the algorithm.
No takes yet. Share an insight, caveat, or question.
Martin et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: