The DFF-PSP Iterative Separation and Theoretical Bound for PCMA with Long Memory  被引量:4

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

在线阅读下载全文

作  者:CUI Penghui JIANG Hua CAO Kai LI Taozhu 

机构地区:[1]National Digital Switching Engineering Technological Research Center

出  处:《Chinese Journal of Electronics》2016年第5期880-885,共6页电子学报(英文版)

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

摘  要: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.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.

关 键 词: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 

分 类 号:TN927.2[电子电信—通信与信息系统]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象