By Topic

On low-complexity joint-detection techniques for TD-CDMA

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
$33 $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)
N. Benvenuto ; Dept. of Inf. Eng., Univ. of Padova, Italy ; F. Boccardi ; G. Carnevale

This paper is focused on low-complexity joint-detection (JD) algorithms, where the computational complexity is reduced using banks of discrete Fourier transformations. Mainly, we have developed a fast hybrid zero-forcing block decision-feedback equalizer (H-ZF-BDFE) combining the Fourier-based JD scheme (IEEE J. Sel. Areas Commun., vol. 19, p. 1461, 2001) with the fast decision-feedback structure (F-ZF-BDFE) IEEE J. Sel. Areas Commun., vol. 19, p. 245, 2001. In a Rayleigh frequency-selective fading channel, the new structure yields an improvement in Eb/N0 of almost 2 dB against the fast block linear equalizer (BLE) (IEEE J. Sel. Areas Commun., vol. 19, p. 1461, 2001) at a bit error rate (BER)=10-3. Moreover, it has the same performance as the F-ZF-BDFE, but the computational complexity for the signal processing is reduced by almost 50%.

Published in:

IEEE Transactions on Wireless Communications  (Volume:4 ,  Issue: 5 )