Novel Spare TSV Deployment for 3-D ICs Considering Yield and Timing Constraints


In three-D integrated circuits, through silicon via (TSV) could be a crucial enabling technique to provide vertical connections. But, it might suffer from several reliability problems like undercut, misalignment, or random open defects. Varied fault-tolerance mechanisms are proposed in literature to improve yield, at the value of important area overhead. During this paper, we have a tendency to specialize in the structure that uses one spare TSV for a group of original TSVs, and study the optimal assignment of spare TSVs beneath yield and timing constraints to attenuate the overall area overhead. We tend to show that such drawback can be modeled as a constrained graph decomposition drawback. 2 efficient heuristics are additional developed to deal with this problem. Experimental results show that underneath the same yield and timing constraints, our heuristic can reduce the area overhead induced by the fault-tolerance mechanisms by up to sixty one%, compared with a seemingly a lot of intuitive nearest-neighbor-primarily based heuristic.

Did you like this research project?

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

PROJECT TITLE : Novel Secure Outsourcing of Modular Inversion for Arbitrary and Variable Modulus ABSTRACT: In the fields of cryptography and algorithmic number theory, modular inversion is regarded as one of the operations that
PROJECT TITLE : A Novel Blockchain Based Secured and QoS Aware IoT Vehicular Network in Edge Cloud Computing ABSTRACT: An IoT (Internet of Things)-based vehicular ad-hoc network and a software-defined network are the two components
PROJECT TITLE : Progressive Self-Supervised Clustering With Novel Category Discovery ABSTRACT: Clustering is one of the most classical methods used to analyze data structures in machine learning and pattern recognition at the
PROJECT TITLE : Large-Scale Affine Matrix Rank Minimization With a Novel Nonconvex Regularizer ABSTRACT: The goal of low-rank minimization is to recover a matrix with the lowest possible rank while still satisfying the constraints
PROJECT TITLE : A Novel Discriminative Dictionary Pair Learning Constrained by Ordinal Locality for Mixed Frequency Data Classification ABSTRACT: One of the challenges that classification must overcome is the fact that the data

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

Project Enquiry