The DFF-PSP Iterative Separation and Theoretical Bound for PCMA with Long Memory

作     者：CUI Penghui JIANG Hua CAO Kai LI Taozhu 

作者机构：National Digital Switching Engineering Technological Research Center 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2016年第25卷第5期

页      面：880-885页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

基　　金：supported by the National Natural Science Foundation of China(No.61072046) 

主　　题：Paired carrier multiple access(PCMA) Single channel blind separation(SCBS) Decision feedbackfeedforward Per-survivor processing Bit-interleaved code modulation iterative decoder(BICM-ID) Multiple-access channel(MAC) Theoretical performance bound 

摘      要：This paper proposes the Decision feedbackfeedforward per-survivor processing(DFF-PSP) iterative separation algorithm and the Monte Carlo integrationbased method to compute the theoretical bound for Paired carrier multiple access(PCMA) Single channel blind separation(SCBS) which is highly complex with long memory. The truncated PSP is employed while the pre- and post- cursors are disregarded to control the *** delayed decisions feedforward and local decisions feedback filters are designed to process the pre- and postcursors. The Bit-interleaved code modulation iterative decoder(BICM-ID) is combined with the second soft decision of the truncated PSP to obtain a better *** mixture signal model is regarded as a Multiple-access channel(MAC) with memory, and the theoretical performance bound is obtained via entropy inequality, Monte Carlo integration and Fano inequality. Simulation results show that the DFF-PSP iterative separation provides the good tradeoff between complexity and performance.