Abstract

AbstractThis paper examines the performance of a reduced rank minimum mean square error (MMSE) receiver‐based direct sequence code division multiple access (DS‐CDMA) system. For such system, when a large processing gain is employed, substantial time is consumed in computing the filter tap weights. Many schemes for reducing the complexity of the MMSE have been proposed in recent years. In this paper, computational complexity reduction of the MMSE receiver is achieved by using the K‐mean classification algorithm. The performance of the uncoded and coded systems are investigated for the full rank MMSE receiver and reduced rank MMSE receiver and results are compared in terms of bit error rate at different loading levels in both AWGN and fading channels. A system with the matched filter (MF) receiver is also presented for the purpose of comparison and an analytical pair‐wise error bound for the coded system is derived. In the adaptive implementation of the receivers, results show that good performance is achieved for the reduced rank receiver when compared to the full rank receiver in both coded and uncoded systems, while in the optimum implementation of the tap weights, the reduced dimension receiver performance experiences degradation when compared to the full rank scheme. Over the band‐limited channels considered, results for the reduced rank receiver also reiterate the fact that higher code rates tend to yield lower BER than that of low rate codes. Copyright © 2006 John Wiley & Sons, Ltd.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.