Abstract

Modern day field programmable gate arrays FPGA have look-up tables LUT as inherent basic logic elements. With FPGAs fast moving from prototype designing to low and medium volume productions, there is an increased need for efficient utilisation of these FPGA primitives. Unfortunately, majority of the work concerned with FPGA implementations focus only on the technology independent architectural optimisations that can be done at the top level of the logic synthesis process. In this paper, we consider the technology dependent optimisation of the fixed-point bit-parallel multiplier on LUT-based FPGAs. We perform technology dependent optimisations prior to the design entry phase and then use instantiation-based coding styles to ensure that the optimisations remain preserved throughout the synthesis process. Our implementations show substantial improvement in terms of resources utilised, critical path delays and dynamic power dissipation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.