DMCA
INTEGRATION OF THE KRYLOV SUBSPACE METHOD IN AN ITERATIVE MULTI-USER DETECTOR FOR TIME-VARIANT CHANNELS (2006)
BibTeX
@MISC{Dumard06integrationof,
author = {Charlotte Dumard and Thomas Zemen},
title = {INTEGRATION OF THE KRYLOV SUBSPACE METHOD IN AN ITERATIVE MULTI-USER DETECTOR FOR TIME-VARIANT CHANNELS},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Iterative multi-user detection and time-variant channel estimation in a multi-carrier (MC) code division multiple access (CDMA) uplink requires high computational complexity. This is mainly due to the linear minimum mean square error (LMMSE) filters that are used for multi-user detection and time-variant channel estimation. Krylov subspace methods allow for an efficient implementation of the LMMSE filter. We show that a suitable chosen starting value, exploiting the iterative receiver structure, allows for a further speedup of the Krylov method. We achieve a complexity reduction by more than one order of magnitude. The Krylov subspace method allows a parallelization of the computations of the multi-user detector, while keeping the receiver performance constant. Numerical simulation results for a fully loaded system with K =64users are presented.
Keyphrases
time-variant channel estimation krylov subspace method efficient implementation high computational complexity iterative multi-user detection suitable chosen multi-user detector complexity reduction multi-user detection iterative receiver structure receiver performance constant numerical simulation result code division multiple access loaded system lmmse filter linear minimum mean square error krylov method
