PROJECT TITLE :

On Efficient Retiming of Fixed-Point Circuits - 2016

ABSTRACT:

Retiming of digital circuits is conventionally based mostly on the estimates of propagation delays across completely different ways in the information-flow graphs (DFGs) obtained by discrete part timing model, which implicitly assumes that operation of a node will begin solely when the completion of the operation(s) of its preceding node(s) to obey the information dependence demand. Such a discrete element timing model terribly typically gives abundant higher estimates of the propagation delays than the actuals notably when the computations within the DFG nodes correspond to fastened-point arithmetic operations like additions and multiplications. On the other hand, very often it's imperative to house the DFGs of such higher granularity at the design-level abstraction of digital system design for mapping an algorithm to the specified architecture, where the overestimation of propagation delay leads to unwanted pipelining and undesirable increase in pipeline overheads. During this paper, we propose the connected part timing model to get adequately precise estimates of propagation delays across completely different combinational methods in a very DFG simply, for economical cutset-retiming so as to reduce the vital path substantially without significant increase in register-complexity and latency. Apart from that, we tend to propose novel node-splitting and node-merging techniques that may be utilized in combination with the present retiming ways to realize reduction of important path to a fraction that of the first DFG with a tiny increase in overall register complexity.


Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here


PROJECT TITLE : TARA: An Efficient Random Access Mechanism for NB-IoT by Exploiting TA Value Difference in Collided Preambles ABSTRACT: The 3rd Generation Partnership Project (3GPP) has specified the narrowband Internet of Things
PROJECT TITLE : ESVSSE Enabling Efficient, Secure, Verifiable Searchable Symmetric Encryption ABSTRACT: It is believed that symmetric searchable encryption, also known as SSE, will solve the problem of privacy in data outsourcing
PROJECT TITLE : ESA-Stream: Efficient Self-Adaptive Online Data Stream Clustering ABSTRACT: A wide variety of big data applications generate an enormous amount of streaming data that is high-dimensional, real-time, and constantly
PROJECT TITLE : Efficient Shapelet Discovery for Time Series Classification ABSTRACT: Recently, it was discovered that time-series shapelets, which are discriminative subsequences, are effective for the classification of time
PROJECT TITLE : Efficient Identity-based Provable Multi-Copy Data Possession in Multi-Cloud Storage ABSTRACT: A significant number of clients currently store multiple copies of their data on a variety of cloud servers. This helps

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry