Parallel Matched Filtering Algorithm with Low Complexity

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.