TY - GEN
T1 - Complexity reduction of adaptive T-algorithm on UWB OFDM systems
AU - Tarasak, Poramate
AU - Peng, Xiaoming
AU - Chin, Francois
PY - 2008
Y1 - 2008
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/50949094403
U2 - 10.1109/RWS.2008.4463419
DO - 10.1109/RWS.2008.4463419
M3 - Conference contribution
AN - SCOPUS:50949094403
SN - 1424414636
SN - 9781424414635
T3 - 2008 IEEE Radio and Wireless Symposium, RWS
SP - 25
EP - 28
BT - 2008 IEEE Radio and Wireless Symposium, RWS
T2 - 2008 IEEE Radio and Wireless Symposium, RWS
Y2 - 22 January 2008 through 24 January 2008
ER -