Abstract
FIR filtering can be expressed as multiplication of vector by scalars. We present high-speed implementations for adaptive and non-adaptive filters based on a computation sharing multiplier which specifically targets computation re-use in vector-scalar products. The performance of the proposed implementation is compared with implementations based on carry save and Wallace tree multipliers in 0.6 μ technology. We show that sharing multiplier scheme improves speed by approximately 30% and 21% with respect to the Wallace tree multiplier based implementation for non-adaptive and adaptive filters, respectively.
| Original language | English |
|---|---|
| Title of host publication | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Publisher | IEEE |
| Pages | 460-463 |
| Number of pages | 4 |
| Volume | 1 |
| Publication status | Published - 2000 |
| Externally published | Yes |
| Event | 2000 IEEE Interntional Conference on Acoustics, Speech, and Signal Processing - Istanbul, Turkey Duration: 2000 Jun 5 → 2000 Jun 9 |
Other
| Other | 2000 IEEE Interntional Conference on Acoustics, Speech, and Signal Processing |
|---|---|
| City | Istanbul, Turkey |
| Period | 00/6/5 → 00/6/9 |
Fingerprint
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
- Acoustics and Ultrasonics
Cite this
Non-adaptive and adaptive filter implementation based on sharing multiplication. / Park, Jongsun; Choo, Hunsoo; Muhammad, Khurram; Choi, SeungHoon; Im, Yonghee; Roy, Kaushik.
ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings. Vol. 1 IEEE, 2000. p. 460-463.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Non-adaptive and adaptive filter implementation based on sharing multiplication
AU - Park, Jongsun
AU - Choo, Hunsoo
AU - Muhammad, Khurram
AU - Choi, SeungHoon
AU - Im, Yonghee
AU - Roy, Kaushik
PY - 2000
Y1 - 2000
N2 - FIR filtering can be expressed as multiplication of vector by scalars. We present high-speed implementations for adaptive and non-adaptive filters based on a computation sharing multiplier which specifically targets computation re-use in vector-scalar products. The performance of the proposed implementation is compared with implementations based on carry save and Wallace tree multipliers in 0.6 μ technology. We show that sharing multiplier scheme improves speed by approximately 30% and 21% with respect to the Wallace tree multiplier based implementation for non-adaptive and adaptive filters, respectively.
AB - FIR filtering can be expressed as multiplication of vector by scalars. We present high-speed implementations for adaptive and non-adaptive filters based on a computation sharing multiplier which specifically targets computation re-use in vector-scalar products. The performance of the proposed implementation is compared with implementations based on carry save and Wallace tree multipliers in 0.6 μ technology. We show that sharing multiplier scheme improves speed by approximately 30% and 21% with respect to the Wallace tree multiplier based implementation for non-adaptive and adaptive filters, respectively.
UR - http://www.scopus.com/inward/record.url?scp=0033708881&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033708881&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0033708881
VL - 1
SP - 460
EP - 463
BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
PB - IEEE
ER -