
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Srinath R. Naidu, Vijay Chandru, "On Synthesis of Easily Testable (k, K) Circuits," IEEE Transactions on Computers, vol. 52, no. 11, pp. 14901494, November, 2003.  
BibTex  x  
@article{ 10.1109/TC.2003.1244946, author = {Srinath R. Naidu and Vijay Chandru}, title = {On Synthesis of Easily Testable (k, K) Circuits}, journal ={IEEE Transactions on Computers}, volume = {52}, number = {11}, issn = {00189340}, year = {2003}, pages = {14901494}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2003.1244946}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Synthesis of Easily Testable (k, K) Circuits IS  11 SN  00189340 SP1490 EP1494 EPD  14901494 A1  Srinath R. Naidu, A1  Vijay Chandru, PY  2003 KW  Testing KW  stuckat fault KW  polynomial time KW  ktree KW  treewidth KW  synthesis. VL  52 JA  IEEE Transactions on Computers ER   
Abstract—A (
[1] S. Arnborg and A. Proskurowski, Linear Time Algorithms for NPHard Problems Restricted to Partial kTrees Discrete Applied Math., vol. 23, pp. 1124, 1989.
[2] S. Arnborg, D.G. Corneil, and A. Proskurowski, Complexity of Finding Embeddings in a kTree SIAM J. Algebraic and Discrete Methods, vol. 8, no. 2, pp. 277284, Apr. 1987.
[3] S.T. Chakradhar, V.D. Agrawal, and M.L. Bushnell, Neural Models and Algorithms for Digital Testing: Dordrecht, The Netherlands, Kluwer Academic Publishers, 1991.
[4] H. Fujiwara and S. Toida, The Complexity of Fault Detection Problems for Combinational Logic Circuits IEEE Trans. Computers, vol. 31, no. 6, pp. 553560, June 1982.
[5] E. Korach and N. Solel, Treewidth, Pathwidth and Cutwidth Discrete Applied Math., vol. 43, pp. 97101, 1993.
[6] J. van Leeuwen, Graph Algorithms Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity Theory, pp. 527631. Amsterdam: North Holland Publishing, 1990.
[7] S.R. Naidu, PolynomialTime Testable Combinational Circuits MSc (Engg) thesis, Dept. of Computer Science and Automation, Indian Inst. of Science, July 1998.
[8] M.R. Prasad, P. Chong, and K. Keutzer, Why Is ATPG Easy? Proc. 36th Design Automation Conf., pp. 2228, 1999.
[9] N.S.V. Rao and S. Toida, On PolynomialTime Testable Combinational Circuits IEEE Trans. Computers, vol. 43, no. 11, pp. 12981309, Nov. 1994.
[10] N.D. Robertson and P.D. Seymour, Graph Minors III. Planar TreeWidth J. Combinatorial Theory, Series B 36, pp. 4964, 1984.