Two approaches for fixed-point filter design: "bit-flipping" algorithm and constrained downhill simplex method
暂无分享,去创建一个
This paper presents two techniques for the design of digital filters with wordlength-constrained coefficients, the bit-flipping algorithm improved since it was first presented in 1994 and the downhill simplex method modified to deliver fixed-point filter coefficients. Both techniques can be applied to design of filter coefficients from scratch or to the optimisation of their floating-point versions. Both methods presented in this paper have been tested on the two-path polyphase half-band lowpass filter design problem. However, both these techniques can be used with almost no alteration, for general constrained coefficient digital design.
[1] Reinaldo A. Valenzuela,et al. Digital signal processing schemes for efficient interpolation and decimation , 1983 .
[2] Izzet Kale,et al. A "bit-flipping" approach to multistage two-path decimation filter design , 1998 .
[3] H. Samueli,et al. An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients , 1989 .
[4] John A. Nelder,et al. A Simplex Method for Function Minimization , 1965, Comput. J..