Paraskevas Kalivas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Paraskevas Kalivas has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Kiamal Pekmestzi
National Technical University of Athens, Zografou Greece
2 shared publications A. Tsirikos
Fac. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, Greece
1 shared publication- Chris Meletis
National Technical University of Athens
1 shared publication P. Bougas
Fac. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, Greece
1 shared publication- Vassilis Vassilakis
National Technical University of Athens
1 shared publication
Latest Publications
- 1 March 2005
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 39 (3) , 313-322
A New Low Latency Parallel FIR Filter Scheme
- 1 March 2005
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 39 (3) , 313-322
A New Low Latency Parallel FIR Filter Scheme
- 10 January 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 52 (1) , 108-118
Pipelined array-based FIR filter folding
The elaborate design of folded finite-impulse response (FIR) filters based on pipelined multiplier arrays is presented in this paper. The design is considered at the bit-level and the internal delays of the pipelined multiplier array are fully exploited in order to reduce hardware complexity. Both direct and transposed FIR filter forms are considered. The carry-save and the carry-propagate multiplier arrays are studied for the filter implementations. Partially folded architectures are also proposed which are implemented by cascading a number of folded FIR filters. The proposed schemes are compared as to the aspect of hardware complexity with a straightforward implementation of a folded FIR filter based on the pipelined Wallace Tree multiplier. The comparison reveals that the proposed schemes require 20%-30% less hardware. Finally, efficient implementation of partially folded FIR filter circuits is presented when constraints in area, power consumption and clock frequency are given.
- 10 January 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 52 (1) , 108-118
Pipelined array-based FIR filter folding
The elaborate design of folded finite-impulse response (FIR) filters based on pipelined multiplier arrays is presented in this paper. The design is considered at the bit-level and the internal delays of the pipelined multiplier array are fully exploited in order to reduce hardware complexity. Both direct and transposed FIR filter forms are considered. The carry-save and the carry-propagate multiplier arrays are studied for the filter implementations. Partially folded architectures are also proposed which are implemented by cascading a number of folded FIR filters. The proposed schemes are compared as to the aspect of hardware complexity with a straightforward implementation of a folded FIR filter based on the pipelined Wallace Tree multiplier. The comparison reveals that the proposed schemes require 20%-30% less hardware. Finally, efficient implementation of partially folded FIR filter circuits is presented when constraints in area, power consumption and clock frequency are given.