A method for reducing the complexity of Per-Survivor Processing algorithm on Single Channel Blind Separation

With the worsening electromagnetic environment ,more and more communication system is facing the mixed signal interference problem which cause some difficulties to demodulation.PSP(Per-Survivor Processing) algorithm is an effective solution for single channel mixed signal blind separation.To solve the current problem that the complexity of PSP algorithm will increase with the higher modulation order in single channel blind separation.,an improved PSP blind separation algorithm was proposed based on the characteristic that the complexity of PSP algorithm increases with the rise of the length of ISI. Simulation results showed that , comparing with the original algorithm ,this improved algorithm can speed up approximately three times in the BPSK demodulation and about 18 times in QPSK demodulation without much impact on Bit Error Rate. If we took another method using the unchanged length of ISI , the BPSK demodulation only had 2dB gain at most compared with the original algorithm. Even if we reduce the duration of ISI,the result still has 1.5dB gain.While The QPSK demodulation had 1.5dB gain at most. Even if we reduce the duration of ISI,the result still has 1dB gain.