Simultaneous Power and Routing Cost Minimization in Scan Chain Design
碩士 === 國立交通大學 === 電子工程系所 === 93 === With advanced VLSI manufacturing technology in deep submicron (DSM) environment, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC design, circuit testability becomes one of the most challenging work. Among design for...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/99798713697142029579 |
id |
ndltd-TW-093NCTU5428040 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-093NCTU54280402016-06-06T04:10:40Z http://ndltd.ncl.edu.tw/handle/99798713697142029579 Simultaneous Power and Routing Cost Minimization in Scan Chain Design 低功率循序串列於繞線端最佳化方法研究 Li-Chung Hsu 許力中 碩士 國立交通大學 電子工程系所 93 With advanced VLSI manufacturing technology in deep submicron (DSM) environment, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC design, circuit testability becomes one of the most challenging work. Among design for testability (DFT) techniques, scan-based built-in self-test (BIST) architectures are widely used in industry. However, without careful design in scan cell placement and chain ordering, circuits consume much more power in test mode operation than that in normal functional mode. This elevated testing power may cause problems including overall yield lost and instant circuit damage. In this thesis, we present an effective approach to simultaneously minimizing test power and routing cost in scan chain design after cell placement. The experimental results are encouraging. Compared with a recent result in [6], which uses the approach with clustering overhead, we obtain up to 10% power saving under the same routing cost. Hung-Ming Chen 陳宏明 2005 學位論文 ; thesis 49 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立交通大學 === 電子工程系所 === 93 === With advanced VLSI manufacturing technology in deep submicron (DSM) environment, we can integrate entire electronic systems on a single chip (SoC). Due to the complexity in SoC design, circuit testability becomes one of the most challenging work. Among design for testability (DFT) techniques, scan-based built-in self-test (BIST) architectures are widely used in industry. However, without careful design in scan cell placement and chain ordering, circuits consume much more power in test mode operation than that in normal functional mode. This elevated testing power may cause problems including overall yield lost and instant circuit damage. In this thesis, we present an effective approach to simultaneously minimizing test power and routing cost in scan chain design after cell placement. The experimental results are encouraging. Compared with a recent result in [6], which uses the approach with clustering overhead, we obtain up to 10% power saving under the same routing cost.
|
author2 |
Hung-Ming Chen |
author_facet |
Hung-Ming Chen Li-Chung Hsu 許力中 |
author |
Li-Chung Hsu 許力中 |
spellingShingle |
Li-Chung Hsu 許力中 Simultaneous Power and Routing Cost Minimization in Scan Chain Design |
author_sort |
Li-Chung Hsu |
title |
Simultaneous Power and Routing Cost Minimization in Scan Chain Design |
title_short |
Simultaneous Power and Routing Cost Minimization in Scan Chain Design |
title_full |
Simultaneous Power and Routing Cost Minimization in Scan Chain Design |
title_fullStr |
Simultaneous Power and Routing Cost Minimization in Scan Chain Design |
title_full_unstemmed |
Simultaneous Power and Routing Cost Minimization in Scan Chain Design |
title_sort |
simultaneous power and routing cost minimization in scan chain design |
publishDate |
2005 |
url |
http://ndltd.ncl.edu.tw/handle/99798713697142029579 |
work_keys_str_mv |
AT lichunghsu simultaneouspowerandroutingcostminimizationinscanchaindesign AT xǔlìzhōng simultaneouspowerandroutingcostminimizationinscanchaindesign AT lichunghsu dīgōnglǜxúnxùchuànlièyúràoxiànduānzuìjiāhuàfāngfǎyánjiū AT xǔlìzhōng dīgōnglǜxúnxùchuànlièyúràoxiànduānzuìjiāhuàfāngfǎyánjiū |
_version_ |
1718294469227315200 |