Complexity reduction of adaptive T-algorithm on UWB OFDM systems

This paper proposes two algorithms to further reduce computation complexity for an adaptive T-algorithm. The complexity saving is achieved by a new way of threshold computation based on reusing already available metrics. The first algorithm requires knowledge of noise variance while the second algorithm does not. Simulation results on an ultrawideband orthogonal frequency division multiplexing (UWB OFDM) system show that the proposed algorithms can reduce computational complexity significantly especially at high SNR while there is no performance degradation compared to the existing algorithms.