Reduced Complexity Turbo Multi User Detection for a CDMA System Using M-ary PSK
作者单位：School of Electrical and Computer Engineering University of TehranTehran Iran
会议名称：《2006 10th International Conference on Communication Technology（ICCT 2006）》
会议日期：2006年
学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统]
基 金：support of Iran Telecommunication Research Center (ITRC)
关 键 词：Turbo multi user non-binary PSK convulutional code Reduced complexity Hamming distance.
摘 要：In CDMA systems, turbo multi user detection for multiple access interference cancellation and channel decoding in CDMA systems has an exponentially growing complexity with number of users. In these systems, when bandwidth efficient modulations like M-ary PSK are used another exponential factor that is relates to the levels of modulation prohibitively increases the computational complexity of the receiver. In this paper we have examined a symbol based reduced complexity multi user detector, for coded and un-coded CDMA system, with a performance very near to optimal detector while having extremely low complexity. We have introduced a design formula for the required Hamming distance value for no loss in performance. Simulation results of coded and un-coded CDMA system verify the performance of our reduced complexity detector that we expect.