Abstract
The problem of reconfiguring a two-dimensional degradable VLSI array under the row and column routing constraints has been shown to be NP-complete. This paper aims to decrease the reconfiguration time to enhance the real time application. A partial rerouting algorithm is proposed in this paper. For a given m /spl times/ n VLSI array with the fault density /spl rho/, the proposed algorithm runs in O((1 - /spl rho/)/spl middot//spl tau/~/spl middot/n) which is far less than O((1 /spl rho/)/spl middot/m/spl middot/n), the time complexity of the most efficient algorithm, cited in the literature, where /spl tau/~ is far less than m and it is nearly a constant for the small fault density. In addition, the proposed algorithm is exactly the same in harvest as the version reported so far.
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 callSimilar Papers
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.
