¥È¥Ã¥×¥Ú¡¼¥¸¤Ø

Âè20²ó ²óÏ©¤È¥·¥¹¥Æ¥à·Ú°æÂô¥ï¡¼¥¯¥·¥ç¥Ã¥×
¥×¥í¥°¥é¥à

PDFÈÇ ¥×¥í¥°¥é¥à  PDFÈÇ Ìܼ¡

¥×¥í¥°¥é¥à:   ´ÊάÈÇ   ¾ÜºÙÈÇ
Ãø¼Ôº÷°ú:   HERE

²ñ¾ì¼õÉÕ»þ´Ö

2007ǯ4·î22Æü(Æü)18:00¡Á20:00
2007ǯ4·î23Æü(·î)8:00¡Á
2007ǯ4·î24Æü(²Ð)8:00¡Á


¥»¥Ã¥·¥ç¥óɽ

ɽÆâ¤Î¥»¥Ã¥·¥ç¥ó̾¤Ï¤½¤Î¥»¥Ã¥·¥ç¥ó¾ðÊó¤Ë¥ê¥ó¥¯¤·¤Æ¤¤¤Þ¤¹¡¥

2007ǯ4·î23Æü(·î) [²ñ¾ì: ·Ú°æÂô¥×¥ê¥ó¥¹¥Û¥Æ¥ë¡¦À¾´Û¡¦¹ñºÝ²ñµÄ¾ì Àõ´Ö]

ABaBdCD

¥Ç¥Ð¥¤¥¹¥â¥Ç¥ê¥ó¥°
8:35-10:15

¦¤¦²ÊÑÄ´´ï
9:00-10:15

¥·¥¹¥Æ¥à¼Â¸½µ»½Ñ
9:00-10:15

¥ì¥¤¥¢¥¦¥È
9:00-10:40

·Á¼°Åª¼êË¡
9:25-10:15

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥·¥ß¥å¥ì¡¼¥·¥ç¥óµ»½Ñ¤È¤½¤Î±þÍÑ
10:35-12:15

ÈóÀþ·¿²óÏ©
10:30-12:10

²èÁü½èÍý
10:35-12:15

[¥Á¥å¡¼¥È¥ê¥¢¥ë] ¥Æ¥¹¥ÈÀß·×
11:00-12:00

ÊÂÎóʬ»¶½èÍý
10:45-12:00

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¼ÂÁõÀß·×ÍÑ¥·¥ß¥å¥ì¡¼¥·¥ç¥ó
13:20-14:45

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥½¥Õ¥È¥¦¥§¥¢ÌµÀþµ»½Ñ¤Î³µÍ×¤ÈÆ°¸þ (1)
13:30-14:30

´ðÁᦲ»À¼½èÍý
13:30-15:10

¥¢¡¼¥­¥Æ¥¯¥Á¥ãÀ߷פÈÄãÅÅÎϲ½
13:30-14:45

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¿·À¤Âå¤Î·×»»¸Â³¦
13:30-15:00

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] À¸Ì¿ÂÎ¥·¥¹¥Æ¥à¤ÈÈóÀþ·Á¥À¥¤¥Ê¥ß¥¯¥¹
15:00-16:56

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥½¥Õ¥È¥¦¥§¥¢ÌµÀþµ»½Ñ¤Î³µÍ×¤ÈÆ°¸þ (2)
15:00-17:00

¥¤¥ó¥¿¥é¥¯¥Æ¥£¥Ö¥»¥Ã¥·¥ç¥ó
15:30-17:10

±é»»´ïÀß·×
15:20-17:00

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ·Á¼°¼êË¡¤Ë´ð¤Å¤¯ÊÂ¹Ô¥×¥í¥°¥é¥ß¥ó¥°
15:15-16:45

¾©Îå¾Þɽ¾´¼°
17:30-17:40 [²ñ¾ì: ĹÌî]
ÆÃÊ̾·ÂÔ¹Ö±é: ¡Ö¥Ó¥Ç¥ª¥«¥á¥éÍÑAVCHDµ¬³Ê¤ÎºöÄê¤Èº£¸å¤Î¥Ó¥Ç¥ª¥«¥á¥éư¸þ¡× µÈÀî ¹§Íº(¥½¥Ë¡¼³ô¼°²ñ¼Ò)
17:40-18:40 [²ñ¾ì: ĹÌî]
º©¿Æ²ñ
18:40-20:40 [²ñ¾ì: ĹÌî]


2007ǯ4·î24Æü(²Ð) [²ñ¾ì: ·Ú°æÂô¥×¥ê¥ó¥¹¥Û¥Æ¥ë¡¦À¾´Û¡¦¹ñºÝ²ñµÄ¾ì Àõ´Ö]

ABaBdCD

ÈóÀþ·Á²óÏ©¤Î²òÀϤÈÀß·×
8:45-10:15

¥¢¥Ê¥í¥°½¸ÀѲóÏ©¥Ö¥í¥Ã¥¯
9:00-10:15

¿®¹æ½èÍý±þÍÑ
9:00-10:15

¹â°Ì¹çÀ®
9:00-10:15

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¸Î¾ã¿ÇÃǤθ¦µæÆ°¸þ (1)
9:30-10:15

¥«¥ª¥¹¤È¤½¤Î±þÍÑ
10:30-12:20

ÅŸ»²óÏ©
10:30-11:45

¥Õ¥£¥ë¥¿´ðÁÃ
10:35-12:15

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] DFM (1)
10:35-12:00

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¸Î¾ã¿ÇÃǤθ¦µæÆ°¸þ (2)
10:30-12:00

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] DFM (2)
13:20-14:45


±ÇÁü±þÍÑ
13:15-14:55

¥·¥¹¥Æ¥àÀß·×¼êË¡
13:30-14:45

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥·¥¹¥Æ¥à¥Ð¥¤¥ª¥í¥¸¡¼
13:30-14:40

¥Ë¥å¡¼¥é¥ë¥·¥¹¥Æ¥à¤È¤½¤Î±þÍÑ
15:00-17:12


²èÁü±þÍÑ
15:10-16:50

[ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] DFM (3)
15:20-17:00

¥¢¥ë¥´¥ê¥º¥à
15:15-16:05




ÏÀʸ°ìÍ÷(¡Ö*¡×°õ¤ÏȯɽͽÄê¼Ô¤òɽ¤¹)


¥»¥Ã¥·¥ç¥ó A1-1 ¥Ç¥Ð¥¤¥¹¥â¥Ç¥ê¥ó¥°
Æü»þ: 2007ǯ4·î23Æü(·î) 8:35-10:15
ºÂĹ: º´Æ£ ¹â»Ë (Åìµþ¹©¶ÈÂç³Ø¡¡Åý¹ç¸¦µæ±¡)

Âê̾ÀèüMOSFETµ»½Ñ¤Ë¤ª¤±¤ëHiSIM2´ðÈÄÅÅή¥â¥Ç¥ë
Ãø¼Ô *°ð³À μ²ð(Áá°ðÅÄÂç³ØÂç³Ø±¡ ¾ðÊóÀ¸»º¥·¥¹¥Æ¥à¸¦µæ²Ê/ȾƳÂÎÍý¹©³Ø¸¦µæ¥»¥ó¥¿¡¼(³ô) ´ë²èÉô), Äç¶á ÎÑÉ×, Dondee Navvaro(¹­ÅçÂç³ØÂç³Ø±¡ Àèüʪ¼Á²Ê³Ø¸¦µæ²Ê), Q. Ngo, C.Y. Yang(¥µ¥ó¥¿¡¦¥¯¥é¥éÂç³Ø), »°±º Æ»»Ò(¹­ÅçÂç³ØÂç³Ø±¡ Àèüʪ¼Á²Ê³Ø¸¦µæ²Ê), °æ¾å Ì÷½©(Áá°ðÅÄÂç³ØÂç³Ø±¡ ¾ðÊóÀ¸»º¥·¥¹¥Æ¥à¸¦µæ²Ê)
Pagepp. 1 - 6
Keyword HiSIM2, ´ðÈÄÅÅή, ¥Ó¥Ë¥ó¥°, û¥Á¥ã¥Í¥ë
AbstractÀèüMOSFET¤Ë¤ª¤±¤ë´ðÈÄÅÅή¥â¥Ç¥ë¤òɽÌ̥ݥƥ󥷥ã¥ë¤ò¥Ù¡¼¥¹¤È¤¹¤ëʪÍý¥â¥Ç¥ëHiSIM2¤ËŬÍѤ·¤½¤ÎÄ󰯤ò¹Ô¤¦¡£¤³¤Î´ðÈÄÅÅή¥â¥Ç¥ë¤Ï¥¤¥ó¥Ñ¥¯¥È¥¤¥ª¥ó²½¤Ë¤è¤ë¥É¥ì¥¤¥ó-´ðÈÄ´Ö¤ËȯÀ¸¤¹¤ëÅÅή¤È¥È¥ó¥Í¥ê¥ó¥°ÅÅή¤Ç¤¢¤ë¥²¡¼¥È-´ðÈÄ´Ö¤ËȯÀ¸¤¹¤ëÅÅή¤Ë¤è¤ê¹½À®¤µ¤ì¤ë¡£Á´¤Æ¤ÎÁǻҥµ¥¤¥º¡¢Á´¤Æ¤Î¥Ð¥¤¥¢¥¹Å۵°Í¸À­¤ËÂФ·¤Æ¥Ó¥Ë¥ó¥°¤¹¤ë¤³¤È̵¤·¤Ë£²£±¸Ä¤Î¥Ñ¥é¥á¡¼¥¿¤Ç¬ÄêÃͤòÀµ³Î¤Ëɽ¸½¤¹¤ë¡£´ðÈÄÅÅή¤Ï¶ËÈùºÙû¥Á¥ã¥Í¥ëÁǻҤˤª¤¤¤Æ¥²¡¼¥ÈÅÅή¤è¤ê¤â½ÅÍפȤʤ롣

Âê̾ûµ÷Î¥¥Ö¥í¥Ã¥¯ÆâÇÛÀþ¤Î¼«¸ÊȯǮ
Ãø¼Ô *¿·³« ·ò°ì, ¶¶ËÜ ¾»µ¹, Èø¾å ¹§Íº(ÂçºåÂç³ØÂç³Ø±¡ ¾ðÊó²Ê³Ø¸¦µæ²Ê)
Pagepp. 7 - 12
Keyword ¼«¸ÊȯǮ, ²¹ÅÙ, ÇÛÀþ, ¥Ö¥í¥Ã¥¯ÆâÇÛÀþ, low-k ºàÎÁ
AbstractËÜÏÀʸ¤Ç¤Ï¡¤Ã»µ÷Î¥¥Ö¥í¥Ã¥¯ÆâÇÛÀþ¤Ë¤ª¤±¤ë¼«¸ÊȯǮ¸ú²Ì¤¬¥×¥í¥»¥¹¥¹¥±¡¼¥ê¥ó¥°¤Ëȼ¤Ã¤Æ¸²ºß²½¤¹¤ë¤«¤òͽ¬¤¹¤ë¡¥Ã»µ÷Î¥¥Ö¥í¥Ã¥¯ÆâÇÛÀþ¤Ï¡¤´ðÈĤ˶ᤤ¤¿¤áÍ¥¤ì¤¿ÊüÇ®À­¤ò»ý¤Á¡¤¼«¸ÊȯǮ¤Ï¾®¤µ¤¤¤È¹Í¤¨¤é¤ì¤Æ¤­¤¿¡¥¤·¤«¤·¡¤¥¯¥í¥Ã¥¯Ê¬ÇÛ¤òÁÛÄꤷ¤¿²òÀϤò¹Ô¤Ã¤¿¤È¤³¤í¡¤¥Ö¥í¥Ã¥¯ÆâÇÛÀþ¤Î¼«¸ÊȯǮ¤¬¥°¥í¡¼¥Ð¥ëÇÛÀþ¤Î¾ì¹ç¤è¤ê¤âÂ礭¤¯¤Ê¤ë¤³¤È¤ò³Îǧ¤·¤¿¡¥´ðÈÄÀܹçÉô²¹ÅÙ¤«¤é¤ÎÇÛÀþ¤ÎºÇÂç²¹Åپ徺¤Ï¡¤14 nm ¥×¥í¥»¥¹¤Ë¤ª¤¤¤Æ 40.5¡î ¤Ë¤â㤹¤ë¡¥Í×°øÊ¬ÀϤò¹Ô¤Ã¤¿·ë²Ì¡¤ÇÛÀþÃÇÌÌÀѤν̾®¤¬ low-k ºàÎÁ¤ÎºÎÍѤä¾ÃÈñÅÅÎÏÁýÂç¤ÈÆ±ÄøÅÙ¼«¸ÊȯǮ¤ò°­²½¤µ¤»¤ë¤³¤È¤¬Ê¬¤«¤Ã¤¿¡¥¤Þ¤¿¡¤¼«¸ÊȯǮ¤Ë¤è¤ê¡¤¿®ÍêÀ­Äã²¼¤ÈÀ­Ç½Îô²½¤¬À¸¤¸¤ë¡¥14 nm ¥×¥í¥»¥¹¤Ë¤ª¤¤¤ÆÇÛÀþ²¹ÅÙ¤ÈÀܹçÉô²¹ÅÙ¤òÅù¤·¤¤¤È¹Í¤¨¤¿¾ì¹ç¡¤¼ÂºÝ¤Î¸Î¾ã»þ´Ö¤ÏͽÁÛ¤è¤êÌó 3 - 10 ÇÜû¤¯¤Ê¤ê¡¤¿®¹æÃÙ±ä¤Ï 2.8% °­²½¤¹¤ë¡¥

Âê̾¿®ÍêÀ­ÊݾڤΤ¿¤á¤ÎNBTI¤Î¥â¥Ç¥ê¥ó¥°¤È¥·¥ß¥å¥ì¡¼¥·¥ç¥óÊýË¡
Ãø¼Ô *¹õÀî ÆØ(»°ÍÎȾƳÂÎ(³ô) SS»ö¶È¿ä¿ÊÅý³çÉô Àß·×µ»½ÑÉô), ÂçÅè ·é(¡Ê³ô¡Ë¥Æ¥£¥¨¥¹¥Æ¥£), ÌÚ¼ °Â¹Ô, µÜ²¼ ÇîÇ·, Æü·¨ ͵ÍÎ(»°ÍÎȾƳÂÎ(³ô) ¥Ç¥¸¥¿¥ë¥·¥¹¥Æ¥àÂè1»ö¶ÈÉô IP³«È¯Éô), ËÌÄÞ Ï½Ó(»°ÍÎȾƳÂÎ(³ô) S£Ó»ö¶È¿ä¿ÊÅý³çÉô ÉʼÁÊݾÚÉô), °ËÉô ůÌé(»°ÍÎȾƳÂÎ(³ô) SS»ö¶È¿ä¿ÊÅý³çÉô Àß·×µ»½ÑÉô)
Pagepp. 13 - 18
Keyword NBTI, HCI, Reliability, Simulation
Abstract¼ÂºÝ¤Î²óϩưºî¤ÎÊݾڤȤ¤¤¦´ÑÅÀ¤Ç¡¢Éé¥Ð¥¤¥¢¥¹²¹ÅÙÉÔ°ÂÄêÀ­¡ÊNBTI¡Ë¤Î¥ê¥«¥Ð¥ê¤ä¼þÇÈ¿ô¸ú²Ì¡¢¼Â¬¤Î¤Ð¤é¤Ä¤­¤òÁ´¤Æ¹Íθ¤·¤¿¸½¼ÂŪ¤Ê¥â¥Ç¥ê¥ó¥°¤òÄ󼨤¹¤ë¡£¤Þ¤¿¡¢¥Û¥Ã¥È¥­¥ã¥ê¥¢ÃíÆþ¡ÊHCI¡Ë¤Î¥Ç¥Ð¥¤¥¹Îô²½¤ÈÁȤ߹ç¤ï¤»¤Æ¿®ÍêÀ­¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤¹¤ëÊýË¡¤ò¼¨¤·¡¢ADC¤ËŬÍѤ·¤¿·ë²Ì¤ò¼¨¤¹¡£

Âê̾¥À¥ß¡¼¥Õ¥£¥ë¤¬¥ª¥ó¥Á¥Ã¥×ÇÛÀþ¤Î¹â¼þÇÈÆÃÀ­¤ËÍ¿¤¨¤ë±Æ¶Á¤Î²òÀÏŪɾ²Á¼êË¡
Ãø¼Ô *ÅÚë μ, ¾®Ìî»û ½¨½Ó(µþÅÔÂç³Ø)
Pagepp. 19 - 22
Keyword ¥À¥ß¡¼¥Õ¥£¥ë, ±²ÅÅή
AbstractËܹƤǤϡ¤¥À¥ß¡¼¥Õ¥£¥ë¤¬¥ª¥ó¥Á¥Ã¥×ÇÛÀþ¤ÎÆÃÀ­¤ËÍ¿¤¨¤ë±Æ¶Á¤ò²òÀÏŪ¤Ëɾ²Á¤¹¤ë¼êË¡¤òÄ󰯤¹¤ë¡¥ ¼þÇÈ¿ô¤¬10GHz¤òͤ¨¤ë¤è¤¦¤ÊÎΰè¤Ç¤Ï¡¤¥À¥ß¡¼¥Õ¥£¥ë¤Ï ÇÛÀþÍÆÎ̤À¤±¤Ç¤Ê¤¯ÇÛÀþÄñ¹³¤Ë¤â±Æ¶Á¤òÍ¿¤¨¤ë¤è¤¦¤Ë¤Ê¤ê¡¤¤½¤Î±Æ¶Á¤Ï̵»ë¤Ç¤­¤Ê¤¤¡¥ °ìÊý¡¤¥À¥ß¡¼¥Õ¥£¥ë¤ÏÁÞÆþ¤µ¤ì¤ë¿ô¤¬ËÄÂç¤Ç¤¢¤ë¤¿¤á¡¤ Åż§³¦²òÀϤòÍѤ¤¤Æ¤â¤½¤Î±Æ¶Á¤òɾ²Á¤¹¤ë¤Ë¤ÏÂ礭¤Ê·×»»µ¡»ñ¸»¤ª¤è¤Ó·×»»»þ´Ö¤¬É¬ÍפǤ¢¤ë¡¥ Ä󰯼êË¡¤Ï¥À¥ß¡¼¥Õ¥£¥ëÆâ¤Ëή¤ì¤ëÅÅή¤ò¥â¥Ç¥ë²½¤¹¤ë¤³¤È¤Ç¡¤ ¥À¥ß¡¼¥Õ¥£¥ë¤¬ÇÛÀþÄñ¹³¤ËÍ¿¤¨¤ë±Æ¶Á¤ò²òÀÏŪ¤ËƳ½Ð¤¹¤ë¡¥ ¼Â¬¤ª¤è¤Ó3¼¡¸µ¤ÎÅż§³¦²òÀϤȤÎÈæ³Ó¤«¤é¡¤Ä󰯼êË¡¤¬ ¥À¥ß¡¼¥Õ¥£¥ë¤Î±Æ¶Á¤ò¹â¤¤ÀºÅ٤Ǹ«ÀѤâ¤ì¤ë¤³¤È¤ò³Îǧ¤·¤¿¡¥


¥»¥Ã¥·¥ç¥ó A1-2 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥·¥ß¥å¥ì¡¼¥·¥ç¥óµ»½Ñ¤È¤½¤Î±þÍÑ
Æü»þ: 2007ǯ4·î23Æü(·î) 10:35-12:15
ºÂĹ: °æ¾å Ì÷½© (Áá°ðÅÄÂç³Ø)

Âê̾(¾·ÂÔ)¥Á¥Ã¥×¡¿¥Ñ¥Ã¥±¡¼¥¸¡¿¥Ü¡¼¥ÉÅý¹çÀ߷פ˸þ¤±¤¿Åŵ¤·Ï¥·¥ß¥å¥ì¡¼¥·¥ç¥óµ»½Ñ¤Î¸½¾õ¤È¾­ÍèŸ˾
Ãø¼Ô *Àõ°æ ½¨¼ù(ÀŲ¬Âç³Ø¹©³ØÉô)
Pagepp. 23 - 27
Keyword SPICE, »°¼¡¸µ²òÀÏ, ¥·¥°¥Ê¥ë¡¦¥¤¥ó¥Æ¥°¥ê¥Æ¥£, ¥Ñ¥ï¡¼¡¦¥¤¥ó¥Æ¥°¥ê¥Æ¥£, Åý¹ç²½´Ä¶­
Abstractºòº£¤Î²óÏ©¤Î¹âÌ©ÅÙ²½¤È¹â®²½¤Ï¡¢À߷ס¢¼ÂÁõ¤Ë¤ª¤±¤ë¥Þ¡¼¥¸¥ó¤ò¾®¤µ¤¯¤·¤Æ¤ª¤ê¡¢¹âÀºÅÙ¡¦¹âÉʼÁ¤¬Í׵ᤵ¤ì¤Æ¤¤¤ë¡£¤½¤³¤Ç¡¢½ÅÍפȤʤäÆÍ褿¤Î¤¬À߷פ«¤é¼ÂÁõ¤Þ¤Ç¤Î¿Íͤʿ®¹æ¡¿ÅŸ»¤ÎÉʼÁÊݾڤǤ¢¤ë¡£ËܹƤǤϡ¢¤Þ¤ººÇ½é¡¢¥Á¥Ã¥×¡¦¥Ñ¥Ã¥±¡¼¥¸¡¦¥Ü¡¼¥ÉÀ߷פˤª¤±¤ëºòº£¤Î¥Ñ¥ï¡¼¡¿¥·¥°¥Ê¥ëÉʼÁÊݾÚÌäÂê¤òÀ°Íý¤·¤¿¾å¤Ç¡¢¹â®¥Ç¥£¥¸¥¿¥ë»þÂå¤Î¥·¥ß¥å¥ì¡¼¥·¥ç¥óµ»½Ñ¤Î¸½¾õ¤Èº£¸å¤ÎŸ˾¤Ë¤Ä¤¤¤Æ½Ò¤Ù¤ë¡£¤µ¤é¤Ë¡¢Åý¹ç²½¸¡¾Ú¥·¥¹¥Æ¥à¤ÎɬÍ×À­¤È¤½¤Î¹½Ãۤ˸þ¤±¤ÆÉ¬ÍפȤʤ뵻½Ñ¤Ë¤Ä¤¤¤Æ¸ÀµÚ¤¹¤ë¡£

Âê̾An Efficient Variable Gain Homotopy Method Using the SPICE-Oriented Approach
Ãø¼Ô *Wataru Kuroki, Kiyotaka Yamamura, Shingo Furuki(Chuo University)
Pagepp. 29 - 34
Keyword Circuit simulation, nonlinear circuit, SPICE, homotopy method
AbstractHomotopy methods are known to be effective methods for finding DC operating points of nonlinear circuits with the theoretical guarantee of global convergence. There are several types of homotopy methods; as one of the efficient methods, the variable gain homotopy (VGH) method is well-known. However, in the conventional VGH method, the initial point is sometimes far from the solution because it is given as a solution of a diode circuit. In this paper, we propose an efficient VGH method using the SPICE-oriented approach. The proposed method can be easily implemented on SPICE without programming, although we do not know the homotopy method well. Moreover, since we can use a good initial point, the path following tends to become smooth and efficient.

Âê̾Index Reduction for Differential-Algebraic Equations in Circuit Simulation
Ãø¼Ô *Mizuyo Takamatsu(University of Tokyo), Satoru Iwata(Kyoto University)
Pagepp. 35 - 40
Keyword DAE, index reduction, circuit simulation, hybrid analysis
AbstractDifferential-algebraic equations (DAEs) naturally arise in many applications, but present numerical and analytical difficulties. The index of a DAE is a measure of the degree of numerical difficulty. In this paper, we propose two index reduction methods for linear DAEs with constant coefficients. One is applicable to all DAEs having at most one derivative per equality. This method always reduces the index exactly by one. The other one, applicable to DAEs in circuit simulation, minimizes the index of the DAE to be solved in the hybrid analysis.


¥»¥Ã¥·¥ç¥ó A1-3 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¼ÂÁõÀß·×ÍÑ¥·¥ß¥å¥ì¡¼¥·¥ç¥ó
Æü»þ: 2007ǯ4·î23Æü(·î) 13:20-14:45
ºÂĹ: ²£¹Â ¹ä°ì (¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸)

Âê̾(¾·ÂÔ)¥Ñ¥ï¡¼¥¤¥ó¥Æ¥°¥ê¥Æ¥£¤ÈÅŸ»¥³¥â¥ó¥â¡¼¥ÉEMI¥·¥ß¥å¥ì¡¼¥·¥ç¥ó
Ãø¼Ô *¿ÜÆ£ ½ÓÉ×((³ô)Åì¼Ç À¸»ºµ»½Ñ¥»¥ó¥¿¡¼), ¶úÊ¿ ¹§¿®(¥Þ¥Ë¥å¥Õ¥¡¥¯¥Á¥ã¥ê¥ó¥° ¥½¥ê¥å¡¼¥·¥ç¥ó(³ô))
Pagepp. 41 - 44
Keyword ¥Ñ¥ï¡¼¥¤¥ó¥Æ¥°¥ê¥Æ¥£, EMI, ¥³¥â¥ó¥â¡¼¥É, ÅŸ»
AbstractÅŸ»ÊÑÆ°¤òµ¯¤¹¥Ñ¥ï¡¼¥¤¥ó¥Æ¥°¥ê¥Æ¥£¤Î£²¤Ä¤Î¦Ì̤ò¤ò¤¢¤²¡¢LSI¤ÎÅŸ»Ã¼»Ò¤«¤éή¤ì¤ë¹â¼þÇÈÅÅή¤¬¥Ü¡¼¥É¤ÎÅŸ»/GNDÌ̤òÍɤ¹¤ë¤³¤È¤Ë¤è¤êÀ¸¤¸¤ë¥³¥â¥ó¥â¡¼¥ÉEMI¤Î²òÀÏ¡¦Í½Â¬¼êË¡¤Ë¤Ä¤¤¤Æ½Ò¤Ù¤ë¡£

Âê̾Áê´Ø·¸¿ô¤Ë¤â¤È¤Å¤¯²óµ¢Ê¬ÀϤÎÅŸ»²þÁ±¤Ø¤ÎŬÍÑ
Ãø¼Ô *Ç븶 ¼®, ¾å±ò ¹ª, º´Æ£ ¹â»Ë, ±× °ìºÈ(Åìµþ¹©¶ÈÂç³Ø Åý¹ç¸¦µæ±¡)
Pagepp. 45 - 50
Keyword ÅŸ»Å۵¹ß²¼, ÅŸ»ÌÖ, Áê´Ø·¸¿ô, ²óµ¢Ê¬ÀÏ
Abstract²óϩưºî¤Ë¤è¤êLSI Æâ¤ÎÅŸ»ÌÖ¤ËÅ۵ÊÑÆ°¤¬À¸¤¸¤ë ¾ì¹ç¡¤³Æ½ê¤ÎÅ۵¤ÏÆÈΩ¤Ç¤Ï¤Ê¤¯¸ß¤¤¤ËÁê´Ø¤¹¤ë¡¥ÅÅ ¸»ÌÖÀ߷פÎÎÉÈݤòɾ²Á¤¹¤ë»ØÉ¸¤È¤·¤Æ¡¤Å۵ÊÑÆ°¤Î Áê´Ø·¸¿ô¤ÎÊ¿¶ÑÃͤÎÍøÍѤò¸¡Æ¤¤¹¤ë¡¥Áê´Ø¤Î¶¯¼å¤Ï ³ÆÀáÅÀ´Ö¤ÎÄñ¹³¤äµ÷Î¥¤Ë°Í¸¤¹¤ë¤Î¤Ç¡¤ÅŸ»Ì֤ˤª ¤¤¤ÆÀܳ¤¬½½Ê¬¤Ç¤Ê¤¤¾ì½ê¤ÎŦ½Ð¤¬¤Ç¤­¤ë¡¥¤Þ¤¿¡¤²ó µ¢Ê¬ÀϤòÊ»ÍѤ·¡¤ÅŸ»ÌÖÆâ¤Ë¤ª¤¤¤Æ¥¯¥í¥Ã¥¯¥¿¥¤¥ß ¥ó¥°²þÁ±¤Ë¸ú²ÌŪ¤Ê½¤Àµ²Õ½ê¤ò»ØÅ¦¤¹¤ëÊýË¡¤òÄó°Æ ¤¹¤ë¡¥¥¯¥í¥Ã¥¯¥¹¥­¥å¡¼Ä㸺¤òÌÜŪ¤È¤·¤¿ÅŸ»ÌÖ²þ Á±¤òÎã¤È¤·¤Æ¡¤ÅŸ»Ì֤κÇÂ祹¥­¥å¡¼¤ò20%Ä㸺¤Ç ¤­¤ë¤³¤È¤ò¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤ËÍѤ¤¤Æ¼¨¤¹¡¥Ä󰯼ê Ë¡¤Ï¡¤À߷פÎÁᤤÃʳ¬¤Ë¤ª¤±¤ëÅŸ»Ì֤κÇŬ²½¤ËÍ­ ¸ú¤Ç¤¢¤ë¡¥

Âê̾CIPË¡¤òÍѤ¤¤¿Â¿Æ³ÂÎͭ»¼ºÅÁÁ÷ÀþÏ©¤Î²áÅϲòÀÏ
Ãø¼Ô *ÅÏîµ µ®Ç·(ÀŲ¬¸©Î©Âç³Ø·Ð±Ä¾ðÊó³ØÉô), ¼»³ ÉÒÉ×(¥½¥Ë¡¼³ô¼°²ñ¼Ò)
Pagepp. 51 - 56
Keyword ÅÁÁ÷ÀþÏ©, ¥·¥°¥Ê¥ë¥¤¥ó¥Æ¥°¥ê¥Æ¥£, CIPË¡, ²óÏ©¥·¥ß¥å¥ì¡¼¥·¥ç¥ó
AbstractËÜÏÀʸ¤Ç¤Ï¡¢CIP(Constrained Interpolation Profile)Ë¡¤ò¿ƳÂÎͭ»¼ºÅÁÁ÷ÀþÏ©¤Î²áÅϲòÀϤËŬÍѤ·¤¿·ë²Ì¤Ë¤Ä¤¤¤Æ¡¢¤½¤Î²òÀÏÀºÅ٤ˤĤ¤¤Æ¹Í»¡¤¹¤ë¡£ÅÁÁ÷ÀþÏ©¤òÇÈÆ°ÊýÄø¼°¤Ë´ð¤Å¤¤¤ÆÄê¼°²½¤·¤¿¾ì¹ç¡¢°Üή¹à¤Î¼è¤ê°·¤¤¤¬²ò¤ÎÀºÅÙ¤ËÂ礭¤¯±Æ¶Á¤¹¤ë¡£1¼¡¤ÎÉ÷¾åº¹Ê¬¤ËÈæ³Ó¤·¤Æ3¼¡ÀºÅÙ¤ò»ý¤ÄCIPË¡¤òŬÍѤ·¤¿¾ì¹ç¡¢ÅÁÈÂÇÈ·Á¤Î¥×¥í¥Õ¥¡¥¤¥ë¤¬ÀºÅ٤褯ÊÝ»ý¤µ¤ì¤ë¤³¤È¤ò¼¨¤¹¡£¤Þ¤¿¡¢Ã±°ìƳÂηϤËÈæ³Ó¤·¤ÆÂ¿Æ³ÂηϤβòÀϤˤª¤¤¤Æ¡¢¤è¤êCIPË¡¤ÎŬÍѤ¬Í­¸ú¤Ç¤¢¤ë¤³¤È¤ò¼¨¤¹¡£


¥»¥Ã¥·¥ç¥ó A1-4 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] À¸Ì¿ÂÎ¥·¥¹¥Æ¥à¤ÈÈóÀþ·Á¥À¥¤¥Ê¥ß¥¯¥¹
Æü»þ: 2007ǯ4·î23Æü(·î) 15:00-16:56
ºÂĹ: Ä»»ô ¹°¹¬ (ÂçºåÂç³ØÂç³Ø±¡´ðÁù©³Ø¸¦µæ²Ê)

Âê̾(¾·ÂÔ)¥Ò¥È±¿Æ°À©¸æ¤Î·×»»ÏÀŪ¥¢¥×¥í¡¼¥Á¤«¤éBMI¤Ø
Ãø¼Ô *ÏÂÅÄ °Â¹°(Ĺ²¬µ»½Ñ²Ê³ØÂç³Ø¹©³ØÉôÅŵ¤·Ï)
Pagepp. 57 - 62
Keyword ¥Ò¥ÈÏÓ±¿Æ°À©¸æ, ·×»»ÏÀŪ¥¢¥×¥í¡¼¥Á, BMI
AbstractËܹƤǤϡ¤¤³¤ì¤Þ¤Ç²æ¡¹¤¬¹Ô¤Ã¤Æ¤­¤¿¥Ò¥ÈÏÓ±¿Æ°À©¸æ¤Ë¤ª¤±¤ëµ°Æ»·×²è¤Ë´Ø¤¹¤ë·×»»ÏÀŪ¥¢¥×¥í¡¼¥Á¤Î³µÍס¤NIRS¤ò»È¤Ã¤¿BMI¥·¥¹¥Æ¥à¤Î¹½ÃÛÎ㡤¤ª¤è¤Ó¤³¤ì¤é¤òƧ¤Þ¤¨¤Æ¤Î²æ¡¹¤Î¸¦µæ·×²è¤Ë¤Ä¤¤¤ÆÊó¹ð¤¹¤ë¡¥

Âê̾²¾Á۴Ķ­Æâ³Ø½¬¥·¥¹¥Æ¥à¤òÍѤ¤¤¿¼Â¶õ´Ö¤Î¥í¥Ü¥Ã¥È¤Î¥¿¥¹¥¯³Ø½¬
Ãø¼Ô *·ªËÜ ·ò°ì(Ĺ²¬µ»½Ñ²Ê³ØÂç³Ø), ¿ù»³ ¹¸°ì(Åì¼Ç¥Æ¥Ã¥¯¡Ê³ô¡Ë), ÄÚº¬ Àµ, ÏÂÅÄ °Â¹°(Ĺ²¬µ»½Ñ²Ê³ØÂç³Ø)
Pagepp. 63 - 68
Keyword ²¾Á۴Ķ­, ³Ø½¬À©¸æ, ¶¯²½³Ø½¬, ¥í¥Ü¥Æ¥£¥¯¥¹, ÅÝΩ¿¶»Ò
Abstract¶¯²½³Ø½¬¤Ï¥í¥Ü¥Ã¥È¤¬¼«¤é»î¹Ôºø¸í¤·¤ÆÀ©¸æÂ§¤ò³ÍÆÀ¤¹¤ë³Ø½¬¼êË¡¤È¤·¤ÆÃíÌܤµ¤ì¤Æ¤¤¤ë¡¥ ¤·¤«¤·¡¤¼ÂÍÑŪ¤Ë¤ÏËþ­¤Ê¥¿¥¹¥¯Æ°ºî¤òÆÀ¤ë¤Þ¤Ç¤ÎËÄÂç¤Ê³Ø½¬²ó¿ô¤òɬÍפȤ¹¤ëÅù¡¤¥í¥Ü¥Ã¥È¤Ë»î¹Ôºø¸íŪ³Ø½¬¤ò¼Â¶õ´Ö¤Ç¹Ô¤ï¤»¤ë¤³¤È¤Ïº¤Æñ¤Ç¤¢¤ë¾ì¹ç¤¬Â¿¤¤¡¥ ËÜÏÀʸ¤Ç¤Ï¤³¤ÎÌäÂê¤ËÂн褹¤ë¤¿¤á¤Ë¡¤¼Â¶õ´Ö¤Î¥í¥Ü¥Ã¥È¤Ë²¾ÁÛ¶õ´ÖÆâ¤ËÍѰդµ¤ì¤¿ÂоݤòÁàºî¤·¤Æ¥¿¥¹¥¯Æ°ºî¤ò³Ø½¬¡¦³ÍÆÀ¤µ¤»¡¤²¾ÁÛ¶õ´Ö¤Ç¤Î³Ø½¬¸å¤Ë¼Â¶õ´Ö¤Ø°Ü¹Ô¤µ¤»¤ë¥·¥¹¥Æ¥à¤òÄ󰯤¹¤ë¡¥ ¼Â¶õ´Ö¤Î¥í¥Ü¥Ã¥È¤¬ÆþÎϥǥХ¤¥¹¤òÄ̤·¤Æ²¾ÁÛ¶õ´ÖÆâ¤Î¥¿¥¹¥¯¤ò³ÍÆÀ²Äǽ¤Ç¤¢¤ë¤³¤È¤òÅÝΩ¿¶»ÒÀ©¸æ¤òÎã¤Ë¼¨¤¹¡¥ ¤Þ¤¿¡¤²¾ÁÛ¶õ´ÖÍøÍѤ¬¼Â¶õ´Ö¤Ç¤Î¥í¥Ü¥Ã¥È¤Î¼Â¥¿¥¹¥¯³ÍÆÀ¤Î¤¿¤á¤ÎÍ­¸ú¤Ê¼êÃʤǤ¢¤ë¤³¤È¤ò¼¨¤¹¡¥

Âê̾²¾ÁÛÇ´¶Ý¥â¥Ç¥ë¤Ë¤è¤ëÌÂϩõº÷¥»¥ë¥ª¡¼¥È¥Þ¥È¥ó¤Î¸¡Æ¤
Ãø¼Ô *ËÌÆâ ͪ²ð, ÃÓÊÕ ¾­Ç·(Ë̳¤Æ»Âç³Ø Âç³Ø±¡¾ðÊó²Ê³Ø¸¦µæ²Ê)
Pagepp. 69 - 73
Keyword ¥»¥ë¥ª¡¼¥È¥Þ¥È¥ó, ÌÂϩõº÷, ²¾ÁÛÇ´¶Ý, ¥È¥Ý¥í¥¸¡¼
AbstractËܸ¦µæ¤ÎÌÜŪ¤Ï,Èó¥Î¥¤¥Þ¥ó·¿¥¢¡¼¥­¥Æ¥¯¥Á¥ã¤Ç¤¢¤ë¥»¥ë¥ª¡¼¥È¥Þ¥È¥ó¤òÍѤ¤¤Æ,À¸ÂÖŪ¤Êưºî¤òÁȤ߹þ¤ßÌÂϩõº÷¤ò¸úΨ¤è¤¯¹Ô¤¦¥¢¥ë¥´¥ê¥º¥à¤ò³«È¯¤¹¤ë¤³¤È¤Ç¤¢¤ë¡¥¥»¥ë¥ª¡¼¥È¥Þ¥È¥ó¤Ï,ÊÂÎóʬ»¶·Ï¤Î¥¢¡¼¥­¥Æ¥¯¥Á¥ã¤Ç¤¢¤ê,Áê¸ßºîÍѤò¹Ô¤¦Ã±°Ì¥»¥ë¤¬µ¬Â§Åª¤Ëʤó¤À¹½Â¤¤ò»ý¤Ã¤Æ¤¤¤ë.ŬÀÚ¤ÊÁê¸ßºîÍѥ롼¥ë¡Ê¥¢¥ë¥´¥ê¥º¥à¡Ë¤òÀßÄꤹ¤ë¤³¤È¤Ç,ÍÍ¡¹¤Ê¶õ´Ö¥Ñ¥¿¡¼¥ó¤òÀ¸À®¤¹¤ë¤³¤È¤¬¤Ç¤­¤ë. Ëܸ¦µæ¤Ç¤Ï¤Þ¤º,¥»¥ë¥ª¡¼¥È¥Þ¥È¥ó¤Ë¥È¥Ý¥í¥¸¡¼Êݸ½èÍý¤òŬ¹ç¤µ¤»¤ë.¼¡¤Ë¾åµ­½èÍý¥¢¥ë¥´¥ê¥º¥à¤ò²þÎɤ·¤Æ,Ç´¶Ý¤Î¤è¤¦¤ÊÀ¸ÂÎÌϵ¼¤ò¥»¥ë¥ª¡¼¥È¥Þ¥È¥ó¤Ç¹Ô¤¤,ÌÂÏ©¤ÎºÇû·Ðϩõº÷¥¢¥ë¥´¥ê¥º¥à¤Î¼Â¸½¤òÌܻؤ¹.¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê5¾õÂ֤ΤߤÇÌÂÏ©¾å¤ÎºÇû·Ðϩõº÷¤¬²Äǽ¤Ç¤¢¤ë¤³¤È¤ò³Îǧ¤·¤¿¡¥

Âê̾Parameter Determination of a Compartmental Model for Parkinson's disease by Algebraic approach
Ãø¼Ô *µÈÅÄ ´²(¶å½£Âç³Ø ¿ôÍý³Ø¸¦µæ±¡ ¹âÅù¸¦µæµ¡¹½), ·ê°æ ¹¨ÏÂ(ÉÙ»ÎÄ̸¦µæ½ê¡Ê³ô¡Ë/CREST JST.), ËÙËÜ ¾¡µ×(»º¶Èµ»½ÑÁí¹ç¸¦µæ½ê À¸Ì¿¾ðÊ󹩳إ»¥ó¥¿)
Pagepp. 75 - 80
Keyword Compartmental models, Groebner base, Parkinson's disease, Without blood sampling, Symbolic computation
AbstractThe mechanism of Parkinson's disease can be investigated at the molecular level by using radiotracers. The concentration of dopamine in the brain can be observed by using a radiotracer, and the dopamine kinetics can be described as compartmental models --- network of compartments interconnected by physiology-describing arrows --- for tissues of the brain. The models for dopamine kinetics are solved explicitly, but the solution shows a complicated form including several convolutions over time domain. Owing to the complicated form of the solution, some kinetic constants have been estimated under various assumptions and only a limited set of parameters have approximately been estimated. We have analysed the compartmental models by using the Laplace transformation of differential equations and by algebraic computation with the aid of Groebner base constructions. We have obtained a rigorous solution with respect to the kinetic constants over Laplace domain. Such a analysis over Laplace domain will shed some light on more complex compartmental models.


¥»¥Ã¥·¥ç¥ó Ba1-1 ¦¤¦²ÊÑÄ´´ï
Æü»þ: 2007ǯ4·î23Æü(·î) 9:00-10:15
ºÂĹ: ¾¾Ã« ¹¯Ç· (ÀÄ»³³Ø±¡Âç³Ø)

Âê̾RF¥µ¥ó¥×¥ê¥ó¥°Ï¢Â³»þ´Ö¥Ð¥ó¥É¥Ñ¥¹¦¤¦²ÊÑÄ´´ï¤ÎÀß·×ÏÀ
Ãø¼Ô *¸µß· ÆÆ»Ë, À¶¿å °ìÌé, ¾å¿¹ ¾­Ê¸(·²ÇÏÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê), ¥í¥ì ¥Ñ¥¹¥«¥ë(¥·¥ã¡¼¥×³ô¼°²ñ¼Ò), ¹â¶¶ Íβð(·²ÇÏÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê), ÈÓÄÍ Ë®É§(¥·¥ã¡¼¥×³ô¼°²ñ¼Ò), ¾®ÎÓ ½ÕÉ×, »± Úß, ¹â°æ ¿­ÏÂ(·²ÇÏÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê), ²¬ËÜ Ä¾¼ù, À¾ÅÄ ½¤Â¤(¥·¥ã¡¼¥×³ô¼°²ñ¼Ò)
Pagepp. 81 - 86
Keyword RF ¥µ¥ó¥×¥ê¥ó¥°, ¥½¥Õ¥È¥¦¥§¥¢ÌµÀþ, ¥Ð¥ó¥É¥Ñ¥¹, Ϣ³»þ´Ö¦¤¦²ÊÑÄ´´ï, RF DAC
Abstract¤³¤ÎÏÀʸ¤Ç¤ÏRF ¿®¹æ¤òľÀÜ¥µ¥ó¥×¥ê¥ó¥°¤¹¤ëÏ¢ ³»þ´Ö¥Ð¥ó¥É¥Ñ¥¹¦¤¦²ADÊÑÄ´´ï¤ÎÀß·×ÏÀ¤Ë¤Ä¤¤¤Æ½Ò¤Ù¤ë. (i) Àè¤ËÄ󰯤·¤¿RF DAC ¤òÍѤ¤¤¿¥µ¥Ö¥µ¥ó¥×¥ê¥ó¥°£² ¼¡Ï¢Â³»þ´Ö¥Ð¥ó¥É¥Ñ¥¹¦¤¦²ADÊÑÄ´´ï¤ò½êÄê¤Î¿®¹æÅÁã´Ø ¿ô, ¥Î¥¤¥ºÅÁã´Ø¿ô¤Ë¤Ê¤ë¤¿¤á¤ÎÆâÉô¥Ñ¥é¥á¡¼¥¿ÃͤÎÀß·× Ë¡¤òƳ½Ð¤·¤¿. (ii) Ϣ³»þ´Ö­ù­ôÊÑÄ´´ï¤Ç¤ÏÆâÉôADC ¤Î ½ÐÎÏ¤ÈÆâÉôDAC ¤Î½ÐÎϤδ֤Υ롼¥×ÃÙ±ä¤Ë¤è¤êAD ÊÑ Ä´´ïÁ´ÂΤÎÀºÅÙ¤¬Îô²½¤¹¤ë¤¬, ¤³¤ÎÌäÂê¤ò·Ú¸º¤¹¤ë¤¿¤á¤Ë ¥ë¡¼¥×ÃÙ±ä¤ò¥¿¥¤¥à¥Ç¥¸¥¿¥¤¥¶¤Ç¬Äꤷ, ¤½¤ÎÃͤ˴ð¤Å¤­ ¥Ñ¥é¥á¡¼¥¿ÃͤòÄ´À°¤¹¤ë¼êË¡¤òÄ󰯤·¤¿. ¤³¤ì¤é¤ÎÍ­¸úÀ­ ¤òMATLAB ¤Î¤è¤ë¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ç³Îǧ¤·¤¿.

Âê̾¥Ï¡¼¥â¥Ë¥Ã¥¯¥ß¥­¥µµ¡Ç½¤òÍ­¤¹¤ë¦¤¦²ADC¤Î¸¡Æ¤
Ãø¼Ô *Ìøß· ·Ã»°(Ë¡À¯Âç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê), °ÂÅÄ ¾´(Ë¡À¯Âç³Ø), »³Ãæ Íβð, ¾ï¸« ÂîÌé(Ë¡À¯Âç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê)
Pagepp. 87 - 92
Keyword ¥Ï¡¼¥â¥Ë¥Ã¥¯¥ß¥­¥µ, Ϣ³»þ´Ö¦¤¦²ÊÑÄ´´ï
Abstract¤³¤ÎÏÀʸ¤Ç¤Ï¡¢¹â¼þÇȤòľÀÜADÊÑ´¹¤¹¤ë¤¿¤á¤Î²óÏ©¹½À®¤òÄ󰯤¹¤ë¡£¥Ï¡¼¥â¥Ë¥Ã¥¯¥ß¥­¥µ¡¢Ï¢Â³»þ´Ö¦¤¦²ÊÑÄ´´ï¡¢¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤È¤¤¤¦²óÏ©¹½À®¤ÇADÊÑ´¹¤ò¹Ô¤¦¡£¤³¤Î¤è¤¦¤Ê¹½À®¤Ç¡¢¥Ï¡¼¥â¥Ë¥Ã¥¯¥ß¥­¥µ½ÐÎϤιâÄ´ÇÈÀ®Ê¬¤Ï¡¢Ï¢Â³»þ´Ö¦¤¦²ÊÑÄ´´ï¤Î¥¢¥ó¥Á¥¨¥¤¥ê¥¢¥·¥ó¥°ÆÃÀ­¤Ë¤è¤êÂÓ°è³°¤Ë¥·¥Õ¥È¤¹¤ë¡£¤³¤ì¤Ë¤è¤ê¼þÇÈ¿ôÊÑ´¹¸å¤ËµÞ½Ô¤ÊÆÃÀ­¤Î¥¢¥Ê¥í¥°¥Õ¥£¥ë¥¿¤òÍѤ¤¤ë¤³¤È¤Ê¤¯¹â¼þÇȤÎADÊÑ´¹¤¬²Äǽ¤È¤Ê¤ë¡£¤³¤ì¤òMATLAB¤Î¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê³Îǧ¤·¤¿¡£¤·¤«¤·¡¢Ï¢Â³»þ´Ö¦¤¦²´ï¤Ï¡¢¥¯¥í¥Ã¥¯¥¸¥Ã¥¿¤ËÉÒ´¶¤Ç¤¢¤ë¡£¤½¤³¤Ç¦¤¦²ADC¤Ë¤ª¤±¤ë¥¯¥í¥Ã¥¯¥¸¥Ã¥¿¤Î±Æ¶Á¤òÄ㸺¤¹¤ë¤¿¤á¡¢½éÃʤÎÀÑʬ´ï¤ØÆþÎϤµ¤ì¤ë¥¢¥Ê¥í¥°¿®¹æ¤ò½ÐÎϤ¹¤ëDAC¤ÎľÁ°¤ËLPF¤òÁÞÆþ¤·¡¢ÆâÉôDAC¤Î¥¯¥í¥Ã¥¯¥¸¥Ã¥¿¤Î±Æ¶Á¤òÄ㸺¤Ç¤­¤ë¥ë¡¼¥×¹½À®¤ò»ý¤Ä¦¤¦²ÊÑÄ´´ï¤ò¹Í°Æ¤·¤¿¡£ ËÜÏÀʸ¤Ç¤Ï¡¢ÁêÂÐŪ¤Ê¥·¥¹¥Æ¥à¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤ò¹Ô¤¦¤¬¡¢²¾¤Ë¥¯¥í¥Ã¥¯¤ò400MHz¡¢ÂÓ°è¤ò1.5MHz¡¢¥¯¥í¥Ã¥¯¥¸¥Ã¥¿0¡Á0.1¡ó¤Î¤È¤­¡¢¥Ô¡¼¥¯SNR¤¬107dB¤òãÀ®¤·¤¿¤³¤È¤ò¼¨¤¹¡£

Âê̾2¼¡¦¤¦²ADÊÑÄ´´ï¤Î¿·¥Õ¥£¡¼¥É¥Õ¥©¥ï¡¼¥É¹½À®¤ÎÄó°Æ
Ãø¼Ô *¾®Ä¹Ã« È¥, »± Úß, ½ù Êö, ¸µß· ÆÆ»Ë, ¾®ÎÓ ½ÕÉ×(·²ÇÏÂç³Ø Åŵ¤ÅŻҹ©³Ø²Ê), °ÂÆ£ ÏÂÀµ, µÈÅÄ Çî»Ë, ¼»³ ÃλٿÍ(Åì¼ÇLSI¥·¥¹¥Æ¥à¥µ¥Ý¡¼¥È(³ô))
Pagepp. 93 - 98
Keyword ¦¤¦²AD ÊÑÄ´´ï, ¥Õ¥£¡¼¥É¥Õ¥©¥ï¡¼¥É, ¥¹¥¤¥Ã¥Á¥É¡¦¥­¥ã¥Ñ¥·¥¿²óÏ©, ¥Þ¥ë¥Á¥Ó¥Ã¥È
Abstract¤³¤ÎÏÀʸ¤Ç¤Ï¥Õ¥£¡¼¥É¥Õ¥©¥ï¡¼¥É·¿Î¥»¶»þ´Ö2¼¡¦¤¦²ADÊÑÄ´´ï¤Î¿·¤·¤¤¹½À®Ë¡¤òÄ󰯤¹¤ë¡£¦¤¦²ADÊÑÄ´´ï¤Ï¥ª¡¼¥Ð¡¼¥µ¥ó¥×¥ê¥ó¥°¤È¥Î¥¤¥º¥·¥§¡¼¥×¼êË¡¤Ç¹âÀºÅÙ¤ÎADÊÑ´¹¤ò¼Â¸½¤¹¤ë¤¬¡¢¤½¤ÎÁ´ÂÎÀ­Ç½ (SNDR : Signal-to-Noise and Distotion Ratio) ¤ÏÆþÎÏ¿®¹æ¥À¥¤¥Ê¥ß¥Ã¥¯¥ì¥ó¥¸¤È³Æ¥Ö¥í¥Ã¥¯²óÏ©¤ÎÈóÍýÁÛŪ¤ÊÀ­¼Á(ÆÃ¤Ë¥ª¥Ú¥¢¥ó¥×²óÏ©¤ÎÏÄÆÃÀ­) ¤Ë¤è¤Ã¤ÆÀ©¸Â¤µ¤ì¤ë¡£½¾Íè¼°¤Î¥Õ¥£¡¼¥É¥Ð¥Ã¥¯·¿¦¤¦²ADÊÑÄ´´ï¤ËÈæ¤Ù¡¢¥Õ¥£¡¼¥É¥Õ¥©¥ï¡¼¥É·¿¦¤¦²ADÊÑÄ´´ï¤Ç¤Ï¡¢ÊÑÄ´´ïÆâÉô¿®¹æ¤Î¿¶Éý¤¬¾®¤µ¤¤¤¿¤á¡¢ÆþÎÏ¿®¹æ¤Î¥À¥¤¥Ê¥ß¥Ã¥¯¥ì¥ó¥¸¤òÂ礭¤¯¤Ç¤­¡¢¥ª¥Ú¥¢¥ó¥×¤ÎÏĤˤè¤ëÊÑÄ´´ï¤ÎÀ­Ç½Îô²½¤¬·Ú¸º¤Ç¤­¤ë¡£¤·¤«¤·¤Ê¤¬¤é¡¢½¾Íè¤Î¥Õ¥£¡¼¥É¥Õ¥©¥ï¡¼¥É·¿¦¤¦²ADÊÑÄ´´ïÆâ Éô¤Ç¤Ï¡¢Èæ³Ó´ï²óÏ©¤ÇADÊÑ´¹¤ò¹Ô¤Ê¤¦Á°¤Ë¡¢ÊÑÄ´´ï¤ÎÆþÎÏÅ۵¤È³ÆÀÑʬ´ï¤Î½ÐÎÏÅ۵¤ò²Ã»»¤¹¤ëɬÍפ¬¤¢¤ë¡£¤½¤Î±é»»¤ò¹Ô¤Ê¤¦¤¿¤á¡¢¥¹¥¤¥Ã¥Á¥É¡¦¥­¥ã¥Ñ¥·¥¿¤È¥ª¥Ú¥¢¥ó¥×²óÏ©¤òÄɲ乤ëɬÍפ¬¤¢¤ê¡¢¥Á¥Ã¥×ÌÌÀѤȾÃÈñÅÅÎϤ¬Áý²Ã¤¹¤ë¡£¤½¤³¤Ç¡¢ËÜÏÀʸ¤Ç¤ÏÅ۵²Ã»»ÍÑ¥ª¥Ú¥¢¥ó¥×¤ÏɬÍפȤ·¤Ê¤¤¡¢¥Õ¥£¡¼¥É¥Õ¥©¥ï¡¼¥É·¿¦¤¦²ADÊÑÄ´´ï¤Î¹½À®Ë¡¤È¤½¤Î²óÏ©¼Â¸½¼êË¡¤òÄ󰯤·¡¢¤è¤ê¾®ÌÌÀÑ¡¦Äã¾ÃÈñÅÅÎϤΦ¤¦²ADÊÑÄ´´ï¤Î¼Â¸½¤ò²Äǽ¤Ë¤·¤¿¡£MATLAB ¤ÈSPICE ¤Ë¤è¤ë¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤ÇÄ󰯼êË¡¤ÎÍ­¸úÀ­¤ò³Îǧ¤·¤¿¡£


¥»¥Ã¥·¥ç¥ó Ba1-2 ÈóÀþ·¿²óÏ©
Æü»þ: 2007ǯ4·î23Æü(·î) 10:30-12:10
ºÂĹ: º´Æ£ ¹­À¸ (ÅìµþÍý²ÊÂç³Ø)

Âê̾A Fast Lock Phase-Locked Loop with a Continuous-Time Phase Frequency Detector
Ãø¼Ô *Jun Pan, Yasuaki Inoue(Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 99 - 103
Keyword PLL, fast locking, continuous-time, PFD
AbstractA continuous-time phase frequency detector (PFD) based on the conventional tri-state PFD is proposed for fast lock charge pump phase-locked loops (CPPLLs) in this paper. The locking time of the PLL can be substantially reduced with the proposed continuous-time architecture. During the period that the best tracing and acquisition properties are required, the bandwidth of the PLL can be increased to decrease the locking time with the proposed continuous-time PFD. Afterwards, the bandwidth of the PLL is recovered to the original value to minimize output jitter due to external noise. Any conventional tri-state PFDs can be improved with the proposed continuous-time architecture. The proposed architecture is realized in a standard CMOS 0.35 um technology. The simulation results demonstrate that the proposed continuous-time PFD is effective to get more speedy locking time.

Âê̾Stability Analysis of Nonlinear Feedback Circuits
Ãø¼Ô *Zhangcai Huang, Fayan Wang, Shuai Fang, Xuetao Sun, Yasuaki Inoue(Waseda University)
Pagepp. 105 - 110
Keyword nonlinear circuits, feedback
AbstractIn this paper the stability analysis of nonlinear feedback circuits is presented. By analyzing the influence of dominant pole of feedback path on the frequency response of feedback circuits, the suitable locations of the dominant pole are proposed for different feedback path gain. Also several design criteria are given to keep the nonlinear feedback circuit stable. Moreover, the experimental results of several nonlinear feedback circuits show that the proposed criteria can improve the stability of feedback circuits very well.

Âê̾¥á¥­¥·¥«¥ó¥Ï¥Ã¥È·¿¤Î»þ´ÖÁë¤ò¼¨¤¹¥¢¥Ê¥í¥°²óÏ©¥â¥Ç¥ë¤Î¹½ÃÛ
Ãø¼Ô *À¶¿å μ(ÆüËÜÂç³Ø Íý¹©³ØÉô ÅŻҾðÊ󹩳زÊ), ÎÓ Í´¸ã(ÆüËÜÂç³Ø Íý¹©³Ø¸¦µæ²Ê ÅŻҹ©³ØÀì¹¶), º´Çì ¾¡ÉÒ, ´Øº¬ ¹¥Ê¸(ÆüËÜÂç³Ø Íý¹©³ØÉô ÅŻҾðÊ󹩳زÊ)
Pagepp. 111 - 115
Keyword STDP, Ĺ´üÁý¶¯, Ĺ´üÍÞ°µ, ¥á¥­¥·¥«¥ó¥Ï¥Ã¥È·¿, »þ´ÖÁë
Abstract¡¡¥·¥Ê¥×¥¹²ÄÁºÀ­¤Ë¤ª¤±¤ëĹ´üÁý¶¯(LTP)¤äĹ´üÍÞ°µ(LTD)¤Ï¡¤Ç¾¤Îµ­²±¡¦³Ø½¬¤È¤¤¤Ã¤¿µ¡Ç½¤Î´ðÁòáÄø¤È¤µ¤ì¤Æ¤¤¤ë¡£ ¡¡¶áǯ¡¤À¸ÂΤˤª¤¤¤Æ¥·¥Ê¥×¥¹Á°¸å¤Î¥Ë¥å¡¼¥í¥ó¤Î¥¹¥Ñ¥¤¥¯¤Î»þ´Öº¹¤Ë°Í¸¤·¤¿¥·¥Ê¥×¥¹²ÄÁºÀ­(STDP)¤Î¸ºß¤¬Êó¹ð¤µ¤ì¤Æ¤¤¤ë¡£Ãæ¤Ç¤â¡¤¥·¥Ê¥×¥¹Á°È¯²Ð¤ÇĹ´üÁý¶¯¤Îµ¯¤³¤ë»þ´ÖÎΰè¤Î¸å¤ËĹ´üÍÞ°µ¤Îµ¯¤³¤ëÎΰ褬¸ºß¤¹¤ë¥á¥­¥·¥«¥ó¥Ï¥Ã¥È·¿¤Î»þ´ÖÁ뤬Êó¹ð¤µ¤ì¤Æ¤¤¤ë¡£ ¡¡ËܹƤϡ¤¥·¥Ê¥×¥¹Á°È¯²Ð¤ÇĹ´üÁý¶¯¤Îµ¯¤³¤ë»þ´ÖÎΰè¤Î¸å¤ËĹ´üÍÞ°µ¤Îµ¯¤³¤ë»þ´ÖÎΰ褬¸ºß¤¹¤ë¥·¥Ê¥×¥¹²ÄÁºÀ­¤ËÃåÌܤ·¡¤¹©³ØÅª±þÍѤòÌÜŪ¤Ë¡¤¥á¥­¥·¥«¥ó¥Ï¥Ã¥È·¿¤Î»þ´ÖÁë¤ò¼¨¤¹¥¢¥Ê¥í¥°²óÏ©¥â¥Ç¥ë¤Î¹½ÃۤˤĤ¤¤Æ¸¡Æ¤¤ò¹Ô¤Ã¤¿¤â¤Î¤Ç¤¢¤ë¡£

Âê̾A High-Precision Strain-Measurement Bridge Circuit System with On-line Digital Calibration
Ãø¼Ô *Masashi Kono, Tetsuya Taura, Takahide Suzuki, Hiroshi Sunaga, Yoshihisa Yamada, Keigo Kimura(Electronic Engineering Department, Gunma University), Masanao Morimura(Consultant), Haruki Okano, Masami Iwazaki, Hiroyuki Takuno, Mitsumasa Suzuki, Yukio Shinoda(Tokyo Sokki Kenkyujo Co., Ltd.), Haruo Kobayashi(Electronic Engineering Department, Gunma University)
Pagepp. 117 - 122
Keyword Strain Measurement, Strain Gauge, Bridge Circuit, Calibration
AbstractThis paper describes high-precision dynamic strain measurement bridge circuits with on-line calibration of parasitic capacitance effects. The proposed calibration system is very reliable and robust against temperature change because most of the calibration is done in digital domain.


¥»¥Ã¥·¥ç¥ó Ba1-3 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥½¥Õ¥È¥¦¥§¥¢ÌµÀþµ»½Ñ¤Î³µÍ×¤ÈÆ°¸þ (1)
Æü»þ: 2007ǯ4·î23Æü(·î) 13:30-14:30
ºÂĹ: ÈÄÁÒ Å¯Ï¯ (Åì¼Ç)

Âê̾(¾·ÂÔ)¥½¥Õ¥È¥¦¥¨¥¢ÌµÀþµ»½Ñ¤Î´ðÁÃ
Ãø¼Ô *¹ÓÌÚ ½ãÆ»(Åìµþ¹©¶ÈÂç³Ø)
Pagepp. 123 - 124
Keyword SDR, ¥Þ¥ë¥Á¥Ð¥ó¥É, ¥Þ¥ë¥Á¥â¡¼¥É, ¥Þ¥ë¥Á¥µ¡¼¥Ó¥¹
Abstract¥½¥Õ¥È¥¦¥¨¥¢ÌµÀþµ¡¤ò¼Â¸½¤¹¤ë¾å¤Ç¤Îµ»½Ñ²ÝÂê¤ò̵Àþµ¡¤Î´ðËܵ¡Ç½¤Ç¤¢¤ëÊÑÉüÄ´¡¢È¯¿¶¡¢¼þÇÈ¿ôÊÑ´¹¡¢ÁýÉý¡¢¥Õ¥£¥ë¥¿¥ê¥ó¥°¡¢Êü¼Í¡¦¼õ¿®¤Î³Æ¹àÌܤËÂФ·¤Æ³µ´Ñ¤·¡¢²óÏ©À߷פÎÌÜɸ¤òÄ󼨤¹¤ë¡£ ÆÃ¤Ë½¾Íè¤Î̵Àþµ¡À߷פȤÎÁê°ãÅÀ¤ò»ØÅ¦¤·¡¢¥½¥Õ¥È¥¦¥¨¥¢ÌµÀþµ¡¤Ë¤è¤Ã¤Æ¤â¤¿¤é¤µ¤ì¤ë¿·¤¿¤Ê̵ÀþÄÌ¿®¥Í¥Ã¥È¥ï¡¼¥¯¹½À®¤Ë¤â¸ÀµÚ¤¹¤ë¡£


¥»¥Ã¥·¥ç¥ó Ba1-4 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥½¥Õ¥È¥¦¥§¥¢ÌµÀþµ»½Ñ¤Î³µÍ×¤ÈÆ°¸þ (2)
Æü»þ: 2007ǯ4·î23Æü(·î) 15:00-17:00
ºÂĹ: ÈÄÁÒ Å¯Ï¯ (Åì¼Ç)

Âê̾(¾·ÂÔ)¥½¥Õ¥È¥¦¥§¥¢ÌµÀþ¤ò»Ø¸þ¤·¤¿¿®¹æ½èÍý¤È̵Àþµ¡¹½À®
Ãø¼Ô *ÎëÌÚ ¹¯É×(ÅìµþÇÀ¹©Âç³Ø ¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê), Äḫ Çî»Ë((³ô)Åì¼Ç)
Pagepp. 125 - 130
Keyword ¥À¥¤¥ì¥¯¥È¥³¥ó¥Ð¡¼¥¸¥ç¥ó, ¥¹¡¼¥Ñ¡¼¥Ø¥Æ¥í¥À¥¤¥ó, ¥½¥Õ¥È¥¦¥¨¥¢ÌµÀþ, PHS, Àþ·ÁÊÑÄ´
Abstract¡¡ÌµÀþµ¡¤Î¾®·Á²½¡¢Äã²Á³Ê²½¤Î´ÑÅÀ¤«¤é¡¢¥À¥¤¥ì¥¯¥È¥³¥ó¥Ð¡¼¥¸¥ç¥óÊý¼°¤ËÃåÌܤ·¡¢½¾Íè¤Î¥Ø¥Æ¥í¥À¥¤¥óÊý¼°¤È¤Î¥È¥ì¡¼¥É¥ª¥Õ¤ò¹Ô¤¦¡£¼¡¤Ë¡¢¥À¥¤¥ì¥¯¥È¥³¥ó¥Ð¡¼¥¸¥ç¥óÊý¼°¤òÀþ·ÁÊÑÄ´¤ËŬÍѤ·¤¿¾ì¹ç¤Î²ÝÂê¤ÈÂкö¤òÀ°Íý¤·¡¢PHS¤Ø¤ÎŬÍÑÎã¤ò¼¨¤¹¡£ºÇ¸å¤Ë¡¢¥½¥Õ¥È¥¦¥§¥¢ÌµÀþµ¡¤È¥Þ¥ë¥Á¥â¡¼¥É̵Àþµ¡¤Î°ã¤¤¤òÀâÌÀ¤·¡¢¥À¥¤¥ì¥¯¥È¥³¥ó¥Ð¡¼¥¸¥ç¥óÊý¼°¤¬¥½¥Õ¥È¥¦¥§¥¢ÌµÀþµ¡¤Ë¸þ¤¤¤Æ¤¤¤ë¤³¤È¤ò¼¨¤¹¡£

Âê̾(¾·ÂÔ)¥ê¥³¥ó¥Õ¥£¥®¥å¥é¥Ö¥ëRF²óÏ©µ»½Ñ¤Î¸¦µæ
Ãø¼Ô *±× °ìºÈ, ²¬ÅÄ ·ò°ì(Åìµþ¹©¶ÈÂç³Ø)
Pagepp. 131 - 135
Keyword RF CMOS, ŽØŽºŽÝŽÌލޏŽÞŽ×ŽÌŽÞŽÙ, VCO
Abstract¥ï¥¤¥ä¥ì¥¹µ»½Ñ¤ÎµÞ®¤Ê¿Ê²½¤È¤È¤â¤Ë¡¢¿ôÉ´MHz¤«¤é¿ôGHz¤Ë¤ª¤¤¤Æ¡¢¥Ç¥¸¥¿¥ëTV¡¢·ÈÂÓÅÅÏá¢LAN¤Ê¤ÉÍÍ¡¹¤Ê¥ï¥¤¥ä¥ì¥¹µ¬³Ê¤¬º®ºß¤·¤Æ¤¤¤ë¡£Ä̾ʣ¿ô¤Îµ¬³Ê¤ËÂбþ¤¹¤ë¾ì¹ç¡¢Ê£¿ô¤Î²óÏ©¤òÅëºÜ¤·¤Æ¤¤¤ë¡£Ã±°ì¤Î²óÏ©¤ÇÊ£¿ô¤Îµ¬³Ê¤ä°Û¤Ê¤ë¼þÇÈ¿ô¤ËÂбþ¤Ç¤­¤ë¥Þ¥ë¥Á¥¹¥¿¥ó¥À¡¼¥É¡¿¥Þ¥ë¥Á¥â¡¼¥É̵Àþ²óÏ©¤Î³«È¯¤Ï´üÂԤι⤤µ»½ÑʬÌî¤Ç¤¢¤ë¡£ËܹƤǤϡ¢É®¼Ô¤é¤¬Ìܻؤ¹¥ê¥³¥ó¥Õ¥£¥°¥é¥Ö¥ëRF CMOS²óÏ©µ»½Ñ¤ÈºÇ¶á³«È¯¤·¤¿¹­ÂÓ°èVCO¤ÎÀ­Ç½¤Ë¤Ä¤¤¤Æ¾Ò²ð¤¹¤ë¡£


¥»¥Ã¥·¥ç¥ó Bd1-1 ¥·¥¹¥Æ¥à¼Â¸½µ»½Ñ
Æü»þ: 2007ǯ4·î23Æü(·î) 9:00-10:15
ºÂĹ: Êõ¼î»³ ¼£ (NEC)

Âê̾A High-speed Design of Montgomery Multiplier
Ãø¼Ô *Yibo Fan, Takeshi Ikenaga, Satoshi Goto(Waseda University)
Pagepp. 137 - 142
Keyword Montgomery multiplier, rsa, high speed, scalable, high radix
AbstractThis paper proposes a high speed design of high radix Montgomery multiplier. There are three contributions in this paper: Firstly, in the algorithm level, a modified scalable Montgomery multiplication algorithm is proposed. Secondly, a novel pipeline data flow is used to reduce pipeline latency between stages. Thirdly, in order to reduce silicon area and power, a compact architecture for Montgomery multiplier is proposed. An ASIC implementation by using 0.25¦Ìm technology can perform 1024-bit RSA encryption with 352 kbps, and the frequency is 180 MHz, the area is about 130 k gates.

Âê̾ÃϾå¥Ç¥¸¥¿¥ë£Ô£ÖÊüÁ÷¤Ë¤ª¤±¤ë2DÊä´Ö¥Õ¥£¥ë¥¿¤òÍѤ¤¤¿ÅÁÁ÷Ï©¿äÄê¤Ë´Ø¤¹¤ë°ì¸¡Æ¤
Ãø¼Ô ºä¸ý Í´²ð, Ä¹Èø ͦʿ(¶å½£¹©¶ÈÂç³ØÂç³Ø±¡¾ðÊ󹩳ظ¦µæ²Ê¾ðÊó¥·¥¹¥Æ¥àÀì¹¶), *¹õºê Àµ¹Ô, ÈøÃÎ Çî(¶å½£¹©¶ÈÂç³Ø¾ðÊ󹩳ØÉôÅŻҾðÊ󹩳زÊ)
Pagepp. 143 - 148
Keyword ÃϾå¥Ç¥¸¥¿¥ëTVÊüÁ÷, 2¼¡¸µ¥Õ¥£¥ë¥¿, ÅÁÁ÷Ï©¿äÄê
AbstractËÜÏÀʸ¤Ç¤Ï¡¤É®¼Ô¤é¤¬Àè¤ËÄ󰯤·¤¿¡¤ÃϾå¥Ç¥¸¥¿¥ëTVÊüÁ÷¤Î°ÜưÂμõ¿®¤Ë¤ª¤±¤ë¡¤ÈóÀµÊýÄ̲á°è¤ò»ý¤ÄÈóʬΥ2¼¡¸µ¥Õ¥£¥ë¥¿¤òÍѤ¤¤ë¹âÀºÅÙ¤ÎÅÁÁ÷Ï©¿äÄêË¡¤Ë´Ø¤·¤Æ¡¤¥Á¥ã¥Í¥ëÊÑÆ°¤Ë´Ø¤¹¤ë¹Í»¡¤ò¹Ô¤¦¡¥Àè¤ËÄ󰯤·¤¿¥Õ¥£¥ë¥¿Àß·×¼êË¡¤Ï³Ê»Ò¤Î¤ß¤Ë°Í¸¤¹¤ë¤â¤Î¤Ç¤¢¤ë¤¬¡¤¥Á¥ã¥Í¥ëÊÑÆ°¤Ë±þ¤¸¤Æ¥Õ¥£¥ë¥¿Ä̲á°è¤òŬ±þŪ¤ËÊѹ¹¤¹¤ë¤³¤È¤Ë¤è¤ê¡¤¼õ¿®ÆÃÀ­¤ò²þÁ±¤¹¤ë¤³¤È¤¬²Äǽ¤Ç¤¢¤ë¡¥·×»»µ¡¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê¤¤¤¯¤Ä¤«¤ÎÅÁÁ÷Ï©´Ä¶­¤ÎÊѲ½¤ËÂФ¹¤ë¼õ¿®ÆÃÀ­¤ÎÊѲ½¤òÌÀ¤é¤«¤Ë¤¹¤ë¡¥²Ã¤¨¤Æ¡¤´Ä¶­¤ÎÊѲ½¤ËÂбþ¤·¤¿Å¬±þŪ¤Ê¥Õ¥£¥ë¥¿À߷פλؿˤò¼¨¤¹¡¥

Âê̾ROI¥Þ¥¹¥¯¤òÍѤ¤¤¿JPEG2000¤Ë¤ª¤±¤ëROI¤Î²è¼ÁÀ©¸æ
Ãø¼Ô *Ë̱º ²Å¹À, ÃæÀ¾ ¹î¾», Åï°Â ¼Â¼£(´ØÀ¾Âç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê)
Pagepp. 149 - 154
Keyword JPEG2000, ROI, ²è¼ÁÀ©¸æ, É乿²½´ï, ROI¥Þ¥¹¥¯
AbstractJPEG2000¤Ë¤Ï¡¤ROI¡ÊRegion of Interest¡Ë¤È¸Æ¤Ð¤ì¤ë¡¤²èÁü¤Î¶½Ì£Îΰè¤òÇØ·ÊÎΰè¤è¤ê¤âÍ¥À褷¤ÆÉ乿²½¤Ç¤­¤ëµ¡Ç½¤¬¤¢¤ë¡¥¤·¤«¤·¡¤Äã¥Ó¥Ã¥È¥ì¡¼¥È°µ½Ì¤Î¾ì¹ç¡¤¶½Ì£Îΰè¤ÎÉ乿Î̤¬É乿¥Ç¡¼¥¿¤ÎÂçÉôʬ¤òÀê¤á¤Æ¤·¤Þ¤¦¤¿¤á¡¤ÇØ·ÊÎΰè¤Î²è¼Á¤¬Îô²½¤¹¤ë¡¥¤³¤ÎÌäÂê¤ò²ò·è¤·¡¤¶½Ì£Îΰè¤ÈÇØ·ÊÎΰè¤ÎÁêÂÐŪ¤Ê²è¼ÁÀ©¸æ¤ò²Äǽ¤È¤·¤¿¼êË¡¤¬¤¤¤¯¤Ä¤«Ä󰯤µ¤ì¤Æ¤¤¤ë¡¥¤·¤«¤·¡¤¤½¤ì¤é¤Ï¶½Ì£Îΰè¤ÈÇØ·Ê¤ÎÁêÂÐŪ¤Ê²è¼Á¤òºÙ¤«¤¯À©¸æ¤¹¤ë¤³¤È¤¬¤Ç¤­¤Ê¤«¤Ã¤¿¡¥ËܹƤǤϡ¤¤³¤Î¶½Ì£Îΰè¤ÈÇØ·ÊÎΰè¤Î´Ö¤Î¤è¤êºÙ¤«¤Ê²è¼ÁÀ©¸æ¤ò¡¤É乿²½´ï¤ÎROI¥Þ¥¹¥¯¤òÍøÍѤ¹¤ë¤³¤È¤Ë¤è¤Ã¤Æ²Äǽ¤È¤·¤¿¼êË¡¤òÄ󰯤¹¤ë¡¥


¥»¥Ã¥·¥ç¥ó Bd1-2 ²èÁü½èÍý
Æü»þ: 2007ǯ4·î23Æü(·î) 10:35-12:15
ºÂĹ: µ×ÊÝÅÄ ¾´ (Åìµþ¹©¶ÈÂç³Ø)

Âê̾¥Õ¥ê¥Ã¥«¤È¥Ö¥í¥Ã¥Á¤Î±Æ¶Á¤ò¹Íθ¤·¤ÆºîÀ®¤·¤¿»²¾È²èÁü¤òÍѤ¤¤¿M¿äÄê¤Ë¤è¤ë¹â®¤Ê¥Õ¥ê¥Ã¥«¥Ñ¥é¥á¡¼¥¿¿äÄê
Ãø¼Ô *°¤Éô Àµ±Ñ, ÀîËô νÂÀ, ÀîËô À¯À¬(ÅìËÌÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê)
Pagepp. 155 - 160
Keyword ±ÇÁü½¤Éü, ¥Õ¥ê¥Ã¥«¥Ñ¥é¥á¡¼¥¿¿äÄê, »²¾È²èÁü
AbstractËܹƤǤϡ¤¸Å¤¤¥Õ¥£¥ë¥à±ÇÁü¤Ë¤ª¤¤¤Æ¡¤¥Õ¥ê¥Ã¥«¤È¥Ö¥í¥Ã¥Á¤ò¹Íθ¤·¤¿»²¾È²èÁü¤ÎºîÀ®Ë¡¤È¡¤¤½¤Î»²¾È²èÁü¤òÍѤ¤¤¿M¿äÄê¤Ë¤è¤ë¥Õ¥ê¥Ã¥«¥Ñ¥é¥á¡¼¥¿¿äÄêË¡¤òÄ󰯤¹¤ë¡¥ »²¾È²èÁü¤Ï¡¤»þ´Ö¼´¾å¤Ë¤ª¤±¤ë¥Õ¥ê¥Ã¥«¤ä¥Ö¥í¥Ã¥Á¤Îµ±ÅÙÃÍÊѲ½¤ÎÀ­¼Á¤«¤é¡¤¦Á-¥È¥ê¥à¥ÉÊ¿¶ÑÃÍ¥Õ¥£¥ë¥¿¤òÍѤ¤¤¿»þ´ÖÊý¸þ¥Õ¥£¥ë¥¿¥ê¥ó¥°¤Ë¤è¤Ã¤ÆÆÀ¤é¤ì¤ë¡¥ ¤³¤Î»²¾È²èÁü¤È½¾Íè¤ÎM¿äÄê¤òÍѤ¤¤¿¥Õ¥ê¥Ã¥«¥Ñ¥é¥á¡¼¥¿¿äÄêË¡¤òÍѤ¤¤ë¤³¤È¤Ç¡¤¹â®¤Ê¥Õ¥ê¥Ã¥«¥Ñ¥é¥á¡¼¥¿¿äÄê¤ò¼Â¸½¤¹¤ë¡¥ ¿Í¹©Åª¤Ë¥Õ¥ê¥Ã¥«¤òÉղä·¤¿±ÇÁü¤Î½¤Éü¼Â¸³¤Ë¤ª¤¤¤Æ¡¤Äó°ÆË¡¤Ç¤Ï½¾ÍèË¡¤ÈÈæ³Ó¤·¤Æ·×»»»þ´Ö¤¬19ʬ¤Î1¤Ë²þÁ±¤µ¤ì¤¿¡¥

Âê̾±ÇÁüÉ乿²½¤Î¤¿¤á¤ÎľÀþ°ÌÁêľ¸òÈóʬΥ¥¦¥§¡¼¥Ö¥ì¥Ã¥ÈÊÑ´¹¤ÈÏĤߤÎÁê´Ø
Ãø¼Ô *°Âã ½¼¹¬, Èæ´ë Ë­(¿·³ãÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê), ¼¾¾ Àµ¸ã, µÆÃÓ µ×ÏÂ(¿·³ãÂç³Ø¹©³ØÉô)
Pagepp. 161 - 166
Keyword ¥¦¥§¡¼¥Ö¥ì¥Ã¥È, ±ÇÁüÉ乿²½, ÈóʬΥ¥Õ¥£¥ë¥¿¥Ð¥ó¥¯
AbstractËܸ¦µæ¤Ç¤Ï, ±ÇÁüÉ乿²½¤Î¤¿¤á¤ÎÎ¥»¶¥¦¥§¡¼¥Ö¥ì¥Ã¥ÈÊÑ´¹(DWT) ¤Ë¤ª¤¤¤ÆÄ¾¸òÀ­¤Î½ÅÍ×À­¤ò¼¨¤¹. ¤Þ¤¿, 2¼¡¤Î¥Ð¥Ë¥Ã¥·¥ó¥°¥â¡¼¥á¥ó¥È¤òÍ­¤¹¤ëľÀþ°ÌÁêľ¸òÈóʬΥDWT ¤Î¥é¥Æ¥£¥¹¹½À®¤Ë´ð¤Å¤¯¿·¤¿¤ÊÀß·×Ë¡¤òÄ󰯤¹¤ë. JPEG2000 ¤Ç»È¤ï¤ì¤Æ¤¤¤ëDWT¤Ï, ±ÇÁü±þÍѤˤª¤¤¤Æ²â¾õ¤Î»ë³ÐŪ¤ÊÎô²½¤òÀ¸¤¸¤ë. º£²ó, ¥é¥ó¥À¥à¥µ¥Ö¥Ð¥ó¥É¿®¹æ¤òºÆ¹½À®¤¹¤ë¼Â¸³¤ò¤È¤ª¤·¤Æ,¤³¤ÎÌäÂê¤Î¸¶°ø¤ò»ØÅ¦¤¹¤ë¤È¶¦¤Ë, ²ò·èË¡¤È¤·¤ÆÄ¾Àþ°ÌÁêľ¸òÈóʬΥDWT ¤ÎƳÆþ¤¬Í­¸ú¤Ç¤¢¤ë¤³¤È¤ò¼¨¤¹. ľ¸òÀ­¡¦½ÅÊ£À­¡¦Ä¾Àþ°ÌÁêÆÃÀ­¤ÎÁ´¤Æ¤òËþ¤¿¤¹ÈóʬΥDWT¤Ï, ½¾Íè¤ÎDWT¤È¤Ï°Û¤Ê¤ê, ¥é¥ó¥À¥à¥µ¥Ö¥Ð¥ó¥É¿®¹æ¤ÎºÆ¹½À®²èÁü¤¬Î¥»¶¥³¥µ¥¤¥óÊÑ´¹(DCT)¤ÈƱÍͤË̵Áê´ØÀ­¤òÊݸ¤¹¤ë¤³¤È¤ò¼¨¤¹. ¤Þ¤¿, ¼ÂºÝ¤Î¥Õ¥ì¡¼¥à²èÁü¤òÍѤ¤¤¿¼Â¸³¤Ë¤è¤ê, ľ¸òÀ­¤ÈÏĤߤÎÁê´Ø¤È¤Î´Ø·¸¤ò»ë³ÐŪµÚ¤Ó¿ôÃÍŪ¤Ë¸¡Æ¤¤¹¤ë.

Âê̾ÈóÂоλ»½ÑÊ¿¶Ñ¤È¿§ÁêÊѲ½¤ÎÊ¿³ê²½¤Ë¤è¤ë¥«¥é¡¼¥Ç¥â¥¼¥¤¥·¥ó¥°
Ãø¼Ô *¹â¶¶ Á±¼÷, ³« ·òÂÀϯ, µÆÃÓ µ×ÏÂ, ¼¾¾ Àµ¸ã(¿·³ãÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê)
Pagepp. 167 - 172
Keyword ¥Ç¥â¥¼¥¤¥·¥ó¥°, ¥Ç¥£¥¸¥¿¥ë¥«¥á¥é
AbstractËܹƤǤÏBayerÇÛÎóñÈļ°»£Áü¥Ç¥Ð¥¤¥¹¤«¤éÆÀ¤é¤ì¤ë¥â¥¶¥¤¥¯²èÁü¤ËÂФ¹¤ë¥«¥é¡¼¥Ç¥â¥¼¥¤¥·¥ó¥°¼êË¡¤È¤·¤ÆÈóÂоλ»½ÑÊ¿¶ÑÊä´Ö¤È¿§ÁêÊѲ½¤ÎÊ¿³ê²½¤Î2Ãʳ¬¤«¤é¤Ê¤ë¥«¥é¡¼¥Ç¥â¥¼¥¤¥·¥ó¥°¤òÄ󰯤¹¤ë¡¥»Ï¤á¤ËÊä´ÖÂоݲèÁǤζá˵¤Ë¤ª¤¤¤Æ¿§ºÌɸËÜÃͤȤÎÊý¸þÀ­º¹Ê¬¤«¤é¥¨¥Ã¥¸Êý¸þ¤ò¿äÄꤷ¤¿¤Î¤Á¡¤¥¨¥Ã¥¸¾å¤Î¤¤¤º¤ì¤ÎÊý¸þ¤È¤ÎϢ³À­¤¬¹â¤¤¤«¤ò¿äÄꤹ¤ë¡¥¤³¤ì¤Ë¤â¤È¤Å¤¤¤ÆÄê¿§Á긶Íý¤òËþ¤¿¤¹¤è¤¦¤Ê¶õ´ÖŪ¤ËÈóÂоΤʲýŻ»½ÑÊ¿¶Ñ¤È¤·¤Æ·çÍî¿§ºÌÃͤòÊä´Ö¤¹¤ë¡¥¼¡¤Ë¡¤Êä´Ö¤Ë¤è¤Ã¤ÆÆÀ¤é¤ì¤¿²èÁü¤ËȯÀ¸¤¹¤ëµ¶¿§¤Î¸¶°ø¤Ç¤¢¤ëÄê¿§Á긶Íý¤ÎÉÔÀµ¤ò¿§Áê¤ÎÊ¿³ê²½¤Ë¤è¤ê½¤Àµ¤¹¤ë¡¥¼Â¸³Åª¤ÊÀ­Ç½¤Ë¤Ä¤¤¤Æ¡¤PSNR¡¤CIELAB¿§º¹¡¤¥Þ¥ó¥»¥ë¿§¶õ´Ö¤Ë¤ª¤±¤ë¿§Á꺹¤Ê¤É¤ÎµÒ´ÑŪɾ²Á»ØÉ¸¤ÈÌÜ»ë¤Ë¤è¤ë¼ç´Ñɾ²Á¤Ë¤è¤Ã¤ÆÍ­¸úÀ­¤ò³Îǧ¤·¤¿¡¥

Âê̾1¼¡¸µ°ÌÁê¸ÂÄêÁê´ØË¡¤Ë´ð¤Å¤¯²èÁü¤Î¹âÀºÅÙ²óž·×¬¥¢¥ë¥´¥ê¥º¥à¤È¤½¤Îɾ²Á
Ãø¼Ô *ĹÅè À», °ËÆ£ ¹¯°ì, ÀÄÌÚ ¹§Ê¸(ÅìËÌÂç³ØÂç³Ø±¡¾ðÊó²Ê³Ø¸¦µæ²Ê), ÀÐ°æ ½¨¾¼, ¾®ÎÓ ¹§¼¡(³ô¼°²ñ¼Ò»³Éð)
Pagepp. 173 - 178
Keyword ²èÁü¥Þ¥Ã¥Á¥ó¥°, °ÌÁê¸ÂÄêÁê´ØË¡, ²óž·×¬
AbstractËܹƤǤϡ¤1¼¡¸µ°ÌÁê¸ÂÄêÁê´ØË¡¤Ë´ð¤Å¤¯²èÁü¤Î¹âÀºÅÙ²óž·×¬¥¢¥ë¥´¥ê¥º¥à¤òÄ󰯤¹¤ë¡¥²èÁü¤Î²óžÎ̤ò·×¬¤¹¤ëºÝ¤Ë¤Ï¡¤¶ËºÂɸŸ³«¤Ë¤è¤êŸ³«²èÁü¤òºîÀ®¤·¡¤²èÁü¤Î²óž¤òŸ³«²èÁü¤ÎÊ¿¹Ô°Üư¤ËÊÑ´¹¤·¤Æ¿äÄꤹ¤ë¡¥Ä󰯼êË¡¤Ï¡¤Å¸³«²èÁü¤ÎÊ¿¹Ô°Üư¤¬²£Êý¸þ¤Î¤ß¤ËÀ©¸Â¤µ¤ì¤ë¤³¤È¤ËÃåÌܤ¹¤ë¡¥¤³¤ì¤Ë¤è¤ê¡¤Å¸³«²èÁü¤Î°ÜưÎÌ¿äÄê¤ÎÌäÂê¤ò2¼¡¸µ¤«¤é1¼¡¸µ¤Î°ÜưÎÌ¿äÄê¤ËÃÖ¤­´¹¤¨¤ë¤³¤È¤¬²Äǽ¤Ç¤¢¤ë¡¥ËܹƤǤϡ¤Å¸³«²èÁü¤Î°ÜưÎÌ¿äÄê¤Ë1 ¼¡¸µ°ÌÁê¸ÂÄêÁê´ØË¡¤òÍѤ¤¤ë¤³¤È¤Ç¡¤½¾Íè¤Î2 ¼¡¸µ°ÌÁê¸ÂÄêÁê´ØË¡¤òÍѤ¤¤¿¼êË¡¤è¤ê¤â¡¤·×»»Î̤òȾʬ°Ê²¼¤Ëºï¸º¤·¤Ä¤Ä¡¤¹â¤¤ÀºÅ٤DzèÁü¤Î²óžÎ̤ò·×¬¤Ç¤­¤ë¤³¤È¤ò¼¨¤¹¡¥


¥»¥Ã¥·¥ç¥ó Bd1-3 ´ðÁᦲ»À¼½èÍý
Æü»þ: 2007ǯ4·î23Æü(·î) 13:30-15:10
ºÂĹ: Åï°Â ¼Â¼£ (´ØÀ¾Âç³Ø¡¡¹©³ØÉô¡¡ÅŻҾðÊó¥·¥¹¥Æ¥à¹©³Ø²Ê)

Âê̾µ÷Î¥·×¬¤Ë´ð¤Å¤¯¥Ï¥¦¥ê¥ó¥°¥­¥ã¥ó¥»¥é¤ÎÀ­Ç½²þÁ±¤Ë´Ø¤¹¤ë¸¡Æ¤
Ãø¼Ô *Àî¼ ¿·, Á¾²æÈþ ÌÀ, ÈÓÔ¢ ÍÎÆó(ÂçºåÂç³Ø´ðÁù©³Ø¸¦µæ²Ê)
Pagepp. 179 - 184
Keyword ¥Ï¥¦¥ê¥ó¥°, µ÷Î¥·×¬, ¥Î¥Ã¥Á¥Õ¥£¥ë¥¿
AbstractËÜÏÀʸ¤Ç¤Ï¡¤¥¹¥Ô¡¼¥«¡Ý¥Þ¥¤¥¯¥í¥Û¥ó´Ö¤Îµ÷Î¥¤òÍøÍѤ·¤¿¥Ï¥¦¥ê¥ó¥°½üµî¥·¥¹¥Æ¥à¤Ë¤Ä¤¤¤Æ¸¡Æ¤¤¹¤ë¡¥¤³¤ÎÊýË¡¤Ç¤Ï¡¤¤Þ¤º¡¤¥¹¥Ô¡¼¥«¡Ý¥Þ¥¤¥¯¥í¥Û¥ó´Ö¤Îµ÷Î¥¤ò²»ÇȤòÍѤ¤¤Æ·×¬¤·¡¤¼¡¤Ë¡¤·×¬¤µ¤ì¤¿µ÷Î¥¤«¤é¥Ï¥¦¥ê¥ó¥°¤È¤Ê¤ë¼þÇÈ¿ô¤Î¸õÊä¤ò¿äÄꤹ¤ë¡¥¤½¤·¤ÆºÇ¸å¤Ë¡¤¿äÄꤵ¤ì¤¿¼þÇÈ¿ôÀ®Ê¬¤ò¥Î¥Ã¥Á¥Õ¥£¥ë¥¿¤Ë¤è¤ê½üµî¤¹¤ë¤³¤È¤Ç¥Ï¥¦¥ê¥ó¥°¤ÎȯÀ¸¤òÍÞ¤¨¤ë¡¥ËÜÊý¼°¤Ï¡¤¥Ï¥¦¥ê¥ó¥°¤ò¤¢¤é¤«¤¸¤á½üµî¤·¤Æ¤ª¤¯¤¿¤á¡¤¥Ï¥¦¥ê¥ó¥°¤½¤Î¤â¤Î¤¬À¸¤¸¤Ê¤¤¤È¤¤¤¦ÆÃŤ¬¤¢¤ë¡¥½¾Í衤²æ¡¹¤Ïµ÷Î¥·×¬¤Î¤¿¤á¤Î¥Ñ¥¤¥í¥Ã¥È¿®¹æ¤È¡¤¥Þ¥¤¥¯¥í¥Û¥ó¤Î¼õ¿®¿®¹æ¤È¤ÎÁê´Ø¤¬¤·¤­¤¤Ãͤò¾å²ó¤ë»þ¹ï¤ò¿®¹æÅþÍè»þ¹ï¤È¤¹¤ë¡¤Áê´ØË¡¤Ë¤è¤Ã¤Æµ÷Î¥·×¬¤ò¼Â¹Ô¤·¤Æ¤­¤¿¡¥¤·¤«¤·¡¤Áê´ØË¡¤Ç¤ÏŬÀڤʤ·¤­¤¤ÃͤòÀßÄꤷ¤Ê¤±¤ì¤Ð¡¤ÀºÅÙ¤ÎÎɤ¤¿äÄêµ÷Î¥¤¬ÆÀ¤é¤ì¤Ê¤¤¤È¤¤¤¦ÌäÂ꤬¤¢¤Ã¤¿¡¥¤½¤³¤Ç¡¤ËÜÏÀʸ¤Ç¤Ï¡¤¤·¤­¤¤ÃÍÀßÄ꤬ÉÔÍפʺÇÂçÃÍË¡¤òƳÆþ¤·¡¤µ÷Î¥·×¬¤ÎÀºÅÙ¤ò¸þ¾å¤µ¤»¤ë¡¥ºÇÂçÃÍË¡¤Ï¡¤¼õ¿®¿®¹æ¤ÎÊñÍíÀþ¤Î¥Ô¡¼¥¯°ÌÃÖ¤ò¸¡½Ð¤·¡¤¥Ñ¥¤¥í¥Ã¥È¿®¹æ¤ÎÅþÍè»þ¹ï¤òµá¤á¤ë¤â¤Î¤Ç¤¢¤ë¡¥¼Â´Ä¶­¤Ç¤Îµ÷Î¥·×¬¼Â¸³¤Ë¤è¤ê¡¤ºÇÂçÃÍË¡¤¬Áê´ØË¡¤è¤ê¤â¹âÀºÅÙ¤«¤Ä°ÂÄê¤Ëµ÷Î¥·×¬¤ò¼Â¸½¤Ç¤­¤ë¤³¤È¤ò¼¨¤¹¡¥

Âê̾Äã·²ÃÙ±ä¤ò¤â¤ÄÈóºÇÂç´Ö°ú¤­¥Õ¥£¥ë¥¿¥Ð¥ó¥¯¤ÎºÇ¾®2¾èÀß·×
Ãø¼Ô *²ÏÌî ·ò, °¤Éô Àµ±Ñ, ÀîËô À¯À¬(ÅìËÌÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê)
Pagepp. 185 - 190
Keyword ¥Õ¥£¥ë¥¿¥Ð¥ó¥¯Àß·×, ´°Á´ºÆ¹½À®, Äã·²ÃÙ±ä, Åù¥ê¥×¥ëÁ˻߰è±þÅú, ½Å¤ßÉÕ¤­ºÇ¾®2¾èË¡
AbstractËܹƤǤϡ¤¶á»÷Ū¤Ê´°Á´ºÆ¹½À®¤Èû¤¤·²ÃÙ±ä¤ò¤â¤ÄÈóºÇÂç´Ö°ú¤­¥Õ¥£¥ë¥¿¥Ð¥ó¥¯¤òÀ߷פ¹¤ë¤¿¤á¤Î¿·¤·¤¤È¿ÉüºÇŬ²½¥¢¥ë¥´¥ê¥º¥à¤òÄ󰯤¹¤ë¡¥ ¥Õ¥£¥ë¥¿¥Ð¥ó¥¯Àß·×ÌäÂê¤ò¥Õ¥£¥ë¥¿·¸¿ô¤Ë´Ø¤¹¤ë½Å¤ßÉÕ¤­ºÇ¾®2¾èÌäÂê¤È¤·¤ÆÉ½¤¹¡¥ ¤³¤Î¥¢¥ë¥´¥ê¥º¥à¤Î³ÆÈ¿Éü¤Ë¤ª¤¤¤Æ¡¤ÌÜŪ´Ø¿ô¤ÎºÇ¾®ÅÀ¤ÏÊĤ¸¤¿·Á¤Î²ò¤ÇÆÀ¤é¤ì¤ë¡¥ ¿ô²ó¤ÎÈ¿Éü¤Î¸å¤Ë¡¤ºÇŬ²ò¤ÏÅù¥ê¥×¥ëÁ˻߰è±þÅú¤ò¤â¤Ä¡¥ ËܼêË¡¤Ï¡¤Â礭¤ÊºÇ¾®Á˻߰踺¿êÎ̤ò¤â¤Ä¥Õ¥£¥ë¥¿¥Ð¥ó¥¯¤ò¸úΨŪ¤ËÀ߷פ¹¤ë¤³¤È¤¬¤Ç¤­¤ë¡¥ Äó°ÆË¡¤ÎÍ­¸úÀ­¤ò¼¨¤¹¤¿¤á¤Ë¡¤¥Õ¥£¥ë¥¿¥Ð¥ó¥¯¤Î°ìÀß·×Îã¤ò¤¢¤²¤ë¡¥ ¤Þ¤¿¡¤½¾ÍèË¡¤È¤ÎÈæ³Ó¤ò¼¨¤¹¡¥

Âê̾¥¦¥§¡¼¥Ö¥ì¥Ã¥ÈÊÑ´¹¤Ë¤è¤ëÊâ¹Ô­²»¤ÎÆÃħÃê½Ð¤ÈSVM¤òÍѤ¤¤¿¸Ä¿Í¼±ÊÌ
Ãø¼Ô *Èİæ ÍÛ½Ó, °ÂÀî Çî(°¦Ãθ©Î©Âç³Ø)
Pagepp. 191 - 196
Keyword Êâ¹Ô­²», ¸Ä¿Í¼±ÊÌ, ¥¦¥§¡¼¥Ö¥ì¥Ã¥ÈÊÑ´¹, SVM
Abstract¶áǯ¡¤Êâ¹Ô­²»¤òÍѤ¤¤¿¸Ä¿Í¼±Ê̤¬²Äǽ¤Ç¤¢¤ë¤³¤È¤¬¼¨¤µ¤ì¡¤Êâ¹Ô­²»¤Î²òÀϤäǧ¼±Î¨¤Î¸þ¾å¤Ë´Ø¤¹¤ë¸¦µæ¤¬¿Ê¤á¤é¤ì¤Æ¤¤¤ë¡¥²æ¡¹¤Ï¥¦¥§¡¼¥Ö¥ì¥Ã¥ÈÊÑ´¹¤òÍѤ¤¤¿Êâ¹Ô­²»¤Î²òÀϤˤè¤ê¡¤ÆÃħÎ̤ÎÃê½Ð¤ä¸Ä¿Í¼±Ê̤˴ؤ¹¤ëÍ­±×¤Ê·ë²Ì¤òÆÀ¤¿¡¥ °ìÊý¡¤Êâ¹Ô­²»¤«¤éÃê½Ð¤·¤¿ÆÃħÎ̤Υ¯¥é¥¹¥¿²½¼êË¡¤Ë¤Ä¤¤¤Æ¤Ï½½Ê¬¤ËÏÀµÄ¤µ¤ì¤Æ¤ª¤é¤º¡¤½¾ÍèË¡¤Ç¤ÏÊ¿¶ÑÃͤ«¤é¤Î¥æ¡¼¥¯¥ê¥Ã¥Éµ÷Î¥¤òÍѤ¤¤Æ¼±Ê̤ò¹Ô¤Ã¤Æ¤¤¤ë¡¥ËܹƤǤϥ¦¥§¡¼¥Ö¥ì¥Ã¥È¥Ñ¥é¥á¡¼¥¿¤òÍѤ¤¤¿Support Vector Machine(SVM)¤Ë¤è¤ë¸Ä¿Í¼±Ê̤ò¹Ô¤¤¡¤¤µ¤é¤Ë¾éĹ¤Ê¾ðÊó¤Î½üµî¤Ë¤Ä¤¤¤Æ¸¡Æ¤¤ò¹Ô¤¦¡¥

Âê̾On the Structure of Adaptive Noise Cancellers
Ãø¼Ô *Akihiko Sugiyama(NEC Media and Information Res. Labs.)
Pagepp. 197 - 202
Keyword Noise canceller, structure
AbstractThis paper presents a comparison of adaptive-noise-canceller (ANC) structures. Kubota's ANC and Dunlop's ANC are investigated as multi-stage ANC structures in comparison with the crosscoupled ANC and crosstalk-resistant andaptive noise canceller (CTRANC). They need a good signal detector and a possible crosstalk contaminates the input of the adaptive filter for cancelling the noise. The crosscoupled ANC and CTRANC do not need a detector nor the filter input is contaminated due to a second adaptive filter for crosstalk cancellation. Finally, sophisticated coefficient adaptation algorithms are discussed with the crosscoupled ANC for better performance that cannot be achieved only by a novel structure.


¥»¥Ã¥·¥ç¥ó Bd1-4 ¥¤¥ó¥¿¥é¥¯¥Æ¥£¥Ö¥»¥Ã¥·¥ç¥ó
Æü»þ: 2007ǯ4·î23Æü(·î) 15:30-17:10
ºÂĹ: ³°Â¼ ´î½¨ (NTT̤Íè¤Í¤Ã¤È¸¦µæ½ê)

Âê̾±ÇÁü¤Ë¤ª¤±¤ëή¿å°è¸¡½Ð¤Î¤¿¤á¤Î»þ¶õ´Ö¥Õ¥£¥ë¥¿¤ÎºÇŬÀß·×
Ãø¼Ô *µÆÃÓ Çî, ÏÂÅÄ Í´°ì, ã·Æ£ ½ß»Ë, ´ä¶¶ À¯¹¨(Ĺ²¬µ»½Ñ²Ê³ØÂç³Ø¹©³ØÉôÅŵ¤·Ï)
Pagepp. 203 - 208
Keyword ºÇŬ²½, ±ÇÁü, ¥Õ¥£¥ë¥¿, ¿å°Ì, ²ÏÀî
Abstract±ÇÁü¤«¤é¿å°Ì¤ò¼«Æ°Åª¤Ëǧ¼±¤¹¤ëÊýË¡¤Ë¤Ä¤¤¤Æ¸¡Æ¤¤¹¤ë¡¥½¾ÍèË¡¤È¤·¤Æ¡¤¿âľÊý¸þ¤Î¥¨¥Ã¥¸¸¡½Ð¤È¥Õ¥ì¡¼¥à´Öº¹Ê¬¤Ë¤è¤ê¿åÊ¿Êý¸þ¤Ë¹­¤¬¤ë¿åÌÌÎØ³Ô¤òÃê½Ð¤¹¤ëÊýË¡¤¬Ä󰯤µ¤ì¤Æ¤¤¤ë¤¬¡¤º¹Ê¬½èÍý¤Î¤¿¤á¤Ë¿åÌ̤ÎÍðÈ¿¼Í¤ä¹ß±«Àãγ»ÒÅù¤Îư¤¯³°Íð¤Î±Æ¶Á¤ò¼õ¤±¤ä¤¹¤¤¡¥ËÜÊó¹ð¤Ç¤Ï¡¤¥Õ¥ì¡¼¥à¤ÎƱ´ü²Ã»»¤È¿åÊ¿Êý¸þ¤Î¥¨¥Ã¥¸¸¡½Ð¤Ë´ð¤Å¤¯¿å°Ì¸¡½ÐË¡¤Ë¤ª¤¤¤Æ¡¤Í¿¤¨¤é¤ì¤¿±ÇÁü¤ËÂФ¹¤ë¥¨¥Ã¥¸¸¡½Ð¥Õ¥£¥ë¥¿¤ÎºÇŬÀ߷פˤĤ¤¤Æ¹Í»¡¤·¡¤Prewitt ¤äSobel ¥ª¥Ú¥ì¡¼¥¿¤ò´Þ¤à½¾Íè¤Î¥¨¥Ã¥¸¸¡½ÐË¡¤ÈÈæ³Ó¸¡Æ¤¤¹¤ë¡¥

Âê̾ưŪ¥Í¥Ã¥È¥â¥Ç¥ë¤Î¥Ñ¥¿¡¼¥óǧ¼±¤Ø¤ÎŬÍѤ˴ؤ¹¤ë¸¡Æ¤
Ãø¼Ô ¸ÅÎÓ Í¤²ð, *ÌùÌÚ ÅÐ(ÄÅ»³¹©¶È¹âÅùÀìÌç³Ø¹»), Ïɸ« °éμ, ¾¾Á° ¿Ê, Ê¡ËÜ Á±ÍÎ(Ä»¼è´Ä¶­Âç³Ø)
Pagepp. 209 - 213
Keyword ưŪ¥Í¥Ã¥È¥â¥Ç¥ë, ¥Ñ¥¿¡¼¥óǧ¼±, Æ°ÅªÎØ³ÔË¡, ÆÃħÃê½Ð
AbstractËܸ¦µæ¤Ç¤Ï¡¤ÆÃħÃê½Ð¤Î°ìÊýË¡¤È¤·¤Æ,ưŪ¥Í¥Ã¥È¥â¥Ç¥ë¤òÍѤ¤¤ë¤³¤È¤ò¹Í¤¨¤ë¡£¤¹¤Ê¤ï¤Á,¥Ñ¥¿¡¼¥óǧ¼±½èÍý¤ËɬÍפʲèÁüÆÃħ¤È¤·¤Æ,ưŪ¥Í¥Ã¥È¥â¥Ç¥ë¤ÎÊ᪷ë²Ì¤Ë¤ª¤±¤ëÌ֤γʻÒÅÀ¤ÎÁÂÌ©ÅÙ¤òºÎÍѤ¹¤ë¡£ËܹƤǤÏ, ®ÅÙɸ¼±¤ËÂФ¹¤ëưŪ¥Í¥Ã¥È¥â¥Ç¥ë¤Ç¤ÎÊ᪷ë²Ì¤«¤éÁÂÌ©ÅÙ¤ò¬Äꤷ,¤½¤ÎÃͤò¥Ë¥å¡¼¥é¥ë¥Í¥Ã¥È¥ï¡¼¥¯¤ËÆþÎÏ,³Ø½¬¤µ¤»¤ë¤³¤È¤Ç¥Ñ¥¿¡¼¥óǧ¼±¤ò¹Ô¤Ê¤¦¤¿¤á¤Î°ìÊýË¡¤ÎÄ󰯤ò¹Ô¤Ê¤¦¡£Æ°Åª¥Í¥Ã¥È¥â¥Ç¥ë¤òÍѤ¤¤ë¤³¤È¤Ç,ÂоݤȤʤëʪÂΤÎÎØ³Ô¤äÆâÉô¾ðÊó¤ò,¥Í¥Ã¥È¤Î·Á¾õ¤ä³Ê»ÒÅÀ¤ÎÁÂÌ©¤Çɽ¸½¤Ç¤­,¤Þ¤¿¤·¤­¤¤ÃͽèÍýµÚ¤Ó£²ÃͲ½½èÍý¤òɬÍפȤ·¤Ê¤¤¤¿¤áǧ¼±½èÍý¤Î´Êά²½¤ä¹â®²½¤ò¿Þ¤ê¤ä¤¹¤¤¤³¤È¤¬Í½Â¬¤µ¤ì¤ë¡£

Âê̾²ÏÀî´Æ»ë¤Î¤¿¤á¤Îµ¡Ç½Åª³¬ÁØÉ乿²½
Ãø¼Ô *¹â¶¶ Ãξ­, º£°æ ͵Æó, ´ä¶¶ À¯¹¨(Ĺ²¬µ»½Ñ²Ê³ØÂç³Ø¹©³ØÉôÅŵ¤·Ï), ¼¾¾ Àµ¸ã(¿·³ãÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê)
Pagepp. 215 - 220
Keyword ²ÏÀî, ¿å°Ì, µ¡Ç½Åª, ³¬Áز½, É乿²½
Abstract¥Í¥Ã¥È¥ï¡¼¥¯¥«¥á¥éÆâÉô¤Ë¿®¹æ½èÍý¥Ü¡¼¥É¤òÁȤ߹þ¤ß¡¤Ä̾ï¤Ï±ÇÁü¤«¤é¿å°Ì¤ò¼«Æ°¸¡½Ð¤·¡¤É¬Í×»þ¤Ë¤Ï±ÇÁü¤½¤Î¤â¤Î¤ò±ÜÍ÷¤Ç¤­¤ë¡¤²ÏÀî¤Î¤¿¤á¤Î±ó³Ö´Æ»ë¥·¥¹¥Æ¥à¤òÄ󰯤¹¤ë¡¥Ã±¤Ë±ÇÁüǧ¼±¤Ë¤è¤ê¿å°Ì¤ò¸¡½Ð¤¹¤ë¤Î¤ß¤Ç¤Ï¤Ê¤¯¡¤¥·¥¹¥Æ¥àÁ´ÂΤ¬ÄÌ¿®²óÀþ¤ò¸úΨŪ¤ËÍøÍѽÐÍè¤ë¤è¤¦¤Ë¥Ç¡¼¥¿¤ÎÁíÅÁÁ÷Î̤òÄ㸺¤¹¤ë¤³¤È¤òÌÜŪ¤È¤¹¤ë¡¥¶ñÂÎŪ¤Ë¤Ï¡¤1)Â裱ͥÀ賬Áؤ«¤é¤Ï¿å°Ì¸¡½Ð¤ËÍ­¸ú¤ÊÀ®Ê¬¤¬¡¤2)Âè2 Í¥À賬Áؤ«¤é¤ÏÄã²òÁüÅ٤ʳµÍ×±ÇÁü¤¬¡¤3)ÈóÍ¥À賬Áؤò´Þ¤àÁ´³¬Áؤ«¤é¤Ï¾ÜºÙ±ÇÁü¤¬ºÆÀ¸¤µ¤ì¤ë¡¤¿å°Ì¸¡½Ð¤È¤¤¤¦µ¡Ç½Ì̤dz¬Áز½¤µ¤ì¤¿±ÇÁü¤ÎÉ乿²½ÊýË¡¤òÄ󰯤¹¤ë¡¥

Âê̾¥Õ¥£¥ë¥à±ÇÁü¤Ë¤ª¤±¤ë¥Õ¥ê¥Ã¥«¤È¥Ö¥í¥Ã¥Á¤Î±Æ¶Á¤ò¹Íθ¤·¤¿ÇطʲèÁüº¹Ê¬Ë¡¤Ë¤è¤ë¥Ö¥í¥Ã¥Á¸¡½Ð
Ãø¼Ô *¾±»Ò ¹°µ£, °¤Éô Àµ±Ñ, ÀîËô À¯À¬(ÅìËÌÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²ÊÅŻҹ©³ØÀì¹¶)
Pagepp. 221 - 226
Keyword ¥Ç¥£¥¸¥¿¥ë½¤Éü, ¥Ö¥í¥Ã¥Á¸¡½Ð, ÇØ·Ê²èÁüº¹Ê¬Ë¡, ¸Å¤¤¥Õ¥£¥ë¥à±ÇÁü, ¥Õ¥ê¥Ã¥«½üµî
AbstractËܹƤǤϡ¤¥Õ¥£¥ë¥à±ÇÁü¤Ë¸ºß¤¹¤ë¥Ö¥í¥Ã¥Á¤ò¥Ç¥£¥¸¥¿¥ë±ÇÁü½èÍý¤Ë¤è¤Ã¤Æ¸¡½Ð¤¹¤ë¼êË¡¤òÄ󰯤¹¤ë¡¥Äó°ÆË¡¤Ç¤Ï¡¤¦Á-¥È¥ê¥à¥ÉÊ¿¶ÑÃÍ¥Õ¥£¥ë¥¿¤Ë¤è¤Ã¤Æ±ÇÁü¤ÎÇØ·Ê²èÁü¤ò¿äÄꤷ¡¤ÇطʲèÁüº¹Ê¬Ë¡¤Ë¤è¤Ã¤Æ¥Ö¥í¥Ã¥Á¤ò¸¡½Ð¤¹¤ë¡¥½¾ÍèË¡¤Î¿¤¯¤ÏϢ³¤¹¤ë¥Õ¥ì¡¼¥à¤Ë¥Ö¥í¥Ã¥Á¤Ï½Ð¸½¤·¤Ê¤¤¤³¤È¤òÁ°Äó¤È¤¹¤ë¤¿¤á¡¤¥Ö¥í¥Ã¥Á½Ð¸½Î¨¤¬Áý²Ã¤¹¤ë¤Ë¤Ä¤ì¤Æ¥Ö¥í¥Ã¥Á¤Î¸¡½ÐÀ­Ç½¤ÏÄã²¼¤¹¤ë¡¥¤³¤ÎÌäÂêÅÀ¤ò²ò·è¤¹¤ë¤¿¤á¤ËÇØ·Ê²èÁü¤ò»²¾È²èÁü¤È¤¹¤ë¥Ö¥í¥Ã¥Á¸¡½ÐË¡¤òÄ󰯤¹¤ë¡¥ËܹƤǤϥ֥í¥Ã¥Á½Ð¸½Î¨¤ËÂФ¹¤ë½¾ÍèË¡¤ÈÄó°ÆË¡¤Î¥Ö¥í¥Ã¥Á¸¡½ÐΨ¤ÈÈó¥Ö¥í¥Ã¥Á¸¡½ÐΨ¤ÎƳ½Ð¤È¿Í¹©Åª¤ËºîÀ®¤·¤¿Îô²½±ÇÁü¤ËÂФ¹¤ë¥Ö¥í¥Ã¥Á¤Î¸¡½ÐÀ­Ç½É¾²Á¼Â¸³¤Ë¤è¤Ã¤ÆÄó°ÆË¡¤ÎÍ¥°ÌÀ­¤ò³Îǧ¤·¤¿¡¥

Âê̾²»ÇȤòÍѤ¤¤¿²ÏÀî¤Îή®ʬÉۤβĻ벽
Ãø¼Ô ÌðÅç Ë®¾¼(ÀçÂæÅÅÇȹ©¶È¹âÅùÀìÌç³Ø¹»), »°±º ͵²ð(ÃæÉôÅÅÎÏ), *±óÆ£ çýè½¹á(ÀçÂæÅÅÇȹ©¶È¹âÅùÀìÌç³Ø¹»), ´ä¶¶ À¯¹¨(Ĺ²¬µ»½Ñ²Ê³ØÂç³Ø)
Pagepp. 227 - 230
Keyword ή®ʬÉÛ, ²èÁüºÆ¹½À®, WMRË¡, ÅÁÇÅ»þ´Ö
Abstract¿·¤·¤¤²ÏÀî¤Îή®·×¬ˡ¤È¤·¤Æ²èÁüºÆ¹½À®¥¢¥ë¥´¥ê¥º¥à¤Ç¤¢¤ëWMRË¡¤ÎŬÍѤòÄ󰯤¹¤ë¡£WMRË¡¤Ï¹©¶ÈʬÌî¤ò»ëÌî¤ËÆþ¤ì¤¿²èÁüºÆ¹½À®¥¢¥ë¥´¥ê¥º¥à¤Ç¤¢¤ê¡¢¶Ë¤á¤Æ¾¯¤Ê¤¤Åê±Æ¥Ç¡¼¥¿¤«¤éÆâÉô¹½Â¤¤Î²Ä»ë²½¤¬²Äǽ¤Ç¤¢¤ë¡£ËÜÏÀ¤Ç¤Ï¡¢²»ÇȤòÍѤ¤¤¿Á÷¼õ¿®µ¡´Ö¤ÎÅÁÇÅ»þ´Ö¤«¤é¡¢²»Â®Ê¬Éۤ˲䨤ÆÎ®Â®Ê¬Éۤκƹ½À®¤¬²Äǽ¤Ç¤¢¤ë¤³¤È¤ò¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤êɾ²Á¤¹¤ë¡£¤³¤ì¤Ë¤è¤ê²ÏÀî¤Îή®ʬÉÛ¤ò¹­°è¤Ëû»þ´Ö¤Ç·×¬¤¬²Äǽ¤È¤Ê¤ë¡£

Âê̾AES°Å¹æ²½µ¡Ç½ÉÕ¤­RFID¥·¥¹¥Æ¥à¤Î¹½ÃÛ
Ãø¼Ô *»°¹¥ ¼÷¸²(¥·¥ã¡¼¥×­êµ»½ÑËÜÉô), Æ÷ºä ůϺ(¶¨Ï¥ƥ¯¥Î¥í¥¸¥£¥º(³ô)), ÇòÀî ¸ù(ʼ¸Ë¸©Î©Âç³Ø±þÍѾðÊó²Ê³Ø¸¦µæ²Ê), ¾¾Â¼ ¸¬¼¡((³ô)¥±¡¼¡¦¥·¡¼¡¦¥¨¥¹)
Pagepp. 231 - 234
Keyword RFID, °Å¹æ½èÍý, FPGA, ¥»¥­¥å¥ê¥Æ¥£
Abstract¡¡RFID¡ÊRadio Frequency IDentification¡Ë¥·¥¹¥Æ¥à¤Ï¡¢Â¿´ô¤Ë¤ï¤¿¤ëʬÌî¤Ç¤ÎÍøÍѤ¬´üÂÔ¤µ¤ì¤Æ¤¤¤ë¡£¤È¤³¤í¤¬¡¢ºÇ¤âÉáµÚ¤¬¸«¹þ¤Þ¤ì¤ëÀ½Â¤¥³¥¹¥È¤¬°Â²Á¤Ê¥¿¥¤¥×¤ÎRFID¥¿¥°¤Ï¡¢ÆâÉô¤Ë±é»»µ¡Ç½¤òÍ­¤·¤Æ¤ª¤é¤º¡¢³°Éô¤«¤éÍ¿¤¨¤é¤ì¤¿¥Ç¡¼¥¿¤òÊÝ»ý¤¹¤ëµ¡Ç½¤·¤«¤Ê¤¤¤¿¤á¡¢¥»¥­¥å¥ê¥Æ¥£Ì̤ËÂ礭¤ÊÌäÂê¤òÊú¤¨¤Æ¤¤¤ë¡£ËܹƤǤÏRFID¥·¥¹¥Æ¥à¤Î¥»¥­¥å¥ê¥Æ¥£¤ò³ÎÊݤ¹¤ë¤¿¤á¤Ë¡¢RFID¥¿¥°ÆâÉô¥Ç¡¼¥¿¤ò°Å¹æ²½¡¢¤¹¤Ê¤ï¤Á¡¢RFID Reader/Writer¤ËÂФ¹¤ëAES°Å¹æ½èÍýµ¡Ç½¤ÎÉղäòÄ󰯤·¡¢¥·¥¹¥Æ¥àÁ´ÂΤλîºî¡¦¸¡¾Ú¤ò¹Ô¤Ã¤¿¡£

Âê̾MIMOÄÌ¿®¤Ë¤ª¤±¤ëLattice-Reduction´³¾Ä¥­¥ã¥ó¥»¥é¤ÎÀß·×
Ãø¼Ô *À¾¾ë Ë®½Ó(¶å½£¹©¶ÈÂç³Ø¾ðÊ󹩳ØÉôÅŻҾðÊ󹩳زÊ), Ä¹Èø ͦʿ(¶å½£¹©¶ÈÂç³ØÂç³Ø±¡¾ðÊ󹩳ظ¦µæ²Ê¾ðÊó¥·¥¹¥Æ¥àÀì¹¶), ¹õºê Àµ¹Ô, ÈøÃÎ Çî(¶å½£¹©¶ÈÂç³Ø¾ðÊ󹩳ØÉôÅŻҾðÊ󹩳زÊ)
Pagepp. 235 - 240
Keyword MIMO, ´³¾Ä¥­¥ã¥ó¥»¥é, lattice-reduction
AbstractËܹƤǤϡ¤MIMOÄÌ¿®¤Ë¤ª¤¤¤Æ¡¤¶õ´ÖÁê´Ø¤Î¹â¤¤¥Á¥ã¥Í¥ë´Ä¶­²¼¤Ç¤ÎÀ­Ç½¤ÎÎô²½¤òÍÞÀ©¤·¤Ä¤Ä¡¤±é»»Î̤òºï¸º²Äǽ¤Ê´³¾Ä½üµîË¡¤Ç¤¢¤ëLattice¡¡Reduction´³¾Ä¥­¥ã¥ó¥»¥é¤Î²þÎɤò¹Ô¤¦¡¥¤Þ¤¿¡¤·×»»µ¡¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê¤½¤ÎÆÃÀ­¤òɾ²Á¤·¡¤½¾Íè¤Î´³¾Ä½üµîË¡¤ÈÈæ³Ó¤·¤Æ¡¤Áê´Ø¤Î¹â¤¤¥Á¥ã¥Í¥ë´Ä¶­²¼¤Ç¤ÎÍ­¸úÀ­¤ò³Îǧ¤¹¤ë¡¥²Ã¤¨¤Æ¡¤±é»»Î̤ÎÈæ³Ó¤â¹Ô¤¤¡¤MLD¤è¤ê¤âÄã±é»»Î̤Ǥ¢¤ë¤³¤È¤ò³Îǧ¤¹¤ë¡¥

Âê̾WH´ðÄì¤òÍѤ¤¤¿¹â®¤Êư¤­¿äÄêË¡
Ãø¼Ô *ÇëÈø ÏÂÌé, ¹õÌÚ ¾Í¸÷(µ×Î±ÊÆ¹©¶È¹âÅùÀìÌç³Ø¹»)
Pagepp. 241 - 246
Keyword WH ´ðÄì, ư¤­¿äÄê, ºÇŬ»²¾È¥Ö¥í¥Ã¥¯Ãµº÷¥¢¥ë¥´¥ê¥º¥à, DHSS Ë¡
Abstractư²èÁü°µ½Ì¤Îư¤­Êä½þ¥Õ¥ì¡¼¥à´Öͽ¬¤Ç¤Ï»²¾È¥Ö¥í¥Ã¥¯¤Îõº÷¤Ë¿¤¯¤Î·×»»Î̤òɬÍפȤ¹¤ë¤¿¤á¡¤¹â®²½¤Î¼êË¡¤¬µá¤á¤é¤ì¤ë¡¥ ¤½¤³¤ÇËܹƤǤϡ¤¥Ù¥¯¥È¥ëÎ̻Ҳ½¤Ë¤ª¤±¤ë¥³¡¼¥É¥ï¡¼¥É¤Îõº÷Ë¡¤Î 1 ¤Ä¤Ç¤¢¤ë DHSS Ë¡¤òŬÍѤ·¤Æ¡¤»²¾È¥Ö¥í¥Ã¥¯¤Îõº÷¤ÎºÝ¤Î·×»»Î̤òºï¸º¤¹¤ë¼êË¡¤òÄ󰯤¹¤ë¡¥Ä󰯼êË¡¤Ç¤ÏÁ´»²¾È¥Ö¥í¥Ã¥¯¤òɾ²Á¤¹¤ë¤¿¤á¡¤Á´Ãµº÷¤ÈÈæ³Ó¤·¤ÆÀºÅÙ¤¬Íî¤Á¤Ê¤¤¤È¤¤¤¦ÍøÅÀ¤¬¤¢¤ë¡¥¤Þ¤¿ËܹƤǤϡ¤Ä¾¸ò´ðÄì¤È¤·¤Æ WH ´ðÄì¤òÍѤ¤¤ë¤¬¡¤³ÎΨÏÀŪ¤Ë³Æ´ðÄì¤Îʬ»¶¤òƳ½Ð¤·¡¤¹â®²½¤Ë´óÍ¿¤¹¤ëÄã¼þÇÈ¿ôÀ®Ê¬¤òÁª½Ð¤·¤¿¡¥·×»»µ¡¼Â¸³¤ò¹Ô¤Ã¤¿·ë²Ì¡¤½¾Íè¼êË¡¤Ë¤ÏÎô¤ë¤â¤Î¤Î·×»»Î̤κ︺¤Ï³Îǧ¤Ç¤­¤¿¡¥

Âê̾SOM¤Ë¤è¤ëǻø²èÁü¤ËÂбþ¤·¤¿ÎسÔÀþÃê½Ð½èÍý¤Î¸¡Æ¤
Ãø¼Ô ¿¢ÅÄ ÂóÌé, Ïɸ« °éμ, *ÆñÇÈ Ê¡Ìï(Ä»¼è´Ä¶­Âç³ØÂç³Ø±¡), ÌùÌÚ ÅÐ(ÄÅ»³¹©¶È¹âÅùÀìÌç³Ø¹»), Ê¡ËÜ Á±ÍÎ(Ä»¼è´Ä¶­Âç³Ø ´Ä¶­¾ðÊó³ØÉô), ÃÛë δͺ(¾¾¹¾¹©¶È¹âÅùÀìÌç³Ø¹»)
Pagepp. 247 - 252
Keyword ƻϩɸ¼±¸¡½Ð, ÎØ³ÔÀþÃê½Ð, ÆÃħÃê½Ð, ¼«¸ÊÁÈ¿¥²½¥Þ¥Ã¥×
Abstractƻϩ¸òÄÌ¥·¥¹¥Æ¥à¤Ï¡¤¹âÅÙÆ»Ï©¸òÄÌ¥·¥¹¥Æ¥à¤Ø¤Î°Ü¹Ô¤¬¶¯¤¯´üÂÔ¤µ¤ì¤Æ¤¤¤ë¡¥¼Öξ¥É¥é¥¤¥Ð¡¼¤Ï¾ï¤ËÁö¹Ô´Ä¶­Ç§¼±¤È¼Öξ¤ÎÀ©¸æ¤ò¹Ô¤ï¤Ê¤±¤ì¤Ð¤Ê¤é¤Ê¤¤¡¥¸«Íî¤È¤µ¤ì¤¬¤Á¤Êƻϩɸ¼±¤òµ¡³£¤¬¼«Æ°Åª¤Ë¸¡½Ð¡¤Ç§¼±¤¹¤ë¥·¥¹¥Æ¥à¤¬¤Ç¤­¤ì¤Ð¡¤¥É¥é¥¤¥Ð¡¼¤ÎÉéô·Ú¸º¤Ë¤Ä¤Ê¤¬¤ë¡¥¤¹¤Ç¤Ë½¾Íè¼êË¡¤Ë¤ª¤¤¤ÆÆ»Ï©É¸¼±¤Î2ÃͲ½²èÁü¤ËŬÍѤ¹¤ë¼êË¡¤Ë¤Ä¤¤¤ÆÄ󰯤·¤Æ¤¤¤ë¡¥¤·¤«¤·¡¤½¾Íè¼êË¡¤Ç¤ÏÆÃÄê¿§Ãê½Ð¤Î·ë²Ì¤Ç¤¢¤ë¿§Ê¬ÉÛ´Ø¿ô¤Ë¤è¤Ã¤ÆÀ¸À®¤µ¤ì¤¿Ç»Ã¸²èÁü¤ò2ÃͲ½¤·¤Æ¤¤¤¿¤¿¤á¡¤¿§Ê¬ÉÛ´Ø¿ô¤ÎÍ­¸úÀ­¤ò³è¤«¤¹¤³¤È¤¬¤Ç¤­¤Æ¤¤¤Ê¤¤¡¥¤½¤³¤Ç¡¤ËÜÏÀʸ¤Ç¤Ï¿§Ê¬ÉÛ´Ø¿ô¤ÎÍ­¸úÀ­¤ò³è¤«¤¹¤¿¤á¡¤Ç»Ã¸²èÁü¤ËÂФ·¤ÆÄ¾ÀÜŬÍѤǤ­¤ë¼êË¡¤òÄ󰯤¹¤ë¡¥

Âê̾A Real-Time Parallel Architecture for Human Face Detection Based on the Algorithm Architecture Adequation Approach
Ãø¼Ô *Dmitriev Ivan(Graduate School of Information, Production and Systems, Waseda University), Grandpierre Thierry, Akil Mohamed(ESIEE, A2SI Laboratory), Ghorayeb Hicham(ENSMP, CAOR Laboratory), Satoshi Goto, Takeshi Ikenaga(Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 253 - 258
Keyword Algorithm Architecture Adequation, real-time parallel architecture, AdaBoost , face detection, real-time scalable architecture
AbstractToday the human face detection is an essential part of bio-medical and security equipment. Following the introduction of AdaBoost and new methodologies ¡¦such as SVM, the human face detection shows a steady increase in diversity of its applications, but mainly in software form. This work focuses on the optimizations of AdaBoost/CA algorithm from CAOR for its implementation in hardware architecture and the application of Algorithm Architecture Adequation (AAA) methodology for the development of a real-time scalable parallel architecture prototype. Real-time performance is achieved by fully extracting and exploring the data and command parallelism, using the AAA approach, and the scalability is maintained by the use of generic components. The architecture prototype is capable of real time processing and it is scalable for images from 160 * 120 till 1920 * 1440 pixels.

Âê̾¦¤¦²·¿1¥Ó¥Ã¥È¥Ç¥£¥¸¥¿¥ë¿®¹æ¤òÍѤ¤¤¿Ä¶²»Çȵ÷Î¥·×¬¤Ë¤ª¤±¤ë¥»¥ó¥µ¿®¹æ½èÍý
Ãø¼Ô *Ê¿ÅÄ ¿µÇ·²ð, ¹õß· ¼Â(Åìµþ¹©¶ÈÂç³Ø Áí¹çÍý¹©³Ø¸¦µæ²Ê), ÊÒ¶Í ¿ò(¤¹¤Æ¤­¤Ê (Í­))
Pagepp. 259 - 264
Keyword ¦¤¦²ÊÑÄ´, Áê¸ßÁê´Ø, °Üưʿ¶Ñ, Ͳ»Çȷ׬
AbstractͲ»ÇÈ¥»¥ó¥µ¤òÍѤ¤¤¿µ÷Î¥·×¬¥·¥¹¥Æ¥à¤Ë¡¤¥³¥¦¥â¥ê¤Î¥¨¥³¡¼¥í¥±¡¼¥·¥ç¥ó¤Î¹©³ØÅª¤Ê±þÍѤò¸¡Æ¤¤·¤Æ¤¤¤ë¡¥ÂоݤȤε÷Î¥¤Ï¡¤Á÷¿®¤·¤¿Ä¶²»ÇȤȤ½¤Î¥¨¥³¡¼¤È¤ÎÁê¸ßÁê´Ø¤ò¤È¤ê¡¤·×¬¤·¤¿¥¨¥³¡¼¤ÎÈô¹Ô»þ´Ö¤«¤éµá¤á¤ë¡¥¿ô¦Ìm¤Îµ÷Υʬ²òǽ¤òÆÀ¤ë¤¿¤á¤Ë¤Ï¡¤¿ô½½ns¤È¤¤¤¦»þ´Öʬ²òǽ¤¬É¬ÍפǤ¢¤ë¡¥¤½¤Î¤¿¤á¿ô½½MHz¤È¤¤¤¦¹â¤¤¼þÇÈ¿ô¤Ç¥µ¥ó¥×¥ê¥ó¥°¤ò¹Ô¤¦É¬Íפ¬¤¢¤ë¡¥ËÜÏÀʸ¤Ç¤Ï¡¤¥»¥ó¥µ¿®¹æ½èÍý¤ÎÉéô·Ú¸º¤òÌÜŪ¤È¤·¡¤¦¤¦²·¿£±¥Ó¥Ã¥È¥Ç¥£¥¸¥¿¥ë¿®¹æ¤ÇÁê¸ßÁê´Ø¤ò¤È¤ë¼êË¡¤òÄ󰯤¹¤ë¡¥¤½¤·¤Æ¥Ó¥Ã¥È¥¹¥È¥ê¡¼¥àƱ»Î¤ÎÀÑϱ黻¤«¤éµ÷Î¥·×¬¤¬²Äǽ¤Ç¤¢¤ë¤«¸¡¾Ú¤¹¤ë¡¥¤µ¤é¤Ë¦¤¦²ÊÑÄ´¤Ë¤è¤ë¹â¼þÇÈ»¨²»¤ò¼è¤ê½ü¤¯¼êË¡¤òÄ󰯤·¡¤Áê¸ßÁê´Ø¤ÎÀºÅÙ¤Îɾ²Á¤ò¹Ô¤¦¡¥

Âê̾A Performance Optimized Architecture of Deblocking Filter in H.264/AVC
Ãø¼Ô *Kyeong-Yuk Min, Jong-Wha Chong(CAD&SoC design lab., Hanyang University)
Pagepp. 265 - 270
Keyword deblocking filter, H.264/AVC
AbstractIn this paper, we propose memory and performance optimized architecture to accelerate the operation speed of adaptive deblocking filter for H.264/JVT/AVC video coding. The proposed deblocking filter executes loading/storing and filtering operations with only 192 cycles for 1 acroblock. Only 2x4x4 internal buffers and 32x16 internal SRAM are adopted for the buffering operation of deblocking filter with I/O bandwidth of 32 bit. The proposed architecture can process the filtering operation for 1 macroblock with less filtering cycles and lower memory sizes than some conventional approaches of realizing deblocking filter. The efficient hardware architecture is implemented with novel data arrangement, hybrid filter scheduling and minimum number of buffer. The proposed architecture is suitable for low cost and real-time applications, and the real-time decoding with 1080HD(1920x1088@30fps) can be easily achieved when working frequency is 70 MHz.

Âê̾°Û¼ï¥³¡¼¥ÉºÇŬ²½ÊýË¡¤òÅý¹ç¤¹¤ë¤¿¤á¤Î¥³¥ó¥Ñ¥¤¥é¹½À®¤Ë´Ø¤¹¤ë°ì¹Í»¡
Ãø¼Ô *¶â»Ò ͺʿ, ¿ùÌî Īɧ(Åìµþ¹©¶ÈÂç³Ø)
Pagepp. 271 - 276
Keyword ºÇŬ²½ÊýË¡, VLIW
AbstractVLIW ·¿¤Î¥×¥í¥»¥Ã¥µ¤òÂоݤȤ¹¤ë¤È¤­¤Ë¡¢ÆþÎÏ¥×¥í¥°¥é¥à¤ËÂФ·¤Æ¤¤¤¯¤Ä¤«¤ÎºÇŬ²½ÊýË¡¤òÁȤ߹ç¤ï¤»¤ÆÅ¬ÍѤ¹¤ë¤¿¤á¤Î¥³¥ó¥Ñ¥¤¥é¹½À®¤òÄ󰯤·¤¿¡£Ê£¿ô¤ÎºÇŬ²½ÊýË¡¤òŬÍѤ¹¤ë¤³¤È¤Ï¡¢¤¢¤ëºÇŬ²½ÊýË¡¤ÎŬÍѤˤè¤Ã¤ÆÂ¾¤ÎºÇŬ²½ÊýË¡¤Î¸úΨ¤òÎô²½¤µ¤»¤ë²ÄǽÀ­¤¬¤¢¤ë¤¿¤á¤Ë¡¢Èó¾ï¤Ëº¤Æñ¤Ê²ÝÂê¤Ç¤¢¤ë¡£ËܹƤǤϡ¢³ÆºÇŬ²½ÊýË¡¤òŬÍѤ¹¤ëÆþÎÏ¥×¥í¥°¥é¥à¤Î¸Ä½ê¤òŪ³Î¤ËÄê¤á¤Æ¡¢ºÇŬ²½ÊýË¡´Ö¤Î¥È¥ì¡¼¥É¥ª¥Õ¤òÍÞÀ©¤¹¤ë¤è¤¦¤Ê¥³¥ó¥Ñ¥¤¥é¹½À®¤òÄ󰯤¹¤ë¡£

Âê̾MIMO-OFDM̵ÀþLAN¥·¥¹¥Æ¥à¤ÎFPGA¼ÂÁõ¤Ë´Ø¤¹¤ë°ì¸¡Æ¤
Ãø¼Ô Ä¹Èø ͦʿ, »ûËÜ ¾¼¹¨(¶å½£¹©¶ÈÂç³ØÂç³Ø±¡¾ðÊ󹩳ظ¦µæ²Ê), °æ¾å ¿¿¸ã, *¹õºê Àµ¹Ô, ÈøÃÎ Çî(¶å½£¹©¶ÈÂç³ØÅŻҾðÊ󹩳زÊ)
Pagepp. 277 - 282
Keyword IEE802.11n, FPGA, ̵ÀþLAN, MIMO, LDPC
Abstract¸½ºß¡¤É¸½à²½³èư¤¬¹Ô¤ï¤ì¤Æ¤¤¤ë̵ÀþLANµ¬³ÊIEEE802.11n¤Ï¡¤PHYÁؤª¤è¤ÓMACÁؤγÈÄ¥¤Ë¤è¤ê¡¤100Mbps°Ê¾å¤Î¼Â¸ú¥¹¥ë¡¼¥×¥Ã¥È¤òÌÜɸ¤È¤·¤Æ¤¤¤ë.ÆÃ¤ËPHYÁؤˤª¤¤¤Æ¤Ï¡¤MIMO-OFDMÅÁÁ÷¤äLDPCÉ乿¤Ê¤É¤Î¹âÅ٤ʿ®¹æ½èÍý¤òɬÍפȤ¹¤ëµ»½Ñ¤¬ºÎÍѤµ¤ì¤Æ¤ª¤ê¡¤Â絬ÌϤʲóÏ©¤¬É¬ÍפȤʤ롥ɮ¼Ô¤é¤Ï¡¤Â絬ÌϤÊMIMO¥·¥¹¥Æ¥à¤Î¤¿¤á¤ÎFPGAɾ²Á¥Ü¡¼¥É¤Î³«È¯¤ò¹Ô¤Ã¤Æ¤ª¤ê¡¤ËÜÏÀʸ¤ÏIEEE802.11nµ¬³Ê¤Ë½àµò¤¹¤ëMIMO-OFDM̵ÀþLAN¥·¥¹¥Æ¥à¤ÎÂ絬ÌÏFPGA¤Ø¤Î¼ÂÁõ¤Ë¤Ä¤¤¤ÆÊó¹ð¤¹¤ë.¤Þ¤¿ËÜÏÀʸ¤Ï¡¤FPGA¼ÂÁõ¤Ë¸þ¤±¤¿¸ÇÄê¾®¿ôÅÀ¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Îɾ²Á¤Ë¤Ä¤¤¤Æ¤âÊó¹ð¤¹¤ë.

Âê̾Ʃ²áͲ»ÇȤòÍѤ¤¤¿¹Ýºà¤Î·ç´Ù¸¡½Ð¤Ë´Ø¤¹¤ë´ðÁø¦µæ
Ãø¼Ô ÌðÅç Ë®¾¼(ÀçÂæÅÅÇȹ©¶È¹âÅùÀìÌç³Ø¹»), È« ·½Í¤(Ĺ²¬µ»½Ñ²Ê³ØÂç³Ø), *»³¸ý µ®ÆÁ(ÀçÂæÅÅÇȹ©¶È¹âÅùÀìÌç³Ø¹»), ÅÄ»³ ŵÃË(´ä¼êÂç³Ø)
Pagepp. 283 - 288
Keyword ²èÁüºÆ¹½À®, WMRË¡, ÅÁÇÅ»þ´Ö, ¸º¿êÎÌ
Abstract½¾Íè¤ÎÈóÇ˲õ¸¡ºº¤Ç¤¢¤ë¥Ñ¥ë¥¹¥¨¥³¡¼¤ä¶áǯ³«È¯¤µ¤ì¤¿¥Õ¥§¡¼¥º¥É¥¢¥ì¥¤¤È¤Ï°Û¤Ê¤ê¡¢¸¡ººÂоݤòÆ©²á¤·¤¿Ä¶²»ÇȤÎÅÁÇÅ»þ´Ö¤È¸º¿ê¾ðÊ󤫤鲻®ʬÉۤȸº¿ê¾ðÊó¤ò²èÁüºÆ¹½À®¤·¡¢ÆâÉô¤ò²Ä»ë²½¤¹¤ëÊýË¡¤òÄ󰯤¹¤ë¡£¶Ë¤á¤Æ¾¯¤Ê¤¤ÅÁÇÅ»þ´Ö¥Ç¡¼¥¿¤«¤éÆâÉô¤ò²Ä»ë²½¤¹¤ë¤³¤È¤¬²Äǽ¤Ç¤¢¤ëWMRË¡¤Ë¤è¤êÆâÉô¤ò²Ä»ë²½¤¹¤ë¤³¤È¤Ë¤è¤ê¡¢¸¡ºº°÷¤Î·Ð¸³¤Ë¤è¤ëÉʼÁ¤Î¤Ð¤é¤Ä¤­¤¬¤Ê¤¯¤Ê¤ê¡¢ÄêÎÌŪ¤Êɾ²Á¤¬²Äǽ¤È¤Ê¤ë¡£

Âê̾Cell¥×¥í¥»¥Ã¥µ¤òÍѤ¤¤¿EM¥¢¥ë¥´¥ê¥º¥à¤ÎÊÂÎó½èÍý
Ãø¼Ô *ÆóÅÄ À²É§, ¼¾¾ Àµ¸ã, µÆÃÓ µ×ÏÂ(¿·³ãÂç³Ø¹©³ØÉô)
Pagepp. 289 - 293
Keyword Cell¥×¥í¥»¥Ã¥µ, ÊÂÎó½èÍý, EM¥¢¥ë¥´¥ê¥º¥à
AbstractËܸ¦µæ¤Ç¤Ï¡¤EM¥¢¥ë¥´¥ê¥º¥à¤Ë¤è¤ëº®¹çÀµµ¬Ê¬ÉÛ¿äÄê¥â¥¸¥å¡¼¥ë¤ÎCell¥×¥í¥»¥Ã¥µ¤Ø¤Î¼ÂÁõ¤ÈÀ­Ç½É¾²Á¤ò¹Ô¤Ê¤¦¡¥º£Æü¤ÎCPU¤ÎÀ­Ç½¸þ¾å¤Ï¡¤¥¯¥í¥Ã¥¯¼þÇÈ¿ô¤ò¹â¤á¤ë¤³¤È¤Ç¤Ê¤¯¡¤1¤Ä¤Î¥×¥í¥»¥Ã¥µÆâ¤Ë¿¤¯¤Î¥³¥¢(¥Þ¥ë¥Á¥³¥¢)¤òÅëºÜ¤¹¤ë¤³¤È¤ÇãÀ®¤·¤Æ¤¤¤ë¡¥¤½¤Î¤è¤¦¤Ê¥Þ¥ë¥Á¥³¥¢¥×¥í¥»¥Ã¥µ¤Î1¤Ä¤ËCell¥×¥í¥»¥Ã¥µ¤¬¤¢¤ë¡¥Cell¥×¥í¥»¥Ã¥µ¤Ï¡¤¥×¥í¥»¥Ã¥µ¤ÎÃæ¤Ë1¸Ä¤ÎÈÆÍÑŪ¥³¥¢(PPE)¤È¡¤8¸Ä¤ÎÊä½õŪ¤Ê¥³¥¢(SPE)¤ò»ý¤Ä¥Ø¥Æ¥í¥¸¥Ë¥¢¥¹¥Þ¥ë¥Á¥³¥¢¤Ç¤¢¤ê¡¤3.2 GHzưºî¤Ç200 GFlops°Ê¾å¤ÎÀ­Ç½¤ò»ý¤Ä¡¥Ä󰯤¹¤ë¥â¥¸¥å¡¼¥ë¤ÏǤ°Õ¤Î¸Ä¿ô¤ÎSPE¤òÍѤ¤¤ÆÊÂÎó¤Ë½èÍý¤¬¹Ô¤¨¤ë¤è¤¦¤ËÀ߷פò¹Ô¤Ê¤¦¡¥¤½¤·¤Æ¡¤6¸Ä¤ÎSPE¤ò»ÈÍѤ·¤¿¤È¤­¡¤81.8[\%]¤È¤¤¤¦¹â¤¤ÊÂÎ󲽸úΨ¤òÊݤÁ·×»»¤ò¹Ô¤Ê¤¨¤ë¤³¤È¤ò¼¨¤¹¡¥


¥»¥Ã¥·¥ç¥ó C1-1 ¥ì¥¤¥¢¥¦¥È
Æü»þ: 2007ǯ4·î23Æü(·î) 9:00-10:40
ºÂĹ: ¹âÅç ¹¯Íµ (Ë̶彣»ÔΩÂç³Ø ¹ñºÝ´Ä¶­¹©³ØÉô ¾ðÊó¥á¥Ç¥£¥¢¹©³Ø²Ê)

Âê̾¹â½¸ÀѲÄǽ¤Ê¥½¥Õ¥È¥â¥¸¥å¡¼¥ë¸þ¤±Fixed-Outline¥Õ¥í¥¢¥×¥é¥ó¥Ê
Ãø¼Ô *»³¹ø ͳµªÉ×, µÈ¼ ÌÔ, ÃÓ±Ê ¹ä, ¸åÆ£ ÉÒ(Áá°ðÅÄÂç³ØÂç³Ø±¡¾ðÊóÀ¸»º¥·¥¹¥Æ¥à¸¦µæ²Ê)
Pagepp. 295 - 300
Keyword ¥Õ¥í¥¢¥×¥é¥ó, ¥½¥Õ¥È¥â¥¸¥å¡¼¥ë, Fixed-Outline, Small dead space
Abstract²æ¡¹¤Ï¥½¥Õ¥È¥â¥¸¥å¡¼¥ë¸þ¤±¤ÎFixed-Outline¥Õ¥í¥¢¥×¥é¥ó¥Ê¤ò³«È¯¤·¤¿¡£¥Õ¥í¥¢¥×¥é¥ó¥Ê¤Ï¡¢2¤Ä¤ÎÉôʬ¤Ë¤è¤ê¹½À®¤µ¤ì¤Æ¤¤¤ë¡£1¤Ä¤Ï¡¢¿Ê²½Åª¥¢¥ë¥´¥ê¥º¥à¤Ë¤è¤ë¥â¥¸¥å¡¼¥ë¤Î½é´üÇÛÃ֤κîÀ®¤Ç¤¢¤ë¡£Dead space¤Î¾®¤µ¤¤¥Õ¥í¥¢¥×¥é¥ó¤ò¹â®¤ËÀ¸À®¤¹¤ë¤¿¤á¤Ë¡¢¡È»Ò¤ÎÀ¸À®¡É¤Ë¤ª¤¤¤ÆSpace-Oriented-Move¤È¤¤¤¦ÆÈ¼«¤ÎÀÝÆ°¤ò¼è¤êÆþ¤ì¤¿¡£¤â¤¦1¤Ä¤Ï¡¢½é´üÇÛÃÖ¤ËÂФ¹¤ë¡¢slackÃͤ˴ð¤Å¤¤¤¿¥â¥¸¥å¡¼¥ë·Á¾õ¤ÎÊѲ½¤Î¤ß¤Ë¤è¤ë¡¢ÇÛÃÖ¤Îdead space¤Îºï¸º¤Ç¤¢¤ë¡£¥Ù¥ó¥Á¥Þ¡¼¥¯¤Îɾ²Á·ë²Ì¤«¤é¡¢²æ¡¹¤Î¥Õ¥í¥¢¥×¥é¥ó¥Ê¤Ï¡¢¤¤¤Þ¤Þ¤ÇÊó¹ð¤µ¤ì¤¿¥Õ¥í¥¢¥×¥é¥ó¥Ê¤ÈÈæ³Ó¤·¤Æ¡¢Fixed-OutlineÀ©Ìó¤òËþ¤¿¤·¤Ê¤¬¤éÈó¾ï¤Ë¾®¤µ¤Êdead space¤Î¥Õ¥í¥¢¥×¥é¥ó¤ò¼Â¸½¤¹¤ë¤³¤È¤¬½ÐÍ褿¡£ÆÃ¤Ë¡¢GSRC¥Ù¥ó¥Á¥Þ¡¼¥¯¤În100,n200µÚ¤Ón300¤ËÂФ·¤Æ¤Ï¡¢Ìó95¡ó¤Î»î¹Ô¤ËÂФ·¤Æ3¡ó°Ê²¼¤Îdead space¤ò¼Â¸½¤¹¤ë¤³¤È¤¬½ÐÍ褿¡£

Âê̾¼þ´üŪ¤Ë·«¤êÊÖ¤¹ÇÛÃ֤θúΨŪ¤Êɽ¸½ÊýË¡
Ãø¼Ô *Àи¶ ·¼Í´(ÅìµþÇÀ¹©Âç³ØÂç³Ø±¡ Åŵ¤ÅŻҹ©³ØÀì¹¶), °©ºä ζÆÁ(ÅìµþÇÀ¹©Âç³Ø ¹©³ØÉô Åŵ¤ÅŻҹ©³Ø²Ê), Æ£µÈ Ë®ÍÎ(ÅìµþÇÀ¹©Âç³ØÂç³Ø±¡)
Pagepp. 301 - 306
Keyword sequence-triple, sequence-pair, ·«¤êÊÖ¤·ÇÛÃÖ, ÁêÂаÌÃÖ´Ø·¸

Âê̾Fujimaki-Takahashi Squeeze :À©Ìó¥°¥é¥Õ¤ÎÀþ·Á»þ´Ö¹½À®
Ãø¼Ô *¹â¶¶ ½Óɧ, Æ£´¬ μ(¿·³ãÂç³ØÂç³Ø±¡¼«Á³²Ê³Ø¸¦µæ²Ê)
Pagepp. 307 - 311
Keyword ¥Õ¥í¥¢¥×¥é¥ó, ɽ¸½Ë¡, ½çÎó, ÎÙÀÜ´Ø·¸
Abstract¥Õ¥í¥¢¥×¥é¥ó¤È¤Ï¶ë·Á¤ò¿åÊ¿Àþʬ¤ª¤è¤Ó¿âľÀþʬ¤Ë¤è¤ê¡¢´ö¤Ä¤«¤Î¶ë·Á¤ØºÙʬ¤·¤¿¤â¤Î¤Ç¤¢¤ë¡£Æ£´¬-¹â¶¶¤Ë¤è¤ê¡¢Éô²°Æ±»Î¤ÎÎÙÀÜ´Ø·¸¤ò¹Íθ¤·¤¿¥Õ¥í¥¢¥×¥é¥ó¤¬n-½çÎó(1¤«¤én¤Þ¤Ç¤Î¿ô¤Î½çÎó)¤Ë¤è¤Ã¤ÆÉ½¸½¤Ç¤­¤ë¤³¤È¤¬¼¨¤µ¤ì¤¿¡£ËÜÊó¹ð¤Ç¤Ï¡¢n-½çÎó¤Ë¤è¤Ã¤ÆÍ¿¤¨¤é¤ì¤¿¥Õ¥í¥¢¥×¥é¥ó¤Î³ÆÉô²°¤È»ÅÀÚ¤ê¤Î¿åÊ¿¤ª¤è¤Ó¿âľÀ©Ìó¥°¥é¥Õ¤¬O(n)»þ´Ö¤Ç¹½À®¤Ç¤­¤ë¤³¤È¤ò¼¨¤¹¡£

Âê̾Symmetry-Oriented Structured Placement for Analog Layouts
Ãø¼Ô *Qing Dong, Shigetoshi Nakatake(Department of Information and Media Sciences, University of Kitakyushu)
Pagepp. 313 - 318
Keyword placement, analog layout, symmetry, regularity, sequence-pair
AbstractThe structured placement is a novel concept to provide a structural domain with the topological regularity for analog placement. In this paper, we focus on the topological symmetricity and present a structural domain with a complete topological symmetry, where every block composes either self-symmetry or symmetrypair. Unlike the existing constraint-driven approaches, this structural domain enables us to generate a symmetrical placement without any constraint. The domain is represented by Single-Sequence as well as a placement based on the domain is done by Sequence-Pair. We utilize simulated annealing as the framework of the optimization, where we propose move operations for keeping topological symmetricity. Besides, we incorporate other regularity such as array and row as evaluation of placement. In experiments, we showed that our approach generated complete topological placements without much compromise on chip area and wire length, compared to the placements with no symmetry.


¥»¥Ã¥·¥ç¥ó C1-2 [¥Á¥å¡¼¥È¥ê¥¢¥ë] ¥Æ¥¹¥ÈÀß·×
Æü»þ: 2007ǯ4·î23Æü(·î) 11:00-12:00
ºÂĹ: »Ô¸¶ ±Ñ¹Ô (¹­Åç»ÔΩÂç³Ø ¾ðÊó²Ê³ØÉô ¾ðÊ󵡳£¥·¥¹¥Æ¥à¹©³Ø²Ê)

Âê̾(¾·ÂÔ)ÏÀÍý²óÏ©¤ËÂФ¹¤ë¹âÉʼÁÃÙ±ä¥Æ¥¹¥È
Ãø¼Ô *³á¸¶ À¿»Ê(¶å½£¹©¶ÈÂç³Ø)
Pagepp. 319 - 324
Keyword ÃÙ±ä¥Æ¥¹¥È, ¥Æ¥¹¥ÈÀ¸À®, £Ó£Ä£Ñ£Í, ÏÀÍý²óÏ©
AbstractÈùºÙ²½µ»½Ñ¤Î¿ÊÊâ¤Ëȼ¤¤¡¢À½Â¤¤·¤¿²óÏ©¤Î¥¿¥¤¥ß¥ó¥°Æ°ºî¤Ë±Æ¶Á¤òµÚ¤Ü¤¹¸Î¾ã¤¬ÌäÂê¤È¤Ê¤Ã¤Æ¤¤¤ë¡£ËܹƤǤϡ¢ÏÀÍý²óÏ©¤ÎÃÙ±ä¥Æ¥¹¥È¤Ë´Ø¤¹¤ë´ðËܵ»½Ñ¤ÈºÇ¶á¤ÎÏÃÂê¤Ë¤Ä¤¤¤Æ³µÀ⤹¤ë¡£¤Þ¤º¡¢ÂåɽŪ¤ÊÃÙ±ä¸Î¾ã¤Î¥â¥Ç¥ë¤ò¾Ò²ð¤¹¤ë¡£¼¡¤Ë¡¢¥¹¥­¥ã¥óµ¡Ç½¤ò»È¤Ã¤¿¼Â®Å٥ƥ¹¥ÈË¡¤ò¾Ò²ð¤¹¤ë¡£ÃÙ±ä¤ÎÂ礭¤µ¤ò¹Íθ¤ËÆþ¤ì¤¿ÃÙ±ä¥Æ¥¹¥È¤Î¥Æ¥¹¥ÈÉʼÁɾ²ÁÊýË¡¤È¤·¤ÆÃΤé¤ì¤Æ¤¤¤ëSDQM (Statistically Delay Quality Model)¤ò¾Ò²ð¤·¤¿¸å¡¢ÃÙ±ä¸Î¾ã¸¡½ÐÎϤò¹â¤á¤ë¤¿¤á¤Î¥Æ¥¹¥ÈÀ¸À®¼êË¡¤ò½Ò¤Ù¤ë¡£


¥»¥Ã¥·¥ç¥ó C1-3 ¥¢¡¼¥­¥Æ¥¯¥Á¥ãÀ߷פÈÄãÅÅÎϲ½
Æü»þ: 2007ǯ4·î23Æü(·î) 13:30-14:45
ºÂĹ: ¾®ÎÓ ÏÂ½Ê (µþÅÔÂç³Ø¾ðÊ󳨏¦µæ²ÊÄÌ¿®¾ðÊó¥·¥¹¥Æ¥àÀì¹¶)

Âê̾Issue Mechanism for Embedded Simultaneous Multithreading Processor
Ãø¼Ô *Chengjie Zang(Áá°ðÅÄÂç³ØÂç³Ø±¡ ¾ðÊóÀ¸»º¥·¥¹¥Æ¥à¸¦µæ²Ê), Shigeki Imai(¥·¥ã¡¼¥×³ô¼°²ñ¼Ò), Shinji Kimura(Áá°ðÅÄÂç³ØÂç³Ø±¡ ¾ðÊóÀ¸»º¥·¥¹¥Æ¥à¸¦µæ²Ê)
Pagepp. 325 - 330
Keyword simultaneous multithreading, instruction flag, predicate register, balanced round-robin issue policy
AbstractSimultaneous Multithreading (SMT) technology enhances instruction throughput by issuing multiple instructions from multiple threads within one clock cycle. For in-order pipeline to each thread, SMT processors can provide large number of issued instructions close to or surpass than using out-of-order pipeline. In this work, we show an efficient issue logic for predicated instruction sequence with the parallel flag at each instruction, where the predicate register based issue control is adopted and the continuous instructions with the parallel flag of '0' are executed in parallel. The flag is pre-defined by a compiler. Instructions from different threads are issued based on the round-robin order. We also introduce an Instruction Queue skip mechanism for thread if the queue is empty. Using this kind of issue logic, we designed a 6 threads, 7-stage, in-order pipeline processor. Based on this processor, we compare round-robin issue policy(RR(T1-Tn)) with other policies: thread one always has the highest priority(PR(T1)) and thread one or thread n has the highest priority in turn(PR(T1-Tn)). The results shown that RR(T1-Tn) policy outperforms others and PR(T1-Tn) is almost the same to RR(T1-Tn) from the point of view of the issued instructions per cycle.

Âê̾¹â¸úΨMessage-Passing¥¹¥±¥¸¥å¡¼¥ë¤òÍѤ¤¤¿LDPCÉü¹æ´ï¤ÎÄã¾ÃÈñÅÅÎϲ½
Ãø¼Ô *À¶¿å °ìÈÏ, ¸ÍÀî ˾, ÃÓ±Ê ¹ä, ¸åÆ£ ÉÒ(Áá°ðÅÄÂç³Ø)
Pagepp. 331 - 336
Keyword LDPCÉ乿, ¹â¸úΨMessage-Passing¥¹¥±¥¸¥å¡¼¥ë
AbstractËܹƤǤϡ¤¹â¸úΨMessage-Passing¥¹¥±¥¸¥å¡¼¥ë¤òŬÍѤ·¤¿LDPCÉü ¹æ´ï¤Î¾ÃÈñÅÅÎϤòºï¸º¤¹¤ë¤¿¤á¤Ë¡¤(1) min-sumË¡¤¬½ÐÎϤ¹¤ëÌàÅÙ¾ðÊó¤Î°µ½Ì¼êË¡¡¤(2) Ê£¿ô¤Î°µ½ÌÌàÅÙ¾ðÊó¤ò1¥¯¥í¥Ã¥¯¤ÇÎó½èÍý¥â¥¸¥å¡¼¥ë¤Ë½ÐÎϤ¹¤ë¤³¤È¤¬²Äǽ¤Ê¥Ï¡¼¥É¥¦¥§¥¢¤È¤½¤ÎÄã¾ÃÈñÅÅÎϲ½¼êË¡¡¤¤òÄ󰯤¹¤ë¡¥TSMC 0.18um CMOS¥Æ¥¯¥Î¥í¥¸¤òÍѤ¤¤Æ¾ÃÈñÅÅÎϤò¬Äꤷ¤¿·ë²Ì¡¤Ä󰯼êË¡¤òŬÍѤ¹¤ë¤³¤È¤Ë¤è¤ê¡¤min-sumË¡¤¬½ÐÎϤ¹¤ëÌàÅÙ¾ðÊó¤òÊÝ»ý¤¹¤ë¥Ï¡¼¥É¥¦¥§¥¢¤Î¾ÃÈñÅÅÎϤòÌóȾʬ¤Ëºï¸º¤Ç¤­¡¤ÌàÅÙ¾ðÊó¤ÎÎ̻Ҳ½¥Ó¥Ã¥È¿ô¤ä¹Ô½Å¤ß¤ÎÁý²Ã¤ËÂФ¹¤ë¡¤¾ÃÈñÅÅÎϤÎÁý²Ãʬ¤â¸Â¤ê¤Ê¤¯¾®¤µ¤¯ÍÞ¤¨¤ë¤³¤È¤¬²Äǽ¤Ç¤¢¤ë¤³¤È¤ò³Îǧ¤·¤¿¡¥

Âê̾¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉMOS²óÏ©¤Ë¤è¤ë¤·¤­¤¤ÏÀÍý¥·¥¹¥Æ¥à
Ãø¼Ô *¾®Àî ÂÀ°ì, ×¢À¥ ůÌé, Àõ°æ ůÌé, ±«µÜ ¹¥¿Î(Ë̳¤Æ»Âç³Ø ¾ðÊó²Ê³Ø¸¦µæ²Ê)
Pagepp. 337 - 341
Keyword ¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥É, ¤·¤­¤¤ÏÀÍý, Äã¾ÃÈñÅÅÎÏ, MOS
Abstract¶áǯ¤Î¾ðÊó¥Í¥Ã¥È¥ï¡¼¥¯¼Ò²ñ¤Î¿ÊŸ¤Ë¤È¤â¤Ê¤¤¡¢¥æ¥Ó¥­¥¿¥¹¾ðÊó´Ä¶­¤Î¼Â¸½¤Ë¸þ¤±¤ÆÂ¿¼ï¿Íͤʥ¤¥ó¥Æ¥ê¥¸¥§¥ó¥È¥»¥ó¥µLSI¤¬Í׵ᤵ¤ì¤ë¤è¤¦¤Ë¤Ê¤Ã¤¿¡£¤³¤ì¤é¤Î¥»¥ó¥µLSI¤Ï¹­¤¤Ãϰè¤Ëʬ»¶ÇÛÃÖ¤µ¤ì¡¢¸Â¤é¤ì¤¿¥¨¥Í¥ë¥®¡¼¸»¤ÇĹ´ü´Ö¤Ë¤ï¤¿¤êưºî¤¹¤ë¤³¤È¤¬Í׵ᤵ¤ì¤ë¡£ ¡¡¤³¤Î¤è¤¦¤ÊÄãÅÅÎÏÆ°ºî¤ò¼Â¸½¤¹¤ë¤¿¤á¤Ë¤Ï¡¢MOSÏÀÍý²óÏ©¤ò¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉÎΰè¤Çư¤«¤¹É¬Íפ¬¤¢¤ë¡£ËܹƤǤϡ¢¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉLSI¤Î³«È¯¤Ë¸þ¤±¤Æ¡¢¹âµ¡Ç½ÏÀÍý¥²¡¼¥È¤Î°ì¤Ä¡Ö¤·¤­¤¤ÏÀÍý¥²¡¼¥È¡×¤ò¼Â¸½¤¹¤ë¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉMOS²óÏ©¤òÄ󰯤¹¤ë¡£¤µ¤é¤Ë¡¢¤³¤Î¥²¡¼¥È¤òÍѤ¤¤¿¥µ¥Ö¥·¥¹¥Æ¥à¤ÎÎã¤È¤·¤Æ²Ã»»´ï¤òÀ߷פ·¡¢¤½¤Îưºî¤ò¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¾å¤Ç³Îǧ¤¹¤ë¡£


¥»¥Ã¥·¥ç¥ó C1-4 ±é»»´ïÀß·×
Æü»þ: 2007ǯ4·î23Æü(·î) 15:20-17:00
ºÂĹ: ±ÛÃÒ ÍµÇ· (µþÅÔÂç³Ø Âç³Ø±¡ ¾ðÊ󳨏¦µæ²Ê ÄÌ¿®¾ðÊó¥·¥¹¥Æ¥àÀì¹¶)

Âê̾Optimal Planar Jumping Systolic Array Design for Matrix Multiplication
Ãø¼Ô *ÍÌ ìÖ , ÌÚ¼ ¿¸Æó(Áá°ðÅÄÂç³ØÂç³Ø±¡¾ðÊóÀ¸»º¥·¥¹¥Æ¥à¸¦µæ²Ê)
Pagepp. 343 - 348
Keyword Jumping systolic array, matrix multiplication, fully concurrent operation
AbstractThis paper introduces an efficient array construction method for optimal planar systolic design for matrix multiplication. The basic idea is connection network adjustment among processing element (PE) array. Then the input/output data are jumping in the systolic array for multiplication operation requirements. The proposed ¡ÈJumping Systolic Array (JSA)¡É method increases matrix multiplication speed with less processing elements and few data registers. New systolic arrays, such as square jumping array, redundant dummy latency jumping hexagonal array, and compact parallel flow jumping hexagonal array, are also presented to improve system operation efficiency. Experimental results are given to demonstrate that jumping systolic array can realize fully concurrent operation and dominate other systolic architectures.

Âê̾Parallel Prefix Adder ¹çÀ®¤òÍѤ¤¤¿¾è»»´ï¤ÎºÇŬ²½¼êË¡¤Ë¤Ä¤¤¤Æ
Ãø¼Ô *¾¾±Ê ¿ÉÄ»Ò(Ê¡²¬ÃÎŪ¥¯¥é¥¹¥¿¡¼¸¦µæ½ê), ¾¾±Ê ͵²ð(¶å½£Âç³Ø)
Pagepp. 349 - 354
Keyword ¾è»»´ï, parallel prefix adder, ±é»»´ï¹çÀ®, wallace tree
AbstractËÜÏÀʸ¤Ç¤Ï¡¢¥¿¥¤¥ß¥ó¥°À©Ì󲼤ǤÎÌÌÀѺǾ®²½¤òÌÜŪ¤È¤·¤¿parallel prefix adder¹çÀ®ÌäÂê¤òÂоݤȤ¹¤ë¡£¥Æ¥¯¥Î¥í¥¸¤Ë°Í¸¤·¤Ê¤¤¥ì¥Ù¥ë¤Ç¤Îparallel prefix adder¤Î³µÎ¬¹½Â¤¤Ï¡¢prefix graph¤È¤·¤ÆÉ½¸½¤Ç¤­¤ë¡£¤½¤³¤Ç¡¢ÂоÝÌäÂê¤òprefix graph½¸¹ç¤ËÂФ¹¤ëõº÷ÌäÂê¤È¤·¤Æ¤È¤é¤¨¡¢¤¢¤ëÀ­¼Á¤ò¤â¤Äprefix graphÉôʬ½¸¹ç¤òÂоݤȤ·¤¿Æ°Åª·×²èË¡¤Ë´ð¤Å¤¯ÌÌÀѺǾ®²½¡¢µÚ¤Ó¡¢¥°¥é¥Õ¤ÎºÆ¹½Ãۤˤè¤ëÌÌÀѺ︺¤Î£²Ãʳ¬¤«¤é¼Â¸½¤µ¤ì¤ë¼êË¡¤òÄ󰯤¹¤ë¡£¤Þ¤¿¸½¼ÂŪ¤ÊŬÍÑÎã¤È¤·¤Æ¡¢ÊÂÎó¾è»»´ï¤ÎºÇ½ªÃʲû»´ï¤ò¤È¤ê¤¢¤²¡¢ËܼêË¡¤òÍѤ¤¤ë¤³¤È¤Ë¤è¤ê¡¢¾è»»´ïºÇŬ²½¤ËÂФ¹¤ë¸ú²Ì¤¬¤¢¤ë¤³¤È¤ò¼¨¤¹¡£

Âê̾GF(2m)¾å¤ÎMSB¾è»»´ï¤ò¥Ù¡¼¥¹¤Ë¤·¤¿Âʱ߶ÊÀþ°Å¹æLSI¸þ¤±MSD¾è»»´ï¤Î¼ÂÁõ
Ãø¼Ô *ÆàÎÉ ÎµÂÀ, ¾®¸¶ ½Ó°ï(Áá°ðÅÄÂç³ØÍý¹©³ØÉô¥³¥ó¥Ô¥å¡¼¥¿¡¦¥Í¥Ã¥È¥ï¡¼¥¯¹©³Ø²Ê), À¶¿å °ìÈÏ(Áá°ðÅÄÂç³ØÂç³Ø±¡¾ðÊóÀ¸»º¥·¥¹¥Æ¥à¸¦µæ²Ê), ¸ÍÀî ˾, Ìøß· À¯À¸, ÂçÉí äÉ×(Áá°ðÅÄÂç³ØÍý¹©³ØÉô¥³¥ó¥Ô¥å¡¼¥¿¡¦¥Í¥Ã¥È¥ï¡¼¥¯¹©³Ø²Ê)
Pagepp. 355 - 360
Keyword digit-serial¾è»»´ï, bit-serial¾è»»´ï, MSB¾è»»´ï, MSD¾è»»´ï, Âʱ߶ÊÀþ°Å¹æ
AbstractGF(2m)¤Ë¤ª¤±¤ëdigit-serial¾è»»´ï¤È¤Ï¡¤bit-serial¾è»»¤ò³ÈÄ¥¤·¡¤Ê£¿ô¤Î¥Ó¥Ã¥È¤òƱ»þ¤Ë½èÍý¤¹¤ë¤³¤È¤Ç1¥µ¥¤¥¯¥ë¤¢¤¿¤ê¤Î½èÍýÎ̤òÁý¤ä¤·¤¿¼êË¡¤Ç¤¢¤ë¡¥ËܹƤǤϡ¤MSB(most significant bit)¾è»»´ï¤ò¥Ù¡¼¥¹¤Ë¡¤digit-serial¾è»»´ï¤Î°ì¤Ä¤Ç¤¢¤ëMSD(most significant digit)¾è»»´ï¤òÄ󰯤¹¤ë¡¥ËܼêË¡¤ÏMSB¾è»»´ï¤òdigit¥µ¥¤¥ºD¤À¤±Ä¾Îó¤ËÀܳ¤¹¤ë¤³¤È¤ÇMSD¾è»»´ï¤ò¼ÂÁõ¤Ç¤­¤ë¤¿¤á¡¤½¾Íè¤Î¼êË¡¤è¤êÀ߷פ¬ÍưפˤʤꡤÌÌÀѤò¾®¤µ¤¯¤Ç¤­¤ë¡¥¤µ¤é¤Ë1²ó¤Î¾è»»¤ËɬÍפʥ¯¥í¥Ã¥¯¥µ¥¤¥¯¥ë¿ô¤òÍÞ¤¨¤ë¤³¤È¤¬¤Ç¤­¤ë¡¥Ä󰯼êË¡¤Ë¤è¤ë¾è»»´ï¤òÍѤ¤¤¿Âʱ߶ÊÀþ°Å¹æ½èÍý²óÏ©¤òROHM0.35um¥Æ¥¯¥Î¥í¥¸¤Ç¼ÂÁõ¤·¤¿·ë²Ì¡¤GF(2163)¤Ë¤ª¤±¤ëÂʱ߰Źæ½èÍý¤ò50MHzưºî»þ¤ËÌó0.115ms¤Ç½èÍý¤¹¤ë¤³¤È¤¬¤Ç¤­¤¿¡¥

Âê̾Counter Tree Diagram¤Ë¤è¤ë¿ÃÍ»»½Ñ±é»»²óÏ©¤ÎºÇŬÀß·×
Ãø¼Ô *½ÐÀî ¾¡É§, ËÜ´Ö ¾°Ê¸, ÀÄÌÚ ¹§Ê¸(ÅìËÌÂç³ØÂç³Ø±¡¾ðÊó²Ê³Ø¸¦µæ²Ê), Èõ¸ý ζͺ(ÅìË̹©¶ÈÂç³Ø¹©³ØÉôÅŻҹ©³Ø²Ê)
Pagepp. 361 - 366
Keyword »»½Ñ±é»»²óÏ©, ¥Ï¡¼¥É¥¦¥§¥¢¥¢¥ë¥´¥ê¥º¥à, ²óÏ©Àß·×, ¿ÃÍÏÀÍý, ¾éĹ¿ô·Ï
AbstractÉ®¼Ô¤é¤Ï¡¤»»½Ñ±é»»²óÏ©¤Î¥Ï¡¼¥É¥¦¥§¥¢¥¢¥ë¥´¥ê¥º¥à¤Î´ðËܤȤʤë²Ã»»¥¢¥ë¥´¥ê¥º¥à¤Îɽ¸½Ë¡¤È¤·¤Æ¡¤Counter Tree Diagram (CTD) ¤òÄ󰯤·¤Æ¤¤¤ë¡¥ËܹƤǤϡ¤¤³¤ÎCTD¤òÍøÍѤ·¤¿¡¤Â¿ÃÍ»»½Ñ±é»»²óÏ©¤ÎºÇŬÀ߷פˤĤ¤¤Æ½Ò¤Ù¤ë¡¥Ä󰯼êË¡¤Ç¤Ï¡¤¾éĹ¿ô·Ï¤òÍѤ¤¤¿²Ã»»¥¢¥ë¥´¥ê¥º¥à¡Ê¾éĹ²Ã»»¥¢¥ë¥´¥ê¥º¥à¡Ë¤òCTD¤Ë¤è¤Ã¤Æ·ÏÅýŪ¤ËƳ½Ð¤¹¤ë¡¥Æ³½Ð¤·¤¿CTD¤ò²óÏ©Êý¼°¤Ë±þ¤¸¤ÆÅ¬ÀÚ¤ËÁªÂò¤¹¤ë¤³¤È¤Ç¡¤ºÇŬ¤Ê¾éĹ²Ã»»´ï¤ÎÀ߷פ¬²Äǽ¤È¤Ê¤ë¡¥ËܹƤǤϡ¤¾éĹ2¿Ê²Ã»»´ï¤òÅÅή¥â¡¼¥É¿Ãͺ¹Æ°ÏÀÍý¤Ë´ð¤Å¤¯²óÏ©¤ÇÀ߷פ·¡¤¤½¤ÎÀ­Ç½¤òɾ²Á¤¹¤ë¡¥¤³¤Î·ë²Ì¡¤½¾Íè¤è¤ê¤âPDÀѤ¬27¡Á57%ºï¸º¤µ¤ì¤¿¡¤¾éĹ2¿Ê²Ã»»´ï¤ò¼Â¸½¤¹¤ë¤³¤È¤¬¤Ç¤­¤¿¡¥


¥»¥Ã¥·¥ç¥ó D1-1 ·Á¼°Åª¼êË¡
Æü»þ: 2007ǯ4·î23Æü(·î) 9:25-10:15
ºÂĹ: °ëÉô ¾Í¾° (»º¶Èµ»½ÑÁí¹ç¸¦µæ½ê ¾ðÊ󵻽Ѹ¦µæÉôÌç)

Âê̾¹¶·â¼Ô¤ò¹Íθ¤·¤¿Æ¿Ì¾À­¸¡¾ÚË¡
Ãø¼Ô *²ÏÊÕ µÁ¿®, ݯÅÄ ±Ñ¼ù(ÆüËÜÅÅ¿®ÅÅÏóô¼°²ñ¼Ò NTT¥³¥ß¥å¥Ë¥±¡¼¥·¥ç¥ó²Ê³Ø´ðÁø¦µæ½ê)
Pagepp. 367 - 372
Keyword ¥»¥­¥å¥ê¥Æ¥£¸¡¾Ú, ƿ̾À­, ·Á¼°¼êË¡, °Å¹æ¥×¥í¥È¥³¥ë, ÄêÍý¾ÚÌÀ
Abstract¶áǯ¡¤¥¤¥ó¥¿¡¼¥Í¥Ã¥ÈÅÅ»ÒÅêɼ¤Ê¤É¡¤¸Ä¿Í¾ðÊó¤¬Ï³±Ì¤·¤Æ¤Ï¤Ê¤é¤Ê¤¤¥·¥¹¥Æ¥à¤¬Áý¤¨¤Ä¤Ä¤¢¤ë¡¥¤½¤Î¤è¤¦¤Ê¥·¥¹¥Æ¥à¤ò°ÂÁ´¤Ë¹½ÃÛ¤¹¤ë¤Ë¤Ï¡¤Æ¿Ì¾À­¤È¸Æ¤Ð¤ì¤ëÀ­¼Á¤¬À®¤êΩ¤Ä¤³¤È¤ò¸·Ì©¤ËÊݾڤ¹¤ëɬÍפ¬¤¢¤ë¡¥²æ¡¹¤Ï¡¤·Á¼°¼êË¡¤Ë´ð¤Å¤­¡¤Ìµ¸Â¾õÂÖ¥·¥¹¥Æ¥à¤Îƿ̾À­¤òÄêÍý¾ÚÌÀ¤¹¤ë¼êË¡¤ò¼¨¤·¤Æ¤¤¤ë¡¥¤·¤«¤·¤³¤ÎÊýË¡¤Ï¡¤Åðݤè¤ê¤â¶¯¤¤¹¶·â¤¬¤¢¤ë¾ì¹ç¤Îƿ̾À­¤ò°·¤Ã¤Æ¤¤¤Ê¤«¤Ã¤¿¡¥ËܹƤϡ¤¹¶·â¼Ô¤¬¤¤¤ë¾ì¹ç¤Îƿ̾À­¤ò¥È¥ì¡¼¥¹½¸¹ç¤òÍѤ¤¤ÆÄêµÁ¤¹¤ë¡¥¤µ¤é¤Ë¡¤Æ¿Ì¾À­¤Î¾ÚÌÀË¡¤òƳÆþ¤¹¤ë¡¥ËܹƤǤϡ¤Å¬ÍÑÎã¤È¤·¤Æ¡¤Æ¿Ì¾ÄÌ¿®Ï©¤Î¼ÂÁõ¤Ç¤¢¤ëCrowds¤ò·Á¼°Åª¤Ë»ÅÍ͵­½Ò¤·¡¤Æ¿Ì¾À­¤òÄêÍý¾ÚÌÀ¤¹¤ë¡¥

Âê̾¥¤¥ó¥¿¡¼¥ï¡¼¥¯¥Õ¥í¡¼¤Î¥é¥Ù¥ëÉÕ¤­WF¥Í¥Ã¥È¥â¥Ç¥ë¤È¿¶¤ëÉñ¤¤·Ñ¾µ¤Ë¤Ä¤¤¤Æ
Ãø¼Ô *»³¸ý ¿¿¸ç(»³¸ýÂç³ØÂç³Ø±¡Íý¹©³Ø¸¦µæ²Ê), À®°æ Ű»Ö(»³¸ýÂç³Ø¹©³ØÉô), ³ë ºê°Î(»³¸ýÂç³Ø¶µ°é³ØÉô), ÅÄÃæ Ì­(»³¸ýÂç³ØÂç³Ø±¡Íý¹©³Ø¸¦µæ²Ê)
Pagepp. 373 - 378
Keyword ¥ï¡¼¥¯¥Õ¥í¡¼, ¥Ú¥È¥ê¥Í¥Ã¥È, ·òÁ´À­, ·Ñ¾µ
Abstract¥¤¥ó¥¿¡¼¥ï¡¼¥¯¥Õ¥í¡¼¤Ï¡¤Ï¢·ÈÁ°¤Î¤¢¤ë¥ï¡¼¥¯¥Õ¥í¡¼¤ò³ÈÄ¥¤·¤¿¹½Â¤¤ò¤â¤Ä¤Î¤Ç¡¤¿¶¤ëÉñ¤¤¤Ë¤Ä¤¤¤Æ¤âƱÍͤ˳ÈÄ¥¤·¤¿¿¶¤ëÉñ¤¤¤ò¤â¤Ä¤³¤È¤¬Ë¾¤Þ¤ì¤ë¡¥¤¢¤ë¥ï¡¼¥¯¥Õ¥í¡¼x¤¬¡¤Ê̤Υ¥¯¥Õ¥í¡¼y¤«¤é³ÈÄ¥¤·¤¿Éôʬ¤ò±£¤·¤¿¤ê¡¤¤½¤Î¼Â¹Ô¤ò¥Ö¥í¥Ã¥¯¤·¤¿¾ì¹ç¡¤y¤ÈƱ¤¸¿¶¤ëÉñ¤¤¤ò¤â¤Ä¤Ê¤é¤Ð¡¤x¤Ïy¤Î¿¶¤ëÉñ¤¤¤ò·Ñ¾µ¤¹¤ë¤È¤¤¤¦¡¥ËܹƤǤϡ¤¥ï¡¼¥¯¥Õ¥í¡¼´ÉÍý¥·¥¹¥Æ¥à¤Î¹ñºÝɸ½à²½ÃÄÂÎWfMC¤Î¥×¥í¥È¥³¥ë¤Ë´ð¤Å¤¯¥¤¥ó¥¿¡¼¥ï¡¼¥¯¥Õ¥í¡¼¤¬¡¤¤½¤ì¤¾¤ìÏ¢·ÈÁ°¤Î¥ï¡¼¥¯¥Õ¥í¡¼¤Î¿¶¤ëÉñ¤¤¤ò·Ñ¾µ¤¹¤ë¤³¤È¤ò¼¨¤¹¡¥


¥»¥Ã¥·¥ç¥ó D1-2 ÊÂÎóʬ»¶½èÍý
Æü»þ: 2007ǯ4·î23Æü(·î) 10:45-12:00
ºÂĹ: ²ÏÀ¾ ·û°ì (·²ÇÏÂç³Ø¹©³ØÉô¾ðÊ󹩳زÊ)

Âê̾Experimental Evaluation of Parallel Genetic Algorithms on Heterogeneous Line Topologies
Ãø¼Ô *Senlin Guan(Faculty of Information Engineering, University of the Ryukyus), Yiyuan Gong(National Institute of Informatics), Morikazu Nakamura(Faculty of Information Engineering, University of the Ryukyus)
Pagepp. 379 - 384
Keyword parallel genetic algorithm, migration interval, heterogeneous computing capability, grid
AbstractThis paper presents an experimental evaluation on parallel genetic algorithm (GA) on the line topology of heterogeneous computing resources. Evolution process of parallel GAs is investigated on two types of arrangements of heterogeneous computing resources: the ascending and descending order arrangement of computing capability. The differences between the two arrangements in chromosome variety, and solution quality are investigated. The results reveal that the quality of solution is determined by not only by the migration interval, but also and the computing capability and the arrangements of the computing resources.

Âê̾Minimum-Cost Load Balancing Document Distribution in Distributed Web Server Systems
Ãø¼Ô *Á¾º¬ ν, »³ÅÄ ÉÒµ¬(ºë¶ÌÂç³Ø Âç³Ø±¡Íý¹©³Ø¸¦µæ²Ê ¿ôÍýÅŻҾðÊóÉôÌç)
Pagepp. 385 - 390
Keyword Distributed web server, Document distribution, Load balancing, NP-completeness, Approximation algorithm
AbstractMotivated by load balancing on servers in DWS(Distributed Web Server) system, this paper considers the following problem: Given a workload of each web document, a common workload acceptable to all servers, and a cost required to transfer each document to each server, find a document distribution with a minimum total cost required to be transferred satisfying that the total workload of documents on each server does not exceed an acceptable workload when each document is allowed to be placed on multiple servers. In this paper, we prove that this problem is strongly NP-hard even in the case of a unit cost for transfer. Moreover, we present two algorithms for the problem in this case, an approximation one and a greedy one. In particular, the greedy algorithm can be solved in the case of an enough acceptable workload.

Âê̾Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
Ãø¼Ô *Satoshi Taoka, Toshimasa Watanabe(Graduate School of Engineering, Hiroshima University)
Pagepp. 391 - 396
Keyword Combinatorial optimization problems, MPI, Optimum solutions
AbstractA branch-and-bound algorithm (BB for short) is the most general technique to deal with various combinatorial optimization problems. Even if it is used, computation time is likely to increase exponentially. So we consider its parallelization to reduce it. We can expect that obtaining a better incumbent makes bounding operations appear at early stages of computation, possibly resulting in short computation time. In case of a parallel BB, it is also necessary to balance each processor load and to prevent increase in communication time¡¥ In this paper, we focus on a parallel BB for the graph coloring problem, propose some improvements for it, and experimentally evaluate how our modification affect computation time of a parallel BB on a PC cluster network.


¥»¥Ã¥·¥ç¥ó D1-3 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¿·À¤Âå¤Î·×»»¸Â³¦
Æü»þ: 2007ǯ4·î23Æü(·î) 13:30-15:00
ºÂĹ: ̦ÇÈ ¹°²Â (´ØÀ¾³Ø±¡Âç³Ø Íý¹©³ØÉô)

Âê̾(¾·ÂÔ)Â絬Ìϥǡ¼¥¿½èÍý¤ËÂФ¹¤ë¥¢¥ë¥´¥ê¥º¥àÍýÏÀ¤«¤é¤Î¥¢¥×¥í¡¼¥Á
Ãø¼Ô *±§Ìî µ£ÌÀ(¹ñΩ¾ðÊ󳨏¦µæ½ê)
Pagepp. 397 - 402
Keyword database, homology, genome, data mining, algorithm
Abstract¶áǯÈó¾ï¤ËÂ絬ÌϤʥǡ¼¥¿¤¬¼ê¤ËÆþ¤ë¤è¤¦¤Ë¤Ê¤ê¡¤¤½¤Î¥Ç¡¼¥¿¤ò²òÀϤ·¤ÆÍ­ÍѤʾðÊó¤ò¼è¤ê½Ð¤¹¤³¤È¤Ï¤Þ¤¹¤Þ¤¹½ÅÍ×ÅÙ¤òÁý¤·¤Æ¤¤¤ë¡¥¤·¤«¤·¡¤¥Ç¡¼¥¿¤ÎµðÂ礵¤Î¤¿¤á¡¤´û¸¤Î¼êË¡¤Ç¤Ï·×»»¤¬¸½¼ÂŪ¤Ê»þ´Ö¤Ç½ªÎ»¤·¤Ê¤¤¤È¤¤¤Ã¤¿ÊÀ³²¤â½Ð¤Æ¤­¤Æ¤¤¤ë¡¥ËÜȯɽ¤Ç¤Ï¡¤¥Ç¡¼¥¿²òÀϤÎÌäÂê¤ÎÃæ¤«¤é¡¤¥Ç¡¼¥¿¤ÎÎà»÷¹½Â¤¤ò¸«¤Ä¤±½Ð¤¹ÌäÂê¤Ë¾ÇÅÀ¤òÅö¤Æ¤ë¡¥Îà»÷¹½Â¤¤ò¸«¤Ä¤±½Ð¤¹ÊýË¡¤Ë¤ÏÎà»÷¸¡º÷¤òÍѤ¤¤ëÊýË¡¤ÈÁ´ÂÐÈæ³Ó¤ò¤¹¤ëÊýË¡¤¬¤¢¤ë¤¬¡¤Î¾¼Ô¤È¤â¤Ë1000Ëü¹àÌܤòͤ¨¤ë¥Ç¡¼¥¿¤Ç¤Ï¡¤¸½¼ÂŪ¤Ê»þ´Ö¤Ç½ªÎ»¤·¤Ê¤¤¡¥ËÜȯɽ¤Ç¤Ï¡¤Ä̾ï¤ÎPC¤Ç¤â¸½¼ÂŪ¤Ê»þ´Ö¤Ç·×»»¤¬½ªÎ»¿·¤·¤¤¼êË¡¤òÄ󰯤·¡¤¤µ¤é¤Ë¤³¤Î¼êË¡¤ò¥²¥Î¥à¤Î²òÀϤËÍѤ¤¤¿·ë²Ì¤ò¾Ò²ð¤¹¤ë¡¥

Âê̾(¾·ÂÔ)´Ê·é¥Ç¡¼¥¿¹½Â¤
Ãø¼Ô *Äê·ó ˮɧ(¶å½£Âç³Ø)
Pagepp. 403 - 408
Keyword ´Ê·é¥Ç¡¼¥¿¹½Â¤, °µ½Ì
Abstract´Ê·é¥Ç¡¼¥¿¹½Â¤¤Ï¡¤¥Ç¡¼¥¿¹½Â¤¤Î¥µ¥¤¥º¤ò¶Ë¸Â¤Þ¤Ç¾®¤µ¤¯¤·¡¤¤«¤Ä¡¤ ¹â®¤ÊÌ䤤¹ç¤ï¤»¤ò¼Â¸½¤¹¤ë¤â¤Î¤Ç¤¢¤ê¡¤ÂçÎ̥ǡ¼¥¿¤Î¹â®½èÍý¤ò ¹Ô¤¦¾ì¹ç¤ËÍѤ¤¤é¤ì¤ë¡¥ËܹƤǤϴðËÜŪ¤Ê´Ê·é¥Ç¡¼¥¿¹½Â¤¤ò²òÀ⤹¤ë¡¥


¥»¥Ã¥·¥ç¥ó D1-4 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ·Á¼°¼êË¡¤Ë´ð¤Å¤¯ÊÂ¹Ô¥×¥í¥°¥é¥ß¥ó¥°
Æü»þ: 2007ǯ4·î23Æü(·î) 15:15-16:45
ºÂĹ: ²ÏÊÕ µÁ¿® (NTT¥³¥ß¥å¥Ë¥±¡¼¥·¥ç¥ó²Ê³Ø´ðÁø¦µæ½ê ¿Í´Ö¾ðÊ󸦵æÉô ¾ðÊó´ðÁÃÍýÏÀ¸¦µæ¥°¥ë¡¼¥×)

Âê̾(¾·ÂÔ)¥×¥í¥»¥¹»Ø¸þ¤ò¼ÂÁõ¤·¤¿¸À¸ì(occam-¦Ð¡¤JCSP¡¤C++CSP)¤È¤½¤Î¼êË¡
Ãø¼Ô *¾¾°æ Ï¿Í(NPOË¡¿Í CSP¥³¥ó¥½¡¼¥·¥¢¥à)
Pagepp. 409 - 414
Keyword CSP, Pi-Calculus, occam, JCSP
Abstractoccam¤ÏCSP¥×¥í¥»¥¹¥â¥Ç¥ë¤«¤éƳ½Ð¤µ¤ì¤¿ÊÂÎó½èÍý¥×¥í¥°¥é¥ß¥ó¥°¸À¸ì¤Ç¤¢¤ê¡¢¾¨¤Æ¤ÏTransputer¤È¸Æ¤Ð¤ì¤ëÊÂÎó½èÍý¥×¥í¥»¥Ã¥µ¡¼¾å¤Çưºî¤·¤Æ¤¤¤¿¡£¤½¤Î¸å±Ñ¹ñKentÂç³Ø¤ÎPeter Welch¶µ¼ø¤é¤Ë¤è¤Ã¤Æoccam¤Ï¿Ê²½¤·¡¢ºÇ¶á¤Ç¤Ï¦Ð-Calculus¤¬¥Ö¥ì¥ó¥É¤µ¤ìoccam-¦Ð¤Ê¤ë¸À¸ì¤¬¼Â¸½¤µ¤ì¤Æ¤ª¤ê¡¢Linux(x86, MIPS, PPC, Cell), Solaris(Sparc)¾å¤Çưºî¤·¤Æ¤¤¤ë¡£¹¹¤Ë¥ª¥Ö¥¸¥§¥¯¥È»Ø¸þ¸À¸ì(Java, C++)¤Ë¤â¼ÂÁõ¤µ¤ì¤Æ¤¤¤ë¡£¤³¤³¤Ç¤Ïoccam-¦Ð¡¢JCSP¡¢C++CSP¤ÎÆâÍÆ¤È¤½¤Î¥×¥í¥°¥é¥ß¥ó¥°¼êË¡¤Ë¤Ä¤¤¤Æ½Ò¤Ù¤ë¡£

Âê̾(¾·ÂÔ)¦Ð·×»»¤Ë¤â¤È¤Å¤¯¥Í¥Ã¥È¥ï¡¼¥¯¥×¥í¥°¥é¥ß¥ó¥°¸À¸ì Nepi
Ãø¼Ô *¿¿Ìî ·ò(NTT¥³¥ß¥å¥Ë¥±¡¼¥·¥ç¥ó²Ê³Ø´ðÁø¦µæ½ê)
Pagepp. 415 - 420
Keyword ¥×¥í¥»¥¹·×»», ¦Ð·×»», ʹÔ, ¥Í¥Ã¥È¥ï¡¼¥¯¥×¥í¥°¥é¥ß¥ó¥°
Abstract¥×¥í¥»¥¹·×»»¤È¤Ï¡¤ÄÌ¿®¥×¥í¥»¥¹¤òµ­½Ò¡¦²òÀÏ¡¦¸¡¾Ú¤¹¤ë¤¿¤á¤ÎÍýÏÀŪÂηϤǤ¢¤ê¡¤¦Ð·×»»¤Ï¤½¤Î¤Ò¤È¤Ä¤Ç¤¢¤ë¡¥¥Í¥Ã¥È¥ï¡¼¥¯¥×¥í¥°¥é¥ß¥ó¥°¸À¸ì Nepi ¤Ï¦Ð·×»»¤Ë´ð¤Å¤¯¥×¥ê¥ß¥Æ¥£¥Ö¤òºÎÍѤ·¡¤ÄÌ¿®¤È¤½¤ì¤Ëȼ¤¦À©¸æ¹½Â¤¤ò´Ê·é¤«¤Ä¸«Ä̤·¤è¤¯µ­½Ò¤Ç¤­¤ë¤È¤¤¤¦ÆÃŤò¤â¤Ä¡¥ËÜȯɽ¤Ç¤Ï¡¤¤½¤Î¸À¸ì»ÅÍÍ¡¤¥·¥¹¥Æ¥à¥Ç¥¶¥¤¥ó¡¤¤ª¤è¤ÓÍ­ÍÑÀ­¤ò³Îǧ¤¹¤ë¤¿¤á¤Î¥×¥í¥°¥é¥ß¥ó¥°·Ð¸³¤Ë¤Ä¤¤¤ÆÀâÌÀ¤¹¤ë¡¥


ÆÃÊ̾·ÂÔ¹Ö±é
Æü»þ: 2007ǯ4·î23Æü(·î) 17:40-18:40
ºÂĹ: °¤Éô Àµ±Ñ (ÅìËÌÂç³Ø Âç³Ø±¡ ¹©³Ø¸¦µæ²Ê ÅŻҹ©³ØÀì¹¶)

Âê̾(¾·ÂÔ)¥Ó¥Ç¥ª¥«¥á¥éÍÑAVCHDµ¬³Ê¤ÎºöÄê¤Èº£¸å¤Î¥Ó¥Ç¥ª¥«¥á¥éư¸þ
Ãø¼Ô *µÈÀî ¹§Íº(¥½¥Ë¡¼³ô¼°²ñ¼Ò)
Pagepp. 421 - 422
Keyword AVCHD, ¥«¥à¥³¡¼¥À, MPEG-4 AVC, xvYcc, ¥É¥ë¥Ó¡¼¥Ç¥¸¥¿¥ë
AbstractAVCHD¡ÊAdvanced Video Codec High Definition, ¥¨¡¼¥Ö¥¤¥·¡¼¥¨¥¤¥Á¥Ç¥£¡¼¡Ë¤Ï¡¢ 2006ǯ5·î11Æü¤Ë¾¾²¼ÅŴﻺ¶È¤È¥½¥Ë¡¼¤¬´ðËÜ»ÅÍͤòºöÄꤷ¤¿¥Ï¥¤¥Ç¥£¥Õ¥£¥Ë¥·¥ç¥ó(HD)±ÇÁü¤ò¥Ó¥Ç¥ª¥«¥á¥é¤Çµ­Ï¿¤¹¤ë¤¿¤á¤Îµ¬³Ê¤Ç¤¢¤ë¡£ 8¥»¥ó¥ÁDVDÅù¤Î½¾Íè¥á¥Ç¥£¥¢¤Ë¤â½½Ê¬¤Ë¹â²è¼Á¤Çµ­Ï¿¤Ç¤­¤ë¤è¤¦¤Ë¡¢ ±ÇÁüÉ乿²½¤Ë¤ÏMPEG-4 AVC(H.264)Êý¼°¤ò»È¤¤¡¢ ²»À¼É乿²½¤Ë¤Ï¥É¥ë¥Ó¡¼¡¦¥Ç¥¸¥¿¥ë(AC-3)Êý¼°¤ò»È¤¤¡¢ ¿½Å²½¤ËMPEG2-TS¤òÍѤ¤¤Æ¤¤¤ë¡£ ¤Þ¤¿¥Ï¥¤¥Ç¥£¥Õ¥£¥Ë¥·¥ç¥ó±ÇÁü(HDV)°Ê³°¤Ë¤â¡¢½¾Íè¤Îɸ½à±ÇÁü(SDV)¤â¥µ¥Ý¡¼¥È¤·¤Æ¤¤¤ë¡£ AVCHD¤ÎÆÃħ¤Î¤Ò¤È¤Ä¤¬Ê£¿ô¤Îµ­Ï¿¥á¥Ç¥£¥¢¤ò¥µ¥Ý¡¼¥È¤·¤¿»ö¤Ç¤¢¤ê¡¢¥Ï¡¼¥É¥Ç¥£¥¹¥¯¥É¥é¥¤¥Ö (HDD) ¡¢SD¥á¥â¥ê¡¼¥«¡¼¥É¡¦MemoryStick¤¬¥µ¥Ý¡¼¥È¤µ¤ì¤Æ¤¤¤ë¡£


¥»¥Ã¥·¥ç¥ó A2-1 ÈóÀþ·Á²óÏ©¤Î²òÀϤÈÀß·×
Æü»þ: 2007ǯ4·î24Æü(²Ð) 8:45-10:15
ºÂĹ: ÌÐϤ À¬°ìϺ (Ê¡°æÂç³Ø)

Âê̾ÍÍ¡¹¤ÊQÃͤˤª¤±¤ë¥·¥ã¥ó¥È¥­¥ã¥Ñ¥·¥¿¤ÎÈóÀþ·ÁÀ­¤ò¹Íθ¤·¤¿DEµéÁýÉý´ï¤ÎÀß·×
Ãø¼Ô *¹¾Âô Ű, ´Ø²° Âçͺ, Ϥ ·úÌÀ, ëÇë δ»Ì(ÀéÍÕÂç³ØÂç³Ø±¡¼«Á³²Ê³Ø¸¦µæ²Ê)
Pagepp. 423 - 428
Keyword DEµéÁýÉý´ï, MOSFET, ¥·¥ã¥ó¥È¥­¥ã¥Ñ¥·¥¿, ´óÀ¸ÍÆÎÌ, ÈóÀþ·ÁÀ­
AbstractËܸ¦µæ¤Ç¤Ï, ÍÍ¡¹¤ÊQ Ãͤˤª¤±¤ë¥·¥ã¥ó¥È¥­¥ã¥Ñ¥·¥¿¤ÎÈóÀþ·ÁÀ­¤ò¹Íθ¤·¤¿DE µéÁýÉý´ï¤ÎÀ߷פò¹Ô¤¦. ¥·¥ã¥ó¥È¥­¥ã¥Ñ¥·¥¿¤Ë´Þ¤Þ¤ì¤ëMOSFET¤Î´óÀ¸ÍÆÎ̤ÎÈóÀþ·ÁÀ­¤ò¹Íθ¤·¤¿DE µéÁýÉý´ï¤Î½¾Íè¤Î²òÀϤª¤è¤ÓÀ߷פˤª¤¤¤Æ¤Ï, ÍýÁÛŪ¤Ê¥Õ¥£¥ë¥¿¤òƳÆþ¤·, ¤Þ¤¿, MOSFET ¤Î´óÀ¸ÍÆÎ̤ÎÊÑ¿ô¤Î¤Ò¤È¤Ä¤Ç¤¢¤ëÉÔ½ãʪǻÅÙ¤ò°ì¤Ä¤ÎÃͤDz¾Äꤷ¤Æ¤¤¤ë. ¤·¤«¤·¤Ê¤¬¤é, ¹â½ÐÎϤ¬Í׵ᤵ¤ì¤ë¾ì¹ç¤Ê¤É¤Ë¤ÏÄ㤤Q ÃͤÇÀ߷פ¹¤ë¤³¤È¤¬µá¤á¤é¤ì, ¤Þ¤¿ÉÔ½ãʪǻÅÙ¤ÏMOSFET¤ÎÈóÀþ·ÁÆÃÀ­¤òÂ礭¤¯ÊѤ¨¤ë. ¤½¤Î¤¿¤á, ¤³¤ì¤é¤ÎÊÑ¿ô¤¬²óÏ©¤ËÍ¿¤¨¤ë±Æ¶Á¤òÌÀ¤é¤«¤Ë¤¹¤ë¤³¤È¤Ï¶Ë¤á¤Æ½ÅÍפǤ¢¤ë. Ëܸ¦µæ¤Ç¤Ï, ÍÍ¡¹¤ÊQÃͤˤª¤¤¤ÆMOSFET¤ÎÉÔ½ãʪǻÅÙ¤ÎÃͤòÊÑÆ°¤µ¤»¤¿¤È¤­¤Î²óÏ©¤ÎÀß·×¶ÊÀþ¤ò¿ôÃÍ·×»»¤Ë¤è¤êÌÀ¤é¤«¤Ë¤¹¤ë.

Âê̾»þ´ÖËè¤ËÊѲ½¤¹¤ëÄñ¹³¤òÍѤ¤¤¿Äñ¹³³Ê»ÒÌ֤ǤΠWinner Take All ²óÏ©¤Ë´ð¤Å¤¯ºÇû»þ´Ö·Ðϩõº÷
Ãø¼Ô *º´Æ£ ²í½Ó, ÀÄ¿¹ µ×, ÅÄÃæ êÌ(¾åÃÒÂç³ØÍý¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê)
Pagepp. 429 - 433
Keyword Winner Take All, CNN, ·Ðϩõº÷

Âê̾¥Õ¥í¡¼¥Æ¥£¥ó¥°¥²¡¼¥ÈMOSFET¤òÍѤ¤¤¿°ì¼¡¸µÎ¥»¶»þ´ÖÎϳطϽ¸ÀѲóÏ©
Ãø¼Ô *²Ï¼ ·ò°ì, ËÙÈø ´îɧ(ÅìµþÅŵ¡Âç³Ø Âç³Ø±¡¹©³Ø¸¦µæ²Ê), ¹ç¸¶ °ì¹¬(ÅìµþÂç³Ø À¸»ºµ»½Ñ¸¦µæ½ê)
Pagepp. 435 - 440
Keyword ¥«¥ª¥¹²óÏ©, ¥¢¥Ê¥í¥°½¸ÀѲóÏ©, ¥Õ¥í¡¼¥Æ¥£¥ó¥°¥²¡¼¥ÈMOSFET
Abstract¥Õ¥í¡¼¥Æ¥£¥ó¥°¥²¡¼¥ÈMOSFET(FG-MOSFET)¤Ï, ¥²¡¼¥È¤ËÊ£¿ô¤Î¥­¥ã¥Ñ¥·¥¿¤òÀܳ¤·¤¿ÁǻҤÇ, ÍÍ¡¹¤Ê¥¢¥Ê¥í¥°²óÏ©¤Ø±þÍѤµ¤ì¤Æ¤¤¤ë. FG-MOSFET¤òÍѤ¤¤¿¥«¥ª¥¹È¯À¸²óÏ©¤È¤·¤Æ, FG-MOSFET¤òÍѤ¤¤¿ÈóÀþ·ÁÄñ¹³²óÏ©, FG-MOS¥¤¥ó¥Ð¡¼¥¿²óÏ©, ¤µ¤é¤Ë, FG-MOS¥Ô¡¼¥­¥ó¥°ÅÅή¸»²óÏ©¤ò¼ÌÁü´Ø¿ô²óÏ©¤È¤·¤ÆÍѤ¤¤ë£³¼ïÎà¤Î°ì¼¡¸µÎ¥»¶»þ´ÖÎϳطϲóÏ©¤¬Ä󰯤µ¤ì¤Æ¤¤¤ë. ËÜÏÀʸ¤Ç¤Ï, ¤³¤ì¤é£³¼ïÎà¤Î°ì¼¡¸µÎ¥»¶»þ´ÖÎϳطϲóÏ©¤ò½¸ÀѲóÏ©²½¤¹¤ë. À½ºî¤·¤¿¥×¥í¥È¥¿¥¤¥×¥Á¥Ã¥×¤è¤ê, ¤½¤ì¤¾¤ì¤Î¼ÌÁü´Ø¿ô²óÏ©¤ÎÆþ½ÐÎÏÆÃÀ­¤È, ³°ÉôÀ©¸æ¥Ð¥¤¥¢¥¹Å۵¤ËÂФ¹¤ë°ì¼¡¸µÎ¥»¶»þ´ÖÎϳطϲóÏ©¤Îʬ´ôÆÃÀ­¤ò¬Äꤷ, ¤µ¤é¤Ë, ¬ÄêÃͤè¤ê¥ê¥¢¥×¥Î¥Õ»Ø¿ô¤òµá¤á¤ë»ö¤Ë¤è¤ê, ½¸ÀѲ½¤·¤¿²óÏ©¤ÎÆÃÀ­¤òɾ²Á¤¹¤ë.

Âê̾¥¤¥ó¥¿¡¼¥ê¡¼¥Ö·¿°ÌÁêÀ©¸æE2µédc/dc¥³¥ó¥Ð¡¼¥¿
Ãø¼Ô *ÊÒ»³ ´´, ´Ø²° Âçͺ, Ϥ ·úÌÀ, ëÇë δ»Ì(ÀéÍÕÂç³ØÂç³Ø±¡¼«Á³²Ê³Ø¸¦µæ²Ê)
Pagepp. 441 - 446
Keyword Eµé¥¤¥ó¥Ð¡¼¥¿, °ÌÁêÀ©¸æ·¿E^2µédc/dc¥³¥ó¥Ð¡¼¥¿, ¥¤¥ó¥¿¡¼¥ê¡¼¥Ö
AbstractËܸ¦µæ¤Ç¤Ï, °ÌÁêÀ©¸æ·¿E^2µédc/dc¥³¥ó¥Ð¡¼¥¿¤ò¥¤¥ó¥¿¡¼¥ê¡¼¥Ö¤·¤¿, ¥¤¥ó¥¿¡¼¥ê¡¼¥Ö·¿°ÌÁêÀ©¸æE^2µédc/dc¥³¥ó¥Ð¡¼¥¿¤òÄ󰯤¹¤ë. ¥¤¥ó¥¿¡¼¥ê¡¼¥Ö¤Ë¤è¤ê, ¹âưºî¼þÇÈ¿ô¹â¸úΨưºî¤ÈÄãÅ۵ÂçÅÅή¤òƱ»þ¤ËËþ¤¿¤¹²óÏ©¤ò¼Â¸½¤¹¤ë¤³¤È¤¬²Äǽ¤È¤Ê¤ë. ¤Þ¤¿, Æó¤Ä¤Î¥¤¥ó¥Ð¡¼¥¿¤Î¶îưÇÈ·Á¤Î°ÌÁ꺹¤òÊѲ½¤µ¤»¤ë¤³¤È¤Ç½ÐÎÏÅ۵¤òÀ©¸æ¤¹¤ë¤³¤È¤¬²Äǽ¤Ç¤¢¤ë. ¤µ¤é¤Ë, ¥¤¥ó¥¿¡¼¥ê¡¼¥Ö²½¤Ë¤è¤ê, °ÌÁêÀ©¸æ·¿E^2µédc/dc¥³¥ó¥Ð¡¼¥¿¤ËÈæ¤ÙÆþÎÏÅ۵¤ÎÊÑÆ°¤ËÂФ¹¤ëÀ©¸æÈϰϤò°Ý»ý¤·¤Ä¤Ä, °ÌÁêÊѲ½¤Ë¤è¤ë½ÐÎÏÅ۵¤ÎÀ©¸æÈϰϤª¤è¤ÓÉé²ÙÊÑÆ°¤ËÂФ¹¤ëÀ©¸æÈϰϤò³ÈÂ礹¤ë¤³¤È¤¬²Äǽ¤È¤¹¤ë. À߷פ·¤¿²óÏ©¤Ë¤ª¤¤¤Æ, Æó¤Ä¤Î¥¤¥ó¥Ð¡¼¥¿¤Î¶îưÇÈ·Á¤Î°ÌÁ꺹¤¬ÊѲ½¤·¤¿¤È¤­¤ÎÄ󰯲óÏ©¤Îưºî¤Ë¤Ä¤¤¤Æ¹Í»¡¤¹¤ë. ²óÏ©¼Â¸³¤ò¹Ô¤¦¤³¤È¤Ë¤è¤êÀ߷פÎÂÅÅöÀ­¤ò¼¨¤¹.


¥»¥Ã¥·¥ç¥ó A2-2 ¥«¥ª¥¹¤È¤½¤Î±þÍÑ
Æü»þ: 2007ǯ4·î24Æü(²Ð) 10:30-12:20
ºÂĹ: ËÙÈø ´îɧ (ÅìµþÅŵ¡Âç³Ø)

Âê̾Various Superstable Phenomena in 1-D Maps with a Trapping Window
Ãø¼Ô *¾¾²¬ Í´²ð(Ë¡À¯Âç³ØÂç³Ø±¡ ¹©³Ø¸¦µæ²Ê Åŵ¤¹©³ØÀì¹¶), ºØÆ£ ÍøÄÌ(Ë¡À¯Âç³Ø ¹©³ØÉô ¾ðÊóÅŵ¤ÅŻҹ©³Ø²Ê)
Pagepp. 447 - 450
Keyword Circle map, Sigma-delta modulator, Superstable phenomena
AbstractThis paper studies dynamics of 1D map with a trapping window. The window has a zero slope and causes various superstable phenomena. We study such phenomena using two examples relating to A/D converters and power converters. In precise numerical simulation, we have investigated robustness for parameter perturbation on the window.

Âê̾¥Á¥§¥Ó¥·¥§¥Õ¿¹à¼°¤òÍѤ¤¤¿¥Ñ¥¤¥³¥ÍÊÑ´¹¤Ë¤è¤êÀ¸À®¤·¤¿¥«¥ª¥¹¿®¹æ¤Î±é»»ÀºÅÙ¤ÈÁê´ØÆÃÀ­¤È¤Î´Ø·¸
Ãø¼Ô *°ËÆ£ ²Åµ¬, ÊÂÌÚ Ã£Ìé(ÌÀ¼£Âç³ØÂç³Ø±¡Íý¹©³Ø¸¦µæ²Ê), ³ùÅÄ ¹°Ç·(ÌÀ¼£Âç³ØÍý¹©³ØÉô)
Pagepp. 451 - 456
Keyword ¥«¥ª¥¹, ³È»¶É乿, ¥Ñ¥¤¥³¥ÍÊÑ´¹, ¥Á¥§¥Ó¥·¥§¥Õ¿¹à¼°, Áê´ØÆÃÀ­
Abstract¥Ñ¥¤¥³¥Í¤Î¸¶Íý¤Ë´ð¤Å¤­¥«¥ª¥¹¿®¹æ¤òÀ¸À®¤¹¤ëºÝ¤Ë¡¢Ä¾¸ò´Ø¿ô¤Î°ì¤Ä¤Ç¤¢¤ë¥Á¥§¥Ó¥·¥§¥Õ¿¹à¼°¤òÍѤ¤¤ëÊýË¡¤Ï¡¢¤¤¤¯¤Ä¤«¤Î¸¦µæµ¡´Ø¤Ç¸¡Æ¤¤µ¤ì¡¢Â¿½ÅÄÌ¿®¤Ë¤ª¤±¤ë³È»¶É乿¤ËŬÍѤµ¤ì¤Æ¤¤¤ë¡£¤·¤«¤·¡¢¸½ºß¸¡Æ¤¤µ¤ì¤Æ¤¤¤ëÊý¼°¤Ï¡¢¼ç¤Ë£±£¶¥Ó¥Ã¥ÈÄøÅ٤θÇÄê¾®¿ôÅÀ±é»»¤Ë¤è¤êÀ¸À®¤¹¤ë¤â¤Î¤Ç¤¢¤ê¡¢¼«¸ÊÁê´ØÆÃÀ­¡¢Áê¸ßÁê´ØÆÃÀ­¤È¤â¤Ë¿½ÅÄÌ¿®¤ËŬÍѤǤ­¤ë¥ì¥Ù¥ë¤Ë¤Ï»ê¤Ã¤Æ¤Ê¤¤¡£Ëܸ¦µæ¤Ç¤Ï¡¢¥«¥ª¥¹¤ò¥¹¥Ú¥¯¥È¥ë³È»¶ÄÌ¿®¤Î³È»¶É乿¤Ë±þÍѤ¹¤ë¤¿¤á¤Ë¡¢¥Á¥§¥Ó¥·¥§¥Õ¿¹à¼°¤Ë¤è¤ë³È»¶É乿À¸À®Ë¡¤òÄ󰯤¹¤ë¡£¥«¥ª¥¹¤Ç¤Î³È»¶É乿¤ò£³£²¥Ó¥Ã¥È¸ÇÄê¾®¿ôÅÀ±é»»¤Ë¤è¤ê¡¢Q14¥Õ¥©¡¼¥Þ¥Ã¥È¤«¤éQ30¥Õ¥©¡¼¥Þ¥Ã¥È¤Þ¤Ç³È»¶É乿¤òÀ¸À®¤·¡¢¼«¸ÊÁê´Ø¤ª¤è¤ÓÁê¸ßÁê´ØÆÃÀ­¤òÄ´¤Ù¤¿¡£¤µ¤é¤Ë¡¢¼ÂºÝ¤ËÁ÷¿®¾ðÊó¤òÍ¿¤¨¡¢¤½¤ì¤¾¤ì¤Î³È»¶É乿¤Ë¤è¤ê¿½Å²½¤·¤¿»þ¤Î¡¢¥Ó¥Ã¥È¸í¤êΨ¡ÊBit Error Rate¡Ë¤â¸¡Æ¤¤¹¤ë¡£

Âê̾¶èʬÀþ·Á¥¹¥Ñ¥¤¥­¥ó¥°¥Ë¥å¡¼¥í¥ó¤Îʬ´ô¸½¾Ý¤Î¹Í»¡
Ãø¼Ô *Âçë Íø¸÷, ºØÆ£ ÍøÄÌ(Ë¡À¯Âç³Ø¹©³ØÉô¾ðÊóÅŵ¤ÅŻҹ©³Ø²Ê), Ä»»ô ¹°¹¬(ÂçºåÂç³ØÂç³Ø±¡)
Pagepp. 457 - 460
Keyword ʬ´ô, ¥«¥ª¥¹, ¥¹¥Ñ¥¤¥­¥ó¥°¥Ë¥å¡¼¥í¥ó
Abstract¶èʬÀþ·Á¥Ù¡¼¥¹¿®¹æ¤òÍ­¤¹¤ëʬ´ô¥Ë¥å¡¼¥í¥ó¤Îưºî¤ò¹Í»¡¤¹¤ë¡£ ¥Ë¥å¡¼¥í¥ó¤Îưºî¤Ï£±¼¡¸µ¥Ñ¥ë¥¹°ÌÃ֥ޥåפˤè¤Ã¤Æµ­½Ò¤µ¤ì¤ë¡£ »°³ÑÇÈ¥Ù¡¼¥¹¿®¹æ¤òÆþÎϤȤ¹¤ë¤³¤È¤Ç¶èʬÀþ·Á¤Ê¥Þ¥Ã¥×¤¬ÆÀ¤é¤ì¡¢Â¿ºÌ¤Ê¸½¾Ý¤òÀºÌ©¤Ë²òÀϤǤ­¤ë¡£ ËÜÏÀʸ¤Ç¤Ï¡¢´ðËÜŪ¤Êʬ´ô¸½¾Ý¤È¥¹¥Ñ¥¤¥¯´Ö³ÖÌ©Å٤δط¸¤Ë¤Ä¤¤¤Æ¹Í»¡¤¹¤ë¡£

Âê̾Chaotic Switching of Phase States in Time-Varying Coupled Circuits
Ãø¼Ô *¾å¼ê ÍλÒ, À¾Èø ˧ʸ(ÆÁÅçÂç³Ø)
Pagepp. 461 - 466
Keyword chaos circuit, phase switching, time-varying resistor
AbstractIn this study, two chaotic circuits coupled by a time-varying resistor are investigated. First, the coexistence of in-phase and anti-phase synchronization are observed. Next, we confirm that interesting synchronization phenomena with switching phase states between the two chaotic circuits can be observed when the strength of coupling parameter R is decreased. Furthermore, the sojourn time of the in-phase and the anti-phase are investigated. We confirm that the sojourn time depends on the frequency and the strength of the time-varying resistor.

Âê̾¥Ü¥ë¥Æ¥é¥Õ¥£¥ë¥¿¤òÍѤ¤¤¿¥«¥ª¥¹ÈëÌ©ÄÌ¿®¤Ë´Ø¤¹¤ë¸¦µæ
Ãø¼Ô *´äÅÄ ÏÂÇÏ, ÆþÁÒ ÍµÇ·(ÌÀ¼£Âç³ØÂç³Ø±¡Íý¹©³Ø¸¦µæ²Ê), ³ùÅÄ ¹°Ç·(ÌÀ¼£Âç³ØÍý¹©³ØÉô)
Pagepp. 467 - 471
Keyword ¥«¥ª¥¹, ÈëÌ©ÄÌ¿®, ¥Ñ¥é¥á¡¼¥¿¥ß¥¹¥Þ¥Ã¥Á, Volterra Filter
AbstractÉ®¼Ô¤é¤Ï¡¢¥¤¥ó¥¿¡¼¥Í¥Ã¥È¤Ê¤É¤Î¥Ç¥£¥¸¥¿¥ëÄÌ¿®Ì֤ǤΥ«¥ª¥¹ÈëÏÃÄÌ¿®¤òÁÛÄꤷ¤¿¥·¥¹¥Æ¥à¤Ë¤Ä¤¤¤Æ¸¡Æ¤¤·¤Æ¤¤¤ë¡£¥«¥ª¥¹¼ÌÁü¤ò¥Ç¥£¥¸¥¿¥ë·×»»µ¡¤Î¤è¤¦¤ÊÍ­¸Â·å±é»»¤ò¼Â¹Ô¤¹¤ë¤È¡¢¿¿¤Î¥«¥ª¥¹¤ËÈæ¤ÙÆÃÀ­¤¬Îô²½¤¹¤ë¡£¥«¥ª¥¹¤òÈëÌ©ÄÌ¿®¤ä°Å¹æ¤ËŬÍѤǤ­¤ëÏÀµò¤Ï¡¢¤ï¤º¤«¤Ê½é´üÃͤκ¹¤ä¥Ñ¥é¥á¡¼¥¿¤Îº¹¤Ë¤è¤ê¡¢¤¹¤Ð¤ä¤¯°Û¤Ê¤Ã¤¿µ°Æ»¤ËÆþ¤ë¤³¤È¤ÇÈëÌ©À­¤òÊݤäƤ¤¤ë¡£ Ëܸ¦µæ¤Ç¤Ï¡¢¥Ñ¥é¥á¡¼¥¿¥ß¥¹¥Þ¥Ã¥Á¤ËÂФ¹¤ëÈëÌ©À­¤ò¹â¤á¤ë¤³¤È¤òÌÜŪ¤È¤·¤Æ¡¢Chaotic NeuronÆâ¤ËVolterra Filter¤òÍѤ¤¤ëÊýË¡¤Ë¤Ä¤¤¤Æ¸¡Æ¤¤¹¤ë¡£¤·¤«¤·Æ±¥Õ¥£¥ë¥¿¤ÏÀþ·Á¥Õ¥£¥ë¥¿¤ËÈæ¤Ù¥Ñ¥é¥á¡¼¥¿¿ô¤¬ÂçÉý¤ËÁý²Ã¤¹¤ë¡£¤½¤³¤Ç¡¢Volterra Filter¤ÎÈóÀþ·Á¹àÉôʬ¤ò¡¢Logistic¼ÌÁü¤äHenon¼ÌÁü¤Ê¤É¤ÎÈóÀþ·Á¼ÌÁü¤ÈƱÅù¤Î¼°¤Ë¤Ê¤ë¤è¤¦¤ËÀßÄꤷ¡¢ÆÃÀ­¤ò²òÀÏ¡¢É¾²Á¤¹¤ë¡£


¥»¥Ã¥·¥ç¥ó A2-3 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] DFM (2)
Æü»þ: 2007ǯ4·î24Æü(²Ð) 13:20-14:45
ºÂĹ: ¶¶ËÜ ¾»µ¹ (ÂçºåÂç³Ø)

Âê̾(¾·ÂÔ)¥¢¥Ê¥í¥°¡¦RFIC ¤Î¤¿¤á¤ÎDFM µ»½Ñ
Ãø¼Ô *¿¹»³ À¿ÆóϺ(£Ð£Ä£Æ¥½¥ê¥å¡¼¥·¥ç¥ó¥º)
Pagepp. 473 - 473
Keyword DFM, Åý·×ŪÀß·×, PDK, Åý·×²òÀϥġ¼¥ë
Abstract¥¢¥Ê¥í¥°Ž¥RFIC¤ÎÀß·×ÉÔ¶ñ¹ç¤Ë¤è¤ë·«¤êÊÖ¤·¡Ê¥ê¥¹¥Ô¥ó¡Ë¤òºï¸º¤¹¤ë¤È¤È¤â¤Ë¡¢ À½Â¤Íư×À­¤òÊݾڤ¹¤ë¤¿¤á¤ËÅý·×ŪÀß·×¼êË¡¤¬É¬ÍפȤµ¤ì¤Æ¤¤¤ë¡£¤³¤Î¾·ÂÔ¹Ö ±é¤Ç¤Ï¡¢Åý·×²òÀϼêË¡¤ÎɬÍ×À­¤Ë¤Ä¤¤¤Æ¿¨¤ì¤¿¾å¤Ç¡¢ Åý·×ŪPDK¡¢¤ª¤è¤Ó¹â® ¤ÊÅý·×²òÀϥġ¼¥ë¤Ë¤Ä¤¤¤Æ³µÍפò½Ò¤Ù¤ë¡££±Îã¤È¤·¤Æ¡¢¹âÀ­Ç½¤Ê0.18 ¦Ìm SiGe:C-BiCMOS¥×¥í¥»¥¹¤òÂоݤ˳«È¯¤·¤¿Åý·×ŪPDK¤Ë¤Ä¤¤¤ÆÀâÌÀ¤¹¤ë¡£¤Þ¤¿¡¢ Åý·×²òÀϥġ¼¥ë¤Ç¤¢¤ëCircuit Surfer¤ò³Æ¼ï¤Î²óÏ©¤ËÄ󶡤·¤¿»öÎã¤ò¾Ò²ð¤¹¤ë¡£

Âê̾¥¯¥ê¥¹¥¿¥ëȯ¿¶²óÏ©¤Ëµ¯°ø¤¹¤ëEMI¥Î¥¤¥º¤Î²òÀϤȥÁ¥Ã¥×ÆâÂкö
Ãø¼Ô *¹õÀî ÆØ, Æ£ÅÄ ¹À»Ö, °ËÉô ůÌé(»°ÍÎȾƳÂÎ(³ô) SS»ö¶È¿ä¿ÊÅý³çÉô Àß·×µ»½ÑÉô), ÅÏÊÕ Å°(»°ÍÎȾƳÂÎ(³ô) ¥Ç¥¸¥¿¥ë¥·¥¹¥Æ¥àÂ裱»ö¶ÈÉô ¥Ç¥¸¥¿¥ë¥ª¡¼¥Ç¥£¥ª³«È¯Éô)
Pagepp. 475 - 480
Keyword EMI, ÅŸ»¥Î¥¤¥º, ¥¯¥ê¥¹¥¿¥ëȯ¿¶²óÏ©, ¥Ç¥«¥Ã¥×¥ê¥ó¥°ÍÆÎÌ
AbstractEMI¥Î¥¤¥ºÂкö¤Ë´Ø¤·¤Æ¡¢¥Á¥Ã¥×Àß·×¼Ô¸þ¤±¤ÎX¡Çtalȯ¿¶²óÏ©¤Ëµ¯°ø¤¹¤ë²òÀÏÊýË¡¤ÈÂкö¤Î¸ú²Ì¤òÄ󼨤¹¤ë¡£¤½¤ÎÆÃħ¤Ï°Ê²¼¤Ç¤¢¤ë¡£ 1)SPICE¥Ù¡¼¥¹¤Ç¥Á¥Ã¥×¤«¤éȯÀ¸¤¹¤ë¥Î¥¤¥º¤ò²òÀϤ¹¤ëÊýË¡¤ò¥Á¥Ã¥×³°¤Î¥â¥Ç¥ê¥ó¥°¤È°ì½ï¤Ë¼¨¤¹¡£ 2)X¡Çtalȯ¿¶²óÏ©¤Ë´Ø¤¹¤ë¥Á¥Ã¥×Æâ¤Î¥Ñ¥Ã¥ÉÇÛÃÖ¡¢¥Ç¥«¥Ã¥×¥ê¥ó¥°ÍÆÎÌ¡¢Äñ¹³ÁÞÆþ¤Ë¤è¤ëÂкö¤Î¥Î¥¤¥ºÄ㸺¤Ø¤Î¸ú²Ì¤ò¼¨¤¹¡£

Âê̾ÄãÅ۵CMOSº¹Æ°ÁýÉý´ï¤ÎÀ߷פȥߥ¹¥Þ¥Ã¥ÁÆÃÀ­²òÀÏ
Ãø¼Ô ²«ÅÄ ¹ä, ÂçÀî âðì(¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸¡¿¥Ç³«), ÄÍÅÄ ÉÒϺ(¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸¡¿À襢³«), *ÁýÅÄ ¹°À¸(¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸¡¿¥Ç³«)
Pagepp. 481 - 486
Keyword 65nm¥ß¥Ã¥¯¥¹¥É¥·¥°¥Ê¥ëLSI, ÄãÅ۵CMOSº¹Æ°ÁýÉý´ï, ¥ß¥¹¥Þ¥Ã¥ÁÆÃÀ­, ¥é¥ó¥À¥à¤Ð¤é¤Ä¤­, ²óÏ©¥·¥ß¥å¥ì¡¼¥·¥ç¥ó
Abstract65nm¥ß¥Ã¥¯¥¹¥É¥·¥°¥Ê¥ëLSI¤Ç¤ÏÄãÅ۵¤Ç¶îư¤Ç¤­¤ëCMOS¥¢¥Ê¥í¥°²óÏ©¤¬É¬Íפˤʤë¤È¹Í¤¨¤é¤ì¤Æ¤¤¤ë¡£¤·¤«¤·¡¢ÄãÅ۵¶îư¤Ç¤Ï¥²¡¼¥ÈÌÌÀѤÎÂ礭¤ÊMOS¤òÍѤ¤¤Æ¤âVth¤Þ¤¿¤ÏIds¤Î¥é¥ó¥À¥à¤Ð¤é¤Ä¤­¤Ë¤è¤ê²óÏ©¤Î¥ß¥¹¥Þ¥Ã¥ÁÆÃÀ­¤¬Îô²½¤¹¤ë²ÄǽÀ­¤¬Í½ÁÛ¤µ¤ì¤ë¡£ ËÜÊó¹ð¤Ç¤Ï¡¢65nm¥×¥í¥»¥¹¤ÎSPICE¥Ñ¥é¥á¡¼¥¿¤òÍѤ¤¤Æ¡¢¤Þ¤ºÄãÅ۵¡ÊVdd=1.2V¡ËCMOSº¹Æ°ÁýÉý´ï¤ÎºÇŬ²óÏ©Äê¿ôÀ߷פò¤ª¤³¤Ê¤Ã¤¿¡£¤µ¤é¤Ë¡¢¤³¤Î·ë²Ì¤ò´ð¤Ë¡¢NMOS¡¿PMOS¤Î¥é¥ó¥À¥à¥ß¥¹¥Þ¥Ã¥ÁÅÅήÆÃÀ­¤Î±Æ¶Á¤¬¡¢º¹Æ°ÁýÉý´ï¤Î½ÐÎÏÅ۵µÚ¤ÓÍøÆÀ¤Î¥ß¥¹¥Þ¥Ã¥Á¤Ë¤É¤¦È¿±Ç¤µ¤ì¤ë¤«¡¢²óÏ©¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ç²òÀÏ¡¦É¾²Á¤·¤¿·ë²Ì¤ò¼¨¤¹¡£


¥»¥Ã¥·¥ç¥ó A2-4 ¥Ë¥å¡¼¥é¥ë¥·¥¹¥Æ¥à¤È¤½¤Î±þÍÑ
Æü»þ: 2007ǯ4·î24Æü(²Ð) 15:00-17:12
ºÂĹ: ´Ø²° Âçͺ (ÀéÍÕÂç³Ø Âç³Ø±¡¼«Á³²Ê³Ø¸¦µæ²Ê)

Âê̾Entropy based Associative Model with an Autocorrelation Dynamics
Ãø¼Ô *Masahiro Nakagawa(Nagaoka University of Technology)
Pagepp. 487 - 492
Keyword Entropy, Association, Memory
AbstractIn this paper, an entropy based associative memory model will be put forward to accomplish the memory retrievals with orthogonal and autocorrelation learning models so as to compare with the conventional autoassociative model with a certain quadratic Lyapunov functional. In the present approach, the updating dynamics will be constructed on the basis of the entropy minimization strategy which is shown to be reduced asymptotically to the conventional quadratic dynamics as a special case. From numerical results, it will be elucidated that the presently proposed novel approach promotes the l memory capacity beyond with the conventional autocorrelation model , e.g. associatron, according to the involved higher-order correlation in the proposed dynamics.

Âê̾Recalling Temporal Sequences of Patterns Using Neurons with Hysteretic Property
Ãø¼Ô *Johan Sveholm, ÁáÀî µÈ¹°, ÃæÅç ¹¯¼£(ÅìËÌÂç³ØÅŵ¤ÄÌ¿®¸¦µæ½ê)
Pagepp. 493 - 498
Keyword neural networks, temporal sequences of patterns, hysteretic property
AbstractTo implement a flow vector that can guide a network through a sequence of patterns is difficult in the conventional case, since flow vectors between two adjacent stored attractors do not coincide in direction. This problem has previous been solved with the Inverse Function Delayed (ID) model, a model which can make the network gradually change from one attractor to another in continuous time. However, in order to increase storage capacity the encoding problem of the patterns can be transformed into a linear separation problem. In that case, a hysteretic two-state neuron model is suggested for recall in continuous time. Paired hysteretic neurons and conventional neurons can give the network continuous valued units as well.

Âê̾Υ»¶»þ´Ö·¿¥»¥ë¥é¥Ë¥å¡¼¥é¥ë¥Í¥Ã¥È¥ï¡¼¥¯¤òÍѤ¤¤¿¶õ´ÖÎΰ襷¥°¥Þ¥Ç¥ë¥¿ÊÑÄ´
Ãø¼Ô *ÀÄ¿¹ µ×(¾åÃÒÂç³Ø), ÂçÃÝ ´º(¶ÌÀîÂç³Ø), ¹â¶¶ ¿­¾´(ÆüËÜ¥¢¥¤¡¦¥Ó¡¼¡¦¥¨¥à(³ô)), ÅÄÃæ êÌ(¾åÃÒÂç³Ø)
Pagepp. 499 - 504
Keyword CNN, ¥·¥°¥Þ¥Ç¥ë¥¿ÊÑÄ´, ¥Ï¡¼¥Õ¥È¡¼¥Ë¥ó¥°, ²èÁüºÆ¹½À®, ÈóÀþ·ÁÆâÁÞ¸ú²Ì
AbstractËܹƤǤÏ, Î¥»¶»þ´Ö·¿¥»¥ë¥é¥Ë¥å¡¼¥é¥ë¥Í¥Ã¥È¥ï¡¼¥¯ (DT-CNN) ¤òÍѤ¤¤¿¶õ´ÖÎΰ襷¥°¥Þ¥Ç¥ë¥¿ÊÑÄ´¤òÄ󰯤¹¤ë. 2˰ÏÂÎΰè¤ò»ý¤Ä½ÐÎÏ´Ø¿ô¤òÍѤ¤¤¿CNN¤ÎËܼÁ¤Ï, ÆþÎϲèÁü¤ò2ÃͲ½¤¹¤ë¤³¤È¤Ç¤¢¤ë¤¿¤á, CNN¤Î¥À¥¤¥Ê¥ß¥¯¥¹¤Ï ¥Ç¥£¥¸¥¿¥ë¥Ï¡¼¥Õ¥È¡¼¥Ë¥ó¥°¤È¤·¤Æ¤Î²ÄǽÀ­¤ò»ý¤Ä. Äó°ÆÊý¼°¤Ç¤Ï, CNN¤Î¥·¥°¥Þ¥Ç¥ë¥¿ÊÑÄ´¤È¤ÎÎà»÷À­¤ËÃåÌܤ·, ¥À¥¤¥Ê¥ß¥¯¥¹¤ÎÈóÀþ·ÁÆâÁÞ¸ú²Ì¤ò 2Ãͥϡ¼¥Õ¥È¡¼¥ó²èÁü¤«¤éºÇŬ¤ÊºÆ¹½À®²èÁü¤òÆÀ¤ë¤¿¤á¤ËÍøÍѤ¹¤ë. ¤Þ¤¿, ¥Õ¥£¡¼¥É¥Ð¥Ã¥¯A¥Æ¥ó¥×¥ì¡¼¥È ¤Ë¤è¤ë¸íº¹³È»¶ÆÃÀ­¤Ë¤è¤ê, ¥Ï¡¼¥Õ¥È¡¼¥ó²èÁü¤ÎÎ̻Ҳ½¸íº¹¤Ï¶õ´ÖŪ¤Ë³È»¶¤µ¤»¤é¤ì¤ë. ÍÍ¡¹¤Ê²èÁü¤ËÂФ¹¤ë¼Â¸³¤Ë¤è¤ê, Ä󰯼êË¡¤ÎÍ­¸úÀ­µÚ¤Ó, CNN¤Î¶õ´ÖÎΰ襷¥°¥Þ¥Ç¥ë¥¿ÊÑÄ´ÆÃÀ­¤ò³Îǧ¤·¤¿.

Âê̾¥Ë¥å¥é¥ë¥Í¥Ã¥È¥ï¡¼¥¯¤òÍѤ¤¤¿³°´Ñ¸¡ºº¥·¥¹¥Æ¥à
Ãø¼Ô *Àé ¾µÍ¤, ÁáÀî µÈ¹°, ÃæÅç ¹¯¼£(ÅìËÌÂç³Ø/Åŵ¤ÄÌ¿®¸¦µæ½ê)
Pagepp. 505 - 510
Keyword hardware, virtex2, BP
AbstractAt factories, the surface inspection of final products relies on visual inspection, which is based on experience and instinct. With such method it is difficult to reduce time and production cost, and hence an automatic inspection system is desired. We used a hardware back-propagation(BP) system enabling high-speed judgment and learning. In order to increase the operation speed, we have implemented parallel and pipeline processing in the hardware. Our hardware BP system could complete the process within 1.37 us. However, there was a case where learning could not be completed by such method. Therefore, we suggest an improved method to solve the problem in this paper.

Âê̾Elman·¿¥Õ¥£¡¼¥É¥Ð¥Ã¥¯SOM¤Ë¤è¤ëÉ÷¶·Í½Â¬¤Ø¤Î±þÍÑ
Ãø¼Ô Æ£¾¾ À¿°ìϺ, Ïɸ« °éμ, ¿¢ÅÄ ÂóÌé, *¾®ÎÓ ÈôÄ»(Ä»¼è´Ä¶­Âç³ØÂç³Ø±¡), ÃÛë δͺ(¾¾¹¾¹©¶È¹âÅùÀìÌç³Ø¹»)
Pagepp. 511 - 516
Keyword ¼«¸ÊÁÈ¿¥²½¥Þ¥Ã¥×¡ÊSOM¡Ë, É÷¶·, ͽ¬, É÷ÎÏȯÅŵ¡
AbstractÏɸ«¸¦µæ¼¼¤Ç¤ÏÄãÉ÷ÎϤǤâȯÅŲÄǽ¤Ê²ÈÄíÍѤξ®·¿É÷ÎÏȯÅŵ¡¤ËÃíÌܤ·¡¢¤è¤ê¸úΨ¤Î¤è¤¤¥Ñ¥ï¡¼¥¢¥·¥¹¥È¤ò¹Ô¤¦¤¿¤á¤ËÉ÷¶·¤Îͽ¬¤¬É¬ÍפǤ¢¤ë¤È¹Í¤¨¤¿¡£¤³¤ì¤Þ¤Ç¤Ë¡¢¼«¸ÊÁÈ¿¥²½¥Þ¥Ã¥×¡ÊSOM¡Ë¤òÍѤ¤¤ÆÉ÷®¤Îͽ¬¤ò¹Ô¤Ã¤Æ¤­¤¿¡£Ä̾ï¤ÎSOM¤Ï¥À¥¤¥Ê¥ß¥Ã¥¯¥¹¤ò¤â¤¿¤Ê¤¤¤¿¤á»þ·ÏÎó¾ðÊó¤ò°·¤¦¤³¤È¤¬¤Ç¤­¤Ê¤¤¡£¤½¤³¤Ç»þ·ÏÎó¾ðÊó¤ò°·¤¦ÊýË¡¤Î1¤Ä¤È¤·¤Æ¹Í¤¨½Ð¤µ¤ì¤¿SOM¤È¤·¤ÆElman·¿¥Õ¥£¡¼¥É¥Ð¥Ã¥¯SOM¤¬¤¢¤ë¡£Í½Â¬Î¨¤Î¸þ¾å¤òÌܻؤ·¤Æ¡¢º£²ó¤ÏÉ÷®¤Îº¹Ê¬Ãͤòµá¤á¡¢¤½¤Îº¹Ê¬Ãͤò³Ø½¬¤ËÍøÍѤ·¤¿¡£¤µ¤é¤ËElman·¿¥Õ¥£¡¼¥É¥Ð¥Ã¥¯SOM¤òÍѤ¤¤ÆÍ½Â¬¤ò¹Ô¤¤¡¢ÁÐÊý¸þSOM¤Ç¹Ô¤Ã¤¿Í½Â¬·ë²Ì¤ÈÈæ³Ó¤ò¹Ô¤Ã¤¿¡£

Âê̾¼«¸ÊÁÈ¿¥²½¥Þ¥Ã¥×¤ò¤â¤È¤Ë¤·¤¿¿·¤·¤¤Ç¾·¿¥Ï¡¼¥É¥¦¥§¥¢¤Î³«È¯
Ãø¼Ô *¶â»Ò ½¡»Ê, Åĸþ ¸¢, ÅÄÃæ Íø¹¯, ÆÁ±Ê ·ûÍÎ, ¸ÅÀî ŰÀ¸(¶å½£¹©¶ÈÂç³ØÂç³Ø±¡À¸Ì¿Âι©³Ø¸¦µæ²Ê)
Pagepp. 517 - 522
Keyword ¼«¸ÊÁÈ¿¥²½¥Þ¥Ã¥×, SOM2, FPGA, ¥Ï¡¼¥É¥¦¥§¥¢²½
AbstractÅö¸¦µæ¼¼¤Ï¡¤Batch Learning ¼«¸ÊÁÈ¿¥²½¥Þ¥Ã¥×(BL-SOM)¤ò¥Ù¡¼¥¹¤È¤·¤Æ¤³¤ì¤Þ¤Ç¤¤¤¯¤Ä¤«¤Î¿·¤·¤¤¥Ë¥å¡¼¥é¥ë¥Í¥Ã¥È¥ï¡¼¥¯¤òÄ󰯤·¤Æ¤­¤¿¡¥ ¤½¤ÎÃæ¤Î°ì¤Ä¡¢SOM of SOM(SOM2)¤Ï¡ÖSOM¤Î½¸¹ç¤¬ºî¤ê½Ð¤¹ÆÃħ¶õ´Ö¤Î¿ÍÍÂΤν¸¹ç¤ò¼«¸ÊÁÈ¿¥²½¥Þ¥Ã¥×¤È¤·¤ÆÉ½¸½¤¹¤ë¡×¤³¤È¤¬¤Ç¤­¤ë¡¥ ¤³¤Î¥¢¡¼¥­¥Æ¥¯¥Á¥ã¤Ï¸½ºß¡¤²èÁüǧ¼±¡¤É÷·Êǧ¼±¤Ê¤ÉÍÍ¡¹¤Ê±þÍÑʬÌî¤ËŬÍѤ¹¤ë»ö¤ò¹Í¤¨¤Æ¤¤¤ë¡¥ ¤·¤«¤·¤³¤ì¤é¤Î±þÍѤϱ黻Î̤¬ËÄÂç¤Ç¤¢¤ë¡¥¤½¤³¤Ç¥Ï¡¼¥É¥¦¥§¥¢²½¤¹¤ë»ö¤ÇÊÂÎó½èÍý¤ò¹Ô¤¤¡¢¹â®±é»»¤ò¹Ô¤¦¤³¤È¤¬ÌÜŪ¤Ç¤¢¤ë¡£¤·¤¿¤¬¤Ã¤ÆËܹƤǤÏSOM2¤ò¼Â¸½¤Ç¤­¤ë¥Ï¡¼¥É¥¦¥§¥¢¤ÎºîÀ®¤òÌܻؤ¹¡¥ º£²ó¤Ï¡¤SOM2¤Î¥Ù¡¼¥¹¤È¤Ê¤ëBL-SOM¤Î¥Ï¡¼¥É¥¦¥§¥¢²½¤Î¸¡Æ¤¤ò¹Ô¤¤¡¤¤½¤Î¾å¤ÇSOM2¤Î¥Ï¡¼¥É¥¦¥§¥¢²½¤Î¸¡Æ¤¤ò¹Ô¤Ã¤¿¤Î¤Ç¤½¤ì¤òÊó¹ð¤¹¤ë¡¥


¥»¥Ã¥·¥ç¥ó Ba2-1 ¥¢¥Ê¥í¥°½¸ÀѲóÏ©¥Ö¥í¥Ã¥¯
Æü»þ: 2007ǯ4·î24Æü(²Ð) 9:00-10:15
ºÂĹ: ¾®ÎÓ ½ÕÉ× (·²ÇÏÂç³Ø)

Âê̾¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉMOSÆÃÀ­¤òÍøÍѤ·¤¿PTATÅÅήÀ¸À®¤Î¤¿¤á¤ÎÈù¾®¥Õ¥í¡¼¥Æ¥£¥ó¥°Å۵¸»²óÏ©
Ãø¼Ô *¾åÌî ·û°ì, ×¢À¥ ůÌé, Àõ°æ ůÌé, ±«µÜ ¹¥¿Î(Ë̳¤Æ»Âç³Ø)
Pagepp. 523 - 528
Keyword ¥Õ¥í¡¼¥Æ¥£¥ó¥°Å۵¸», ¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉÎΰè, PTATÅÅή, CMOS¥¹¥Þ¡¼¥È¥»¥ó¥µ
AbstractMOSFET¤Î¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉÅÅή¤òÍøÍѤ¹¤ë¤³¤È¤Ç¡¢ÀäÂв¹ÅÙ¤ËÈæÎ㤷¤¿PTAT (Proportional To Absolute Temperature)ÅÅή¤òÀ¸À®¤Ç¤­¤ë¡£PTATÅÅή¤Ï²¹ÅÙ¥»¥ó¥µ¤Î¥»¥ó¥µ¥·¥°¥Ê¥ë¤È¤·¤ÆÍøÍѤ¹¤ë¤³¤È¤¬¤Ç¤­¤ë¡£Ëܸ¦µæ¤Ç¤Ï¡¢¤³¤ÎPTATÅÅή¤òÀ¸À®¤¹¤ë¤¿¤á¤ËɬÍ×¤Ê¥Õ¥í¡¼¥Æ¥£¥ó¥°Å۵¸»¤òÄ󰯤¹¤ë¡£ 0.35 um-CMOS¥×¥í¥»¥¹¤òÍѤ¤¤ÆSPICE¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê²óϩưºî¤ò³Îǧ¤·¤¿¡£-20 ¡î¡Á100 ¡î¤Î²¹ÅÙÊѲ½¤ËÂФ·¤Æ¥Õ¥í¡¼¥Æ¥£¥ó¥°Å۵¤ÎÊÑÆ°¤Ï¡Þ0.3 %¤Þ¤ÇÍÞ¤¨¤ë¤³¤È¤¬¤Ç¤­¤ë¡£¤³¤Î²óÏ©¤Ï¡¢¥µ¥Ö¥¹¥ì¥Ã¥·¥ç¥ë¥ÉÎΰè¤Çưºî¤·¡¢4.6 uW¤Î¶ËÄã¾ÃÈñÅÅÎÏ¤ÇÆ°ºî¤¹¤ë¡£

Âê̾An Ultra Low-Power High-Speed Rail-to-Rail Buffer Amplifier for LCD Source Drivers
Ãø¼Ô *Zheng Liang, Wei-Lun Huang, Jun Pan, Yasuaki Inoue(Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 529 - 533
Keyword low-power, buffer amplifier, rail-to-rail, high-speed, LCD driver
AbstractA high-speed, low-power, rail-to-rail buffer amplifier with improved current summing circuit is proposed for LCD source drivers. By placing two complementary differential pairs in parallel, it is possible to obtain a rail-to-rail input stage. Then, a current summing circuit with two embedded comparators is proposed. With the proposed current summing circuit, the output stages will be turned off at static state to suppress quiescent current, while keeping large driving capacity when they are turned on at dynamic state. In addition, the proposed buffer amplifier will not increase the chip size so that the buffer amplifier can be made compact. Simulation with a 0.35 um CMOS technology demonstrates that the buffer has a quiescent current of 2.0 uA and a maximum tracking error of 0.16 LSB with 100% rail-to-rail input swing. Settling time of 1.5 us and 2.1 us for the rising and falling edge is measured for rail-to-rail voltage swing with 600 pF capacitance load, which is sufficient for driving large LCD panels.

Âê̾¤Î¤³¤®¤êÇÈȯÀ¸²óÏ©¤ÎÃÙ±ä»þ´Ö¤Ë¤è¤ë¸íº¹¤Î½¤Àµ
Ãø¼Ô *ƣ¼ À¬¹°, ¹â°æ ¿­ÏÂ(·²ÇÏÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê)
Pagepp. 535 - 539
Keyword ¤Î¤³¤®¤êÇÈ, ¥¹¥¤¥Ã¥Á¥ó¥°ÅŸ», ¥³¥ó¥Ñ¥ì¡¼¥¿
Abstract¡¡¥¹¥¤¥Ã¥Á¥ó¥°ÅŸ»²óÏ©¤Ï¡¢¾®·¿·ÚÎ̲½¤ÎÍøÅÀ¤«¤é¡¢Â¿¤¯¤ÎÅŻҵ¡´ï¤Ë»ÈÍѤµ¤ì¤Æ¤¤¤ë¡£ ¡¡¤³¤ÎÅŸ»²óÏ©¤Ï¡¢¤Î¤³¤®¤êÇȤμþÇÈ¿ô¤¬¹â¤¤¤ÈÀ­Ç½¤¬Îɤ¯¤Ê¤ë¡£ ¡¡¤·¤«¤·¡¢¤Î¤³¤®¤êÇÈȯÀ¸²óÏ©¤Ï²óÏ©¤ÎÃÙ±ä»þ´Ö¤Ë¤è¤Ã¤Æ½ÐÎÏÅ۵¤Ë¸íº¹¤¬À¸¤¸¡¢¹â¤¤¼þÇÈ¿ô¤Ç¤Î¤³¤®¤êÇȤòȯÀ¸¤µ¤»¤é¤ì¤Ê¤¤¡£ ¡¡ËÜÏÀʸ¤Ç¤Ï¡¢¤Î¤³¤®¤êÇÈȯÀ¸²óÏ©Æâ¤Î¥³¥ó¥Ñ¥ì¡¼¥¿¤Î½ÐÎÏü¤Î´óÀ¸ÍÆÎ̤ˡ¢¤¢¤é¤«¤¸¤áÅŲ٤òί¤á¤Æ¤ª¤¯¤³¤È¤Ç¡¢ÃÙ±ä»þ´Ö¤Ë¤è¤ë¸íº¹¤ò½¤Àµ¤¹¤ë²óÏ©¹½À®¤òÄ󰯤¹¤ë¡£ ¡¡¤³¤ÎÄ󰯲óÏ©¤Ë¤è¤Ã¤Æ¤Î¤³¤®¤êÇÈȯÀ¸²óÏ©¤ÎÃÙ±ä»þ´Ö¤Ë¤è¤ë¸íº¹¤ò½¤Àµ¤Ç¤­¤ë¤³¤È¤ò¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê³Îǧ¤·¤¿¡£


¥»¥Ã¥·¥ç¥ó Ba2-2 ÅŸ»²óÏ©
Æü»þ: 2007ǯ4·î24Æü(²Ð) 10:30-11:45
ºÂĹ: °ÂÅÄ ¾´ (Ë¡À¯Âç³Ø)

Âê̾A High Efficiency All PMOS Charge Pump Circuit Without Overstress in Low-Voltage CMOS Process
Ãø¼Ô *Jun Pan, Yasuaki Inoue(Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 541 - 546
Keyword high efficiency, charge pump, without overstress, low voltage, CMOS
AbstractA high efficiency all PMOS charge pump circuit without overstress is proposed in this paper. The proposed driver circuit can completely switch on and switch off the charge-transfer switches. In addition, the body effect is eliminated due to the proposed two pumping branches architecture. Therefore, its voltage pumping efficiency is much higher than that of the conventional designs. Moreover, the maximum gate-source, gate-drain and drain-source voltages of all transistors in the proposed charge pump circuit do not exceed the power supply voltage Vdd. The proposed charge pump circuit has been realized in a standard CMOS 0.35 um technology. The simulation results demonstrated that the proposed charge pump circuit has very high voltage pumping efficiency without overstress. Therefore, the proposed circuit is suitable for implementation in low-voltage CMOS processes.

Âê̾¥Ç¥å¥¢¥ë¡¦¥Ç¥ë¥¿¡Ý¥·¥°¥ÞÊÑÄ´Êý¼°¤Ë¤è¤ë¥·¡¼¥à¥ì¥¹À©¸æ¾º¹ß°µ·Á¥³¥ó¥Ð¡¼¥¿¤ÎÀ­Ç½²þÁ±¸¡Æ¤
Ãø¼Ô *¾®ËÙ ¹¯¸ù, ¸Åë ůÌé, ¸÷Ìî Àµ»Ö(·²ÇÏÂç³Ø¡¿Âç³Ø±¡¹©³Ø¸¦µæ²Ê), ¾®ÎÓ ½ÕÉ×(·²ÇÏÂç³Ø¡¿¹©³ØÉô), À¶¿å ÉÒɧ(­ê¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸¡¿À½Â¤ËÜÉô)
Pagepp. 547 - 550
Keyword ¥¹¥¤¥Ã¥Á¥ó¥°¥³¥ó¥Ð¡¼¥¿, ¾º¹ß°µ·ÁÅŸ», ¥Ç¥å¥¢¥ë¥Ç¥ë¥¿¥·¥°¥ÞÊÑÄ´, ¥Õ¥ë¥Ö¥ê¥Ã¥¸¹½À®
Abstract¹ß°µ·Á¡Ü¾º°µ·ÁÅŸ»¤òɬÍפȤ¹¤ë¹­ÈÏ°Ï¤ÊÆþÎÏÅ۵¤ËÂбþ¤Î¥¹¥¤¥Ã¥Á¥ó¥°¥³¥ó¥Ð¡¼¥¿¤Ë¤ª¤¤¤Æ¡¢¥·¡¼¥à¥ì¥¹¤ËÀ©¸æÊý¼°¤òÀÚ´¹¤¨¤Æ°ÂÄê¤Ë½ÐÎÏÅ۵¤ò¶¡µë¤Ç¤­¤ëÅŸ»¥·¥¹¥Æ¥à¡£¥Õ¥ë¥Ö¥ê¥Ã¥¸¹½À®¤Ç¥Ï¥¤¥µ¥¤¥É¡¿¥í¡¼¥µ¥¤¥É¤ÎMOS¥¹¥¤¥Ã¥Á¤òÍ­¤·¡¢¤³¤Î¥¹¥¤¥Ã¥ÁÀ©¸æ¤Ë¤½¤ì¤¾¤ìÀìÍѤΥǥ륿¥·¥°¥ÞÊÑÄ´´ï¤òÀߤ±¤¿¹½À®¤òÄó°Æ¡£¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê¡¢Äã½ÐÎÏ¥ê¥×¥ë¤È¸úΨ¤ò¸¡Æ¤¤·¤¿¡£¤Þ¤¿¼Â¸³¤Ë¤è¤ê¡¢Ê¿¶ÑŪ¤Ë¸úΨ£¸£°¡ó¤ò³Îǧ¤·¤¿¡£

Âê̾¥Ç¥¸¥¿¥ëÀ©¸æÅŸ»ÍÑ ¹â»þ´Öʬ²òǽDPWM²óÏ©
Ãø¼Ô ÌÚ¼ ·½¸ã, *¿¹ °Îʸ¼ù, »³ÅÄ ²Â±û, ¾®ÎÓ ½ÕÉ×(·²ÇÏÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê), ¾®ËÙ ¹¯¸ù(·²ÇÏÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê ¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸Àèü¥¢¥Ê¥í¥°²óÏ©¹©³Ø¹ÖºÂ), À¶¿å °ìÌé, ¸÷Ìî Àµ»Ö, »± Úß(·²ÇÏÂç³Ø¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê)
Pagepp. 551 - 556
Keyword ¥Ç¥¸¥¿¥ëÀ©¸æ, ÅŸ», PWM, »þ´Ö¼´¥¢¥Ê¥í¥°²óÏ©
AbstractËÜÏÀʸ¤Ç¤Ï¥Ç¥¸¥¿¥ëÀ©¸æÅŸ»¤ËÍѤ¤¤ë¤¿¤á¤Î, ¹â»þ´Öʬ²òǽ¥Ç¥¸¥¿¥ëPWMÀ¸À®²óÏ©¤Î¿·¹½À®¤òÄ󰯤¹¤ë.½¾Íè¤Î¥Ç¥¸¥¿¥ëPWM¤Ï¤½¤Î»þ´Öʬ²òǽ¤¬¡Ö¥²¡¼¥ÈÃÙ±ä¡×¤Ç·è¤Þ¤ë¤¬,¤³¤³¤ÇÄ󰯤¹¤ë¹½À®¤Ç¤Ï¡Ö£²¤Ä°Ê¾å¤Î¥²¡¼¥ÈÃÙ±ä¤Îº¹¡×¤Ç¤¢¤ë¤Î¤Ç, ¤è¤ê¹â»þ´Öʬ²òǽ¤¬¼Â¸½¤Ç¤­¤ë.¤Þ¤¿²óÏ©Î̤¬ºï¸º¤µ¤ì¹â®¤Çưºî¤¹¤ëɬÍפ¬¤Ê¤¯¤Ê¤ë¤Î¤ÇÄã¾ÃÈñÅÅÎϲ½¤Ç¤­¤ë. ¤µ¤é¤Ë³ÈÄ¥¥æ¡¼¥¯¥ê¥Ã¥É¸ß½üË¡¤ò¥Ù¡¼¥¹¤Ë¤·¤Æ¤½¤Î¥·¥¹¥Æ¥Þ¥Æ¥Ã¥¯¤ÊÀß·×¥¢¥ë¥´¥ê¥º¥à¤ò³«È¯¤·ºÇŬ²½À߷פò²Äǽ¤Ë¤·¤¿. Ä󰯼êË¡¤Ë¤è¤ë²óÏ©¹½À®¤È¸¶Íý, Àß·×¼êË¡¤ò½Ò¤Ù¤ë.


¥»¥Ã¥·¥ç¥ó Bd2-1 ¿®¹æ½èÍý±þÍÑ
Æü»þ: 2007ǯ4·î24Æü(²Ð) 9:00-10:15
ºÂĹ: ¿ùÌî Īɧ (Åìµþ¹©¶ÈÂç³Ø)

Âê̾Multi-scale Fragmented Edges Grouping for Monocular Building Extraction
Ãø¼Ô *Jing Wang(Graduate School of Information, Production and Systems, Waseda University), Makoto Iwata, Hirokazu Koizumi, Hideo Shimazu(System Technology Laboratory, NEC System Technologies, Ltd.), Satoshi Goto, Takeshi Ikenaga(Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 557 - 562
Keyword multi-scale grouping, fragmented edge grouping, monocular building extraction, aerial image
AbstractFragmented edges grouping is very important for the performance of the monocular building extraction systems. In this paper, we propose a novel method to robustly group fragmented edges that share the common underlying structure by analyzing their spatial and geometric correlation across multiple scales. Firstly, we propose a new linear edge extractor and utilize it on the image pyramid to obtain edge interpretations with different fragmentation degrees. Secondly, the orientation and location correlation of the linear edge maps at two neighboring scales is utilized to guide the fragmented edges grouping. Such grouping process is performed on the fragmented edges from higher scale to the finest scale and finally better connected linear features with precise locations are output. We also discuss how to adaptively determine the proper largest scale level of the image pyramid according to the correlations of linear features across scales. Experimental results demonstrated the capabilities of the multi-scale method to merge edges fragmented by noise, low contrast or occlusion on the building boundary and also to break connected but distinct edges into different line segments.

Âê̾¦¤¦²ÊÑÄ´¤òÍѤ¤¤¿¾®µ¬ÌϤ«¤Ä¹âÀºÅÙ¤ÊPLL·¿ÆâÁÞ´ï¤ÎÀ߷פȸ¡Æ¤
Ãø¼Ô *ÀÞÌî ͵°ìϺ, ¹õß· ¼Â(Åìµþ¹©¶ÈÂç³Ø Áí¹çÍý¹©³Ø¸¦µæ²Ê), ÊÒ¶Í ¿ò(¤¹¤Æ¤­¤Ê(Í­))
Pagepp. 563 - 568
Keyword ¦¤¦²ÊÑÄ´, ¥¨¥ó¥³¡¼¥ÀÆâÁÞ, ¥ª¡¼¥Ð¡¼¥µ¥ó¥×¥ê¥ó¥°, PLL
AbstractÆâÁÞ´ï¤Ï°ÌÃÖ¥»¥ó¥µ¤Ç¤¢¤ëÀµ¸¹ÇÈ¥¨¥ó¥³¡¼¥À¤Î¤¿¤á¤Î¥»¥ó¥µ¿®¹æ½èÍý¤Ç¤¢¤ë¡£ËÜÏÀʸ¤Ç¤ÏPLL¤Ë´ð¤Å¤¯¥È¥é¥Ã¥­¥ó¥°·¿ÆâÁÞ´ï¤Î¿®¹æ½èÍý¤Ë´Ø¤·¤Æ¡¢¾®µ¬ÌϤʥϡ¼¥É¥¦¥§¥¢¤Ç¹â¤¤ÆâÁÞÀºÅÙ¤ò¼Â¸½¤¹¤ë¤³¤È¤òÌÜŪ¤Ë¡¢Äã¥Ó¥Ã¥È¤Ê¥ª¡¼¥Ð¡¼¥µ¥ó¥×¥ê¥ó¥°·¿¥Ç¥£¥¸¥¿¥ë¿®¹æ½èÍý¤Ë¤è¤ë¼Â¸½¤ò¸¡Æ¤¤·¤Æ¤¤¤ë¡£¥Ç¥£¥¸¥¿¥ë¿®¹æ¤ËÂФ¹¤ë¦¤¦²ÊÑÄ´¤òÍøÍѤ·¡¢·¸¿ô¾è»»¤ò¾è»»²óϩ̵¤·¤Ç¹Ô¤¦ÈæÎãÀÑʬ·¿¥ë¡¼¥×¥Õ¥£¥ë¥¿¤ò¿·¤¿¤ËÀ߷פ·¤¿¡£¤µ¤é¤Ë¡¢À߷פ·¤¿ÆâÁÞ´ï¤ò¥½¥Õ¥È¥¦¥§¥¢¤Ë¤è¤ë¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê¸¡Æ¤¤·¡¢ÀŻ߯þÎϤʤé¤Ó¤Ë°ìÄê®ÅÙÆþÎϤËÂФ·¤ÆÊĥ롼¥×¤Îʬ²òǽ°Ê¾å¤Î¸¡½ÐÀºÅÙ¤¬ÆÀ¤é¤ì¤ë¤³¤È¤ò³Îǧ¤·¤¿¡£¤Þ¤¿¤½¤ÎưŪÆÃÀ­¤ò¼þÇÈ¿ô±þÅú¤È¤·¤Æ¸¡Æ¤¤·¤¿¡£

Âê̾¦¤¦²ÊÑÄ´¤Ë´ð¤Å¤¯1¥Ó¥Ã¥È¿®¹æ½èÍý¤Ë¤è¤ë¾õÂÖ¶õ´Öɽ¸½¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿Àß·×Ë¡¤Î¸¡Æ¤
Ãø¼Ô *°ËÆ£ ͪÆó, Æ»ÌÚ ¿µÆó, Âç·§ ÈË(̾¸Å²°Âç³ØÂç³Ø±¡¹©³Ø¸¦µæ²ÊÅŻҾðÊó¥·¥¹¥Æ¥àÀì¹¶ Âç·§¸¦µæ¼¼)
Pagepp. 569 - 574
Keyword ¦¤¦²ÊÑÄ´, 1¥Ó¥Ã¥È¿®¹æ½èÍý, ¾õÂÖ¶õ´Öɽ¸½
Abstract²æ¡¹¤Ï¡¢¥Ï¡¼¥É¥¦¥§¥¢¼ÂÁõ¤ËŬ¤·¤¿ÊýË¡¤È¤·¤Æ¦¤¦²ÊÑÄ´¤Ë´ð¤Å¤¯1¥Ó¥Ã¥È¿®¹æ½èÍý¥·¥¹¥Æ¥à¤Ë¤Ä¤¤¤Æ¸¡Æ¤¤·¤Æ¤¤¤ë¡£ËܹƤǤϡ¢¤³¤Î¿®¹æ½èÍý¥·¥¹¥Æ¥à¤Ë¤ª¤¤¤Æ¡¢Àþ·Á¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤ÎÀß·×Ë¡¤ò¸¡Æ¤¤¹¤ë¡£À߷פò¹Ô¤¦¤Ë¤¢¤¿¤ê¡¢´Ý¤á¸íº¹¤ä¥ª¡¼¥Ð¡¼¥Õ¥í¡¼¤Ê¤É¤È¤¤¤Ã¤¿Í­¸Â¸ìĹÌäÂê¤È¤è¤Ð¤ì¤ëÌäÂê¤ò¹Íθ¤¹¤ëɬÍפ¬¤¢¤ë¡£¤³¤ÎÍ­¸Â¸ìĹÌäÂê¤ò¹Íθ¤·¤¿À߷פò¹Ô¤¦¤¿¤á¡¢Ëܸ¦µæ¤Ç¤Ï¾õÂÖ¶õ´Öɽ¸½¤òƳÆþ¤¹¤ë¡£¾õÂÖ¶õ´Öɽ¸½¾å¤Ë¤ª¤¤¤Æ¡¢Í­¸Â¸ìĹÌäÂê¤ò¹Íθ¤·¤¿1¥Ó¥Ã¥È¥Õ¥£¥ë¥¿¤ÎÀß·×Ë¡¤òÄ󰯤·¡¢¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤ª¤¤¤Æ¤½¤ÎÍ­¸úÀ­¤ò¼¨¤¹¡£


¥»¥Ã¥·¥ç¥ó Bd2-2 ¥Õ¥£¥ë¥¿´ðÁÃ
Æü»þ: 2007ǯ4·î24Æü(²Ð) 10:35-12:15
ºÂĹ: À¾Àî À¶»Ë (¼óÅÔÂç³ØÅìµþ)

Âê̾¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤Î¤Ê¤¤L2´¶ÅٺǾ®·Á¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤Î¹çÀ®
Ãø¼Ô *Ȭ´¬ ½ÓÊå, °¤Éô Àµ±Ñ, ÀîËô À¯À¬(ÅìËÌÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²ÊÅŻҹ©³ØÀì¹¶)
Pagepp. 575 - 580
Keyword ¾õÂÖ¶õ´Ö¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿, ¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë, L2´¶ÅٺǾ®¼Â¸½, ²ÄÀ©¸æÀ­¥°¥é¥ß¥¢¥ó, ²Ä´Ñ¬À­¥°¥é¥ß¥¢¥ó
AbstractËÜÏÀʸ¤Ç¤Ï¡¤¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤Î¤Ê¤¤L2´¶ÅٺǾ®·Á¾õÂÖ¶õ´Ö¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤Î¹çÀ®Ë¡¤òÄ󰯤¹¤ë¡¥¾õÂÖ¶õ´Ö¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤ÎÍ­¸Â¸ìĹ¼Â¸½ÌäÂê¤Î¤Ò¤È¤Ä¤Ë¡¤¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤¬¤¢¤ë¡¥¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤È¤Ï¡¤ºÆµ¢·Á¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤Ë¤ª¤¤¤Æ¡¤ÎíÆþÎÏ»þ¤Þ¤¿¤Ï°ìÄêÆþÎÏ»þ¤Ë¼þ´üŪ¤Ë¸½¤ì¤ëȯ¿¶¸½¾Ý¤Î¤³¤È¤Ç¤¢¤ë¡¥°ìÈ̤ˤϡ¤¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤ÏȯÀ¸¤·¤Ê¤¤¤³¤È¤¬Ë¾¤Þ¤ì¤ë¡¥L2´¶ÅٺǾ®¼Â¸½¤Ï¡¤Ç¤°Õ¤Îľ¸ò¹ÔÎó¤Ë¤è¤ëºÂɸÊÑ´¹¤ËÂФ·¤ÆL2´¶ÅٺǾ®¼Â¸½¤òÊݤġ¤¤È¤¤¤¦À­¼Á¤ò¤â¤Ä¡¥¤³¤ÎÀ­¼Á¤òÍøÍѤ·¡¤L2´¶ÅٺǾ®¼Â¸½¤ËÂФ·¤ÆÅ¬ÀÚ¤Êľ¸ò¹ÔÎó¤Ë¤è¤ëºÂɸÊÑ´¹¤ò»Ü¤¹¤³¤È¤Ë¤è¤ê¡¤¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤Î¤Ê¤¤L2´¶ÅٺǾ®¼Â¸½¤¬¹çÀ®¤Ç¤­¤ë¤³¤È¤ò¼¨¤¹¡¥

Âê̾¾õÂÖ¶õ´Ö¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤Î¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤È¼þÇÈ¿ôÊÑ´¹¤È¤Î´Ø·¸¤Ë¤Ä¤¤¤Æ
Ãø¼Ô *±ÛÅÄ ½Ó²ð, °¤Éô Àµ±Ñ, ÀîËô À¯À¬(ÅìËÌÂç³ØÂç³Ø±¡ ¹©³Ø¸¦µæ²Ê ÅŻҹ©³ØÀì¹¶)
Pagepp. 581 - 586
Keyword ¾õÂÖ¶õ´Ö¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿, ¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë, ¼þÇÈ¿ôÊÑ´¹, ¥°¥é¥ß¥¢¥ó¤òÊݸ¤¹¤ë¼þÇÈ¿ôÊÑ´¹
AbstractËܹƤǤϡ¤¥Ç¥£¥¸¥¿¥ë¥Õ¥£¥ë¥¿¤Î¼Â¸½¤Ë¤ª¤¤¤Æ½ÅÍפÊÌäÂê¤Ç¤¢¤ë¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤¬¡¤¼þÇÈ¿ôÊÑ´¹¤È¤É¤Î¤è¤¦¤Ê´Ø·¸¤Ë¤¢¤ë¤«¤Ë¤Ä¤¤¤Æ¿ô³ØÅª¤ËµÄÏÀ¤¹¤ë¡¥¤³¤ÎµÄÏÀ¤Ë¤ª¤¤¤Æ¡¤Ãø¼Ô¤é¤¬¤³¤ì¤Þ¤Ç¤ËÄ󰯤·¤Æ¤¤¤ë²ÄÀ©¸æÀ­¡¦²Ä´Ñ¬À­¥°¥é¥ß¥¢¥ó¤òÊݸ¤¹¤ë¼þÇÈ¿ôÊÑ´¹¤òÍѤ¤¤ë¡¥¤½¤Î·ë²Ì¤È¤·¤Æ¡¤¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤òȯÀ¸¤·¤Ê¤¤¹½Â¤¤ò¤â¤Ä¥Õ¥£¥ë¥¿¤¬Í¿¤¨¤é¤ì¤¿¤È¤­¡¤¤½¤Î¥Õ¥£¥ë¥¿¤ËÂФ·¤ÆÃø¼Ô¤é¤¬Ä󰯤·¤¿¼þÇÈ¿ôÊÑ´¹¤òŬÍѤ·¤ÆÆÀ¤é¤ì¤ëǤ°Õ¤Î¥Õ¥£¥ë¥¿¤â¤Þ¤¿¡¤¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤òȯÀ¸¤·¤Ê¤¤¤³¤È¤ò¾ÚÌÀ¤¹¤ë¡¥¤³¤ì¤ËÂФ·¡¤½¾Íè¤Î¼þÇÈ¿ôÊÑ´¹¤Îµ­½ÒË¡¤Ï¡¤¥ê¥ß¥Ã¥È¥µ¥¤¥¯¥ë¤òȯÀ¸¤·¤Ê¤¤À­¼Á¤òɬ¤º¤·¤âÊݸ¤¹¤ë¤È¤Ï¸Â¤é¤Ê¤¤¤³¤È¤ò¼¨¤¹¡¥

Âê̾A Unified Theory of the Optimum Approximation of Vector-Signals
Ãø¼Ô *Yuichi Kida(School of Pharmaceutical Sciences, Ohu University), Takuro Kida(Department of Electrical and Electronics Engineering, Nihon University)
Pagepp. 587 - 592
Keyword Optimum approximation, filter bank, digital signal processing, vector-signals
AbstractFor a set of vector-signals such that generalized spectrums have weighted norms smaller than a given positive number, we present extended optimum approximation that minimizes various worst-case measures of approximation error at the same time. This approximation uses shift-variant interpolation functions that have the infinite support. Further, for a set of time-limited signals, we present a proof of the optimality of running-type discrete approximation that minimizes various worst-case measures of error. This approximation uses shift-invariant interpolation functions that have finite supports. Therefore, this approximation can be realized by FIR filter bank.

Âê̾Theory of the Optimum Approximation of Time-Limited Signals Based on Fredholm Integral Equation Using Pincherle-Goursat Kernel
Ãø¼Ô *Yuichi Kida(School of Pharmaceutical Sciences, Ohu University), Takuro Kida(Department of Electrical and Electronics Engineering, Nihon University)
Pagepp. 593 - 598
Keyword Optimum approximation, filter bank, digital signal processing, Pincherle-Goursat kernel
AbstractIn the main part of this paper, we present a systematic discussion of the optimum running-type approximation based on Fredholm integral equation using Pincherle-Goursat kernel. We can choose flexible sub-bands, sample points and analysis filters in this approximation. Moreover, this approximation can be realized by FIR filter bank.


¥»¥Ã¥·¥ç¥ó Bd2-3 ±ÇÁü±þÍÑ
Æü»þ: 2007ǯ4·î24Æü(²Ð) 13:15-14:55
ºÂĹ: °¤Éô ½Ê¿Í (¿·³ã¸©¹©¶Èµ»½ÑÁí¹ç¸¦µæ½ê)

Âê̾Low Complexity MPEG-4 VideoTtranscoders for Storage and Delivery System in Mobile Networks
Ãø¼Ô *Hironori Ito, Kazunori Ozawa, Kazuteru Watanabe, Kazuhiro Koyama, Atsushi Murashima(NEC/Mobile IP Network Division)
Pagepp. 599 - 602
Keyword audio recording, multimedia communication, video recording, video phone systems
AbstractThis paper proposes low complexity video transcoders for the video storage and delivery system in 3G (the 3rd generation) Circuit Switched (CS) networks, and presents their DSP implementation results. In the storage stage, the I-frame transcoder, which converts the first frame of MPEG-4 video stream to be stored into I-frame, employs a simple method to highly reduce complexity. Timestamp adjustment is proposed in order to solve buffer overflow and lack of audio-visual synchronization problems, which occur in the 3G CS networks, when applying this type of transcoder to the system. In the delivery stage, syntax transcoder is proposed which converts the formats of the streams to deliver several formats of MPEG-4 streams during the same session, by converting. This transcoder achieves no loss of the original video quality. The DSP implementation results show that the complexity of both proposed transocders is a total of 7.2 % in the average load on 720 MHz clock DSP, which is only 55 % of that of the conventional tandem transcoder. They are suitable for multi-channel operation in the storage and delivery system.

Âê̾MPEG-2/H.264¥È¥é¥ó¥¹¥³¡¼¥À¤Ë¤ª¤±¤ëÄã±é»»ÎÌÆ°¤­Ãµº÷¼êË¡
Ãø¼Ô *¶¶ËÜ ·Ä¹¨(ÆÁÅçÂç³ØÂç³Ø±¡ Àèüµ»½Ñ²Ê³Ø¶µ°éÉô ¥·¥¹¥Æ¥àÁÏÀ¸¹©³ØÀì¹¶ Åŵ¤ÅÅ»ÒÁÏÀ¸¹©³Ø¥³¡¼¥¹), Á× Å·, ÅçËÜ Î´(ÆÁÅçÂç³ØÂç³Ø±¡ ¥½¥·¥ª¥Æ¥¯¥Î¥µ¥¤¥¨¥ó¥¹¸¦µæÉô ¾ðÊó¥½¥ê¥å¡¼¥·¥ç¥óÉôÌç)
Pagepp. 603 - 608
Keyword H.264, MPEG-2, ¥È¥é¥ó¥¹¥³¡¼¥À

Âê̾Inter Search Mode Reduction Based Parallel Propagate Partial SAD Architecture for Variable Block Size Motion Estimation in H.264/AVC
Ãø¼Ô *Yiqing Huang, Zhenyu Liu, Yang Song, Satoshi Goto, Takeshi Ikenaga(Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 609 - 614
Keyword mode reduction, propagate partial SAD, motion esitmation, VBSME, HDTV
AbstractThe newest video coding standard H.264/AVC has a wide range of applications, from QCIF to HDTV. For large frame size video sequences, small inter search modes contribute negligible gain in the video quality. This paper proposes a mode reduction based propagate partial SAD architecture that targets high resolution pictures¡Çcoding. With mode decision based on coarse rate-distortion calculation, this approach contributes to the coding performance. Moreover, the proposed architecture performs well when parallelism and high clock speed are considered. Finally, we give out the mode reduction based eight-set propagated partial SAD hardwired integer motion estimation engine for H.264/AVC. Its peak throughput is 720p@30Hz with the 128 ¡ß 64 search range and 5 reference frames. Compared with the original parallel SAD tree architecture, 12k gates hardware cost can be saved by our design.

Âê̾Motion-Content Based Search Range Prediction in Variable Block Size Motion Estimation
Ãø¼Ô *ZhenXing Chen, Yang Song, Takeshi Ikenaga, Satoshi Goto(The Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 615 - 618
Keyword VBSME, search range, motion content, motion vector predictor
AbstractIn this paper, one adaptive search range prediction algorithm is proposed for the variable block size motion estimation (VBSME) in H.264/AVC. In the presented algorithm, the search range is dynamically adjusted according to the motion content, which is defined by three motion vector predictions. Experimental results have shown that the proposed method can save up to 50% of computational complexity with competitive image quality in [10].


¥»¥Ã¥·¥ç¥ó Bd2-4 ²èÁü±þÍÑ
Æü»þ: 2007ǯ4·î24Æü(²Ð) 15:10-16:50
ºÂĹ: ÌÚ¼ À¿Áï (ÆüËÜIBM(³ô¡Ë ¥Æ¡¼¥×¥·¥¹¥Æ¥à¥º³«È¯)

Âê̾¥Ó¥Ã¥È¥Ñ¥¿¡¼¥óËä¹þ¤ß²Äǽ¤Ê²èÁüÅÅ»ÒÆ©¤«¤·Ë¡¤ËÂФ¹¤ë¿·¤·¤¤¸°·ÏÎó¤ÎÄó°Æ
Ãø¼Ô *ÃæËÜ ¾»Í³, Æ£ËÜ Âî(¹­ÅçÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê), ÅÚ°æ ¾Ï½¼(¹­Å繩¶ÈÂç³Ø¾ðÊó³ØÉô), ¿÷¸µ ¹§É×(¹­ÅçÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê)
Pagepp. 619 - 624
Keyword ÅÅ»ÒÆ©¤«¤·, DWT, ¥Ó¥Ã¥È¥Ñ¥¿¡¼¥ó, ¸°·ÏÎó, Ãøºî¸¢Êݸî

Âê̾°ÌÁê¸ÂÄêÁê´ØË¡¤òÍѤ¤¤¿¾¸ÌæÇ§¾Ú¥¢¥ë¥´¥ê¥º¥à¤È¤½¤ÎÀ­Ç½É¾²Á
Ãø¼Ô *°ËÆ£ ¹¯°ì, ÀÄÌÚ ¹§Ê¸(ÅìËÌÂç³Ø), ÃæÅç ´², ¾®ÎÓ ¹§¼¡(³ô¼°²ñ¼Ò»³Éð), Èõ¸ý ζͺ(ÅìË̹©¶ÈÂç³Ø)
Pagepp. 625 - 630
Keyword ¾¸ÌæÇ§¾Ú, °ÌÁê¸ÂÄêÁê´ØË¡, ¥Ð¥¤¥ª¥á¥È¥ê¥¯¥¹, ¸Ä¿Íǧ¾Ú, ¥»¥­¥å¥ê¥Æ¥£
Abstract¼ê¤Î¤Ò¤é¤Ï¡¤¼ê¤ÎÆâ¦¤ÎɽÌ̤Ǥ¢¤ê¡¤»ØÌæ¤Î¤è¤¦¤ÊδÀþ¤Î¥Ñ¥¿¡¼¥ó¤ò»ý¤Ã¤Æ¤¤¤ë¡¥¤³¤Î¥Ñ¥¿¡¼¥ó¤ò¾¸Ìæ¤È¸Æ¤Ö¡¥¾¸Ìæ¤Ï¡¤»ØÌæ¤ÈÈæ¤Ù¤ÆÎΰ褬Â礭¤¤¤³¤È¤ä¡¤Î´Àþ°Ê³°¤Ë¤âºÙ¤«¤¤¤·¤ï¤äÆÃ°ÛÅÀ¡¤¸ÇÍ­¤Î¥Æ¥¯¥¹¥Á¥ã¤òÍ­¤·¤Æ¤¤¤ë¤³¤È¤è¤ê¡¤»ØÌæ¤è¤ê¤â¼±ÊÌÀ­Ç½¤¬¹â¤¤¤È¸À¤ï¤ì¤Æ¤¤¤ë¡¥ËÜÏÀʸ¤Ç¤Ï¡¤°ÌÁê¸ÂÄêÁê´ØË¡ (Phase-Only Correlation: POC) ¤òÍѤ¤¤¿¾¸ÌæÇ§¾Ú¥¢¥ë¥´¥ê¥º¥à¤òÄ󰯤¹¤ë¡¥°ÌÁê¸ÂÄêÁê´ØË¡¤Ï¡¤²èÁü¤Î°ÌÁê¾ðÊó¤òÍѤ¤¤¿¹âÀºÅÙ²èÁü¥Þ¥Ã¥Á¥ó¥°¤Ç¤¢¤ê¡¤¥Ð¥¤¥ª¥á¥È¥ê¥¯¥¹Ç§¾Ú¤Ë¤ª¤¤¤Æ¤âÍ­¸úÀ­¤¬¼Â¾Ú¤µ¤ì¤Æ¤¤¤ë¡¥¤Þ¤¿¡¤¾¸Ìæ²èÁü¥Ç¡¼¥¿¥Ù¡¼¥¹¤òÍѤ¤¤¿À­Ç½É¾²Á¼Â¸³¤òÄ̤·¤Æ¡¤Ä󰯼êË¡¤¬¹âÀ­Ç½¤Ç¤¢¤ë¤³¤È¤ò¼¨¤¹¡¥

Âê̾An Efficient Encryption Scheme for H.264 Format Video Streams
Ãø¼Ô *Jidong Wang, Yibo Fan(Graduate School of Information, Production and Systems, Waseda University), Takeshi Ikenaga(Graduate School of Information, Production and Systems,Waseda University), Satoshi Goto(Graduate School of Information, Production and Systems, Waseda University)
Pagepp. 631 - 636
Keyword H.264/AVC encryption, 4x4 intra prediction mode, MVD, sub-MB type

Âê̾¸¶²èÁü¤ÎÅý·×Î̤ˤè¤é¤Ê¤¤²ÄµÕ¾ðÊóËä¹þË¡
Ãø¼Ô *¶â ¹°ÎÓ(¼óÅÔÂç³ØÅìµþÂç³Ø±¡), Æ£µÈ ÀµÌÀ, µ®²È ¿Î»Ö(¼óÅÔÂç³ØÅìµþ)
Pagepp. 637 - 642
Keyword ¥í¥¹¥ì¥¹, ¥¢¥ó¥À¡¼¥Õ¥í¡¼, ¥ª¡¼¥Ð¡¼¥Õ¥í¡¼, °åÍÑ, ÅÅ»ÒÆ©¤«¤·
AbstractËܹƤϡ¤¶õ´ÖÎΰè¤Ç²èÁü¤Ø¾ðÊó¤òËä¤á¤ë²ÄµÕ¾ðÊóËä¹þË¡¤òÄ󰯤·¤Æ¤¤¤ë¡¥²ÄµÕ¾ðÊóËä¹þË¡¤Ï¡¤¾ðÊó¤¬Ëä¤á¤é¤ì¤¿²èÁü¡Ê¥¹¥Æ¥´²èÁü¡Ë¤«¤é¾ðÊó¤òÃê½Ð¤¹¤ë¤À¤±¤Ç¤Ê¤¯¡¤¸¶²èÁü¤òÉü¸µ²Äǽ¤Ê¼êË¡¤Ç¤¢¤ë¡¥Äó°ÆË¡¤Ï¡¤Ëä¹þÂоݲèÁǤζá˵²èÁǤ«¤éÆÀ¤é¤ì¤ëÅý·×Î̤˴ð¤Å¤¤¤Æ²èÁü¤Ø¾ðÊó¤òËä¤á¤ë¡¥Äó°ÆË¡¤Ï½¾ÍèË¡¤È°Û¤Ê¤ê¡¤²ÄµÕ½èÍý¤Ë¤è¤Ã¤Æ¸¶²èÁü¤òÁ°½èÍý¤¹¤ë¤¿¤á¡¤¸¶²èÁü¤ÎÅý·×Î̤ˤè¤é¤ºÂ¿¤¯¤Î²èÁü¤Ø¾ðÊó¤òËä¤á¤ë¤³¤È¤¬²Äǽ¤È¤Ê¤Ã¤Æ¤¤¤ë¡¥¤µ¤é¤Ë¡¤¸¶²èÁü¤ÎÅý·×Î̤˴ð¤Å¤­Å¬±þŪ¤ËÁ°½èÍý¤¹¤ë¤¿¤á¡¤Ëä¹þ²Äǽ¾ðÊóÎ̤òÁý²Ã¤¹¤ë½¾ÍèË¡¤ËÂФ·¤Æ¥¹¥Æ¥´²èÁü¤Î²è¼Á¤ò¸þ¾å¤·¤Æ¤¤¤ë¡¥¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤Ã¤Æ¡¤Äó°ÆË¡¤ÎÍ­¸úÀ­¤¬¼¨¤µ¤ì¤Æ¤¤¤ë¡¥


¥»¥Ã¥·¥ç¥ó C2-1 ¹â°Ì¹çÀ®
Æü»þ: 2007ǯ4·î24Æü(²Ð) 9:00-10:15
ºÂĹ: »³ÅÄ ¹¸µ× (¥·¥ã¡¼¥×³ô¼°²ñ¼ÒÅŻҥǥХ¤¥¹³«È¯ËÜÉôÀèüµ»½Ñ³«È¯¸¦µæ½êÂ裳³«È¯¼¼)

Âê̾Delay Balancing by Min-Cut Algorithm for Reducing the Area of Pipelined Circuits
Ãø¼Ô *Bakhtiar Affendi Rosdi, ¹â¶¶ ÆÆ»Ê(Tokyo Institute of Technology)
Pagepp. 643 - 648
Keyword multi-clock cycle paths, clock-scheduling, delay balancing, minimum cut, pipelined circuits
AbstractA new algorithm is proposed to reduce the area of a pipelined circuit using a combination of multi-clock cycle paths, clock scheduling and delay balancing under the condition that the circuit works correctly at target clock-period range. The algorithm analyzes the circuit and determines the path where the intermediate registers can be removed by delay balancing. A min-cut algorithm is used to minimize the number of inserted delay elements during delay balancing. Experiments with a pipelined multiplier verify that the proposed algorithm can reduce the area of a pipelined circuit without degrading performance.

Âê̾¥Ç¡¼¥¿¥Ñ¥¹¤Ë¤ª¤±¤ëÃÙ±äÊÑÆ°ÂÑÀ­¤Ë´Ø¤¹¤ë´ðÁÃŪ¸¡Æ¤
Ãø¼Ô *°æ¾å ·Ã²ð, ¶â»Ò Êöͺ, ´ä³À ¹ä(ËÌΦÀèü²Ê³Øµ»½ÑÂç³Ø±¡Âç³Ø)
Pagepp. 649 - 654
Keyword ¹â°Ì¹çÀ®, ÃÙ±äÊÑÆ°, ¥ì¥¸¥¹¥¿³ä¤êÅö¤Æ
AbstractȾƳÂÎ¥×¥í¥»¥¹¤ÎÈùºÙ²½¤Ëȼ¤¤¡¤´óÀ¸ÁǻҤαƶÁÁýÂ硤 Å۵¤ÎÈù¼å²½¤¬¿Ê¤ß¡¤»¨²»¤äÃÙ±ä¤Ð¤é¤Ä¤­¤ÎÌäÂ꤬ ¸²ºß²½¤·¤Æ¤­¤Æ¤¤¤ë¡¥ Ëܸ¦µæ¤Ç¤Ï¡¤ÃÙ±ä¤Ð¤é¤Ä¤­¤Î²¼¤ÇÀµ¤·¤¯Æ°ºî¤¹¤ë²óÏ©¤ò¡¤ ÄêÀ­Åª¤ËÍ­¸Â¤ÊǤ°Õ¤ÎÃÙ±ä¤Ð¤é¤Ä¤­¤Î²¼¤Ç Àµ¤·¤¯Æ°ºî¤¹¤ë¥¯¥í¥Ã¥¯¼þ´ü¤¬Â¸ºß¤¹¤ë²óÏ©¤Èª¤¨¡¤ ²óÏ©¤Î¥Ç¡¼¥¿¥Ñ¥¹Éô¤Ë¤ª¤±¤ë ¥ì¥¸¥¹¥¿Å¾Á÷¥ì¥Ù¥ëÀß·×¾ò·ï¤òÌÀ¤é¤«¤Ë¤¹¤ë¡¥ ¤Þ¤¿¡¤¤³¤ì¤Ë´ð¤Å¤¤¤ÆÃÙ±ä¤Ð¤é¤Ä¤­¤ò¹Íθ¤·¤¿ ¥ì¥¸¥¹¥¿³ä¤êÅö¤ÆÌäÂê¤ò¹Í¤¨¤ë¡¥ ÆþÎϥǡ¼¥¿¥Õ¥í¡¼¥°¥é¥Õ¤¬ÌµÊÄϩͭ¸þ¥°¥é¥Õ¤Î¤È¤­ ¥ì¥¸¥¹¥¿¿ôºÇ¾®¤òÊݾڤ¹¤ë¥ì¥¸¥¹¥¿³ä¤êÅö¤Æ¼êË¡¤ò¼¨¤¹¡¥ ºÇ¸å¤Ë¡¤ÃÙ±ä¤Ð¤é¤Ä¤­¤Î²¼¤ÇÀµ¤·¤¯Æ°ºî¤¹¤ë À©¸æÉô¤Ë´Ø¤¹¤ë¹Í»¡¤ò¹Ô¤¦¡¥

Âê̾ÀìÍѱ黻´ï¤È±é»»¤Î¥Á¥§¥¤¥Ë¥ó¥°¤Î¥È¥ì¡¼¥É¥ª¥Õ¤ò¹Íθ¤·¤¿Æ°ºî¹çÀ®¼êË¡
Ãø¼Ô *ÄçÊý µ£(¶å½£Âç³ØÂç³Ø±¡¥·¥¹¥Æ¥à¾ðÊó²Ê³ØÉÜ), ¾¾±Ê ͵²ð(¶å½£Âç³ØÂç³Ø±¡¥·¥¹¥Æ¥à¾ðÊó²Ê³Ø¸¦µæ±¡)
Pagepp. 655 - 660
Keyword ưºî¹çÀ®, ¥Á¥§¥¤¥Ë¥ó¥°, ÀìÍѱ黻´ï
Abstractưºî¹çÀ®¤Ë¤ª¤¤¤Æ¡¢¸ß¤¤¤Ë¥Ç¡¼¥¿°Í¸´Ø·¸¤ò»ý¤ÄÊ£¿ô¤Î±é»»¤òƱ°ì ¤Î¥³¥ó¥È¥í¡¼¥ë¥¹¥Æ¥Ã¥×¤Ç¼Â¹Ô¤¹¤ëÊýË¡¤Ï£²¤Ä¤¢¤ë¡££±¤Ä¤Ï´ðËÜ ¤È¤Ê¤ë±é»»´ï¤òÁȤ߹ç¤ï¤»¤ë¤³¤È¤Ç¼Â¹Ô¤ò²Äǽ¤È¤¹¤ë±é»»¤Î¥Á¥§¥¤ ¥Ë¥ó¥°¤Ç¤¢¤ë¡£¤â¤¦£±¤Ä¤ÏÀìÍѱ黻´ï¤òÍѤ¤¤ëÊýË¡¤Ç¤¢¤ë¡£ÀìÍÑ±é »»´ï¤Ï·å¤¢¤²Êݸ²Ã»»´ï¤òÍѤ¤¤ë¤Ê¤É¤ÎÊýË¡¤Ç¹â®¤«¤Ä¾®ÌÌÀѤ˹½ À®¤¹¤ë¤³¤È¤¬²Äǽ¤Ç¤¢¤ë¡£°ìÊý¡¢Ãæ´Ö¤Î±é»»·ë²Ì¤òÆÀ¤ë¤³¤È¤¬º¤Æñ ¤Ç¤¢¤ë¾ì¹ç¤¬Â¿¤¯¡¢´ðËܱ黻´ï¤ÎÁȤ߹ç¤ï¤»¤ËÈæ¤Ù¤ÆÂ¾¤Î±é»»¤È¤Î ±é»»´ï¤Î¶¦Í­¤Î¤·¤ä¤¹¤µ¤ÏÎô¤ë¡£¤Ä¤Þ¤ê¡¢¤¤¤º¤ì¤ÎÊýË¡¤òÍѤ¤¤ë¤« ¤ÎÁªÂò¤Ë¤Ï±é»»´ï¤ÎÃÙ±ä¤äÌÌÀѤȡ¢¶¦Í­¤Î¤·¤ä¤¹¤µ¤Î¥È¥ì¡¼¥É¥ª¥Õ ´Ø·¸¤¬Â¸ºß¤¹¤ë¡£ËÜÏÀʸ¤Ç¤Ï¡¢¥Á¥§¥¤¥Ë¥ó¥°¤ÈÀìÍѱ黻´ï¤ÎÍøÍѤò Ʊ»þ¤Ë¹Íθ¤·¤¿¡¢¥â¥¸¥å¡¼¥ëÁªÂò¡¢¥¹¥±¥¸¥å¡¼¥ê¥ó¥°¡¢¥¢¥í¥±¡¼¥· ¥ç¥óÌäÂê¤òÄê¼°²½¤·¡¢¥Ù¥ó¥Á¥Þ¡¼¥¯¤ËŬÍѤ·¤¿·ë²Ì¤ò¼¨¤¹¡£


¥»¥Ã¥·¥ç¥ó C2-2 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] DFM (1)
Æü»þ: 2007ǯ4·î24Æü(²Ð) 10:35-12:00
ºÂĹ: ÁýÅÄ ¹°À¸ (¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸¡¡SOCÀß·×Åý³çÉô ¥Ç¥Ð¥¤¥¹IP³«È¯Éô)

Âê̾(¾·ÂÔ)À½Â¤¡¦´Ä¶­¤Ð¤é¤Ä¤­¤ÈÀ½Â¤¸åÀ­Ç½Êä½þ¤ò¹Íθ¤·¤¿¥¿¥¤¥ß¥ó¥°¸¡¾Ú¤Ë¸þ¤±¤Æ
Ãø¼Ô *¶¶ËÜ ¾»µ¹(ÂçºåÂç³Ø)
Pagepp. 661 - 666
Keyword À½Â¤¤Ð¤é¤Ä¤­, ÅŸ»¥Î¥¤¥º, Åý·×Ū¥¿¥¤¥ß¥ó¥°²òÀÏ, ´Ä¶­¤Ð¤é¤Ä¤­, ưŪÀ­Ç½Êä½þ
AbstractÀ½Â¤¡¤´Ä¶­¤Ð¤é¤Ä¤­¤Ë¤è¤ëÃÙ±äÊÑÆ°¤¬¿¼¹ï²½¤·¤¿LSI ¤Î¥¿¥¤¥ß¥ó¥°¸¡¾Úµ»½Ñ¤Ë¤Ä¤¤¤ÆµÄÏÀ¤¹¤ë¡¥À½Â¤¤Ð¤é¤Ä¤­ ¤ò¬Äꤷ¡¤¥â¥Ç¥ë²½¡¤²òÀϤ¹¤ëµ»½Ñ¤¬À¹¤ó¤Ë¸¦µæ¤µ¤ì¤Æ ¤¤¤ë°ìÊý¡¤ÅŸ»¥Î¥¤¥º¤ÏÆþÎÏ¥Ù¥¯¥È¥ë°Í¸À­¤Ê¤É¤ÎÌäÂê ÅÀ¤«¤é¸¡Æ¤¤¬ÉÔ½½Ê¬¤Ç¤¢¤ë¡¥ËܹƤǤϡ¤²æ¡¹¤¬¼è¤êÁȤó ¤Ç¤¤¤ëÀ½Â¤¡¦´Ä¶­¤Ð¤é¤Ä¤­¤òÅý°ìŪ¤Ë¼è¤ê°·¤Ã¤¿¥¿¥¤¥ß¥ó ¥°¸¡¾Úµ»½Ñ¤Î°ìÎã¤ò¾Ò²ð¤¹¤ë¡¥¤Þ¤¿¡¤º£¸å¤Î¸¦µæÆ°¸þ¤È ¤·¤Æ¡¤À½Â¤¸å¤ÎÀ­Ç½Êä½þ¤ò¹Íθ¤·¤¿¥¿¥¤¥ß¥ó¥°²òÀÏ¡¤Êâ α¤Þ¤êͽ¬¤ò¼è¤ê¾å¤²¡¤¸¦µæ²ÝÂê¤ò¼¨¤¹¡¥

Âê̾ÅŸ»¥Î¥¤¥º¤Î¶õ´ÖŪÁê´Ø¤ò¹Íθ¤·¤¿Åý·×Ū¥¿¥¤¥ß¥ó¥°²òÀÏ
Ãø¼Ô *±ÝÊ ¹§»Ê, ÆóµÜ ¿ÊÍ­, ¶¶ËÜ ¾»µ¹(ÂçºåÂç³Ø Âç³Ø±¡¾ðÊó²Ê³Ø¸¦µæ²Ê ¾ðÊó¥·¥¹¥Æ¥à¹©³ØÀì¹¶)
Pagepp. 667 - 672
Keyword ÅŸ»¥Î¥¤¥º, SSTA, Áê´Ø, ľ¸ò²½, ¼çÀ®Ê¬Ê¬ÀÏ
Abstract¶áǯ¡¢ÅŸ»¥Î¥¤¥º¤¬¥¿¥¤¥ß¥ó¥°¤ËÍ¿¤¨¤ë±Æ¶Á¤¬Â礭¤¯¤Ê¤Ã¤Æ¤¤¤ë¡£ÅŸ»¥Î¥¤¥º¤ÏÆþÎÏ¥Ù¥¯¥È¥ë¤Ë¤è¤êÊѲ½¤·¡¢ ¥¿¥¤¥ß¥ó¥°¤¬ºÇ°­¤È¤Ê¤ëÆþÎÏ¥Ù¥¯¥È¥ë¤òµá¤á¤ë¤Î¤ÏÈó¾ï¤Ëº¤Æñ¤Ç¤¢¤ë¡£ËÜÏÀʸ¤Ç¤Ï¡¢Åý·×Ū¤ËÅŸ»¥Î¥¤¥º¤ò¼è¤ê°·¤Ã¤¿ÀÅŪÃÙ±ä²òÀϤòÄ󰯤¹¤ë¡£ÅŸ»¥Î¥¤¥º¤òưŪÊÑÆ°¾ðÊó¤òÊÝ»ý¤·¤¿ÌµÁê´Ø¤ÊÊÑ¿ô¤ËÊÑ´¹¤·¡¢Åý·×Ū¥â¥Ç¥ë¤È¤·¤ÆÉ½¸½¤¹¤ë¡£ÅŸ»Å۵¤ÎÁê´Ø¤ÏÈó¾ï¤Ë¶¯¤¤¤¿¤á¡¢Ä¾¸ò²½¼êË¡¤È¤·¤Æ¼çÀ®Ê¬Ê¬ÀϤ¬Í­¸ú¤Ç¤¢¤ë¤³¤È¤ò¼¨¤¹¡£¼Â¸³¤Ë¤è¤êÄ󰯼êË¡¤ÎÍ­¸úÀ­¤ò¼¨¤·¡¢ÃÙ±ä²òÀÏÀºÅ٤ȷ׻»»þ´Ö¤òµÄÏÀ¤¹¤ë¡£


¥»¥Ã¥·¥ç¥ó C2-3 ¥·¥¹¥Æ¥àÀß·×¼êË¡
Æü»þ: 2007ǯ4·î24Æü(²Ð) 13:30-14:45
ºÂĹ: ÃÝÃæ ¿ò (NEC ¥·¥¹¥Æ¥à¥Ç¥Ð¥¤¥¹¸¦µæ½ê ¥·¥¹¥Æ¥àCAD)

Âê̾¥·¥¹¥Æ¥àÀ߷פΤ¿¤á¤Î¥Õ¥ì¥­¥·¥Ó¥ê¥Æ¥£¤Î¹â¤¤¥·¥ß¥å¥ì¡¼¥·¥ç¥ó´Ä¶­¤òÍѤ¤¤¿¿®¹æ½èÍý¥¢¥ë¥´¥ê¥º¥à¤Î¼ÂÁõ»Ù±ç
Ãø¼Ô *»°¹¥ ·òʸ, ¿ùÌî Īɧ(Åìµþ¹©¶ÈÂç³ØÁí¹çÍý¹©³Ø¸¦µæ²ÊʪÍý¾ðÊó¥·¥¹¥Æ¥àÀì¹¶¿ùÌµæ¼¼)
Pagepp. 673 - 678
Keyword ¥·¥ß¥å¥ì¡¼¥·¥ç¥ó´Ä¶­, ¥·¥¹¥Æ¥àÀß·×, ¿®¹æ½èÍý
AbstractÄã¾ÃÈñÅÅÎÏ¡¤¸Â¤é¤ì¤¿¥ê¥½¡¼¥¹¤Î¾å¤Ç¡¤¸úΨ¤ÎÎɤ¤¥¢¥×¥ê¥±¡¼¥·¥ç¥ó¤ò¼Â¸½¤¹¤ë¤¿¤á¤Ë¤Ï¡¤¥Ï¡¼¥É¥¦¥§¥¢¤È¥½¥Õ¥È¥¦¥§¥¢¤ÎξÊý¡¤¤¹¤Ê¤ï¤Á¥·¥¹¥Æ¥à¥¢¡¼¥­¥Æ¥¯¥Á¥ã¤ÎÀ߷פ¬½ÅÍפǤ¢¤ë¡¥¤³¤Î¥·¥¹¥Æ¥à¤ÎÀ߷פª¤è¤Óɾ²Á¤Ë¤Ï¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤¬Í­¸ú¤Ç¤¢¤ë¤¬¡¤½¾Íè¤è¤êÍѤ¤¤é¤ì¤Æ¤¤¤ë¼êË¡¤Ç¤Ï¡¤¤½¤Î¹½Ãۤˤ«¤«¤ë¥³¥¹¥È¤¬Â礭¤¯¡¤¼ê·Ú¤ËÍÍ¡¹¤Ê¥Ç¥Ð¥¤¥¹¤Ë¤è¤ë¥·¥¹¥Æ¥à¤ò»î¹Ô¤¹¤ë¤³¤È¤¬Æñ¤·¤¤¡¥ Ä󰯤¹¤ëMICS¤Ç¤Ï¡¤½ÀÆð¤Ê¥·¥¹¥Æ¥à¹½À®¤È¥µ¥¤¥¯¥ë¥ì¥Ù¥ë¤Ç¤Î¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Ë¤è¤ê³«È¯¤Î½é´üÃʳ¬¤«¤é¼Â¥¢¥×¥ê¥±¡¼¥·¥ç¥ó¤Ë¶á¤¤¥½¥Õ¥È¥¦¥§¥¢¤òưºî¤µ¤»¤ë¤³¤È¤¬²Äǽ¤Ç¤¢¤ë¡¥ ËÜÏÀʸ¤Ç¤Ï¡¤¤³¤Î¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Îưºî®Å٤ˤĤ¤¤Æ¤Îɾ²Á¤ò¹Ô¤¤¡¤¿®¹æ½èÍý¥×¥í¥°¥é¥à¤òÎã¤Ë¤È¤Ã¤¿¥·¥ß¥å¥ì¡¼¥·¥ç¥ó·ë²Ì¤ò¼¨¤¹¡¥

Âê̾C¥Ù¡¼¥¹Àß·×¼êË¡¤òÍѤ¤¤¿±Õ¾½¥Æ¥ì¥ÓÍѲèÁü½èÍýLSI¤Î³«È¯
Ãø¼Ô *»³ÅÄ ¹¸µ×, ÃÝÅÄ ¿®¹°, ²¬ÅÄ Ïµ×, ÂçÀ¾ ½¼µ×, ¿¹²¼ µ®¹°, ³á¼ ¹¸Íµ, Á°ÅÄ ¿¿°ì, ÀÐÅÄ Ë­, ¾±Ìî ¾­¹Ô, ÅÄÃæ δµÈ, µÈÅÄ °é¹°, µÆÃÏ ÍºÆó, ¿ùÌî Æ»¹¬(¥·¥ã¡¼¥×)
Pagepp. 679 - 684
Keyword ¹â°Ì¹çÀ®, Bach, C¥Ù¡¼¥¹Àß·×, ¥¢¥µ¡¼¥·¥ç¥ó¥Ù¡¼¥¹¸¡¾Ú
AbstractËÜʸ¤Ç¤Ï¡¢Åö¼Ò¤Ç¹½ÃÛ¤·¤¿¹â°Ì¹çÀ®¼êË¡¤òÃæ¿´¤È¤·¤¿C¥Ù¡¼¥¹Àß·×¥Õ¥í¡¼¤Ë¤Ä¤¤¤Æ±ä¤Ù¡¢ > ¤³¤ÎÀß·×¥Õ¥í¡¼¤òÍѤ¤¤¿¥±¡¼¥¹¥¹¥¿¥Ç¥£¤È¤·¤Æ±Õ¾½TV¸þ¤±²èÁü½èÍýLSI¤òÀ߷פ·¤¿·ë²Ì¤ò¼¨¤·¡¢Ä󰯼êË¡¤ÎÍ­¸úÀ­¤ò¼¨¤¹¡£

Âê̾C¸À¸ìÀ߷פˤª¤±¤ë¥¢¡¼¥­¥Æ¥¯¥Á¥ãºÇŬ²½¼êË¡
Ãø¼Ô *¿À¸Í ¾°»Ö(¶áµ¦Âç³ØÍý¹©³ØÉôÅŵ¤ÅŻҹ©³Ø²Ê), ¾å¹Ã ·û»Ô, ¾åÄÅ ´²ÏÂ(¶áµ¦Âç³ØÂç³Ø±¡Áí¹çÍý¹©³Ø¸¦µæ²Ê ¥¨¥ì¥¯¥È¥í¥Ë¥¯¥¹·Ï¹©³ØÀì¹¶), »³ÅÄ ¹¸µ×(¥·¥ã¡¼¥×³ô¼°²ñ¼Ò ÅŻҥǥХ¤¥¹³«È¯ËÜÉô Àèüµ»½Ñ³«È¯¸¦µæ½ê)
Pagepp. 685 - 690
Keyword C¸À¸ìÀß·×, ¥¢¡¼¥­¥Æ¥¯¥Á¥ã, BACH¥·¥¹¥Æ¥à, γ»ÒÄÉÀ×, ¥Æ¥ó¥×¥ì¡¼¥È¥Þ¥Ã¥Á¥ó¥°
Abstractǯ¡¹¡¢Ê£»¨²½¡¦Â¿µ¡Ç½²½¤¬¿Ê¤à¥·¥¹¥Æ¥àLSIÀ߷פǤϡ¢Â絬ÌϲóÏ©¤ÎÀ߷׸úΨ²½¤Î¤¿¤á¤Ë¡¢C¸À¸ìÀ߷פ¬ÃíÌܤµ¤ì¤Æ¤¤¤ë¡£C¸À¸ìÀß·×¤ÎÆÃħ¤Î°ì¤Ä¤Ï¡¢Â¿Íͤʥ¢¡¼¥­¥Æ¥¯¥Á¥ã¤òû´ü´Ö¤ËÀ߷ס¦É¾²Á½ÐÍè¤ëÅÀ¤Ë¤¢¤ë¡£ËÜʸ¤Ç¤Ï¡¢C¸À¸ì¤òÍѤ¤¤¿¡¢¥Ç¡¼¥¿¥¢¥¯¥»¥¹¡¢ÊÂÎ󲽡¢¥â¥¸¥å¡¼¥ë¹½À®¤ÎÊѹ¹¡¢ÀìÍѱ黻²óÏ©²½¤Ê¤É¤Ë¤è¤ë¥¢¡¼¥­¥Æ¥¯¥Á¥ãºÇŬ²½Ë¡¤òÄ󰯤¹¤ë¡£¤Þ¤¿¡¢ËܼêË¡¤ò¥Æ¥ó¥×¥ì¡¼¥È¥Þ¥Ã¥Á¥ó¥°Ë¡¤Ë¤è¤ëγ»ÒÄÉÀ×µ»½Ñ¤ËŬÍѤ·¡¢¤½¤Î¸ú²Ì¤ò³Îǧ¤¹¤ë¡£


¥»¥Ã¥·¥ç¥ó C2-4 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] DFM (3)
Æü»þ: 2007ǯ4·î24Æü(²Ð) 15:20-17:00
ºÂĹ: ÅÚë μ (µþÅÔÂç³ØÂç³Ø±¡¾ðÊ󳨏¦µæ²Ê ÄÌ¿®¾ðÊó¥·¥¹¥Æ¥àÀì¹¶)

Âê̾45-65nm¥Î¡¼¥É¤Ë¤ª¤±¤ëÃÙ±ä¤Ð¤é¤Ä¤­ÆÃÀ­¤Î´Ä¶­²¹Åٰ͸À­
Ãø¼Ô *ÃæÎÓ ÂÀÈþÀ¤(¥·¥ã¡¼¥×), ¹õÀî ÆØ(»°ÍÎȾƳÂÎ), º´Æ£ ¹â»Ë(Åìµþ¹©¶ÈÂç³Ø), ¶¶ËÜ ¾»µ¹(ÂçºåÂç³Ø), ÁýÅÄ ¹°À¸(¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸ )
Pagepp. 691 - 696
Keyword ¤Ð¤é¤Ä¤­, ²¹Åٰ͸À­, DFM, ÇÛÀþÃÙ±ä
AbstractËܹƤǤϡ¢¤Ð¤é¤Ä¤­¤Î²¹Åٰ͸À­¤Ë¤Ä¤¤¤ÆµÄÏÀ¤¹¤ë¡£¤Þ¤ºÁÇ»ÒÆÃÀ­¤Ð¤é¤Ä¤­¤È¤·¤Æ¡¢MOSÅÅήÆÃÀ­¡¢CuÇÛÀþÄñ¹³¤ÎÁêÂФФé¤Ä¤­¤¬Äã²¹¤Ç¥ï¡¼¥¹¥È(ºÇÂç)¤È¤Ê¤ë¤³¤È¤ò¼¨¤¹¡£¤µ¤é¤Ë¡¢ÁǻҤФé¤Ä¤­¤Î²óÏ©ÆÃÀ­¤Ð¤é¤Ä¤­¤Ø¤Î±Æ¶Á¤Ë¤Ä¤¤¤ÆÉ¾²Á¤¹¤ë¤¿¤á¡¢ÇÛÀþÃÙ±ä¤Ð¤é¤Ä¤­¤Î²¹ÅÙÆÃÀ­¤ò²òÀϤ·¤¿¡£ÌµÉé²Ù¤Î¥»¥ëÃÙ±ä¤Ç¤Ï¥È¥é¥ó¥¸¥¹¥¿¤Î¤Ð¤é¤Ä¤­¤Î²¹ÅÙÆÃÀ­¸ú²Ì¤¬»ÙÇÛŪ¤Ç¤¢¤ë¤¬¡¢Ä¹ÇÛÀþ¤Î¥»¥ë´Ö¥É¥é¥¤¥ÐÆÃÀ­¤Ç¤ÏÇÛÀþÄñ¹³¤Ð¤é¤Ä¤­¤¬Äã²¹¤Ë¤ª¤¤¤ÆÆÃ¤Ë¸²Ãø¤Ë¤Ê¤ë¤³¤È¤ò¼¨¤·¡¢¤³¤Î·¹¸þ¤Ï¥×¥í¥»¥¹¤¬ÈùºÙ¤Ë¤Ê¤ë¤Ë½¾¤Ã¤ÆÁýÂ礹¤ë¤³¤È¤òÌÀ¤é¤«¤Ë¤·¤¿¡£Â¨¤Á¡¢º£¸å¤ÎLSIÀ߷פˤª¤¤¤Æ¡¢Äã²¹¤Ç¤Î¤Ð¤é¤Ä¤­¥Þ¡¼¥¸¥ó¤Î¹Í»¡¡¢MOSÅÅή¤Ð¤é¤Ä¤­¤À¤±¤Ç¤Ê¤¯ÇÛÀþÄñ¹³¤Ð¤é¤Ä¤­¤Î¹Íθ¤¬É¬¿Ü¤Ë¤Ê¤Ã¤Æ¤¯¤ë¤³¤È¤òÌÀ¤é¤«¤Ë¤·¤¿¡£

Âê̾¥é¥ó¥À¥à¶ÊÌÌ¥â¥Ç¥ë¤Ë¤è¤ë¶õ´ÖÁê´Ø¤Îɽ¸½¤ÈLSIÀ߷פؤαþÍÑ
Ãø¼Ô *ÂçÀî âðì, ÁýÅÄ ¹°À¸(¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸ ¥Ç¥Ð¥¤¥¹IP³«È¯Éô)
Pagepp. 697 - 702
Keyword LSIÀß·×, ¤Ð¤é¤Ä¤­, ¥·¥¹¥Æ¥àÀ®Ê¬, ¥é¥ó¥À¥à¶ÊÌÌ¥â¥Ç¥ë
Abstract¡¡²æ¡¹¤ÏÀè¤Î¸¦µæ¤Ë¤ª¤¤¤Æ¥é¥ó¥À¥à¶ÊÌÌ¥â¥Ç¥ë¤È¤¤¤¦¿·¤·¤¤³µÇ°¤òÄ󾧤·¤¿¡£ÊÑ¿ô¤Î¤Ð¤é¤Ä¤­¤ÎÂåɽ¤¬¥¬¥¦¥¹Ê¬ÉۤǤ¢¤ë¤è¤¦¤Ë¡¢¶ÊÌ̤Υé¥ó¥À¥à¤ÊÊѲ½¤ò¥é¥ó¥À¥à¶ÊÌÌ¥â¥Ç¥ë¤Çɽ¸½¤¹¤ë¡£¤³¤Î°·¤¤¤Ï¡¢LSI¥Á¥Ã¥×Æâ¤Ð¤é¤Ä¤­¤Î¥é¥ó¥À¥àÀ®Ê¬¤È¥·¥¹¥Æ¥àÀ®Ê¬¤ËÁêÅö¤¹¤ë¡£ ¡¡º£¤Þ¤Ç¡¢¥·¥¹¥Æ¥àÀ®Ê¬¤ÎÍ­¸ú¤Êɽ¸½¼êÃʤ¬¸«¤¢¤¿¤é¤Ê¤«¤Ã¤¿¡£µ÷Î¥¤Ë°Í¸¤¹¤ëÁê´Ø·¸¿ô¤È¤¤¤¦É½¸½¼êÃʤϤ¢¤Ã¤¿¤¬¡¢·×»»¤Î¸úΨ¡¢°ÂÄêÀ­¤ËÌäÂ꤬¤¢¤Ã¤¿¡£°ìÄê¤Î¹©ÉפǸúΨ¤ò¾å¤²¤¿Î㤬ʸ¸¥¤Ë¼¨¤µ¤ì¤Æ¤¤¤ë¤¬¡¢¥Ç¡¼¥¿¤ÎÉÔϢ³¤Ê°·¤¤¤ËÌäÂ꤬¤¢¤Ã¤¿¡£ ËÜÄó°Æ¤Î¥é¥ó¥À¥à¶ÊÌÌ¥â¥Ç¥ë¤Ï¡¢¤³¤Î¤è¤¦¤ÊÌäÂêÅÀ¤ò¥¯¥ê¥¢¤·¡¢¸ú²ÌŪ¡¢¸úΨŪ¤Ê²ò¤òÄ󶡤¹¤ë¡£LSI¤Î¤Ð¤é¤Ä¤­Àß·×¤Ç¤ÎÆñÂê(¥·¥¹¥Æ¥àÀ®Ê¬¹Íθ)¤ò¸«»ö¤Ë²ò·è¤Ç¤­¤ë¡£

Âê̾Åý·×Ū¥Ñ¥¹ÃÙ±ä²òÀϤΤ¿¤á¤ÎMonte Carlo STA¼Â¹Ô¿ôɾ²Á¤Î°ì¼êË¡
Ãø¼Ô *º£°æ Àµµª(Åìµþ¹©¶ÈÂç³Ø Âç³Ø±¡Áí¹çÍý¹©³Ø¸¦µæ²Ê/ȾƳÂÎÍý¹©³Ø¸¦µæ¥»¥ó¥¿¡¼), º´Æ£ ¹â»Ë(Åìµþ¹©¶ÈÂç³Ø Åý¹ç¸¦µæ±¡), Ãæ»³ ÈÏÌÀ(Åìµþ¹©¶ÈÂç³Ø Âç³Ø±¡Áí¹çÍý¹©³Ø¸¦µæ²Ê¡¢È¾Æ³ÂÎÍý¹©³Ø¸¦µæ¥»¥ó¥¿¡¼), ±× °ìºÈ(Åìµþ¹©¶ÈÂç³Ø Åý¹ç¸¦µæ±¡)
Pagepp. 703 - 708
Keyword STA, SSTA, timing, variation, Monte Carlo
AbstractSoC Åù¤ÎÀ߷פò¹Ô¤¦¾ì¹ç¤Ë¥Ñ¥é¥á¡¼¥¿¤òÅý·×Ū¤Ë°·¤¦¤³¤È¤¬½ÅÍפˤʤäƤ­¤Æ¤¤¤ë. ÆÃ¤Ë, ¥¿¥¤¥ß¥ó¥°À߷פǤÏÃٱ䤬¤½¤Î¥Ñ¥é¥á¡¼¥¿¤Ç¤¢¤ê, ÃÙ±ä¤ÎÅý·×ŪºÇÂçÃͺǾ®Ãͤ˴ؿ´¤¬¤¢¤ë. ¤½¤³¤ÇËÜÏÀʸ¤Ç¤Ï,¤¢¤ë´ð½à¤ÇÁª¤ó¤ÀÅý·×ŪºÇÂçºÇ¾®ÃÙ±äÃͤDzóÏ©¤Î¥¿¥¤¥ß¥ó¥°²òÀϤò¹Ô¤Ê¤¦¤³¤È¤Ë¤è¤ê, ¤¢¤ë³ÎΨ¤Ç¥¿¥¤¥ß¥ó¥°°ãÈ¿¤¬¤Ê¤¤¤ÈȽÃǤ¹¤ë¤Î¤ËɬÍפÊMonte Carlo STA¤Î¼Â¹Ô²ó¿ô¤Î²¼¸Â¤ò»öÁ°¤Ëɾ²Á¤¹¤ë¼êË¡¤òÄ󰯤¹¤ë. ¼Â¾Ú¤Î¤¿¤á¤Ë ISCAS ¤½¤Î¾¤Î¥Ç¡¼¥¿¤ËŬÍѤ·, Ä󰯤¹¤ëɾ²Á¼êË¡¤¬Í­¸ú¤Ç¤¢¤ë¤³¤È¤ò³Î¤«¤á¤¿.

Âê̾Åý·×ŪSTA¤Ç¤Î¥¹¥ë¡¼°Í¸À­¤ò¹Íθ¤·¤¿ÃÙ±ä¤Ð¤é¤Ä¤­·×»»¼êË¡¤ÎÄó°Æ
Ãø¼Ô *¹âÆ£ ¹À»ñ((³ô)¥ê¥³¡¼ ÅŻҥǥХ¤¥¹¥«¥ó¥Ñ¥Ë¡¼), ¾®ÎÓ ¹¨¹Ô(ÆüËÜ¥·¥Î¥×¥·¥¹(³ô) µ»½ÑËÜÉô), ¾®Ìî ¿®Ç¤((³ô)¥¸¡¼¥À¥Ã¥È¡¦¥¤¥Î¥Ù¡¼¥·¥ç¥ó EDA¸¦µæ³«È¯Éô), ÁýÅÄ ¹°À¸((³ô)¥ë¥Í¥µ¥¹¥Æ¥¯¥Î¥í¥¸ SOCÀß·×Åý³çÉô), ÃæÅç ±ÑÀÆ(NEC¥¨¥ì¥¯¥È¥í¥Ë¥¯¥¹(³ô) ´ðÈĵ»½Ñ³«È¯»ö¶ÈËÜÉô), ±ü¼ δ¾»(ÉÙ»ÎÄÌVLSI(³ô) ¥Æ¥¯¥Î¥í¥¸³«È¯Åý³çÉô), ¶¶ËÜ ¾»µ¹(ÂçºåÂç³Ø ¾ðÊó²Ê³Ø¸¦µæ²Ê¾ðÊó¥·¥¹¥Æ¥à¹©³ØÀì¹¶), º´Æ£ ¹â»Ë(Åìµþ¹©¶ÈÂç³Ø Åý¹ç¸¦µæ±¡¥½¥ê¥å¡¼¥·¥ç¥ó¸¦µæµ¡¹½)
Pagepp. 709 - 714
Keyword ¤Ð¤é¤Ä¤­, STA, ÃÙ±ä, ¥¹¥ë¡¼
AbstractÅý·×ŪSTA ¤Ë¤ª¤¤¤Æ¥é¥ó¥À¥àÃÙ±ä¤Ð¤é¤Ä¤­²òÀϤÎÀºÅÙ¤ò¸þ¾å¤¹¤ë·×»»¼êË¡¤ò¸¡Æ¤¤·¤¿¡£·×»»¼êË¡¤Î¼çÍפÊÅÀ¤Ï¡¢¥¹¥ë¡¼»þ´Ö¤Ð¤é¤Ä¤­¤òÃÙ±ä¤Ð¤é¤Ä¤­²òÀϤÎÍ×ÁǤȤ·¤Æ¼è¤êÆþ¤ì¤¿¤³¤È¤Ç¤¢¤ë¡£¤³¤ÎÄ󰯼êË¡¤Ç¡¢ÃÙ±ä¤Ð¤é¤Ä¤­²òÀÏ¸íº¹¤¬Ä㸺¤Ç¤­¤ë¤³¤È¤ò¡¢¥â¥ó¥Æ¥«¥ë¥í²òÀϤθ¡¾Ú¤ÇÌÀ¤é¤«¤Ë¤·¤¿¡£


¥»¥Ã¥·¥ç¥ó D2-1 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¸Î¾ã¿ÇÃǤθ¦µæÆ°¸þ (1)
Æü»þ: 2007ǯ4·î24Æü(²Ð) 9:30-10:15
ºÂĹ: Âçß· ¿·¸ã (·²ÇÏÂç³Ø ¹©³ØÉô ¾ðÊ󹩳زÊ)

Âê̾(¾·ÂÔ)Äê¿ô¥é¥¦¥ó¥É¤ÎŬ±þŪʬ»¶¸Î¾ã¿ÇÃǼêË¡¤Ë¤Ä¤¤¤Æ
Ãø¼Ô *Æ£ÅÄ Áï(¹­ÅçÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê¾ðÊ󹩳ØÀì¹¶)
Pagepp. 715 - 720
Keyword PMC¥â¥Ç¥ë, Ŭ±þŪ¸Î¾ã¿ÇÃÇ, ´°Á´¥°¥é¥Õ
AbstractËܹƤǤϡ¢PMC¥â¥Ç¥ë¤Ë´Ø¤¹¤ë¸¦µæ¤ÎÃæ¤Ç¤âÆÃ¤Ë¡¢Nakajima¤Ë¤è¤Ã¤ÆÄ󰯤µ¤ì¤¿Å¬±þŪ¤Ê¸Î¾ã¿ÇÃǼêË¡¤Î³µÀâ¤ò¹Ô¤¦¡£°Ê²¼¤Ç¤Ï¡¢Å¬±þŪ¤Ê¥â¥Ç¥ë¤Î¤â¤È¤Ç¸Î¾ã¥æ¥Ë¥Ã¥È¤òÀµ¤·¤¯ÆÃÄꤹ¤ë¤¿¤á¤ËɬÍפʥ饦¥ó¥É¿ô¤Î¾å²¼¸Â¤Ë¤Ä¤¤¤Æ¡¢¤³¤ì¤Þ¤Ç¤Ë¤ï¤«¤Ã¤Æ¤¤¤ë¤ª¤â¤Ê·ë²Ì¤È¤½¤³¤ÇÍѤ¤¤é¤ì¤Æ¤¤¤ë´ðËÜŪ¤Ê¥¢¥¤¥Ç¥¢¤È¤ò¤Ç¤­¤ë¤À¤±¤ï¤«¤ê¤ä¤¹¤¯Ðíâפ·¤Æ¤¤¤¯¡£


¥»¥Ã¥·¥ç¥ó D2-2 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¸Î¾ã¿ÇÃǤθ¦µæÆ°¸þ (2)
Æü»þ: 2007ǯ4·î24Æü(²Ð) 10:30-12:00
ºÂĹ: Âçß· ¿·¸ã (·²ÇÏÂç³Ø ¹©³ØÉô ¾ðÊ󹩳زÊ)

Âê̾(¾·ÂÔ)ÀµÂ§¤Ê¥°¥é¥Õ¤ÎŬ±þ·¿¸Î¾ã¿ÇÃÇ
Ãø¼Ô *¹ÓÌÚ Å° (´ä¼êÂç³Ø¹©³ØÉô¾ðÊó¥·¥¹¥Æ¥à¹©³Ø²Ê)
Pagepp. 721 - 725
Keyword ¥·¥¹¥Æ¥à¥ì¥Ù¥ë¸Î¾ã¿ÇÃÇ, PMC¥â¥Ç¥ë, Ŭ±þ·¿¸Î¾ã¿ÇÃÇ, Áê¸ß·ë¹çÌÖ
Abstract¥·¥¹¥Æ¥à¥ì¥Ù¥ë¤Î¸Î¾ã¿ÇÃǤȤϡ¤Ê¬»¶¥·¥¹¥Æ¥àÆâ¤Î³Æ¥æ¥Ë¥Ã¥È¤¬¸ß¤¤¤Î¾õÂÖ¤ò¸¡ºº¤·¤¢¤¦¤³¤È¤Ç¡¤¥·¥¹¥Æ¥àÆâ¤Ë¸ºß¤¹¤ë¸Î¾ã¥æ¥Ë¥Ã¥È¤ò¼«Î§Åª¤Ë¸¡½Ð¤¹¤ëÌäÂê¤Ç¤¢¤ë¡¥¤³¤ÎÌäÂê¤Î´ðËÜŪ¤Ê¥â¥Ç¥ë¤È¤·¤Æ¡¤1967ǯ¤ËPreparata,Metze, Chien¤Ë¤è¤Ã¤ÆÄ󰯤µ¤ì¤¿PMC¥â¥Ç¥ë¤¬ÃΤé¤ì¤Æ¤¤¤ë¡¥¤½¤Î¸å¡¤¤³¤ÎÌäÂê¤ËÂФ¹¤ë¿¤¯¤Î·ë²Ì¤¬ÆÀ¤é¤ì¤Æ¤¤¤ë¡¥ËÜÏÀʸ¤Ç¤Ï¡¤¤½¤ÎÃæ¤«¤é¶áǯÃíÌܤµ¤ì¤Æ¤¤¤ëŬ±þ·¿¿ÇÃǤˤĤ¤¤Æ³µ´Ñ¤¹¤ë¡¥

Âê̾(¾·ÂÔ)¥Þ¥ë¥Á¥×¥í¥»¥Ã¥µ¥·¥¹¥Æ¥à¤ÎÃ༡¸Î¾ã¿ÇÃǤˤĤ¤¤Æ
Ãø¼Ô *»³ÅÄ ÉÒµ¬(ºë¶ÌÂç³Ø Âç³Ø±¡Íý¹©³Ø¸¦µæ²Ê ¿ôÍýÅŻҾðÊóÉôÌç)
Pagepp. 727 - 732
Keyword ¥Þ¥ë¥Á¥×¥í¥»¥Ã¥µ¥·¥¹¥Æ¥à, ¥·¥¹¥Æ¥à¥ì¥Ù¥ë¸Î¾ã¿ÇÃÇ, PMC¥â¥Ç¥ë, Ã༡¸Î¾ã¿ÇÃÇ
Abstract¥Þ¥ë¥Á¥×¥í¥»¥Ã¥µ¥·¥¹¥Æ¥à¤Î¥·¥¹¥Æ¥à¥ì¥Ù¥ë¸Î¾ã¿ÇÃǤΤ¿¤á¤Î¥°¥é¥ÕÍýÏÀŪ¤ÊÏÈÁȤÏPreparata¤é¤Ë¤è¤Ã¤ÆÄ󰯤µ¤ì¡¤PMC¥â¥Ç¥ë¤È¤·¤Æ¹­¤¯ÃΤé¤ì¤Æ¤¤¤ë¡¥PMC¥â¥Ç¥ë¤Ë¤ª¤±¤ë¸Î¾ã¿ÇÃǤϡ¤¸¡ºº·ë²Ì¤«¤éÁ´¤Æ¤Î¸Î¾ã¥×¥í¥»¥Ã¥µ¤òƱÄꤹ¤ëƱ»þ¸Î¾ã¿ÇÃǤȾ¯¤Ê¤¯¤È¤â°ì¤Ä¤Î¸Î¾ã¥×¥í¥»¥Ã¥µ¤òƱÄꤹ¤ëÃ༡¸Î¾ã¿ÇÃÇ¤ÎÆó¤Ä¤ËʬÎव¤ì¤ë¡¥ËܹƤǤϡ¤Ã༡¸Î¾ã¿ÇÃǤ˴ؤ·¤Æ¤³¤ì¤Þ¤Ç¤ËÃΤé¤ì¤Æ¤¤¤ë·ë²Ì¤ò¡¤¤½¤Î¾ÚÌÀµ»Ë¡¤È¤È¤â¤Ë¾Ò²ð¤¹¤ë¡¥


¥»¥Ã¥·¥ç¥ó D2-3 [ÆÃÊÌ¥»¥Ã¥·¥ç¥ó] ¥·¥¹¥Æ¥à¥Ð¥¤¥ª¥í¥¸¡¼
Æü»þ: 2007ǯ4·î24Æü(²Ð) 13:30-14:40
ºÂĹ: °æ¸µ À¶ºÈ (ÅìµþÂç³Ø°å²Ê³Ø¸¦µæ½ê)

Âê̾(¾·ÂÔ)À¸Ì¿¥Ñ¥¹¥¦¥§¥¤¤Î¥·¥¹¥Æ¥àŪÍý²ò¤Ë¸þ¤±¤¿¥Ú¥È¥ê¥Í¥Ã¥Èɽ¸½¤È±þÍÑ
Ãø¼Ô *¾¾Ìî ¹À»Ì (»³¸ýÂç³ØÂç³Ø±¡Íý¹©³Ø¸¦µæ²Ê)
Pagepp. 733 - 738
Keyword ¥·¥¹¥Æ¥àÀ¸Êª³Ø, ¥Ú¥È¥ê¥Í¥Ã¥È, À¸Ì¿¥Ñ¥¹¥¦¥§¥¤
AbstractºÇ¶á¤Ç¤Ï¡¢¥Ú¥È¥ê¥Í¥Ã¥È¤ÏÀ¸Ì¿¥Ñ¥¹¥¦¥§¥¤¤Î¥â¥Ç¥ë²½¼êË¡¤È¤·¤Æ¾ðÊó²Ê³Ø¼Ô¤À¤±¤Ç¤Ê¤¯¡¢À¸Êª²Ê³Ø¼Ô¤Ë¤â¹­¤¯¼õ¤±Æþ¤ì¤é¤ì¤Æ¤¤¤ë¡£ËܹƤǤϡ¢¥Ú¥È¥ê¥Í¥Ã¥È¤Ë¤è¤ëÀ¸Ì¿¥Ñ¥¹¥¦¥§¥¤µ­½Ò¤Î¸¦µæ¤ò³µ´Ñ¤·¡¢À¸Ì¿¥Ñ¥¹¥¦¥§¥¤¤ò¥·¥¹¥Æ¥à¤È¤·¤ÆÍý²ò¤¹¤ë¤¿¤á¤Î¥â¥Ç¥ë²½¤È¥·¥ß¥å¥ì¡¼¥·¥ç¥ó¤Î±þÍѤˤĤ¤¤Æ½Ò¤Ù¤ë¡£¤µ¤é¤Ë¡¢ºîÀ®¤·¤¿¥Ú¥È¥ê¥Í¥Ã¥È¤Ë¤è¤ëÀ¸Ì¿¥Ñ¥¹¥¦¥§¥¤¤ò¸ø³«¤¹¤ë¤¿¤á¤Ë¹½ÃÛ¤·¤¿¥¦¥§¥Ö¥µ¥¤¥È¤Ç¤¢¤ëPetri Net Pathways¤Ë¤Ä¤¤¤Æ¾Ò²ð¤¹¤ë¡£

Âê̾Estimation of Gene Regulation Using Expression Profiles by Gene Disruption and Comprehensive Sequence Analysis on Gene Regulatory Regions
Ãø¼Ô *Ê¿ÀРˮɧ(ËÌΦÀèü²Ê³Øµ»½ÑÂç³Ø±¡Âç³Ø ¾ðÊó²Ê³Ø¸¦µæ²Ê), ÅÚµï ÍÎʸ(¥»¥ì¥¹¥¿¡¼¡¦¥ì¥­¥·¥³¡¦¥µ¥¤¥¨¥ó¥·¥º(³ô))
Pagepp. 739 - 744
Keyword °äÅÁ»Òȯ¸½, °äÅÁ»ÒÀ©¸æ¥Í¥Ã¥È¥ï¡¼¥¯
Abstract°äÅÁ»Òȯ¸½¤Ë´Ø¤¹¤ëÀ©¸æ¥Í¥Ã¥È¥ï¡¼¥¯¤ò¿äÄꤹ¤ë¤¿¤á¤Î¼êË¡¤òÄ󰯤¹¤ë¡¥¼êË¡¤ÏÇ˲õ³ô¤Ë¤è¤ë°äÅÁ»Òȯ¸½¥×¥í¥Õ¥¡¥¤¥ë¤È°äÅÁ»ÒÀ©¸æÎΰè¤ÎÌÖÍåŪ¤Êʸ»úÎó²òÀϤòÁȤ߹ç¤ï¤»¤¿¤â¤Î¤Ç¤¢¤ê¡¤£³¤Ä¤ÎÆÈΩ¤Ê¾ðÊ󸻤Ǥ¢¤ë (i) °äÅÁ»Òȯ¸½¥×¥í¥Õ¥¡¥¤¥ë¤ÎÁê´Ø·¸¿ô¡¤(ii) ÆÃÄê¤Î°äÅÁ»Ò¤òÇ˲õ¤·¤¿¸ÇÂΤˤª¤±¤ëȯ¸½¶¯ÅÙ¤ÎÊѲ½¡¤(iii) °äÅÁ»ÒÀ©¸æÎΰè¤Ë¤ª¤±¤ëŤµ20¡Á30ÄøÅÙ¤ÎÉôʬÎΰè¡Ê¥¦¥¤¥ó¥É¥¦¡Ë¤ÎÎà»÷À­¡¤¤òÍѤ¤¤ë¡¥ÆÃ¤Ë¡¤(iii)¤ÏÀ©¸æÎΰè¤Ë¶¦Ä̤Υâ¥Á¡¼¥Õ¤ò¤â¤Ä°äÅÁ»Ò·²¤òµá¤á¤ë¤³¤È¤òÌÜŪ¤È¤·¤¿¤â¤Î¤Ç¤¢¤ê¡¤ÆÃÄê¤ÎÀ©¸æ°ø»Ò¤Ë¤è¤ëľÀÜŪÀ©¸æ¤Î¾Úµò¤È¤Ê¤ë¡¥¼êË¡¤Ç¤Ï¥¦¥¤¥ó¥É¥¦Îà»÷ÅÙ¤ò¿¿ô¤Î°äÅÁ»Ò´Ö¤ÇÌÖÍåŪ¤Ë·×»»¤¹¤ë¡¥


¥»¥Ã¥·¥ç¥ó D2-4 ¥¢¥ë¥´¥ê¥º¥à
Æü»þ: 2007ǯ4·î24Æü(²Ð) 15:15-16:05
ºÂĹ: ÁêÅÄ ¿µ (Ë­¶¶µ»½Ñ²Ê³ØÂç³Ø Ãμ±¾ðÊ󹩳طÏ)

Âê̾ÆÌÊñ¤òÍѤ¤¤¿Àïά·¿2¿Í¥²¡¼¥à¤Î¥Ê¥Ã¥·¥å¶Ñ¹ÕÅÀ¤òµá¤á¤ë¥¢¥ë¥´¥ê¥º¥à
Ãø¼Ô ÀÐ°æ ¹¨¹¬, *»³ÅÄ ÉÒµ¬(ºë¶ÌÂç³Ø Âç³Ø±¡Íý¹©³Ø¸¦µæ²Ê ¿ôÍýÅŻҾðÊóÉôÌç)
Pagepp. 745 - 750
Keyword Àïά·¿2¿ÍÈó¶¨ÎÏ¥²¡¼¥à, ÁйÔÎ󥲡¼¥à, ¥Ê¥Ã¥·¥å¶Ñ¹ÕÅÀ, ÆÌÊñ, ¿¹à¼°»þ´Ö¥¢¥ë¥´¥ê¥º¥à
AbstractÀïά·¿N¿ÍÈó¶¨ÎÏ¥²¡¼¥à¤Î¥Ê¥Ã¥·¥å¶Ñ¹ÕÅÀ¤Ï¾ï¤Ë¸ºß¤¹¤ë¤³¤È¤¬ÃΤé¤ì¤Æ¤¤¤ë¡¥ ¤·¤«¤·¤Ê¤¬¤é¡¤N=2¤Î¤È¤­¤Ç¤µ¤¨¡¤ ¥Ê¥Ã¥·¥å¶Ñ¹ÕÅÀ¤ò¿¹à¼°»þ´Ö¤Çµá¤á¤ë¤³¤È¤Ï̤²ò·è¤Ç¤¢¤ë¡¥ ¾®Ê¸¤Ç¤Ï¡¤¥æ¡¼¥¯¥ê¥Ã¥É¶õ´Ö¤Ë¤ª¤±¤ëÆÌÊñ¤òµá¤á¤ë¥¢¥ë¥´¥ê¥º¥àÍøÍѤ·¤¿ Àïά·¿2¿ÍÈó¶¨ÎÏ¥²¡¼¥à¤Î¥Ê¥Ã¥·¥å¶Ñ¹ÕÅÀ¤òµá¤á¤ë¥¢¥ë¥´¥ê¥º¥à¤òÄ󰯤¹¤ë¡¥ Äó°Æ¥¢¥ë¥´¥ê¥º¥à¤Î»þ´Ö·×»»Î̤ϡ¤ °ìÊý¤Î¥×¥ì¥¤¥ä¡¼¤Î¹Ôư¤Î¼ïÎबÄê¿ô¤Ç¤¢¤ë¤È¤­¤Ë¤Ï¿¹à¼°»þ´Ö¤Ç¤¢¤ë¡¥

Âê̾½Å¤ßÁý²Ã¥Ñ¥¹Ãµº÷²þÎɤˤè¤ë¥°¥é¥ÕºÇÂç½Å¤ß¥Þ¥Ã¥Á¥ó¥°¶á»÷²òË¡¤ÎÀ­Ç½¶¯²½
Ãø¼Ô *À¾²Ï ¶³ÎÑ, ¹âÆ£ Âç²ð, ÅIJ¬ ÃÒ»Ö, ÅÏîµ ÉÒÀµ(¹­ÅçÂç³ØÂç³Ø±¡¹©³Ø¸¦µæ²Ê)
Pagepp. 751 - 756
Keyword ¥°¥é¥ÕºÇÂç½Å¤ß¥Þ¥Ã¥Á¥ó¥°, ¶á»÷²òË¡, ½Å¤ßÁý²Ã¥Ñ¥¹
Abstract¥°¥é¥ÕºÇÂç½Å¤ß¥Þ¥Ã¥Á¥ó¥°ÌäÂê¤È¤Ï¡¤ÊսŤߤò»ý¤Ä¥°¥é¥ÕG=(V,E)¤Ë¤ª¤¤¤Æ½Å¤ßÁíϺÇÂç¤Î¥Þ¥Ã¥Á¥ó¥°¤òµá¤á¤ëÌäÂê¤Ç¤¢¤ë¡¥¥Þ¥Ã¥Á¥ó¥°M¤È¤Ï¡¤¤É¤ÎÊÕ¤â¸ß¤¤¤ËüÅÀ¤ò¶¦Í­¤·¤Ê¤¤ÊÕ½¸¹ç¤Ç¤¢¤ë¡¥ºÇÂç½Å¤ß¥Þ¥Ã¥Á¥ó¥°¤ÎºÇŬ²ò¤òµá¤á¤ë¿¹à¼°»þ´Ö²òË¡¤¬¤¤¤¯¤Ä¤«Ä󰯤µ¤ì¤Æ¤¤¤ë¤¬¡¤¥°¥é¥Õ¥µ¥¤¥º¤¬Â礭¤¯¤Ê¤ë¤ÈºÇŬ²ò¤òÆÀ¤ë¤Ë¤Ï¶Ëü¤Ë¿¤¯¤Î·×»»»þ´Ö¤òɬÍפȤ¹¤ë¡¥ ¤½¤³¤Ç¡¤¼ÂÍÑÀ­¤ò¹Íθ¤·¤Æ¹â®¤Ê¶á»÷²òË¡¤¬¤¤¤¯¤Ä¤«Ä󰯤µ¤ì¤Æ¤¤¤ë¡¥¤½¤ÎÃæ¤Ç¤â½Å¤ßÁý²Ã¥Ñ¥¹¤òÍøÍѤ·¤¿¼êË¡¤Ï¡¤¼Â¸³Åª¤Ë¶á»÷²òË¡¤Ç¤Ï²òÀºÅÙ¤¬¤è¤¤¤È¤¤¤¦·ë²Ì¤¬ÆÀ¤é¤ì¤Æ¤¤¤ë¡¥ ËܹƤǤϡ¤½Å¤ßÁý²Ã¥Ñ¥¹Ãµº÷¤òÍøÍѤ·¤¿¶á»÷²òË¡¤ËÃåÌܤ·¡¤¤½¤ì¤ò²þÎɤ·¤¿¼êË¡¤ò¤¤¤¯¤Ä¤«Ä󰯤·¡¤·×»»µ¡¼Â¸³¤Ë¤è¤ê¤½¤ÎÀ­Ç½¤ò¼¨¤¹¡¥