Anup Hosangadi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Anup Hosangadi has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
F. Fallah
Fujitsu Labs of America, Inc
1 shared publicationR. Kastner
University of California, Santa Barbara
1 shared publication- Ryan Kastner
University of California, San Diego
1 shared publication - Shahnam Mirzaei
Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106, USA
1 shared publication
Latest Publications
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2006 International Conference on Computer Design
- No. 10636404,p. 308-313
FPGA Implementation of High Speed FIR Filters Using Add and Shift Method
We present a method for implementing high speed finite impulse response (FIR) filters using just registered adders and hardwired shifts. We extensively use a modified common subexpression elimination algorithm to reduce the number of adders. We target our optimizations to Xilinx Virtex II devices where we compare our implementations with those produced by Xilinx CoregenTM using Distributed Arithmetic. We observe up to 50% reduction in the number of slices and up to 75% reduction in the number of LUTs for fully parallel implementations. We also observed up to 50% reduction in the total dynamic power consumption of the filters. Our designs perform significantly faster than the MAC filters, which use embedded multipliers.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2006 International Conference on Computer Design
- No. 10636404,p. 308-313
FPGA Implementation of High Speed FIR Filters Using Add and Shift Method
We present a method for implementing high speed finite impulse response (FIR) filters using just registered adders and hardwired shifts. We extensively use a modified common subexpression elimination algorithm to reduce the number of adders. We target our optimizations to Xilinx Virtex II devices where we compare our implementations with those produced by Xilinx CoregenTM using Distributed Arithmetic. We observe up to 50% reduction in the number of slices and up to 75% reduction in the number of LUTs for fully parallel implementations. We also observed up to 50% reduction in the total dynamic power consumption of the filters. Our designs perform significantly faster than the MAC filters, which use embedded multipliers.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15301591) , 1-6
Optimizing High Speed Arithmetic Circuits Using Three-Term Extraction
Carry save adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by extracting common three-term subexpressions. Our method can optimize multiple CSA trees involving any number of variables. This optimization has a significant impact on the total area of the synthesized circuits, as we show in our experiments. To the best of our knowledge, this is the only known method for eliminating common subexpressions in CSA structures. Since extracting common subexpressions can potentially increase delay, we also present a delay aware extraction algorithm that takes into account the different arrival times of the signals
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15301591) , 1-6
Optimizing High Speed Arithmetic Circuits Using Three-Term Extraction
Carry save adder (CSA) trees are commonly used for high speed implementation of multi-operand additions. We present a method to reduce the number of the adders in CSA trees by extracting common three-term subexpressions. Our method can optimize multiple CSA trees involving any number of variables. This optimization has a significant impact on the total area of the synthesized circuits, as we show in our experiments. To the best of our knowledge, this is the only known method for eliminating common subexpressions in CSA structures. Since extracting common subexpressions can potentially increase delay, we also present a delay aware extraction algorithm that takes into account the different arrival times of the signals