Digital Filter Design Using an Improved Shuffled Frog Leaping Algorithm
碩士 === 樹德科技大學 === 電腦與通訊系碩士班 === 104 === In this thesis, we employ an improved shuffled frog leaping algorithm (ISLFA) to solve two different digital filter design issues. Shuffled frog leaping algorithm is a meta-heuristic optimization method that mimics a group of frogs for seeking food. It combi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/12083795841166650101 |
| Summary: | 碩士 === 樹德科技大學 === 電腦與通訊系碩士班 === 104 === In this thesis, we employ an improved shuffled frog leaping algorithm (ISLFA) to solve two different digital filter design issues. Shuffled frog leaping algorithm is a meta-heuristic optimization method that mimics a group of frogs for seeking food. It combines the advantages of the Genetic-based Memetic Algorithm (MA) and social behavior-based Particle Swarm Optimization (PSO) algorithm. A new mechanism to the general frog leaping algorithm is developed to enhance the search efficiency of the algorithm. Based on using the developed algorithm, two different digital filter design issues is considered. One is the FIR digital filter design, the other is the parameter estimation of bilinear digital systems. Simulation results will reveal the applicability of the proposed algorithm.
|
|---|