Paper
22 October 1996 FIR filter implementation using bit-serial arithmetic and partial summation trees
S. Gibb, P. J. W. Graumann, Laurence E. Turner
Author Affiliations +
Abstract
An architecture which efficiently implements a fixed coefficient FIR filter using pipelined bit-serial arithmetic is described. A specialized multiplier decomposition exploiting multiplier coefficient similarities is used to obtain a reduced hardware area implementation. A design methodology which supports the conversion of a frequency response specification into a gate level implementation of the filter is presented. An 89 tap FIR filter meeting a multi-band frequency response specification, with 16 bit internal data precision and a sample rate of 1.6 GHz for parallel input and output data is implemented on a single XILINX 4005PG156 FPGA device.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
S. Gibb, P. J. W. Graumann, and Laurence E. Turner "FIR filter implementation using bit-serial arithmetic and partial summation trees", Proc. SPIE 2846, Advanced Signal Processing Algorithms, Architectures, and Implementations VI, (22 October 1996); https://doi.org/10.1117/12.255462
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Finite impulse response filters

Optical filters

Field programmable gate arrays

Digital filtering

Electronic filtering

Nonlinear filtering

Quantization

RELATED CONTENT

Nonlinear filters based on ordering by FFT structure
Proceedings of SPIE (March 25 1996)
Learning type of median and mean hybrid filters and a...
Proceedings of SPIE (April 06 1998)
FPGA design of MOMS-based sampling rate converters
Proceedings of SPIE (April 03 2008)
Two design techiques for 2-D FIR LoG filters
Proceedings of SPIE (September 01 1990)

Back to Top