Parallel Matched Filtering Algorithm with Low Complexity

Chen Xuhuang ,Shao Gaoping ,Wang Yang

doi:10.23977/cpcs.2016.11003

Abstract

For the problem of double counting in the overlap save algorithm(OSA), this paper presents parallel matched filtering algorithm with low complexity. The current data is segment based on the filter order, then using the quarter discrete fourier transform (QDFT) to reduce the amount of calculation. The calculation result of the previous and current data block are added to obtain the block filter results. Analysis and simulation results show that the algorithm effectively reduces the computational complexity. It is more suitable for high-speed demodulation which has multiple parallel paths.

Highlights

With the rapid development of information technology and communication technology, the data transmission rate of communication system can reach the order of Gsps
High-speed data can not be processed by traditional serial demodulation method at present, so it needs parallel processing algorithm[1]
To reduce the complexity of filtering, in [1] the complexity of the filter is reduced by optimizing the design of constant coefficient multiplier

Summary

Introduction

With the rapid development of information technology and communication technology, the data transmission rate of communication system can reach the order of Gsps. High-speed data can not be processed by traditional serial demodulation method at present, so it needs parallel processing algorithm[1]. Matched filter is high complexity part of the key algorithm, so It is significant to study the parallel matching filter algorithm. To reduce the complexity of filtering, in [1] the complexity of the filter is reduced by optimizing the design of constant coefficient multiplier. In [1], the fast FIR algorithm (FFAs) is used to generate the low complexity filtering algorithm by using the characteristics of the filter coefficient symmetry. A low complexity parallel filtering algorithm is proposed on the basis of overlapped preserving filtering algorithm. The overlap-preserving algorithm is decomposed into two independent processing modules, and the low-complexity matched filter structure is calculated

Frequency - Domain Parallel Matching Filtering Algorithm Based on QDFT

Complexity analysis and simulation experiment

Conclusions