Translator Disclaimer
6 October 2000 High-performance reconfigurable constant coefficient multiplier implementations
Author Affiliations +
Abstract
The use of dynamic reconfiguration appears extremely attractive for implementing adaptive processing algorithms. Often, the adaption involves updating look-up tables based on a parameter which can only be determined at run-time. For reasons of efficiency, these look-up tables are read-only to the rest of the circuitry. This paper compares the use of run-time reconfiguration and read-only look-up tables, with similar implementations using writable memories. The application under consideration is the multi-layer perceptron neural network. It is shown that the ROM based network is considerably simpler than the RAM based network, at the expense of a dramatically increased time to update the weights during training.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Philip B. James-Roxby and Brandon J. Blodget "High-performance reconfigurable constant coefficient multiplier implementations", Proc. SPIE 4212, Reconfigurable Technology: FPGAs for Computing and Applications II, (6 October 2000); https://doi.org/10.1117/12.402519
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Encoding of compatible micro-operations in LUT-based FSMs
Proceedings of SPIE (August 07 2017)
Implementation of adaptive logic networks on an FPGA board
Proceedings of SPIE (October 08 1998)
ArMenX: a flexible platform for signal and image processing
Proceedings of SPIE (September 19 1995)
Reconfigurable logic design case
Proceedings of SPIE (July 02 2002)
FPGA-based artificial neural network using CORDIC modules
Proceedings of SPIE (August 25 2006)

Back to Top