University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Blind a daptive channel shortening with a generalized lag-hopping algorithm which employs squared auto-correlation minimization [GLHSAM]

Maatoug, K and Chambers, JA (2008) Blind a daptive channel shortening with a generalized lag-hopping algorithm which employs squared auto-correlation minimization [GLHSAM]

Full text not available from this repository.

Abstract

A generalized blind lag-hopping adaptive channel shortening (GLHSAM) algorithm based upon squared auto-correlation minimization is proposed. This algorithm provides the ability to select a level of complexity at each iteration between the sum-squared autocorrelation minimization (SAM) algorithm due to Martin and Johnson and the single lag autocorrelation minimization (SLAM) algorithm proposed by Nawaz and Chambers whilst guaranteeing convergence to high signal to interference ratio (SIR). At each iteration a number of unique lags are chosen randomly from the available range so that on the average GLHSAM has the same cost as the SAM algorithm. The performance of the proposed GLHSAM algorithm is confirmed through simulation studies. © 2008 IEEE.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Authors :
NameEmailORCID
Maatoug, KUNSPECIFIEDUNSPECIFIED
Chambers, JAj.a.chambers@surrey.ac.ukUNSPECIFIED
Date : 1 December 2008
Identification Number : https://doi.org/10.1109/ICSNC.2008.60
Depositing User : Symplectic Elements
Date Deposited : 17 May 2017 13:25
Last Modified : 17 May 2017 13:25
URI: http://epubs.surrey.ac.uk/id/eprint/839178

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800