Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions
In this paper, a new efficient algorithm is proposed for the synthesis of low-complexity finite-impulse response (FIR) filters with resource sharing. The original problem statement based on the minimization of signed-power-of-two (SPT) terms has been reformulated to account for the sharable adders....
Principais autores: | Xu, Fei, Chang, Chip Hong, Jong, Ching Chuen |
---|---|
Outros Autores: | School of Electrical and Electronic Engineering |
Formato: | Journal Article |
Idioma: | English |
Publicado em: |
2009
|
Assuntos: | |
Acesso em linha: | https://hdl.handle.net/10356/90778 http://hdl.handle.net/10220/4641 |
Registros relacionados
-
Contention resolution algorithm for common subexpression elimination in digital filter design
por: Xu, Fei, et al.
Publicado em: (2009) -
Contention resolution : a new approach to versatile subexpressions sharing in multiple constant multiplications
por: Xu, Fei, et al.
Publicado em: (2010) -
Design of extrapolated impulse response FIR filters with residual compensation in subexpression space
por: Yu, Ya Jun, et al.
Publicado em: (2010) -
Subexpression encoded extrapolated impulse response FIR filter with perfect residual compensation
por: Yu, Ya Jun, et al.
Publicado em: (2010) -
Design of linear phase FIR filters in subexpression space using mixed integer linear programming
por: Yu, Ya Jun, et al.
Publicado em: (2009)