By Topic

Recursive structures and finite impulse response implementations of linear multiuser detectors for an asynchronous CDMA system

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

2 Author(s)
Uppala, S.V. ; Lucent Technol., AT&T Bell Labs., Murray Hill, NJ, USA ; Sahr, J.D.

We present order-recursive structures for implementing the linear decorrelating and linear minimum mean square error (MMSE) detectors in a computationally efficient manner. These infinite memory length, linear time invariant, noncausal systems can be approximated by implementing them as K-input K-output finite impulse response (FIR) filters. We developed a linear multiuser receiver architecture called a recursive linear multiuser detector which has lower computational and memory requirements then an equivalent tap delay line FIR filter implementation. We establish the tradeoff between window length and bit error rate and find that relatively small window size yields performance indistinguishable from the ideal decorrelating detector and the ideal MMSE detector

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:16 ,  Issue: 9 )