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 wit...

Full description

Saved in:
Bibliographic Details
Published in:电子学报：英文版 2016 (5), p.880-885
Main Author: CUI Penghui JIANG Hua CAO Kai LI Taozhu
Format: Article
Language:English
Subjects:
access(PCMA)
Single
blind
bound
carrier
channel
channel(MAC)
Theoretical
code
decoder(BICM-ID)
Multiple-access
feedbackfeedforward
Per-survivor
iterative
modulation
multiple
Paired
processing
Bit-interleaved
separation(SCBS)
Decision
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1022-4653