Open AccessThe DFF‐PSP Iterative Separation and Theoretical Bound for PCMA with Long Memory
Author(s) -
Cui Penghui,
Jiang Hua,
Cao Kai,
Li Taozhu
Publication year - 2016
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2016.08.046
Subject(s) - computer science , monte carlo method , algorithm , upper and lower bounds , computational complexity theory , entropy (arrow of time) , channel (broadcasting) , iterative method , mathematics , telecommunications , statistics , mathematical analysis , physics , quantum mechanics
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 post‐ cursors. 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.