On Two Problems of Nano-PLA Design

The logic mapping problem and the problem of finding a largest sub-crossbar with no defects in a nano-crossbar with nonprogrammable-crosspoint defects and disconnected-wire defects are known to be NP-hard. This paper shows that for nano-crossbars with only disconnected-wire defects, the former remains NP-hard, while the latter can be solved in polynomial time.

[1]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[2]  Mehdi Baradaran Tahoori,et al.  A mapping algorithm for defect-tolerance of reconfigurable nano-architectures , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[3]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[4]  Dhiraj K. Pradhan,et al.  A Defect Tolerance Scheme for Nanotechnology Circuits , 2007, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  Dieter Kratsch,et al.  Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph , 1995, Inf. Process. Lett..

[6]  Ramesh Karri,et al.  Logic Mapping in Crossbar-Based Nanoarchitectures , 2009, IEEE Design & Test of Computers.

[7]  Satoshi Tayu,et al.  Orthogonal ray graphs and nano-PLA design , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[8]  Satoshi Tayu,et al.  On orthogonal ray graphs , 2010, Discret. Appl. Math..