A recursive linear detection algorithm for asynchronous CDMA communication system
IEEE Transactions on Information Theory（2002）
摘要
A recursive linear detection algorithm is proposed for the detection of signals from an asynchronous direct-sequence code-division multiple-access (DS-CDMA) communication system. This algorithm works for short as well as long codes. Under some reasonable conditions, this algorithm is proved to be stable and converges to the ideal decorrelating detector (IDD) with a sufficiently large memory length. The performance of the algorithm is analyzed in some detail. Upper and lower bounds for the bit-error probabilities are developed. It is demonstrated that the two bounds converge to the bit-error probabilities of the IDD as the large memory length increases. Simulation results show that the recursive detector proposed outperforms the truncated decorrelating detector with less memory and less computational complexity
更多查看译文
关键词
code division multiple access,decorrelation,error statistics,multiuser channels,signal detection,spread spectrum communication,BPSK,DS-CDMA,algorithm performance,asynchronous CDMA communication system,binary phase-shift keying,bit error probability,computational complexity,convergence,direct-sequence code-division multiple-access,ideal decorrelating detector,long codes,lower bound,memory length,recursive linear detection algorithm,short codes,signal detection,simulation results,stable algorithm,truncated decorrelating detector,upper bound
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要