Abstract
In this paper we present a hardware design technique which utilises runtime reconfiguration for a particular class of applications. For a multiplication circuit implemented within an FPGA, a specific instance of multiplying by a constant provides a significant reduction of required logic when compared to the generic case when multiplying any two arbitrary values. The use of reconfiguration allows the specific constant value to be updated, such that at any time instance the constant multiplication value will be fixed, however over time this constant value can change via reconfiguration. Through investigation and manipulation of the sequence of required multiplication operations for given applications, sequences of multiplication operations can be obtained where one input changes at a rate slower than the other input. That is one input to the multiplier is fixed for a set number of cycles, hence allowing it to be configured in hardware as a constant and reconfigured at the periodicity of its change. Applications such as the IDEA encryption algorithm and every cycle Adaptive FIR filtering are presented which utilise this reconfiguration technique providing reduced logic implementations while not compromising the performance of the design.
Preview
Unable to display preview. Download preview PDF.
References
J. Burns A. Donlin J. Hoggs S. Singh M. de Wit. A dynamic reconfiguration runtime system. In FPGAs for Custom Computing Machines, April 1997.
A. DeHon. Reconfigurable Architectures for General-Purpose Computing. PhD thesis, Massachusetts Institute of Technology, 1996.
A. DeHon. DPGA utilization and application. In FPGA ’96 ACM/SIGDA Fourth International Symposium on FPGAs, Montery CA, February 1996.
H. Eggers P. Lysaght H. Dick and G. McGregor. Fast reconfigurable crossbar switching in FPGAs. In FPL’96.
N. Weaver E. Caspi. Idea as a benchmark for reconfigurable computing. Technical Report Available from http://www.cs.berkeley.edu/projects/brass/projects.html, BRASS Research Group, University of Berkeley, December 1996.
J. R. Hauser and J. Wawrzynek. Garp: A mips processor with a reconfigurable coprocessor. In Proc. FPGAs for Custom Computing Machines, pages 12–21. IEEE, April 1997.
Xilinx Incorporated. Xilinx XC4000 data sheet, 1996.
Les Mintzer. FIR filters with field-programmable gate arrays. Journal of VLSI Signal Processing, 6(2):119–127, 1993.
C. Rupp, M. Landguth, T. Garverick, E. Gomersall, H. Holt, T. Arnold, and M. Gokhale. The NAPA adaptive processing architecture. In Proc. FPGAs for Custom Computing Machines, pages 28–37. IEEE, April 1998.
H. Schmit. Incremental reconfiguration for pipelined applications. In Proc. FPGAs for Custom Computing Machines, pages 47–55. IEEE, April 1997.
W. Stallings. Network and Internetwork Security: Principles and Practice. Prentice Hall, 1995.
B. Slous T. Kean, B. New. A multiplier for the XC6200. In Sixth International Workshop on Field Programmable Logic and Applications, 1996.
J. Vuillemin, P. Bertin, D. Roncin, M. Shand, H. Touati and P. Boucard. Programmable active memories: Reconfigurable systems come of age. IEEE Transactions on VLSI Systems, 4(1):56–69, March 1996.
M. Wojko and H. ElGindy. Self configurable binary multipliers for LUT addressable FPGAs. In Tam Shardi, editor, Proceedings of PART’98, Newcastle, New South Wales, Australia, September 1998. Springer.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Wojko, M., ElGindy, H. (1999). Configuration sequencing with self configurable binary multipliers. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097949
Download citation
DOI: https://doi.org/10.1007/BFb0097949
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive