¡¤½Ç½ÀÀÇ ¸ñÀû.
- boolean, switching, algebra, combinational logicÀÇ °³³äÀ» ÀÌÇØÇÑ´Ù.
- logicworks¸¦ ÀÌ¿ëÇÑ combinational ȸ·Î¸¦ µðÀÚÀÎÇÏ°í, ¼öÇàÇÑ´Ù..
- combinational ȸ·Î¿¡ ´ëÇÑ ÀÌÇػӸ¸ ¾Æ´Ï¶ó modularµðÀÚÀΠó¸®ÀÇ ´õ ³ªÀº ÀÌÇظ¦ ÇÑ´Ù.
¡¤combinational ³×Æ®¿öÅ©¿Í sequential ³×Æ®¿öÅ©
- combinational ³×Æ®¿öÅ© : ³í¸® °ÔÀÌÆ®¸¦ ±¸¼º, Çϳª ¶Ç´Â ±× ÀÌ»óÀÇ ºÒ¸° ÇÔ¼ö
. ºÒ¸°ÇÔ¼ö(boolean function) : ½Ã½ºÅÛÀÇ ÀÔ·ÂÀÌ Ãâ·Â¿¡ ¾î¶»°Ô ÀÛ¿ëÇÏ´ÂÁö¸¦ ³ªÅ¸³¿.
·Î Ç¥½Ã,
°ÅÀÇ ¸ðµç ½ºÀ§Äª Æã¼ÇÀ» ³ªÅ¸³¿.
¡©sequential ³×Æ®¿öÅ© : Áö¿¬, ±â¾ï ¿ä¼Ò¸¦ ±¸¼º, µðÁöÅ» ½Ã½ºÅÛÀÌ »ì¾ÆÀÖµµ·Ï ÇÔ.
¡¤µðÁöÅ» µðÀÚÀ̳ʰ¡ ½ÇÁ¦Àû °í¾È¹°À» ½ÇÇö ½ÃÅ°±â À§ÇØ µû¶ó¾ß ÇÒ ´Ü°èµé.
high-level
Definition
Logic definition
Simplified-logic
definition
Implementation
< µðÁöÅ» ȸ·Î µðÀÚÀÎ °úÁ¤ >
PART ¥°: THE FULL STORY ON THE FULL ADDER
¡Þ½ÇÇè 1¿¡¼± 1-bit °¡»ê±â¸¦ ¼³¸íÇß´Ù. À̹ø¿¡´Â full-adder¸¦ µðÀÚÀÎ Çغ¸ÀÚ..
ÃÖ¡¦(»ý·«)
|