Partial update blind adaptive channel shortening algorithms for wireline multicarrier systems.

Grira, Mahmud. 2008. Partial update blind adaptive channel shortening algorithms for wireline multicarrier systems. PhD Thesis, Cardiff University.

PDF - Accepted Post-Print Version Download (4MB)

Abstract

In wireline multicarrier systems a cyclic prefix is generally used to facilitate simple channel equalization at the receiver. The choice of the length of the cyclic prefix is a trade-off between maximizing the length of the channel for which inter-symbol interference is eliminated and optimizing the transmission efficiency. When the length of the channel is greater than the cyclic prefix, adaptive channel shorteners can be used to force the effective channel length of the combined channel and channel shortener to be within the cyclic prefix constraint. The focus of this thesis is the design of new blind adaptive time-domain channel shortening algorithms with good convergence properties and low computational complexity. An overview of the previous work in the field of supervised partial update adaptive filtering is given. The concept of property-restoral based blind channel shortening algorithms is then introduced together with the main techniques within this class of adaptive filters. Two new partial update blind (unsupervised) adaptive channel shortening algorithms are therefore introduced with robustness to impulsive noise commonly present in wireline multicarrier systems. Two further blind channel shortening algorithms are proposed in which the set of coefficients which is updated at each iteration of the algorithm is chosen deterministically. One of which, the partial up-date single lag autocorrelation maximization (PUSLAM) algorithm is particularly attractive due to its low computational complexity. The interaction between the receiver matched filter and the channel shortener is considered in the context of a multi-input single-output environment. To mitigate the possibility of ill-convergence with the PUSLAM algorithm an entirely new random PUSLAM (RPUSLAM) algorithm is proposed in which randomness is introduced both into the lag selection of the cost function underlying SLAM and the selection of the particular set of coefficients updated at each algorithm. This algorithm benefits from robust convergence properties whilst retaining relatively low computational complexity. All algorithms developed within the thesis are supported by evaluation on a set of eight carrier serving area test loop channels.

Item Type:	Thesis (PhD)
Status:	Unpublished
ISBN:	9781303213922
Date of First Compliant Deposit:	30 March 2016
Last Modified:	08 Jan 2014 15:48
URI:	https://orca.cardiff.ac.uk/id/eprint/54782

Actions (repository staff only)

Edit Item