{"title":"Defect tolerant sorting networks for WSI implementation","authors":"Sheng-Chiech Liang, S. Kuo","doi":"10.1109/ICWSI.1990.63893","DOIUrl":null,"url":null,"abstract":"To overcome the yield problem in WSI, it is necessary to include redundancy and use more regular architectures for implementation. The authors present a novel hierarchical fault tolerant sorting network which satisfies both application requirements and area-time complexity constraints. It is very regular in structure and hence more easily reconfigurable than any existing sorting network with the same time complexity. Redundancy is provided at each level of the hierarchy. Hierarchical reconfiguration is implemented by replacing the faulty cells with spare cells at the lowest level first, and go to the next higher level to perform reconfiguration if there is not enough redundancy at the current level. In addition to defect tolerance after fabrication, these redundant cells can also be used for single error correction at run time.<<ETX>>","PeriodicalId":206140,"journal":{"name":"1990 Proceedings. International Conference on Wafer Scale Integration","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1990 Proceedings. International Conference on Wafer Scale Integration","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWSI.1990.63893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
To overcome the yield problem in WSI, it is necessary to include redundancy and use more regular architectures for implementation. The authors present a novel hierarchical fault tolerant sorting network which satisfies both application requirements and area-time complexity constraints. It is very regular in structure and hence more easily reconfigurable than any existing sorting network with the same time complexity. Redundancy is provided at each level of the hierarchy. Hierarchical reconfiguration is implemented by replacing the faulty cells with spare cells at the lowest level first, and go to the next higher level to perform reconfiguration if there is not enough redundancy at the current level. In addition to defect tolerance after fabrication, these redundant cells can also be used for single error correction at run time.<>