Name
Abstract | ||
|---|---|---|
We address the challenge of implementing reliable computation of Boolean functions in future nanocircuit fabrics. Such fabrics are projected to have very high defect rates. We overcome this limitation by using a combination of cheap but unreliable nanodevices and reliable but expensive CMOS devices. The contribution of this work is twofold - (1) A heterogeneous architecture suitable for low level defect tolerance (2) A novel coding strategy that for the first time exploited the structure of Boolean function for better coder. In our approach, defect tolerance is achieved through a novel coding of Boolean functions; specifically, we exploit the don’t cares of Boolean functions encountered in multi-level Boolean logic networks for constructing better codes. The optimal coding problem is NPhard. We solved it with a SAT based heuristic. We show that compared to direct application of existing coding techniques, the coding overhead in terms of extra bits can be reduced, on average by 23%, and savings can go up to 34%. We demonstrate that by incorporating efficient coding techniques more than a 20% average yield improvement is possible in case of 10% defect rates. We incur a negligible delay penalty of less than 1% for decoder and the area is 13X smaller compared 22nm CMOS technology and 32% smaller than TMR (triple modular redundancy) coding scheme. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/NANOARCH.2007.4400852 | NANOARCH |
Keywords | Field | DocType |
high defect rate,optimal coding problem,coding scheme,boolean function,coding overhead,heterogeneous cmos-cnt architecture,defect tolerance,efficient coding technique,coding technique,multi-level boolean logic network,defect rate,nanoelectronics,decoder,computational complexity,np hard problem,boolean functions,carbon nanotubes,computability,encoding | Boolean function,Heuristic,Computer science,Triple modular redundancy,Algorithm,Coding (social sciences),CMOS,Electronic engineering,Boolean algebra,Encoding (memory),Computational complexity theory | Conference |
Citations | PageRank | References |
4 | 0.58 | 4 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ashish Singh | 1 | 28 | 6.99 |
| Hady Ali Zeineddine | 2 | 4 | 0.92 |
| Adnan Aziz | 3 | 1778 | 149.76 |
| Sriram Vishwanath | 4 | 4185 | 445.45 |
| Michael Orshansky | 5 | 1299 | 110.06 |