A Lattice Basis Reduction Approach for the Design of Finite Wordlength FIR Filters

Abstract

Many applications of finite impulse response (FIR) digital filters impose strict format constraints on the filter coefficients. Such requirements increase the complexity of determining optimal designs for the problem at hand. We introduce a fast and efficient method, based on the computation of good nodes for polynomial interpolation and Euclidean lattice basis reduction. Experiments show that it returns quasi-optimal finite wordlength FIR filters; compared to previous approaches it also scales remarkably well (length 125 filters are treated in $ 9 s). It also proves useful for accelerating the determination of optimal finite wordlength FIR filters.