Abstract

This paper considers a cost function level analysis of the Sum-squared Autocorrelation Minimization (SAM) channel shortening algorithm. We point out that the actual cost the blind adaptive stochastic gradient descent algorithm is minimizing is only indirectly related to the sum squared autocorrelation. We study the asymptotic regimes under which the actual cost yields a reliable surrogate for the sum squared autocorrelation. We investigate the relationship between the minima of the actual cost and sum squared autocorrelation. We also study the upper bound of the approximate cost as a function of the window size used in the approximate autocorrelation calculation.

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 call

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.