CUI Penghui, JIANG Hua, CAO Kai, LI Taozhu. The DFF-PSP Iterative Separation and Theoretical Bound for PCMA with Long Memory[J]. Chinese Journal of Electronics, 2016, 25(5): 880-885. DOI: 10.1049/cje.2016.08.046
Citation: CUI Penghui, JIANG Hua, CAO Kai, LI Taozhu. The DFF-PSP Iterative Separation and Theoretical Bound for PCMA with Long Memory[J]. Chinese Journal of Electronics, 2016, 25(5): 880-885. DOI: 10.1049/cje.2016.08.046

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

  • 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 complexity. 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 performance. The 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.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return