A New Reduced-Complexity Algorithm for Multiple-Symbol Differential Detection of M-ary DDPSK

摘要：

　　Although multiple-symbol differential detection (MSDD) of double differential phase-shift keying (DDPSK) provides much better error performance than conventional double differential detection,its complexity is much higher.In this paper,a fast algorithm for MSDD is presented,which reduces the number of trellis paths searched by using a subset search concept.It is proved that its performance is identical to that of the original receiver,while its complexity is only proportional to the (N-1)-th power of 2.By combining it with Viterbi algorithm,a new reduced-complexity algorithm is proposed.Computer simulations demonstrate that the performance of the proposed reduced-complexity receiver can reach the lower bound on the error probability of MSDD with very lower complexity,especially for M is very large.

关键词： multiple-symbol differential detection double differential phase-shift keying

作者: Yong Nie Yuehong Shen Mingxi Guo

作者单位: Institute of Communication Engineering, PLA University of Science and Technology, Nanjing, China

会议类型: 国际会议

会议名称: 2012 IEEE 14th International Conference on Communication Technology(2012年第十四届通信技术国际会议(ICCT 2012))

会议地点: 成都

会议语种:英文

页码: 833-837

在线出版日期: 2012-11-09（万方平台首次上网日期，不代表论文的发表时间）