Abstract: Fast finite impulse response (FIR) algorithm (FFA) can break the limitation that the hardware complexity of traditional parallel algorithm linearly increases with the degree of parallelism, which can improve FIR algorithm efficiency. However, there is few research focusing on the general algorithm and implementation structure for high-parallelism FFA. In this case, we propose high-efficiency 2ⁿ-parallel general FFA and its implementation structure. We also provide the high-parallelism FFA structure with non-2ⁿ-parallelism. According to the algorithm analysis and hardware efficiency estimation, we know that the efficient 2ⁿ-parallel FFA algorithm and structure proposed in this paper can achieve significant advantage over traditional methods, and this advantage is becoming more obvious with the parallelism increasing. Thus, the proposed high-efficiency 2ⁿ-parallel FFA can be used for the implementation of high-parallelism FIR filters.