To reduce the overall hardware cost as well as improve the synthesizability of finite impulse response (FIR) filter

a two-dimensional non-recursive optimization algorithm based on coefficient matrix was proposed and simulated. Firstly

the existing digital filter optimization algorithms were investigated

and the advantages and shortcomings of these algorithms were compared and analyzed. Then

efforts were made to optimize the existing one-dimensional non-recursive algorithm. By extracting the redundant terms of one-dimensional non-recursive optimization algorithm

a novel two-dimensional non-recursive FIR optimization method with low computing complexity was obtained. Finally

multiple groups of filters were generated to simulate and compare the performance between the proposed algorithm and one-dimensional non-recursive algorithm as well as the existing recursive algorithms. Simulation results show that the two-dimensional non-recursive FIR filter design method proposed in this paper makes full use of the redundant information of the coefficient matrix

keeps the character of minimum logic depth

and meanwhile reduces logic adder number. Compared with the existing one-dimensional non-recursive algorithm

this algorithm saved logic adder by 10.05% (12 bit quantization) and 7.21% (16 bit quantization). In the design of low-order filter

the adder cost was reduced to 30% of the conventional CSD representation

which outperforms the existing recursive and non-recursive filter design methods in terms of logic depth and adder number.