Contention resolution : a new approach to versatile subexpressions sharing in multiple constant multiplications
Multiple constant multiplications (MCM) have been a core operation in many digital signal processing applications. In this paper, an efficient generalized contention resolution algorithm (CRA) is proposed to eliminate three broad categories of reusable common subexpressions in MCM. The idea is to re...
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: |
2010
|
Assuntos: | |
Acesso em linha: | https://hdl.handle.net/10356/93572 http://hdl.handle.net/10220/6285 http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4400044 |
Registros relacionados
-
Contention resolution algorithm for common subexpression elimination in digital filter design
por: Xu, Fei, et al.
Publicado em: (2009) -
Design of low-complexity FIR filters based on signed-powers-of-two coefficients with reusable common subexpressions
por: Xu, Fei, et al.
Publicado em: (2009) -
Pipelined adder graph optimization for high speed multiple constant multiplication
por: Kumm, Martin, et al.
Publicado em: (2013) -
Design of extrapolated impulse response FIR filters with residual compensation in subexpression space
por: Yu, Ya Jun, et al.
Publicado em: (2010) -
Generic selections of subexpressions
por: van Steenbergen, M, et al.
Publicado em: (2010)