Depth First Traversal Algorithm for Efficient Build-in Self-Test in Nano Fabrics

We describe an algorithmic method comes from Depth First Traversal algorithm for covering the nanoblocks in an easier and more efficient way in using BIST test method in Nano Fabrics. This method easily makes the high dense Nano Fabric acts as a Tree and then uses DFT to assign each nanoblock TPGs, BUTs and ORAs(the fundamental parts of BIST test method). The complexity of this algorithm when n is the number of nanoblocks is O(nlog(n)) and this quick order of running is very important because of the high dense nature of Nano Fabrics.