ÇѱÛÁ¦¸ñ(Korean Title) |
ÀԷºÐÇÒ¿¡ ÀÇÇÏ¿© ÇÕ¼ºµÈ Á¶ÇÕ È¸·ÎÀÇ °áÇÔ°ËÃâ·Â |
¿µ¹®Á¦¸ñ(English Title) |
On the Testability of Combinational Circuits Synthesized by Input Decomposition |
ÀúÀÚ(Author) |
À̱ͻó
Gueesang Lee
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 20 NO. 07 PP. 0997 ~ 1004 (1993. 07) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â ÀԷºÐÇÒ¿¡ ÀÇÇÑ ³í¸®ÇÕ¼ºµµ±¸ÀÎ FACTOR¿¡ ÀÇÇؼ »ý¼ºµÈ ȸ·ÎÀÇ °áÇÔ°ËÃâ¿¡ ´ëÇÏ¿© °íÂûÇÑ´Ù. ³í¸®ÇÕ¼ºµµ±¸ FACTOR´Â ºÎºÐȸ·Îµé »çÀÌÀÇ ¿¬°á¼±ÀÇ ¼ö°¡ ÃÖ¼Òȵǵµ·Ï ȸ±ÍÀûÀ¸·Î ÀÔ·ÂÀ» ºÐÇÒÇÏ¿© ȸ·Î¸¦ »ý¼ºÇϹǷΠÀüüÀûÀ¸·Î ºÎºÐȸ·ÎµéÀÌ ³ª¹«±¸Á¶(tree structure)¸¦ Çü¼ºÇÑ´Ù. ÀÌ·¯ÇÑ È¸·Îµé¿¡ ´ëÇÏ¿© °¢°¢ÀÇ °íÂøÇü ´Ü°áÇÔ¿¡ ´ëÇÏ¿© °áÇÔ°ËÃâ ¹æ¹ýÀ» º¸ÀÌµÇ °¢°¢ÀÇ ºÎºÐȸ·Î¿¡ ÇØ´çÇÏ´Â Áø¸®Ç¥¸¦ ÀÛ¼ºÇÏ°í À̸¦ ÀÌ¿ëÇÏ¿© ÁÖ¾îÁø °áÇÔÀÌ ½±°Ô °ËÃâµÊÀ» º¸ÀδÙ. ¶ÇÇÑ °íÂøÇü ´Ü°áÇÔ ¸ðµ¨À» »ç¿ëÇÏ¿© 100%°áÇÔ°ËÃâ°¡´ÉÇÔÀ» º¸ÀδÙ. µû¶ó¼ ´Ù¸¥ ¹æ¹ý°ú ºñ±³ÇÒ ¶§, ÀԷºÐÇÒ¿¡ ÀÇÇÑ ³í¸®ÇÕ¼º¹æ¹ýÀÌ 100%°áÇÔ°ËÃâ°¡´ÉÇÑ È¸·Î¸¦ »ý¼ºÇÒ »Ó ¾Æ´Ï¶ó °áÇÔ°ËÃâ ¼ÂÆ® ¹ß»ýÀÇ ¾î·Á¿òÀ» ¸Å¿ì ¼Õ½±°Ô ³í¸®ÇÕ¼º´Ü°è¿¡¼ ÇØ°áÇÒ ¼ö ÀÖÀ½À» º¸ÀδÙ. |
¿µ¹®³»¿ë (English Abstract) |
In this paper, the testability of combinational circuits generated by the logic synthesis tool FACTOR is considered using single stuck-at fault model. FACTOR generates circuits by recursively decomposing the inputs so that the connections between subcircuits become minimal, resulting in tree-type circuits. First, an effective fault detection algorithm is given. Also we show that these circuits are 100% testable, which demonstrates how FACTOR achieves the goal of 100% testability and easy test generation very easily compared to the other methods.
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|