Abstract
Recent analytical results due to Walsh, Martin and Johnson showed that optimizing the single lag autocorrelation minimization (SLAM) cost does not guarantee convergence to high signal to interference ratio (SIR), an important metric in channel shortening applications. We submit that we can overcome this potential limitation of the SLAM algorithm and retain its computational complexity advantage by minimizing the square of single autocorrelation value with randomly selected lag. Our proposed lag-hopping adaptive channel shortening algorithm based upon squared autocorrelation minimization (LHSAM) has, therefore, low complexity as in the SLAM algorithm and, more importantly, a low average LHSAM cost can guarantee to give a high SIR as for the SAM algorithm. Simulation studies are included to confirm the performance of the LHSAM algorithm.
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 callDisclaimer: 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.
