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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/93572 http://hdl.handle.net/10220/6285 http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4400044 |