Low-complexity single-channel blind source separation  

作　　者：Zhang Xing Hu Jianhao 

机构地区：[1]National Key Laboratory of Science and Technology on Communications,University of Electronic Science and Technology of China

出　　处：《The Journal of China Universities of Posts and Telecommunications》2017年第3期7-15,共9页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (61501084)

摘　　要：For the time-frequency overlapped signals, a low-complexity single-channel blind source separation （SBSS） algorithm is proposed in this paper. The algorithm does not only introduce the Gibbs sampling theory to separate the mixed signals, but also adopts the orthogonal triangle decomposition-M （QRD-M） to reduce the computational complexity. According to analysis and simulation results, we demonstrate that the separation performance of the proposed algorithm is similar to that of the per-survivor processing （PSP） algorithm, while its computational complexity is sharply reduced.For the time-frequency overlapped signals, a low-complexity single-channel blind source separation （SBSS） algorithm is proposed in this paper. The algorithm does not only introduce the Gibbs sampling theory to separate the mixed signals, but also adopts the orthogonal triangle decomposition-M （QRD-M） to reduce the computational complexity. According to analysis and simulation results, we demonstrate that the separation performance of the proposed algorithm is similar to that of the per-survivor processing （PSP） algorithm, while its computational complexity is sharply reduced.

关 键 词：SINGLE-CHANNEL SEPARATION Gibbs sampling QRD-M 

分 类 号：TN911.7[电子电信—通信与信息系统]