By Topic

Low complexity data detection using fast Fourier transform decomposition of channel correlation matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jung-Lin Pan ; InterDigital Commun. Corp, Melville, NY, USA ; De, P. ; Zeira, A.

This paper presents an efficient FFT based channel-equalization method for data detection. The data detection method is applicable to multiuser detection in the downlink, and single user detection in the uplink. It can operate for chip rate sampling as well as higher sampling rates. The FFT implementation is enabled by approximating the channel correlation matrix by a right circulant matrix. Furthermore, the circulant matrix approximation is optimized via a simple permutation procedure. The solution offers very low complexity relative to other receivers. For instance, for twelve codes with spreading factor 16 each, the complexity of the proposed solution is about 25% of the complexity of the approximate Cholesky based joint detector. The proposed FFT based solution significantly outperforms the matched filter (MF) and is comparable in performance to the approximate Cholesky based joint detector

Published in:

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:2 )

Date of Conference:

2001