Technology optimised fixed-point bit-parallel multiplier for LUT-based FPGAs
by Burhan Khurshid; Roohie Naaz
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 6, No. 1, 2016

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.

Online publication date: Fri, 29-Apr-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com