Paper
10 May 2012 Optimization of high speed pipelining in FPGA-based FIR filter design using genetic algorithm
Author Affiliations +
Abstract
This paper compares FPGA-based full pipelined multiplierless FIR filter design options. Comparison of Distributed Arithmetic (DA), Common Sub-Expression (CSE) sharing and n-dimensional Reduced Adder Graph (RAG-n) multiplierless filter design methods in term of size, speed, and A*T product are provided. Since DA designs are table-based and CSE/RAG-n designs are adder-based, FPGA synthesis design data are used for a realistic comparison. Superior results of a genetic algorithm based optimization of pipeline registers and non-output fundamental coefficients are shown. FIR filters (posted as open source by Kastner et al.) for filters in the length from 6 to 151 coefficients are used.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Uwe Meyer-Baese, Guillermo Botella, David E. T. Romero, and Martin Kumm "Optimization of high speed pipelining in FPGA-based FIR filter design using genetic algorithm", Proc. SPIE 8401, Independent Component Analyses, Compressive Sampling, Wavelets, Neural Net, Biosystems, and Nanoengineering X, 84010R (10 May 2012); https://doi.org/10.1117/12.918934
Lens.org Logo
CITATIONS
Cited by 27 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Genetic algorithms

Field programmable gate arrays

Optical filters

Finite impulse response filters

Optimization (mathematics)

Binary data

Personal digital assistants

Back to Top