High-speed fir filter design and optimization using artificial intelligence techniques

Ph.DDOCTOR OF PHILOSOPH

Computationally efficient FIR digital filters

Ph.DDOCTOR OF PHILOSOPH

Design and implementation of computationally efficient digital filters

Ph.DDOCTOR OF PHILOSOPH

Optimisation of multiplier-less FIR filter design techniques

This thesis is concerned with the design of multiplier-less (ML) finite impulse response (FIR) digital filters. The use of multiplier-less digital filters results in simplified filtering structures, better throughput rates and higher speed. These characteristics are very desirable in many DSP systems. This thesis concentrates on the design of digital filters with power-of-two coefficients that result in simplified filtering structures. Two distinct classesof ML FIR filter design algorithms are developed and compared with traditional techniques. The first class is based on the sensitivity of filter coefficients to rounding to power-of-two. Novel elements include extending of the algorithm for multiple-bands filters and introducing mean square error as the sensitivity criterion. This improves the performance of the algorithm and reduces the complexity of resulting filtering structures. The second class of filter design algorithms is based on evolutionary techniques, primarily genetic algorithms. Three different algorithms based on genetic algorithm kernel are developed. They include simple genetic algorithm, knowledge-based genetic algorithm and hybrid of genetic algorithm and simulated annealing. Inclusion of the additional knowledge has been found very useful when re-designing filters or refining previous designs. Hybrid techniques are useful when exploring large, N-dimensional searching spaces. Here, the genetic algorithm is used to explore searching space rapidly, followed by fine search using simulated annealing. This approach has been found beneficial for design of high-order filters. Finally, a formula for estimation of the filter length from its specification and complementing both classes of design algorithms, has been evolved using techniques of symbolic regression and genetic programming. Although the evolved formula is very complex and not easily understandable, statistical analysis has shown that it produces more accurate results than traditional Kaiser's formula. In summary, several novel algorithms for the design of multiplier-less digital filters have been developed. They outperform traditional techniques that are used for the design of ML FIR filters and hence contributed to the knowledge in the field of ML FIR filter design

Synthesis methods for linear-phase FIR filters with a piecewise-polynomial impulse response

his thesis concentrates on synthesis methods for linear-phase finite-impulse response filters with a piecewise-polynomial impulse response. One of the objectives has been to find integer-valued coefficients to efficiently implement filters of the piecewise-polynomial impulse response approach introduced by Saram¨aki and Mitra. In this method, the impulse response is divided into blocks of equal length and each block is created by a polynomial of a given degree. The arithmetic complexity of these filters depends on the polynomial degree and the number of blocks. By using integer-valued coefficients it is possible to make the implementation of the subfilters, which generates the polynomials, multiplication-free. The main focus has been on finding computationally-efficient synthesis methods by using a piecewise-polynomial and a piecewise-polynomial-sinusoidal impulse responses to make it possible to implement high-speed, low-power, highly integrated digital signal processing systems. The earlier method by Chu and Burrus has been studied. The overall impulse response of the approach proposed in this thesis consists of the sum of several polynomial-form responses. The arithmetic complexity depends on the polynomial degree and the number of polynomial-form responses. The piecewise-polynomial-sinusoidal approach is a modification of the piecewise-polynomial approach. The subresponses are multiplied by a sinusoidal function and an arbitrary number of separate center coefficients is added. Thereby, the arithmetic complexity depends also on the number of complex multipliers and separately generated center coefficients. The filters proposed in this thesis are optimized by using linear programming methods