NDLI: Optimal joint module-selection and retiming with carry-save representation

Content Provider	IEEE Xplore Digital Library
Author	Zhan Yu Kei-Yong Khoo Willson Jr., A.N.
Copyright Year	1982
Abstract	This paper is the first to combine the joint module-selection and retiming problem with the use of carry-save representation in the optimization of a synchronous circuit. To solve this problem efficiently, we first create a mixed-representation data-flow graph (MFG) by inserting signal representation conversion vertices into the data-flow graph, thus allowing carry-save representation to be freely selected for use. We then identify key properties of an optimal implementation of the MFG that consider the different signal representations as well as the sharing of registers and adders. These properties enable us to formulate the problem as a mixed-integer linear programming problem with cost functions that accurately reflect the true implementation costs of the circuit. Our algorithm, by allowing carry-save representation, can produce a wider range of solutions. In our experiments, our fastest implementation is 27% faster and our smallest implementation is 27% smaller, in comparison with solutions obtained using the previously known joint module-selection and retiming technique.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	836
Ending Page	846
Page Count	11
File Size	656846
File Format	PDF
ISSN	02780070
Volume Number	22
Issue Number	7
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Circuits Signal representations Adders Registers Linear programming Cost function Arithmetic Delay High level synthesis Hardware
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An optimal allocation of carry-save-adders in arithmetic circuits

Data-Flow Transformations to Maximize the Use of Carry-Save Representation in Arithmetic Circuits

Retiming edge-triggered circuits under general delay models

Multioperand Redundant Adders on FPGAs

Design of residue generators and multioperand modular adders using carry-save adders

A practical approach to the synthesis of arithmetic circuits using carry-save-adders

Optimal retiming of level-clocked circuits using symmetric clock schedules

Equivalence checking of arithmetic circuits on the arithmetic bit level

ILP-based cost-optimal DSP synthesis with module selection and data format conversion

Optimal joint module-selection and retiming with carry-save representation

Similar Documents

An optimal allocation of carry-save-adders in arithmetic circuits

Data-Flow Transformations to Maximize the Use of Carry-Save Representation in Arithmetic Circuits

Retiming edge-triggered circuits under general delay models

Multioperand Redundant Adders on FPGAs

Design of residue generators and multioperand modular adders using carry-save adders

A practical approach to the synthesis of arithmetic circuits using carry-save-adders

Optimal retiming of level-clocked circuits using symmetric clock schedules

Equivalence checking of arithmetic circuits on the arithmetic bit level

ILP-based cost-optimal DSP synthesis with module selection and data format conversion

Optimal joint module-selection and retiming with carry-save representation