DocumentCode
3290305
Title
Transformation Matrix System for Reducing the Computational Complexity of Wireless Multi-User Receivers for DS-CDMA Systems
Author
Rizvi, Syed S. ; Riasat, Aasia ; Elleithy, Khaled M.
Author_Institution
Univ. of Bridgeport, Bridgeport
fYear
2008
fDate
7-9 April 2008
Firstpage
1251
Lastpage
1252
Abstract
This paper presents a new transformation matrix system for reducing the computational complexity of multiuser receiver. The proposed system observes the coordinates of the constellation diagram to determine the location of the transformation points. Since most of the decisions are correct, we can reduce the number of required computations by using the transformation matrixes only on those coordinates which are most likely to lead to an incorrect decision. Our results show that the proposed system successfully reduces the computational complexity of an optimal multiuser receiver. The complexity of the proposed system is not polynomial in the number of users, but it still gives comparatively reduced complexity.
Keywords
code division multiple access; computational complexity; matrix algebra; radio receivers; spread spectrum communication; DS-CDMA systems; computational complexity; transformation matrix system; wireless multiuser receivers; Computational complexity; Computer science; Detectors; Iterative algorithms; Matched filters; Maximum likelihood detection; Maximum likelihood estimation; Multiaccess communication; Multiple access interference; Neodymium; Computational Complexity; DS-CDMA; Multiuser Communications; Transformation Matrix;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology: New Generations, 2008. ITNG 2008. Fifth International Conference on
Conference_Location
Las Vegas, NV
Print_ISBN
0-7695-3099-0
Type
conf
DOI
10.1109/ITNG.2008.123
Filename
4492680
Link To Document