\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Bench Marking Models of Low Power VLSI Testing Strategies: Current State of the Art},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Bench Marking Models of Low Power VLSI Testing Strategies: Current State of the Art}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Y. Sreenivasula  Goud}

             \author[2]{  Dr.B.K.Madhavi}

             \affil[1]{  JNTU, Hyderabad.}

\renewcommand\Authands{ and }

\date{\small \em Received: 7 December 2012 Accepted: 3 January 2013 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Testing time, power dissipation and others are major challenging optimization problems while testing digital circuits and VLSI circuits. Unluckily, most of these problems are frequently solved by heuristic ways which do not assure best solution. The analysis of situation of art models and answers in such optimization problems were carried out in this paper, especially for power optimization in digital VLSI circuit testing.

\end{abstract}


\keywords{very large scale integration (VLSI), inte-grated circuit(ic), low power testing, bist, ate, scan test.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
he method of checking the fabricated IC's for any wrong behavior due to errors like rational error, holdup error, falsehood faults[1],etc is called VLSI testing [1][2][3].Testing is made by creating and putting test vectors which are a set of binary vectors in to the entry of the circuit. Error is found by checking the outcome for the said test vector with kept answers. High fault coverage is the main problem at the early stage of circuit design and testing. Due the latest emerging technology the focus is more towards the new target which has limited test data quantity, condensed test instant and small control testing etc. All possible errors have to be tested in the circuit. To test all the errors in the complete circuit we may require more test vectors. More than one error can be detected by a single test vector and for a single error more than one test vector can be generated. We must create a set of test vectors so that more number of errors can be covered with smallest amount of test vectors. The control dissipated during the normal mode of operation is much lesser when compared the power dissipated during testing of a circuit. The major cause for this difficulty is superior toggling count of the recall component like flip flops. The main aim of checking of chronological circuit is to know such series of test vectors that have more error coverage and also has an optimized toggling calculation. Reordering the test vectors in the examination sequences is the easiest way to improve the power in testing, by checking this the test vectors are not customized, the test reporting is conserved.\par
In this paper during digital VLSI circuit testing we used the modern confirmation of the state of art models to improve the power consumption. The major reason for considering power usage throughout test application is that power and energy of a digital system are much higher in the test mode than in system mode  {\ref [4, 5, and 6]}. The motive is that control reduction system mode only starts a few modules where as the test patterns affect as many nodes swapping as probable at the same time. One more reason is the continuous practical contribution vectors functional to a specified circuit has a significant connection, while the connection between the successive test patterns can be very small \hyperref[b4]{[7]}. 
\section[{II.}]{II.} 
\section[{Taxonomy of Low Power Testing a) Problems of VLSI circuit testing in negligible power}]{Taxonomy of Low Power Testing a) Problems of VLSI circuit testing in negligible power}\par
The latest improvement of complex, high performance, low power devices put into practice in profound submicron technologies generates a new class of many difficult electronic products, like laptop computers, cellular telephones, audio and video based multimedia products, energy efficient desktop computers. Power management becomes a critical factor which cannot be ignored during test development because of this new class of systems. There are three key factors for checking the control properties of a scheme under test [2]:\par
? The Switching action created in the circuit throughout test application is directly corresponded by the consumed energy, and during the remote testing this has an effect on the battery life. ? The ratio between energy and the test time gives average power consumption. This factor is of high importance than the energy because hot spots and reliability problems are caused by high power consumption. ? The maximum switching action created in the circuit in test throughout one clock cycle is corresponded by the highest power consumption. The thermal and electrical limits of the mechanism and the system wrapping necessities [3] are determined by peak power. Academic researchers have been carried out on low power design and separately tests have been conducted, during external testing or BSIT the industrial T practices have needed ad hoc solutions for power consumption \hyperref[b5]{[8]}.The solutions include: ? To bear the high current during testing the power supply, ? Package and cooling is over sized.\par
? Tests are conducted at reduced operational frequency. ? Needs appropriate test planning and partitioning of the system. While working with high density systems like modem ASICs and MCMs, in the design phase we have to assure all the power constraints so that we can conduct a non destructive test. Other than the need for stop the circuit under test (CUT) from destruction we also have to consider other factors for reduced power consumption during test application like price, dependability, presentation confirmation, independence as well as knowledge connected issues. All of these problems are discussed in the sequel.\par
The effect of strong limit on the energy dissipation is due to the constraints of consumer electronic products that need plastic packages. The CUT requires a highly costly package in effect as a lot of switching action during the test leads to an increased high current flow (an increased peak power).Furthermore, it has been found that wearing away of conductors and ensuing stoppage of circuits is caused by electro migration. Electro relocation rate, prominent temperature and existing thickness caused by extreme switching throughout test application are determined by the main parameters like temperature and current density which drastically lowers the dependability of circuits in test. In circuits equipped with BIST this phenomenon is very severe because these circuits are test regularly, for example in online BIST approach. Due to high activity not only the reliability but also autonomy of remote and portable systems motorized by batteries suffer. Remote systems frequently work mainly of their time in standby state with nearly no power consumption, intermittently by regular self tests. Therefore the lifetime of the batteries is increased by saving power during test mode.\par
The below two points emphasizes on importance of power minimization problem. Firstly, to get rid of too much of heat produced during test application the present tendency in circuit design towards circuit miniaturization (for portability for example) avoids the use of special cooling equipment. Next, the rising use of speed testing to find slow chips no more allows compensating the raise of power indulgence in test by reduced frequency of testing. Earlier, test was basically applied at rates much lesser that a circuit's normal clock rate because only the treatment of fixed at faults were considered to be important. Currently the test to recognize slow chips via delay testing is done by aggressive timing. The high order for presentation specialized dies contrived for use in MCMs is seen in this fact.\par
One more factor that demonstrates the criticality of this crisis is that the potential of a circuit in dispersing power is not constantly the same during the test and normal form of function. In practical checking of the die immediately after engraving on the wafer, the exposed die is not yet packed and has very less option for power or warmth indulgence. throughout it normal use, the is die is packed considering the quantity of power that needs to be dissipated and at times has extra options like heat dissipated fins. Therefore, during bare die testing because of the absence of packaging the conventional heat removal techniques cannot be used. The applications based on MCMs technology may have a problem because of this, for example, without the access to the completely tested bare dies we cannot realize the possible advantages in circuit density and performance. The overall yield and increasing production cost is affected if proper care is not taken to lower the power dissipation during bare die, the die in the test may be damaged. There are two other factors encouraging the lessening of power in check is given below. The first one is related to the problems found in testing memories via wafer probes \hyperref[b9]{[12]}.High Switching action during testing causes high power and ground noise which are mainly serious during the wafer probing since the power provide links are pitiable. The logical state of circuit lines are erroneously changes because of the high noise, because of which a few good dies fail the test, causing unavoidable loss of yield.\par
The next reason is concerned with the problems rising during BIST. External testing becomes very tough with modern technologies and Modem design, a promising solution to VLSI testing problems is emerged through BIST. The design used to test methodologies which aim at finding defective mechanism in a arrangement by adding test logic on the chip is called BIST. The Various advantages of BIST are enhanced testability, at regulator speed test of modules, minimum need for automatic test tools and support during system maintenance \hyperref[b9]{[12]} \hyperref[b10]{[13]}.Furthermore, with the upcoming core based "system-on-a-chip" designs, BIST has always been one of the most good testing methods as it helps to maintain the rational property of the design. In BIST, the creation of the patterns are generally got from the Linear Feedback Shift Register (LFSR), the advantage of this is compact size and the ability to work as a Signature analyzer too. Unluckily there in increase in total energy consumption because of the excitation from the LFSR therefore achieving acceptable coverage levels require larger test lengths. The autonomy of portable equipment is reduced with increase in energy consumption, mostly in application where periodical tests are applied. With this when the test vectors are used with supposed process occurrence, the normal power indulgence maximizes when compared to the power indulgence in the ordinary mode. This is because of the fact that when a given circuit in its normal mode of operation is applied with continuous functional input vectors has significant correlation; whereas consecutive vectors of a series created by an LFSR is proven to have less correlation \hyperref[b12]{[15]}. This would compel the use of special packages and cooling systems to maintain the thermal conditions under specifications, therefore the final product cost is increased. It is very significant to lessen the power/energy indulgence in testing in order to assure the cost, performance verification, and autonomy and reliability constraints.\par
Let's look into another point related to scan supported BIST. Scan supported self test architectures are extremely famous because of it less impact on performance and area \hyperref[b11]{[14]}.Considering small power, scan supported architectures are incredibly costly because of every test outline is escorted with a alter operation with elevated power utilization to supply test model and check the test reply. This is popular in industrial surroundings. To limit the energy indulgence when scan shifting it had to convene the specific power restrictions throughout test mode and shun system destruction. 
\section[{b) Low Power Testing Strategies}]{b) Low Power Testing Strategies}\par
The power degenerates in a CMOS circuit come because of indict and release of capacitances in switching. To clarify this power indulgence through test, let us believe a circuit made up of N nodes, and a test succession of length L used to the circuit inputs. The regular power used at nodule i per switching is ½. i C .\par
2 dd V Here i C is the equal productivity capacitance at nodule i and 2 dd V the energy supply voltage. A highquality estimate of the energy used at nodule in a time interval t is ½. i S . 2 dd V , here i S is the regular number of changes during this period (also known as the switching movement factor at nodule i). Moreover, nodules linked to additional one logic gate in the circuit are nodules having a elevated productivity capacitance. Depending on this reality, and in a primary estimate, it can be said that productivity capacitance i C is relative to the fan out at node i , named as i F [Wang 1995]. Thus, an estimation of the energy i E used at node i throughout the instance interval t is given by:2 0 1 . . . . 2 i i i dd E S F C V = 0\par
C is the least productivity capacitance of the circuit. As to the appearance, energy utilization at the logic stage is a task of the fan out i F and the swapping task factor i S . The fan out is shown by circuit topology, and the action feature i S can be checked by a judgment simulator. The product . i i S F is called weighted switching action (WSA) at node i and shows the only changeable part in the power used at nodule i in test application.\par
Based on the formulation above, the energy used in the circuit following function of a pair of succeeding input vectors 1 ( , )k k V V\par
? can be articulated by:( ) i 2 Vk 0 dd i i 1 E = .C .V . S k .F 2 
\section[{?}]{?}\par
Here i ranges from corner to corner all the nodules of the circuit and ( ) i s k is the quantity of changeover initiated by k V at node i . Currently, let us think the full test sequence of length L needed to reach the plan fault action. The whole power used in the circuit after the function of the whole test series is shown below; here k ranges from corner to corner all the vectors of the test series.( ) i 2 total 0 dd i i 1 E = .C .V . S k .F 2 ?\par
By clarity, energy is specified by the ratio linking power and occasion. The immediate power is usually estimated as the quantity of energy needed through a tiny instant of time t small such as the piece of a clock cycle instantly subsequent the system clock increasing or declining edge. Therefore, the immediate energy degenerate in the circuit after the submission of a test vector is shown by: ( )P V =E /t k Vk small inst\par
The peak power communicates to the greatest value of immediate energy checked during test. Consequently, this is shown in terms of the maximum energy used in a low moment of time in the test session:( ) P ( / ) peak k inst k k Vk small Ma P V Ma E t = × = ×\par
At the end, the average power used in the test session could be checked from the whole power and the analysis time. Taking into account that the analysis time is said by the product L.T, where T matches to the supposed clock period of the circuit, the regular energy can be shown as follows: P / ( . )\par
average total 
\section[{E L T =}]{E L T =}\par
Though the expression on power and energy stated above is based on a simplified model, it is precise enough for the planned use of power analysis during test. Based on the above expression and considering that a given CMOS technology and a provided voltage for the circuit, it seems that the switching action factor is the only factor that has force on the power, peak power and average power. This tells us that most of the methods suggested till now for decreasing the power and energy during the test are based on the lowering of the swapping action aspect. c) Low power external testing usimg Automatic Test Equipment Figure  {\ref 1} : Basic principle of external testing using ATE Since the Design complexity of state of art VLSI circuits, automation is majorly considered for creating test process. The fundamental code of exterior testing using automatic test apparatus with the three basic components is shown in Figure  {\ref 2}: manufacturing defects, for integrated circuit parts are tested under this circuit; automatic test equipment (ATE) including control processor, timing module, energy module, and format module; ATE memory that gives analysis model and checks test responses. The summary of the previously outlined components are presented below \hyperref[b13]{[16]}.\par
The tests are applied to the circuit under test (CUT) which is piece of silicon wafer or packaged apparatus to detect manufacturing defects. Since checking will join and separate millions of pieces to ATE to independently test every part so the links of the CUT pins and bond pads to ATE has to be robust and easily changeable.\par
Control processor, timing module, power module and format module are there in the ATE. Control processor is a swarm computer which manages the flow of the test procedures and corresponds to the other ATE modules even if CUT is non faulty or faulty. The clock edges required for every pin in the CUT is defined by the timing module. The signal to the pin will go high or low based on the test model information with timing and format in sequence that is extended by the format module, the power supply to CUT is given by power module and it is accountable for exactly calculate power and voltages.\par
The ATE memory has test patterns given to the CUT and the anticipated non faulty responses are evaluated with the definite answer when testing happens. Voltage reply with mille volt correctness at a timing precision of hundreds of picoseconds is measured by State of art ATE \hyperref[b13]{[16]}. Automatic test pattern generation (ATPG) algorithms are used to get test patterns or test vectors kept in ATE memory \hyperref[b14]{[17]}. All through this paper from now on the test model and test vectors are made use of randomly. Random and deterministic algorithms are the classifications of ATPG algorithm. Random ATPG algorithms involve creations of random vectors and the test efficiency is got by error reproduction \hyperref[b21]{[24]}. ATPG algorithms create tests by doing a structural net list at the logical level of concepts using a particular error list from a error world. Deterministic ATPG algorithms generate smaller and superior value tests in stipulations of test effectiveness when compared to Random ATPG algorithms, at the cost of extended computational time. Low controllability and capacity to scrutinize the inner nodules of the circuit are caused by the increased computational time related with deterministic ATPG algorithms. For sequential circuits this problem is extra severe in spite of the latest advancements in ATPG \hyperref[b15]{[18]} computational time is huge, and test efficiency is not adequate. Additionally, the problem of getting increased test efficiency is very difficult and time consuming because of the increasing difference among the quantity of transistors on a chip and the inadequate input/output pins.\par
The technique that improves the testability, in conditions of controllability and capacity to observe, by including the test hardware and introducing particular test leaning decisions in the VLSI design flow is called Design for testability (DFT) as seen in Figure  {\ref 1}. This frequently results in smaller test application time, increased fault coverage and hence tests efficiency and easier ATPG. Scan based DFT is the most general DFT methodology wherever chronological basics are adapted to scan cells and initiated into a linear shift register. This made by keeping a scan mode for every scan cell where the information is not put in equivalent from the combinational part of the circuit, because it is shifted in order from the earlier scrutiny cell in the change register. Scan depending on DFT is additionally separated into entire scan and partial scan. The major benefit of full scan is that by changing all the chronological elements to scan cell that lessens the ATPG difficulty for chronological circuits to the additional computationally tractable ATPG for combinational circuits. In contrast, partial scan changes the subset of sequential elements going to lower test area slide at the expenditure of many complexes ATPG. How the test patterns are applied to CUT is described by the introduction of scan based DFT which leads to the change of the test application strategy. A test pattern is applied to each clock cycle in the case of amalgamation circuits or non scan series circuits, Every test model is used in a scan cycle when scan based DFT is used. 
\section[{d) Low-Power Scan Testing}]{d) Low-Power Scan Testing}\par
The problem of too much power during that test that is in the context of scan testing is much harsh than in practical mode. This is mainly due to the fact that application of every test model in a scan plan needs a quantity of shift clock cycles that add to an needless raise of switching activity \hyperref[b16]{[19]} \hyperref[b17]{[20]}. A study reported in \hyperref[b18]{[21]} expresses that when 10\% 20\% of the memory fundamentals (D flip flops and D latches) in a digital circuit modify state in one clock cycle in functional mode, 35\% 40\% of such memory elements while reconfigured as scan cells can swap state in scan testing. All scan cells can change state. One more report \hyperref[b19]{[22]} further indicates that the power used during the functional operation is 3 times lesser than the power used in scan testing, in normal functional operation the power is 30 times lesser when compared to the peak power.\par
Scan design needs reconfiguration of memory elements (regularly D flip flops) in scan cells and next joining them jointly to create scan chains \hyperref[b16]{[19]} [23] \hyperref[b17]{[20]}. Every scan test pattern has to be first moved into the scan chains during slow speed testing. To do this we need to set the scan cells to shift mode and putting a quantity of load/unload (shift) clock cycles. In order to avoid high power dissipation scan shifting is usually done at low speed. To incarcerate the test reply of the plan into scan cells capture clock cycle is used. To do this we need to set the scan cells to normal/capture mode. For this setting generally a scan enable signal (SE) is used. The scan design is in shift mode when SE is set to 1 and when it is set to 0, the circuit is moved to normal/capture mode.\par
From the early 1990s, in the industry to check stuck at faults and bridging faults this slow speed scan test method has been extensively used. The Figure  {\ref 7}.2 shows the shift and capture operations for the classic scan design with the connected current waveform for every clock cycle. This current waveform changes from cycle to cycle since current is relative to the number of 0-to -1 and 1-to-0 changeover on the scan cells which in turn makes swapping in the circuit under test (CUT).\par
The excessive power during (slow-speed) scan testing can be divided into two sub problems: extreme power in the shift procedure (known as extreme shift power) and extreme energy in the capture procedure (known as extreme capture power)  {\ref [Girard 20021}]. When a lot of flip-flops change their output values at the same time after capture operation the latter is proposed to deal the issues that raises during the clock skew. Many methods have been intended to decrease shift power, capture power or both simultaneously during slow speed scan testing since the last ten years. 
\section[{e) Low power testing in BIST}]{e) Low power testing in BIST}\par
Lately new methods have come to handle with the energy and power issues in BIST. To shorten the BIST implementation of tough IC's, particularly during higher levels of test activity Zorian \hyperref[b22]{[25]} offered a distributed BIST control scheme. When the average power is decreased as a result the temperature associated issues are avoided by the amplifying the check time limit. On the flip side the self-sufficiency of the system is not increased and the total energy remains the same.\par
Cheung et al. in \hyperref[b23]{[26]} suggested a technique for the low power test of RAMs. It reduces the energy usage which conserves the test time; the average power is also reduced.\par
Based on the two different speed LFSRs [27] Wang et al. suggested a BIST strategy called Dual Speed LFSR. They attain a reduction in the regular energy and power usage between 13\% and 70 \% with no error of mistake treatment.\par
Lately, Hertwig et al \hyperref[b25]{[28]} suggested a reduced power strategy for scan based BIST. Energy saving ranged from 70\% to 90\% evaluated to standard scan based BIST architecture is got from this original design of scan path elements. Zhang et al. in \hyperref[b26]{[29]} suggested another low power method for scan -based BIST.\par
The issue of power limitation in test application for BIST circuit is also seen in \hyperref[b27]{[30]}. The major restriction is to decrease the energy consumption with changing the stuck at fault coverage. It is seen that energy consumption is not influenced by polynomial selection, regarding energy consumption seed of the LFSR is the major important factor. Thus, a technique based on simulated annealing algorithm is suggested to choose the seed of a known LFSR that gives the least power usage. The untried results collected on the ISCAS benchmarks display difference if the weighted swapping action starting from 147\% to 889\% based on the selected LFSR seed.\par
A test vector inhibiting method to sort the nondetecting sub sequences of a pseudo random test order created by a LFSR is shown by Girard et al. in \hyperref[b28]{[31]}. To accumulate the initial and final vectors of the non detecting sub sequences to b filtered is done by using the decoding logic To carry out a discerning filtering action a D type flip flop functioning in the snap style is made use of to change the enable/disable mode of LFSR. Decrease in the energy consumption is in the choice from 18\% to 78\% with a small cost in conditions of region slide of the BIST structure (below than 3\% of the circuit area). Manich et al. in \hyperref[b29]{[32]}, suggested a enhancement method where the filtering action is complete to all the non-detecting subseries. The main thought is based on the amalgamation of all the deciphered logic modules. For some of the experimented benchmark circuits Energy and average power usage savings can reach a level of 90\%.\par
In \hyperref[b30]{[33]}, a original low power/energy BIST approach based on circuit partitioning is suggested. The aim of this approach is to reduce the average power and energy usage during pseudo-random testing and to decrease the peak power usage without changing the fault coverage. The main idea is to divide the actual circuit into two structural sub circuits so that every sub circuit can be sequentially tested through two various BIST sessions. The average power of the swapping action in a instance time (i.e. the average power) as well as the peak energy usage is reduced when dividing and planning the test session. Furthermore, the total energy usage during BIST is also decreased because the test length needed to check the two sub circuits is not so far from the experiment length for the actual circuit. By slightly modifying conventional TPG structures the suggested approach can be put to whichever test-perscan or test-per-clock BIST schemes. Results on ISCAS circuits presents that regular energy lessening of up to 62\%, high power decrease of up to 57\%, and power decrease of up to 82\% can be got at very less price in conditions of vicinity slide and with approximately no fine on the circuit with regards to timing. 
\section[{III.}]{III.} 
\section[{Current State of the Art}]{Current State of the Art}\par
The key idea for taking into account power usage in test application is that energy and power of a digital scheme are generally supreme in test mode than in system mode \hyperref[b31]{[34]} [35] and \hyperref[b33]{[36]}. The motive is that test models result as much nodes switching as possible but a energy saving system mode only triggers some modules at the identical time. One more motive is that succeeding practical input vectors put to a said circuit during system mode has a important connection, but the connection among successive test models can be very less \hyperref[b34]{[37]}.\par
In the last decade  {\ref [-94, 116]} there was extensive research done on less power model and testability of VLSI circuits. With the introduction of profound sub-micron technology and tense acquiesce and consistency restraint in order to execute a nondestructive test for supreme show VLSI circuits energy indulgence in test application should not to surpass the energy restraint set by the energy degenerate when the practical process of the circuit \hyperref[b49]{[52]}, \hyperref[b57]{[60]}, \hyperref[b66]{[69]}, \hyperref[b99]{[103]}, \hyperref[b107]{[111]}, \hyperref[b121]{[125]}. This is because unnecessary energy indulgence in the test application that happens by elevated swapping action may cause the next two problems \hyperref[b66]{[69]}, \hyperref[b114]{[118]}  \hyperref[b114]{[118]}. Also electro migration rate goes high with heat and present compactness that is not estimated by state of the art approaches \hyperref[b79]{[82]}, \hyperref[b113]{[117]}  a) The algorithms \hyperref[b39]{[42]}, \hyperref[b45]{[48]}, \hyperref[b78]{[81]}, \hyperref[b82]{[85]}, \hyperref[b104]{[108]}, \hyperref[b109]{[113]}, \hyperref[b111]{[115]}, \hyperref[b118]{[122]} synthesizes the low power combinational circuits that look to optimize the signal or change probabilities of circuit nodes making use of the spatial addiction in the circuit (spatial connection), and presumptuous the change probabilities of first inputs to be known (temporal connection) \hyperref[b95]{[99]}. The utilization of spatial and temporary associations in the practical process for less energy mixture of combinational circuits causes elevated swapping action through test application as connection between consecutive test patterns created by repeated test model creation (ATPG) algorithms is very less \hyperref[b105]{[109]}. This is since a test pattern is created for a said goal error devoid of any thought of the earlier test model in the test series. As a result, increased switching activity is caused by lower connection between successive test patterns during test application and therefore energy indulgence when evaluated to practical process \hyperref[b122]{[126]}. b) State job algorithms that use state change probabilities \hyperref[b43]{[46]}, \hyperref[b44]{[47]}, \hyperref[b46]{[49]}, \hyperref[b52]{[55]}, \hyperref[b94]{[98]}, \hyperref[b104]{[108]}, \hyperref[b112]{[116]} synthesize the low power sequential circuits. The state changeover likelihood are calculated considering the key in likelihood allocation and the state changeover graph that are suitable in functional operation. When scan DFT technique is used these two hypotheses are not suitable in the test mode of operation. Whilst changing the test results, the scan cells are linked to uncorrelated values that destroy the connection between successive functional states. Moreover, in the case of data lane circuits with huge amount of states that are created for less energy making use of the relationships among information transfers \hyperref[b50]{[53]}, \hyperref[b81]{[84]},\par
[86], \hyperref[b83]{[87]}, \hyperref[b84]{[88]}, \hyperref[b85]{[89]}, \hyperref[b86]{[90]}, in the test manner scrutinize registers are linked uncorrelated values that are not at all get to useful process that may cause supreme energy indulgence in the efficient operation.\par
Design methods at the register-transfer stage of concept causes elevated energy indulgence in test application due to the following. Power aware architectural choice such as power managing where blocks are not concurrently activated during functional operation \hyperref[b42]{[45]}, \hyperref[b86]{[90]} uses systems which include a elevated quantity of memory fundamentals and multifunctional implementation units. Therefore, motionless blocks do not add to extravagance in the realistic procedure. The innovative standard for energy association is the systems and their work understanding varied workload in the practical process \hyperref[b41]{[44]}. Nevertheless, such an supposition is not suitable in test application. To decrease test application time when the system is in the test mode, simultaneous implementation of tests is needed. Thus, by concomitantly implementing tests a lot of blocks will be energetic at the identical time heading to a difference with the energy management strategy. This will cause elevated power indulgence in test application in contrast to practical process.\par
To overcome the low connection between repetitive test vectors in test application in combinational circuits a new ATPG tool \hyperref[b122]{[126]} was suggested. In spite of having, the objectives of protected and low-cost testing of low power circuits the method in \hyperref[b122]{[126]} maximized the test application time. A special method for decreasing energy indulgence in test submission in combinational circuits is based on test vector order \hyperref[b58]{[61]}, \hyperref[b60]{[63]}, \hyperref[b69]{[72]}, \hyperref[b71]{[74]}, and \hyperref[b72]{[75]}. The fundamental thought ahead of test vector order is to get a new array of the set such that connection between consecutive test patterns is maximized.\par
The severity of the test vector-ordering problem that is minimized to get a minimal cost Hamiltonian path in a full, undirected, and weighted graph due to the working time in \hyperref[b58]{[61]} is very high. The elevated calculating time is triumphed over by the methods suggested in \hyperref[b60]{[63]}, \hyperref[b69]{[72]}, \hyperref[b71]{[74]} where test vector order assumes a high relation among swapping action in the circuit under test and the hamming space \hyperref[b60]{[63]}, \hyperref[b71]{[74]} or changeover density \hyperref[b69]{[72]} at circuit primary inputs. For joined circuits employing BIST many methods for reducing power dissipation were planned newly \hyperref[b47]{[50]}, \hyperref[b54]{[57]}, \hyperref[b55]{[58]}, \hyperref[b68]{[71]}, \hyperref[b70]{[73]}, \hyperref[b91]{[95]}, \hyperref[b92]{[96]}, \hyperref[b93]{[97]}, \hyperref[b116]{[120]}, \hyperref[b119]{[123]}, \hyperref[b120]{[124]}. In \hyperref[b116]{[120]} the usage of two speed linear response shift register (DS-LFSR) lessens the changeover compactness at the circuit inputs causing reduced power indulgence. The DS-LFSR function with a unhurried and a standard speed LFSR, in order to amplify the association among successive patterns. It has to be known that the slow LFSR has both a unhurried clock and a standard clock as inputs; it also has a control signal that chooses the suitable clock based on the process. It was shown in \hyperref[b116]{[120]} that test competence of the DS-LFSR is elevated than in the case of the LFSR based on a primal polynomial with a fall in energy indulgence at the cost of much complex control and clocking. Best influence sets for entry signal allocation are dogged in order to reduce average power \hyperref[b120]{[124]}, the best early circumstances in the cellular automata (CA) cells used for model creation \hyperref[b119]{[123]} found when the peak power is reduced. It was confirmed in \hyperref[b47]{[50]} that all the ancient polynomial LFSR of the identical size, generate the similar energy indulgence in the circuit under test, therefore recommending the use of varied answer based on reseeding LFSRs and test vector restrained to filter a couple of non-detecting subsequences of a pseudorandom test series was planned in  {\ref [-68, 70]}. A sub-sequence is non-detecting if all the faults originate by it are also seen by additional notice sub sequences from the pseudorandom test series. An improvement of the test vector restraining methods was shown in \hyperref[b70]{[73]}, \hyperref[b91]{[95]}, \hyperref[b92]{[96]}, \hyperref[b93]{[97]} where all the non-detecting sub-sequences are removed. The fundamental standard of filtering nondetecting series is to used for decoding judgment to find the primary and the final vectors of every nondetecting series. Later finding the initial vector of a nondetecting series, the restrained structure making use of a broadcast gates network facilitating signal spread \hyperref[b100]{[104]}, stops the submission of test vectors to the CUT. The seed memory is made of two parts which is the exact feature of the proposed BIST structure: the first part has seeds for arbitrary prototype challenging errors and the second part has seeds to inhibit the nondetecting series \hyperref[b68]{[71]}. The seed memory joined with the interpreted logic is enhanced than only decoding logic in terms of less energy indulgence and elevated error treatment, at the cost of higher BIST area overhead.\par
For filtering non-detecting vectors motivated by the pre-computation structural design \hyperref[b36]{[39]} is shown in \hyperref[b55]{[58]} in different approaches. The MASK block is a circuit with a latch-based architecture or AND-based architecture which also removes or keeps unchanged the vectors made by the LFSR. The facilitate logic trappings a partly specific Boolean function whose onset \hyperref[b59]{[62]} is the set of the unchanged vectors and whose off-set is the set of the removed (non-detecting) vectors \hyperref[b55]{[58]}. A progress in area overhead linked with filtering non-detecting vectors without fine in error coverage or test submission time was got making use of non-linear hybrid cellular automata \hyperref[b54]{[57]}. The hybrid cellular automata creates test models for the CUT making use of cell configurations optimized for less energy indulgence under set error treatment and test application time constraints. The promptness of multiplier units and linear sized test set needs reaching elevated mistake treatment guide to competent low power.\par
BIST implementations for information trail \hyperref[b40]{[43]}, \hyperref[b73]{[76]}, \hyperref[b74]{[77]}, \hyperref[b75]{[78]}, \hyperref[b77]{[80]}: In spite of the accomplishment kind of the test pattern producer, in terms of power dissipation \hyperref[b102]{[106]} BIST architectures extensively differ one from another. The three diverse architectures were checked for energy indulgence, BIST area transparency and test application time. It was seen \hyperref[b102]{[106]} that the architecture having an LFSR and a transfer register SR creates lower energy indulgence, BIST area transparency and test relevance time when evaluated to a single LFSR and two LFSRs with mutual feature polynomials. Though, this is achieved at the cost of subordinate error treatment and therefore decreased test competence owing to the customized series of model practical to the CUT that does not find all the accidental model unwilling faults.\par
The power dissipation as described in \hyperref[b67]{[70]} is influence by circuit division into sub-circuits and cognized sub-circuit. Test development have the major reason for circuit partition is to get two diverse structural circuits of roughly the same size, so that every circuit can be sequentially experienced in two diverse sittings. To reduce the BIST area transparency of the ensuing BIST scheme, the quantity of associations among the two sub-circuits has to be as less as possible. It was revealed in \hyperref[b67]{[70]} that by dividing a single circuit unit into two sub-circuits and implement two succeeding tests, reserves in energy indulgence can be got with approximately the similar test application time as in the case of a single circuit unit.\par
Even though the methods planned for reducing energy indulgence in test application in combinational circuits at the judgment stage of concept gives good results, they can additionally be joined with the methods proposed at register-transfer level.\par
A test pattern creation method for less energy indulgence was projected in \hyperref[b53]{[56]} to reduce energy indulgence in non-scan chronological circuits in test application. The technique is developed on three self-regulating steps including unnecessary test model creation, power indulgence size and optimum test series assortment. The explanation suggested in \hyperref[b53]{[56]} that is based on genetic algorithms gets significant savings in energy indulgence, that cannot be realistic to scan sequential circuits anywhere variable energy extravagance is the major contributor to the whole energy indulgence.\par
To reduce shifting energy indulgence in scan in order circuits, test vector inhibiting methods suggested for combinational circuits are comprehensive to scan in order circuits \hyperref[b56]{[59]}. Whether the examination example to be shifted fit in to the subset of notice sequences is detected based on the substance of the LFSR the decoding logic. If the model is non-detecting the dissemination throughout the SR and scan chain is blocked. In \hyperref[b65]{[68]} the test vector restrained method is complete where the modules and modes with the maximum power indulgence are recognized, and gating logic is initiated to lower power dissipation. In spite of considerable savings in energy indulgence vector recognition and gating logic begin not only important area overhead but also significant presentation degradation for changed scan cell design. In \hyperref[b110]{[114]} a fresh scan BIST arrangement was suggested that A very elevated fault coverage can be got by a small number of clusters of test vectors based on the experimental observation in \hyperref[b110]{[114]} a new scan BIST structure. Even though not targeted particularly for small energy pattern that can also cause less energy indulgence. A same method is in use in the little changeover random test model creator (LT-RTPG) projected in \hyperref[b117]{[121]}, where adjacent bits of the test vectors are allocated the same values in most test vectors. A straightforward and quick way to compact scan vectors with achievable devoid of more than energy indulgence was projected in \hyperref[b106]{[110]}. All the preceding scan-based BIST techniques \hyperref[b56]{[59]} [68]  {\ref [110] [114]} [121] initiate test area overhead and/or additional show degradation when compared to scan DFT techniques.\par
A diverse method \hyperref[b58]{[61]} based on test vector and scan cell order reduces energy indulgence in full scan chronological circuits devoid of any overhead in test area or show deprivation. The input series at the main and pseudo inputs of the CUT, though uneven out test reply in the case of regular scan design is considerably customized when reorder scan cells and test vectors. The new series got after reorder will direct to lower switch action and therefore lessen energy indulgence due to superior connection between successive pattern at the main and pretend inputs of the CUT. Additional benefit of the post-ATPG method projected in \hyperref[b58]{[61]} is that lessening of energy indulgence in test application got devoid of any cut in error treatment and/or augment in test application time. The method is test set dependent, which means that energy limit depends on the size and the worth of the test vectors in the test set. Due to its test set belief, the method planned in \hyperref[b58]{[61]} is computationally not feasible because of big computational time needed to discover the huge design space.\par
A diverse method to get energy reserves is the use of extra key input vectors, leads to additional volume of test data  {\ref [-88, 189}]. The method planned in \hyperref[b115]{[119]} exploits the unneeded in sequence that comes during scan shifting to reduce switch action in the CUT. Though shifting out the pseudo output part of the test reply in the clock cycles, the price of the main inputs is superfluous. Thus this superfluous data can be broken by compute an additional main input vector for every clock cycle of the scan cycle of each test pattern. On the other hand, in spite of getting considerable power savings the methods needed huge test request time, which is linked to a extensive computational time, and a big quantity of test data. The volume of test data is reduced in \hyperref[b76]{[79]} where a D-algorithm like ATPG \hyperref[b35]{[38]} is created to create an only control vector to mask the circuit action while variable out the test responses. Nothing like the method planned in \hyperref[b115]{[119]} based on a huge number of additional main input vectors, the explanation presented in \hyperref[b76]{[79]} employ a single extra chief input vector for all the clock cycles of the inspect cycle of each test pattern.\par
The input control method projected in \hyperref[b76]{[79]} can additional be mutual with earlier projected scan cell and test vector order \hyperref[b58]{[61]} to realize, though, modest savings in power dissipation in spite of a considerable decrease in volume of test data when compare to \hyperref[b115]{[119]}. On the other hand, both methods based on extra main input vectors [-88, 189] needs elevated computational time and therefore are infeasible for great chronological circuits. In spite of their effectiveness for reducing energy indulgence in scan chronological circuits, the previous methods trade off one test parameter at the advantage of an additional test parameter of the scan based DFT technique. Thus new methods are needed for small to average sized and big scan serial circuits.\par
To defeat the difficulty of high power indulgence in test application at RTL, frequent power-constrained test preparation algorithms were projected under a BIST environment \hyperref[b48]{[51]}, \hyperref[b51]{[54]}, \hyperref[b87]{[91]}, \hyperref[b88]{[92]}, \hyperref[b89]{[93]}, \hyperref[b96]{[100]}, \hyperref[b97]{[101]}, \hyperref[b98]{[102]}, \hyperref[b101]{[105]}, \hyperref[b103]{[107]}, \hyperref[b121]{[125]}. The method in \hyperref[b121]{[125]} schedules the tests under power constraint by assemblage and order based on floor plan in sequence. An additional investigation in the explanation space of the development difficulty is provide in \hyperref[b51]{[54]} where a provide distribution graph formulation for the test expansion complexity is given and tests are scheduled concomitantly devoid of more than their power restraint during test application. To shorten the preparation difficulty the bad case power indulgence (maximum immediate power indulgence) is used to distinguish the energy limitation of every test. The test compatibility graph is annotated with energy and test application time information.\par
The power rating characterized by high power dissipation and test application time are used for scheduling unequal length tests under a power constraint. To conquer the recognition of all the cliques in a graph and the covering table minimization trouble applied in \hyperref[b51]{[54]}, which are well known NP-hard troubles, the solutions planned in \hyperref[b96]{[100]}, \hyperref[b97]{[101]}, \hyperref[b98]{[102]} use list scheduling, left edge algorithm and a hierarchy growing method as an heuristic for the block test preparation difficulty. Power forced test preparation is comprehensive to system on a chip in \hyperref[b48]{[51]}, \hyperref[b101]{[105]}, \hyperref[b103]{[107]}. Test communications and power unnatural test preparation algorithms for a scan-based architecture are accessible in \hyperref[b87]{[91]}, \hyperref[b88]{[92]}, \hyperref[b89]{[93]}.\par
All the earlier methods for power controlled test preparation have unspecified a fixed amount of energy indulgence associated with each test. This is an positive supposition that is not applicable when employ BIST for RTL data paths calculated for less energy due to ineffective energy indulgence.\par
Observation: The majority of the previous study in less energy testing is alert on scan-based circuits as whole-scan is the extensively adopt test approach in the industry. In a full-scan circuit, all the internal flip-flops (FFs) are replacing by scan-FFs and work in two modes competent to control/observe all the inside memory elements. In capture mode, scan-FFs work as functional FFs such that the test stimuli are applied to the combinational section of the circuit and the test response are stored into these FFs themselves in the next clock cycle. It is probable that the test power usage exceeds the circuit's energy ranking in both shift mode and confine mode. Methods based on scan chain management (e.g,  {\ref [127][128]}[134] \hyperref[b136]{[139]}) are very efficient in dropping scan shift power, but does not help in lessening scan capture power. There are also some other methods that decreases the switch actions of the CUT by captivating benefit of the 'don't-care' bits in test cubes, e.g., the low-power routine test pattern creation (ATPG) methods in \hyperref[b125]{[129]}[137] and the test vector treatment techniques in \hyperref[b126]{[130]} \hyperref[b129]{[133]} [135] \hyperref[b135]{[138]}. A few of them are able to decrease scan shift power whilst the others are supportive in decreasing scan capture power. Yet after apply the above methods, it is potential that there remain some patterns that exceed the circuit's power rating if the CUT is large. One answer in this case is to replay low power ATPG for the faults that were found by those problematic patterns \hyperref[b133]{[136]}. On the other hand, even if such ATPG tools are available, they usually result in bigger test data volume and are computationally very costly. Another solution is to partition the original circuit into multiple sub-circuits and test them separately through clock gating \hyperref[b127]{[131]}. This not only significantly reduces the power used in the logic part, but also decreases the power used in clock tree, which is a major contributor to test power consumption. Partitioning the circuit for test, nevertheless, frequently involve rerunning the lengthy ATPG procedure for the partition sub-circuits and solve the difficulty of how to get satisfactory responsibility coverage for the glue logic between sub-circuits. An motivating question is whether partition for test can be done with no mention the said limitations?\par
Regular power usage during scan testing can be managed by minimizing the scan clock occurrence, a well known explanation used in industry. In difference, peak power usage during scan testing is selfdetermining of the clock occurrence and therefore is greatly tougher to control. Among the power-aware scan testing methods shown, some of them relate openly to peak energy. As said in new industrial experiences \hyperref[b137]{[140]}, scan pattern in various designs may use greatly more peak power over the regular mode and can answer in failures in manufacturing test. For example, if the immediate energy is high, the temperature in some part of the die can go beyond the boundary of thermal ability and then reason immediate injure to the chip. In practice, demolition really happens when the immediate power exceeds the high power grant during many succeeding clock cycles and not just during in one single clock cycle \hyperref[b137]{[140]}. Thus, such temperature-related or heat indulgence issue speak about more to important regular power than peak power. The main issue with extreme peak power concerns yield decrease and is made clear in the follow-up.\par
With elevated speed, too much peak power in test reason high rates of current (di/dt) in the energy and ground rails and therefore leads to high energy and ground noise (VDD or Ground bounce). This may incorrectly modify the logic state of some circuit nodes and reason some superior dies to fail the test, therefore leading to needless loss of yield. Likewise, IRdrop and crosstalk things are occurrence that may explain up an error in test mode but not in efficient mode.\par
IR-drop refers to the quantity of reduction (increase) in the power (ground) rail voltage due to the confrontation of the devices among the rail and a node of attention in the CUT. Crosstalk relates to capacitive coupling between neighboring nets within an IC. With high peak power demands during test, the voltages at some gates in the circuit are minimized. This causes these gates to display superior delays, probably foremost to test fails and yield loss \hyperref[b7]{[10]}. This experience is reported in many reports from a mixture of companies, in particular when at-speed changeover delay testing is done \hyperref[b137]{[140]}. Typical example of voltage drop and ground rebound responsive applications is Gigabit switches contain millions of logic gates.\par
Methods based on scan chain handling \hyperref[b138]{[141]} are very efficient in minimizing shift power, but generally do not help in falling detain power. In particular, the scan chain segmentation method is extensively utilized in the industry due to the fact that it is easy to execute and highly effectual in reducing shift power.\par
Several research groups have also proposed minimizing test power by modifying the circuit under test. This includes clock gating \hyperref[b139]{[142]}, insert circuitry among the scan chains and the combinational portion of the CUT to block changeover  {\ref [143][144]}[145], scan enable disable \hyperref[b143]{[146]} and circuit virtual partitioning \hyperref[b144]{[147]}. Circuit alteration methods are able to minimize both shift power and capture power, though, frequently at a higher design-for-testability (DFT) cost.\par
When compared to the above DFT-based methods, minimizing test power during successful test scheduling and/or test cube treatment methods does not incur any DFT overhead.\par
Power-constrained test scheduling is frequently conducted in core-based testing, in which we cautiously select surrounded cores that are tested concurrently according to a agreed energy resources  {\ref [148]}. Often times only a little bits in a test model are necessary to notice all the fault enclosed by it; while the lingering bits are "don't-care bits" (also known as X-bits). here are also many methods that minimizes the switch behavior XIII Issue VII Version I 2 ( ) Year of the CUT by captivating improvement of this property, e.g., the low-power routine test model creation (ATPG) methods in \hyperref[b145]{[149]}[150] \hyperref[b147]{[151]}, test compression approach in \hyperref[b148]{[152]}, and the assorted X-filling methods projected freshly in \hyperref[b149]{[153]} \hyperref[b150]{[154]}[155] \hyperref[b152]{[156]}. The test cubes may have as much as 95\%\textasciitilde 98\% X-bits \hyperref[b153]{[157]}. They can be generously filled with moreover logic '0' or logic '1' devoid of affecting the CUT's fault reporting. Low power X-filling methods use this quality to accomplish shift power and/or capture power decrease. As a absolutely software-based solution, these X-filling method do not initiate any DFT overhead and therefore are simply integrated into any test flow. It must also be noted that, even if the known test cube is fully particular, the don'tcare bits can motionless be known with method such as the one projected in \hyperref[b154]{[158]}. Filling X-bits to minimize scan shift power is to create less difference among adjacent scan cells.\par
Observation : It is shown in \hyperref[b149]{[153]} that logic value difference occur in diverse position have diverse impact on the shift power indulgence. Filling X-bits to minimize capture energy is very diverse from the above. The aim is to minimize the hamming distance flanked by the input and output of each scan-FF in capture mode (denoted as the scan capture transition count), which is revealed to be closely connected with the circuit's switching activity. In \hyperref[b150]{[154]}, Wen et al. first existing low-capture power X-filling techniques (denoted as LCP-filling) in the literature. Their method tries to minimize the scan capture transition count as much as possible by filling X-bits one by one through implication and line justification ATPG procedures. The filling order of the X-bits extensively affects the results of their method and one of the main boundaries of their technique is that they try to lessen changeover in a single scan cell in every filling step, devoid of considering its effect on the other X-bits. To minimize the computational complexities of the ATPG measures utilized in \hyperref[b150]{[154]}, Remersaro et al \hyperref[b151]{[155]} introduced a probability-based X-filling method (namely preferred fill) to decrease capture energy. On the other hand, their technique is not capable to weight X bits on capture power reduction efficiencies to get the optimal filling order among them. Because of their diverse objectives, low-shift power X-filling method may result in higher capture power indulgence, and vice versa. As a consequence, it is essential to consider both shift power lessening and capture power reduction during the Xfilling development. \hyperref[b152]{[156]} Takes a fully individual test set as input and generates a new test set with summary shift power and capture power. The authors first identify X-bits in the test set and then fill 50\% of the X-bits using preferred fill \hyperref[b151]{[155]} while the outstanding X-bits are filled next using adjacent fill \hyperref[b149]{[153]}.\par
Both shift power and capture power can be lessen with X-filling procedure in \hyperref[b152]{[156]}, filling half of the X-bits for capture power minimization and the other half for shift power minimization is not a very good approach. This is because; the shift power indulgence and the capture power indulgence should be dealt with another way. The major purpose in shift power lessening is to reduce the average test power indulgence as much as promising, so that we are able to use increased shift frequency and/or higher test parallelism to minimization of the CUT's test time and hence cut down the test cost; while the main duty in capture power minimization is to keep it under a safe peak power limit and it is needless to minimize it to be the least value.\par
Test during burn-in at the wafer level augment the repayment that are resulting from the burn-in procedure. The monitoring of de-vice responses while be relevant apt test stimuli during WLBI leads to the easier recognition of faulty devices. This process can be referred as "WLTBI"; it is also referred to in the literature as "test in burn-in" (TIBI) \hyperref[b155]{[159]}, "wafer-level burn-in test" (WLBT) \hyperref[b158]{[162]}, etc. WLTBI technology has lately made fast advances with the arrival of the "known good die" (KGD) \hyperref[b159]{[163]}, i.e., devices that are sold as tested bare die. KGDs are construction blocks of complex systemin-package (SiP) de-sign, wherever chips with various functionalities are united in a single package. The mounting order for KGDs in complex system-on-a-chip (SoC)/SiP architectures, multichip modules, and stacked memories, show the significance for cost effectual and feasible WLTBI solutions \hyperref[b156]{[160]}. WLTBI will also make possible advance in the manufacture of 3-D ICs, where exposed dies or wafers have to be checked prior they are perpendicularly stacked. WLTBI can therefore be seen as an facilitate technology for cost competent manufacture of reliable 3-D ICs. The vital methods used for the testing and burn-in of entity chips are the similar as those used in WLTBI. Test and burn-in need the accessibility of fitting electrical excitation of the device/die under test (DUT), irrespective of whether it is done on a package chip or a bare die. The only dissimilarity lies in the mode of delivery of the electrical excitation. Mechanically contact the leads provide electrical unfairness and excitation during conservative testing and burn-in. In the case of WLTBI, this excitation can be provided in any of the following three ways: the probe-per-pad method, the sacrificial metal method, and the built-in test/burn-in method \hyperref[b160]{[164]}.\par
The built-in test/burn-in technique involves the use of on-chip design-for-test (DFT) communications to get WLTBI. This method allows wafers to undergo fullwafer contact using far fewer probe contacts. The existence of complicated built-in DFT features on current day ICs makes "monitored burn-in" possible. Monitored burn-in is a process where a DUT is provided with input test patterns; the output responses of the DUT are monitored online, thereby leading to the identification of failing devices. It is therefore clear that WLTBI has a important possible to lower the generally product cost by flouting the barrier among burn-in and contact during burn-in and also provide test monitoring capabilities \hyperref[b156]{[160]}, \hyperref[b158]{[162]}, \hyperref[b161]{[165]}.\par
There are many practical challenges connected with WLTBI; these comprise full contact burnin and competent thermal control \hyperref[b160]{[164]}. Winning WLTBI process also needs during understanding of the thermal characteristics of the DUT. To keep the burn-in time to a least, it is necessary to test the devices at the superior end of their temperature cover \hyperref[b157]{[161]}. Furthermore, the junction temperature of the DUT need to be maintain in a small window such that burn-in prediction are precise.\par
For scan testing Power management for WLTBI is very significant. The semi-conductor industry \hyperref[b162]{[166]} is now extensively used in Scan-based testing. Although, scan testing leads to composite power profiles in test application; in exacting, there is a important variation in the energy usage of a device below test on a cycle-by-cycle basis. In a burn-in environment, the high inconsistency in scan power negatively affects prediction on burn-in time, ensuing in a device individual subjected to extreme or inadequate burn-in \hyperref[b163]{[167]}. Erroneous prediction may also effect in thermal runaway. Dynamic burn-in using a fullscan circuit automatic test pat-tern creation (ATPG) was projected in \hyperref[b164]{[168]} with the aim of increasing the number of transition in the scan chains.\par
Observation : In the semiconductor industry the maximum power usage of ICs in scan-based testing is a severe apprehension in the semiconductor industry; scan power is regularly some times more than the device power indulgence in normal circuit operation \hyperref[b165]{[169]}. Too much power usage in scan testing can lead to yield defeat. As a consequence, power reduction during test pattern application has lately expected a lot Research has alert on model order to lessen test power \hyperref[b166]{[170]}, \hyperref[b172]{[176]}, \hyperref[b174]{[177]}. The pattern-ordering difficulty has been mapped to the well-known wandering salesman trouble (TSP) \hyperref[b172]{[176]}, \hyperref[b174]{[177]}. The burn-in at wafer-level needs low variation in power usage during testing semiconductor devices \hyperref[b157]{[161]}. The need of WLTBI is not addressed in the test-pattern re-ordering method that reduces the dynamic power usage. Particular methods need to be urbanized to address this feature of low-power testing, i.e., the order of test model to reduce the overall variation in power usage. 
\section[{IV.}]{IV.} 
\section[{Conclusion}]{Conclusion}\par
As devices grow in gate count, scan test data volume and function time grows as well, even for singlestuck-at faults with single-detection. This causes a grave difficulty on manufacturing test because, as test data volume increase, it takes more tester memory to hold the whole test set, and longer to bring the test set through restricted test channels, both important to higher test cost. In addition, considerable research on low power design and testability of VLSI circuits have been shown that the power used in test mode of operation is frequently much higher than the power used in normal mode of process due to the high swapping action in the nodes of the circuit under test which may effect in increased dynamic power indulgence or higher supply current demand. This can reduce the dependability of the circuit under test due to high temperature and current solidity which cannot be tolerated by circuits designed using power reduction method. Unnecessary power indulgence may root hot spots that could harm the CUT. High supply current may cause extreme power supply droop causing to bigger gate delays that cause good chips to fail tests causing yield loss.\par
Many studies from academia and industry have revealed the need to minimize energy expenditure during test of digital and memory designs. This need is caused by the fact that generally test power could be more than twice the power used in normal functional mode. Since test throughput and developed yield are frequently exaggerated by test power, different test solutions have been projected over the past decade. In this chapter, we converse many low-power test solutions to tackle the above-mentioned problems. Both structural and algorithmic solutions are described the length of with their collision on parameters such as fault reporting, test time, area transparency, circuit show penalty, and design flow alteration. These explanations cover a wide spectrum of difficult environments, together with scan testing, scan-based BIST, test-per-clock BIST, test compression, and memory testing.\par
External testing with ATE becomes very expensive, as the complexity of modern chips increases. The BIST design technique has been extensively adopted in the design of VLSI circuits in order to facilitate the chip to test itself and to evaluate its answer with a satisfactory cost. On the other hand, the main problem in logic BIST methods is that energy utilization during BIST can go beyond the power rating of the chip or enclose. High average power can cause heat of the chip and high peak power can create noiserelated failures. It is predictable that low power test compression methods and functional test techniques need to be projected to like-minded with logic BIST effectively. of concentration \hyperref[b166]{[170]}, \hyperref[b167]{[171]}, \hyperref[b168]{[172]}, \hyperref[b169]{[173]} [174], \hyperref[b171]{[175]} \begin{figure}[htbp]
\noindent\textbf{16}\includegraphics[]{image-2.png}
\caption{\label{fig_0}16 Bench}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{figure3}}\end{figure}
 			\footnote{Professor \& Head of ECE, Ravindra College of Engineering for women, Kurnool, A.P, India. E-mail : ysgoud18@yahoo.co.in Professor in ECE Department, Geethanjali College of Engineering and Technology, Cheeryal (V), Keesara (MDL), RR Dist. E-mail : bkmadhavi2009@gmail.com} 			\footnote{© 2013 Global Journals Inc. (US) © 2013 Global Journals Inc. (US)} 			\footnote{Bench Marking Models of Low Power VLSI Testing Strategies: Current State of the Art} 			\footnote{© 2013 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{This page is intentionally left blank}]{This page is intentionally left blank}			 			  				\begin{bibitemlist}{1}
\bibitem[Dabholkar et al.]{b172}\label{b172} 	 		\textit{},  		 			V Dabholkar 		,  		 			S Chakravarty 		,  		 			I Pomeranz 		,  		 			S 		.  		 	 
\bibitem[Cheung and Gupta (1996)]{b8}\label{b8} 	 		‘A BIST Methodology for Comprehensive Testing of RAM with Reduced Heat Dissipation’.  		 			H Cheung 		,  		 			S Gupta 		.  	 	 		\textit{IEEE Int. Test Conf}  		October 1996. p. .  	 
\bibitem[Cheung and Gupta (1996)]{b23}\label{b23} 	 		‘A BIST Methodology for Comprehensive Testing of RAM with Reduced Heat Dissipation’.  		 			H Cheung 		,  		 			S Gupta 		.  	 	 		\textit{IEEE Int. Test Conf}  		October 1996. p. .  	 
\bibitem[Saxena et al. (2003)]{b18}\label{b18} 	 		‘A Case Study of IR-Drop in Structured At-Speed Testing’.  		 			J Saxena 		,  		 			K M Butler 		,  		 			V B Jayaram 		,  		 			S Kundu 		,  		 			N V Arvind 		,  		 			P Sreeprakash 		,  		 			M Hachinger 		.  	 	 		\textit{Proc. Int'l Test Conf},  				 (Int'l Test Conf)  		October 2003. p. .  	 
\bibitem[Delta et al.]{b156}\label{b156} 	 		\textit{A comparison of wafer level burn-in \& test platforms for device qualification and known good die (KGD) production},  		 			V Delta 		,  		 			Instruments 		,  		 			Richardson 		,  		 			Tx 		.  		 	 
\bibitem[Zorian ()]{b121}\label{b121} 	 		‘A distributed BIST control scheme for complex VLSI devices’.  		 			Y Zorian 		.  	 	 		\textit{Proc. 11th IEEE VLSI Test Symposium},  				 (11th IEEE VLSI Test Symposium)  		1993. p. .  	 
\bibitem[Zorian (1993)]{b1}\label{b1} 	 		‘A Distributed BIST Control Scheme for Complex VLSI Devices’.  		 			Y Zorian 		.  	 	 		\textit{IEEE VLSI Test Symp},  				April 1993. p. .  	 
\bibitem[Zorian (1993)]{b22}\label{b22} 	 		‘A Distributed BIST Control Scheme for Complex VLSI Devices’.  		 			Y Zorian 		.  	 	 		\textit{IEEE VLSI Test Symp},  				April 1993. p. .  	 
\bibitem[Zorian (1993)]{b31}\label{b31} 	 		‘A Distributed BIST Control Scheme for Complex VLSI Devices’.  		 			Y Zorian 		.  	 	 		\textit{IEEE VLSI Test Symp},  				April 1993. p. .  	 
\bibitem[Zorian ()]{b165}\label{b165} 	 		‘A distributed BIST control scheme for complex VLSI devices in’.  		 			Y Zorian 		.  	 	 		\textit{Proc. VLSI Test Symp},  				 (VLSI Test Symp)  		1993. p. .  	 
\bibitem[Bonhomme et al. (2001)]{b123}\label{b123} 	 		‘A Gated Clock Scheme for Low Power Scan Testing of Logic ICs or Embedded Cores’.  		 			Y Bonhomme 		,  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravos 		.  	 	 		\textit{InProceed-ings IEEE Asian Test Symposium (ATS)},  				Nov. 2001. p. .  	 
\bibitem[Corno et al. ()]{b55}\label{b55} 	 		‘A new BIST archi-tecture for low power circuits’.  		 			F Corno 		,  		 			M Rebaudengo 		,  		 			M Sonza Reorda 		,  		 			M Violante 		.  	 	 		\textit{IEEE European Test Workshop (ETW99)},  				1999. p. .  	 
\bibitem[Ravikumar et al. ()]{b103}\label{b103} 	 		‘A polynomial-time algorithm for power constrained testing of core based systems’.  		 			C P Ravikumar 		,  		 			A Verma 		,  		 			G Chandra 		.  	 	 		\textit{8th Asian Test Symposium},  				1999. p. .  	 
\bibitem[Li et al. ()]{b142}\label{b142} 	 		‘A Scan Chain Adjustment Technology for Test Power Reduction’.  		 			J Li 		,  		 			Y Hu 		,  		 			X Li 		.  	 	 		\textit{Proc. IEEE Asian Test Symposium (ATS)},  				 (IEEE Asian Test Symposium (ATS))  		2006. p. .  	 
\bibitem[Koenemann ()]{b153}\label{b153} 	 		‘A Smart BIST Variant with Guaranteed Encoding’.  		 			B Koenemann 		.  	 	 		\textit{Proc. IEEE Asian Test Symposium (ATS)},  				 (IEEE Asian Test Symposium (ATS))  		2001. p. .  	 
\bibitem[Benini et al. (2000)]{b41}\label{b41} 	 		‘A survey of design techniques for system-level dynamic power management’.  		 			L Benini 		,  		 			A Bogliolo 		,  		 			G De Micheli 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems},  				June 2000. 8 p. .  	 
\bibitem[Larsson and Peng ()]{b88}\label{b88} 	 		‘A technique for test infrastructure design and test schedul-ing’.  		 			E Larsson 		,  		 			Z Peng 		.  	 	 		\textit{Design and Diagnostic of Electronic Circuits and Systems Workshop (DDECS 2000)},  				2000.  	 
\bibitem[Corno et al. ()]{b53}\label{b53} 	 		‘A test pattern generation methodology for low power consumption’.  		 			F Corno 		,  		 			P Prinetto 		,  		 			M Rebaudengo 		,  		 			M Sonza-Reorda 		.  	 	 		\textit{16th IEEE VLSI Test Symposium},  				1998. p. .  	 
\bibitem[Corno et al. ()]{b125}\label{b125} 	 		‘A test pattern generation methodology for low power consumption’.  		 			F Corno 		,  		 			P Prinetto 		,  		 			M Rebaudengo 		,  		 			M Sonza-Reorda 		.  	 	 		\textit{InProceedings IEEE VLSI Test Sym-posium (VTS)},  				1998. p. .  	 
\bibitem[Girard et al. ()]{b68}\label{b68} 	 		‘A test vector in-hibiting technique for low energy BIST design’.  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  	 	 		\textit{Proc. 17th IEEE VLSI Test Symposium},  				 (17th IEEE VLSI Test Symposium)  		1999. p. .  	 
\bibitem[Girard et al. (1999)]{b28}\label{b28} 	 		‘A Test Vector Inhibiting Technique for Low Energy BIST Design’.  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  	 	 		\textit{IEEE VLSI Test Symp},  				May 1999. p. .  	 
\bibitem[Girard et al. ()]{b69}\label{b69} 	 		‘A test vector ordering technique for switching activity reduction during test operation’.  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  	 	 		\textit{9th Great Lakes Symposium on VLSI (GLSVLSI99)},  				1999. p. .  	 
\bibitem[Abramovici et al. ()]{b9}\label{b9} 	 		 			M Abramovici 		,  		 			M A Breuer 		,  		 			A D Friedman 		.  		\textit{Digital Systems Testing and Testable Design},  				1990. Computer Science Press.  	 
\bibitem[Whetsel (2000)]{b136}\label{b136} 	 		‘Adapting Scan Architectures for Low Power Operation’.  		 			L Whetsel 		.  	 	 		\textit{InProceedings IEEE International Test Confer-ence (ITC)},  				Oct. 2000. p. .  	 
\bibitem[Gerez ()]{b63}\label{b63} 	 		\textit{Algorithms for VLSI Design Automation},  		 			S H Gerez 		.  		1999. John Wiley \& Sons.  	 
\bibitem[Saxena et al. ()]{b170}\label{b170} 	 		‘An analysis of power re-duction techniques in scan testing inProc’.  		 			J Saxena 		,  		 			K M Butler 		,  		 			L Whetsel 		.  	 	 		\textit{Int. Test Conf}  		2001. p. .  	 
\bibitem[Iman and Pedram (1996)]{b78}\label{b78} 	 		‘An approach for multilevel logic optimization targeting low power’.  		 			S Iman 		,  		 			M Pedram 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		August 1996. 15  (8)  p. .  	 
\bibitem[Wang and Gupta (2002)]{b166}\label{b166} 	 		‘An automatic test pattern generator for minimizing switching activity during scan testing activity’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst}  		Aug. 2002. 21  (8)  p. .  	 
\bibitem[Pouget et al. (2003)]{b20}\label{b20} 	 		‘An Efficient Approach to SOC Wrapper Design, TAM Configuration and Test Scheduling’.  		 			J Pouget 		,  		 			E Larsson 		,  		 			Z Peng 		,  		 			M L Flottes 		,  		 			B Rouzeyre 		.  	 	 		\textit{Proc. European Test Workshop},  				 (European Test Workshop)  		May 2003. p. .  	 
\bibitem[Larsson and Peng ()]{b87}\label{b87} 	 		‘An estimation-based technique for test scheduling’.  		 			E Larsson 		,  		 			Z Peng 		.  	 	 		\textit{Electronic Circuits and Systems Conference},  				1999. p. .  	 
\bibitem[Huang and Lee ()]{b76}\label{b76} 	 		‘An input control technique for power reduction in scan circuits during test application’.  		 			C Huang 		,  		 			K.-J Lee 		.  	 	 		\textit{Proc. 8th Asian Test Symposium},  				 (8th Asian Test Symposium)  		1999. p. .  	 
\bibitem[Rajski and Tyszer ()]{b3}\label{b3} 	 		\textit{Arithmetic Built-In Self-Test for Embedded Systems},  		 			J Rajski 		,  		 			J Tyszer 		.  		1998. Prentice Hall PTR.  	 
\bibitem[Rajski and Tyszer ()]{b33}\label{b33} 	 		\textit{Arithmetic Built-In Self-Test for Embedded Systems},  		 			J Rajski 		,  		 			J Tyszer 		.  		1998. Prentice Hall PTR.  	 
\bibitem[Flores et al. ()]{b60}\label{b60} 	 		‘Assignment and reordering of incompletely specified pattern sequences targeting minimum power dissipation’.  		 			P Flores 		,  		 			J Costa 		,  		 			H Neto 		,  		 			J Monteiro 		,  		 			J Marques-Silva 		.  	 	 		\textit{12th International Conference on VLSI Design},  				1999. p. .  	 
\bibitem[Wang and Gupta (1998)]{b134}\label{b134} 	 		‘ATPG for heat dissipation min-imization during test application’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Transactions on Computers}  		February 1998. 47  (2)  p. .  	 
\bibitem[Wang and Gupta ()]{b115}\label{b115} 	 		‘ATPG for heat dissipation minimization during scan testing’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{Proc. 34th Design Automation Conference (DAC)},  				 (34th Design Automation Conference (DAC))  		1997. p. .  	 
\bibitem[Wang and Gupta (1998)]{b147}\label{b147} 	 		‘ATPG for heat dissipation minimization during test application’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Transactions on Computers}  		Feb. 1998. 47  (2)  p. .  	 
\bibitem[Wang and Gupta (1998)]{b122}\label{b122} 	 		‘ATPG for heat dissipation minimization during test application’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Transactions on Computers}  		February 1998. 47  (2)  p. .  	 
\bibitem[Benini and De Micheli (1996)]{b44}\label{b44} 	 		‘Automatic synthesis of low-power gated-clock finite-state machines’.  		 			L Benini 		,  		 			G De Micheli 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Cir-cuits and Systems}  		June 1996. 15  (6)  p. .  	 
\bibitem[Saab et al. (1996)]{b105}\label{b105} 	 		‘Automatic test vector cultivation for sequential Bench Marking Models of Low Power VLSI Testing Strategies: Current State of the Art VLSI circuits using genetic algorithms’.  		 			D G Saab 		,  		 			Y G Saab 		,  		 			J A Abrahamn 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		October 1996. 15  (10)  p. .  	 
\bibitem[Parkar ()]{b7}\label{b7} 	 		\textit{Bare Die Test},  		 			R Parkar 		.  		1992. p. .  	 
\bibitem[Debany ()]{b32}\label{b32} 	 		‘Bench Marking Models of Low Power VLSI Testing Strategies: Current State of the Art 35’.  		 			W H Debany 		.  	 	 		\textit{Dual-Use Tech. \& App}  		1994. p. .  	 	 (Quiescent Scan Design for Testing Digital Logic Circuits) 
\bibitem[Benso et al. ()]{b164}\label{b164} 	 		 			A Benso 		,  		 			A Bosio 		,  		 			S D Carlo 		,  		 			G D Natale 		,  		 			P Prinetto 		.  		\textit{ATPG for dynamic burn-in test in fullscan circuits in Proc. Asian Test Symp},  				2006. p. .  	 
\bibitem[Wunderlich and Zorian ()]{b10}\label{b10} 	 		\textit{Built-In Self Test (BIST): Synthesis of Self-Testable Systems},  		 			H J Wunderlich 		,  		 			Y Zorian 		.  		1997. Kluwer Academic Publishers.  	 
\bibitem[Roy and Prasad (1993)]{b104}\label{b104} 	 		‘Circuit activity based CMOS logic synthesis for low power reliable operations’.  		 			K Roy 		,  		 			S Prasad 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems}  		December 1993. 1  (4)  p. .  	 
\bibitem[Girard et al. ()]{b67}\label{b67} 	 		‘Circuit partitioning for low power BIST design with minimized peak power consumption’.  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  	 	 		\textit{8th Asian Test Symposium (ATS99)},  				1999. p. .  	 
\bibitem[Girard et al. (1999)]{b30}\label{b30} 	 		\textit{Circuit Partitioning for Low Power BIST Design with Minimized Peak Power Consumption},  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  		November 1999.  	 	 (to be presented at IEEE Asian Test Symp.) 
\bibitem[Garey and Johnson ()]{b62}\label{b62} 	 		\textit{Computers and Intractability: A Guide to the The-ory of NP-Completeness},  		 			M R Garey 		,  		 			D S Johnson 		.  		1979. New York: Morgan Freeman.  	 
\bibitem[Pochmuller (2003)]{b161}\label{b161} 	 		‘Configuration for carrying out burnin processing op-erations of semiconductor devices at wafer level’.  		 			P Pochmuller 		.  	 	 		\textit{Patent Office U.S. Patent}  		Mar. 18, 2003. 6 p. .  	 
\bibitem[Sankaralingam and Touba ()]{b133}\label{b133} 	 		‘Controlling Peak Power During Scan Testing’.  		 			R Sankaralingam 		,  		 			N A Touba 		.  	 	 		\textit{InProceedings IEEE VLSI Test Sym-posium (VTS)},  				2002. p. .  	 
\bibitem[Sankaralingam and Touba ()]{b145}\label{b145} 	 		‘Controlling peak power during scan testing’.  		 			R Sankaralingam 		,  		 			N A Touba 		.  	 	 		\textit{Proc. IEEE VLSI Test Symp},  				 (IEEE VLSI Test Symp)  		2002. p. .  	 
\bibitem[Cheng and Krstic (1999)]{b14}\label{b14} 	 		‘Current directions in automatic test-pattern generation’.  		 			K.-T Cheng 		,  		 			A Krstic 		.  	 	 		\textit{Computer}  		November 1999. 32  (11)  p. .  	 
\bibitem[Zhang and Roy ()]{b119}\label{b119} 	 		‘Design and synthesis of low power weighted random pattern generator considering peak power reduction’.  		 			K Zhang 		,  		 			Roy 		.  	 	 		\textit{International Symposium on Defect and Fault Tolerance in VLSI Systems},  				1999. p. .  	 
\bibitem[Chakrabarty ()]{b48}\label{b48} 	 		‘Design of system-on-a-chip test access architectures under place-and-route and power constraints’.  		 			K Chakrabarty 		.  	 	 		\textit{Proc. IEEE/ACM Design Automation Confer-ence (DAC)},  				 (IEEE/ACM Design Automation Confer-ence (DAC))  		2000. p. .  	 
\bibitem[Crouch ()]{b57}\label{b57} 	 		\textit{Design-For-Test For Digital IC's and Embedded Core Systems},  		 			A L Crouch 		.  		1999. Prentice-Hall.  	 
\bibitem[Rabaey ()]{b100}\label{b100} 	 		\textit{Digital Integrated Circuits: A Design Perspective},  		 			J M Rabaey 		.  		1996. Prentice-Hall International.  	 
\bibitem[Abramovici et al. ()]{b21}\label{b21} 	 		\textit{Digital Systems Testing and Testable Design},  		 			M Abramovici 		,  		 			M A Breuer 		,  		 			A D Friedman 		.  		1990. IEEE Press.  	 
\bibitem[Abramovici et al. ()]{b35}\label{b35} 	 		\textit{Digital Systems Testing and Testable Design},  		 			M Abramovici 		,  		 			M A Breuer 		,  		 			A D Friedman 		.  		1990. IEEE Press.  	 
\bibitem[Wang and Gupta (1997)]{b34}\label{b34} 	 		‘DS-LFSR : A New BIST TPG for Low Heat Dissipation’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Int. Test Conf}  		October 1997. p. .  	 
\bibitem[Wang and Gupta ()]{b116}\label{b116} 	 		‘DS-LFSR: A new BIST TPG for low heat dissipation’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{Proc. IEEE International Test Conference},  				 (IEEE International Test Conference)  		1997. p. .  	 
\bibitem[Wang and Gupta (1997)]{b4}\label{b4} 	 		‘DS-LFSR: A New BIST TPG for Low Heat Dissipation’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Int. Test Conf}  		October 1997. p. .  	 
\bibitem[Wang and Gupta (1997)]{b24}\label{b24} 	 		‘DS-LFSR: A New BIST TPG for Low Heat Dissipation’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Int. Test Conf}  		October 1997. p. .  	 
\bibitem[Wang and Gupta (1997)]{b12}\label{b12} 	 		‘DSLFSR: A New BIST TPG for Low Heat Dissipation’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{IEEE Int. Test Conf}  		October 1997. p. .  	 
\bibitem[Gizopoulos et al. ()]{b73}\label{b73} 	 		‘Effective low power BIST for datapaths’.  		 			D Gizopoulos 		,  		 			N Kranitis 		,  		 			A Paschalis 		,  		 			M Psarakis 		,  		 			Y Zorian 		.  	 	 		\textit{Proc. of the Design, Automation and Test in Europe Conference (DATE)},  				 (of the Design, Automation and Test in Europe Conference (DATE))  		2000. p. 757.  	 
\bibitem[Bonhomme ()]{b141}\label{b141} 	 		‘Efficient scan chain design for power minimization during scan testing under routing constraint’.  		 			Y Bonhomme 		.  	 	 		\textit{Proc. IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		2003. p. .  	 
\bibitem[Manich et al. ()]{b91}\label{b91} 	 		‘Energy and average power con-sumption reduction in LFSR based BIST structures’.  		 			S Manich 		,  		 			A Gabarro 		,  		 			M Lopez 		,  		 			J Figueras 		,  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			P Teixeira 		,  		 			M Santos 		.  	 	 		\textit{Design of Circuits and Integrated Systems Conference (DCIS99)},  				1999. p. .  	 
\bibitem[Latypov (2001)]{b174}\label{b174} 	 		‘Energy saving testing of circuits Autom’.  		 			P K Latypov 		.  	 	 		\textit{Remote Con-trol}  		Apr. 2001. 62 p. .  	 
\bibitem[Bushnell ()]{b16}\label{b16} 	 		\textit{Essentials of Electronic Testing for Digital, Memory \& Mixed-Signal VLSI Circuits},  		 			M L Bushnell 		,  		 			VD 		.  		2000. New York, NY: Springer Science.  	 
\bibitem[Jiang et al. (2000)]{b79}\label{b79} 	 		‘Estimation for maximum instantaneous current through supply lines for CMOS circuits’.  		 			Y.-M Jiang 		,  		 			A Krstic 		,  		 			K.-T Cheng 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems},  				February 2000. 8 p. .  	 
\bibitem[Ravikumar and Prasad ()]{b102}\label{b102} 	 		‘Evaluating BIST architectures for low power’.  		 			C P Ravikumar 		,  		 			N S Prasad 		.  	 	 		\textit{7th Asian Test Symposium},  				1998. p. .  	 
\bibitem[Cheng (1996)]{b15}\label{b15} 	 		‘Gate level test generation for sequential circuits’.  		 			K.-T Cheng 		.  	 	 		\textit{ACM Transactions on Design Automation of Electronic Systems (TODAES)}  		October 1996. 1  (4)  p. .  	 
\bibitem[Benini et al. (2000)]{b45}\label{b45} 	 		‘Glitch power minimization by selective gate freezing’.  		 			L Benini 		,  		 			G De Micheli 		,  		 			A Macii 		,  		 			E Macii 		,  		 			M Poncino 		,  		 			R Scarsi 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems}  		June 2000. 8  (3)  p. .  	 
\bibitem[Butler et al. ()]{b169}\label{b169} 	 		‘Het-hering-ton, Minimizing power consumption in scan testing: Pattern generation and DFT techniques in’.  		 			K M Butler 		,  		 			J Saxena 		,  		 			A Jain 		,  		 			T Fryars 		,  		 			J Lewis 		.  	 	 		\textit{Proc. Int. Test Conf},  				 (Int. Test Conf)  		2004. p. .  	 
\bibitem[Macii et al. (1998)]{b90}\label{b90} 	 		‘High level power modeling, estimation, and optimization’.  		 			E Macii 		,  		 			M Pedram 		,  		 			F Somenzi 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		November 1998. 17  (11)  p. .  	 
\bibitem[Khouri et al. (1999)]{b81}\label{b81} 	 		‘High-level synthesis of low-power control-flow intensive circuits’.  		 			K S Khouri 		,  		 			G Lakshminarayana 		,  		 			N K Jha 		.  	 	 		\textit{IEEE Transactions on Computer-Aided De-sign of Integrated Circuits and Systems}  		December. 1999. 18 p. .  	 
\bibitem[Lakshminarayana and Jha (1999)]{b83}\label{b83} 	 		‘High-level synthesis of power-optimized and area-optimized circuits from hierarchical data-flow intensive behaviors’.  		 			G Lakshminarayana 		,  		 			N K Jha 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		March 1999. 18  (3)  p. .  	 
\bibitem[Shi and Kapur (2004)]{b19}\label{b19} 	 		‘How Power Aware Test Improves Reliability and Yield’.  		 			C Shi 		,  		 			R Kapur 		.  	 	 		\textit{IEEDesign.com}  		September 15, 2004.  	 
\bibitem[Shi and Kapur (2004)]{b137}\label{b137} 	 		‘How Power Aware Test Improves Reliability and Yield’.  		 			C Shi 		,  		 			R Kapur 		.  	 	 		\textit{IEEDesign.com}  		September 15, 2004.  	 
\bibitem[Lakshminarayana et al. (2000)]{b85}\label{b85} 	 		‘Incorporating speculative execution into scheduling of control-flow-intensive designs’.  		 			G Lakshminarayana 		,  		 			A Raghunathan 		,  		 			N K Jha 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		March 2000. 19  (3)  p. .  	 
\bibitem[Forster and Lopez ()]{b163}\label{b163} 	 		‘Junction temperature during burn-in: How variable is it and how can we control it?’.  		 			J Forster 		,  		 			C Lopez 		.  	 	 		\textit{Proc. Semicond. Thermal Meas. Manage. Symp},  				 (Semicond. Thermal Meas. Manage. Symp)  		2007. p. .  	 
\bibitem[Girard et al. (1999)]{b27}\label{b27} 	 		‘Low Energy BIST Design: Impact of the LFSR TPG Parameters on the Weighted Switching Activity’.  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravos Soudovitch 		,  		 			J Figueras 		,  		 			S Manich 		,  		 			P Teixeira 		,  		 			M Santos 		.  	 	 		\textit{CD-ROM proceedings},  				June 1999.  	 
\bibitem[Manich et al. ()]{b92}\label{b92} 	 		‘Low power BIST by filtering non-detecting vectors’.  		 			S Manich 		,  		 			A Gabarro 		,  		 			M Lopez 		,  		 			J Figueras 		,  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			P Teixeira 		,  		 			M Santos 		.  	 	 		\textit{IEEE European Test Workshop (ETW99)},  				1999. p. .  	 
\bibitem[Manich et al. (2000)]{b93}\label{b93} 	 		‘Low power BIST by filtering non-detecting vectors’.  		 			S Manich 		,  		 			A Gabarro 		,  		 			M Lopez 		,  		 			J Figueras 		,  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			P Teixeira 		,  		 			M Santos 		.  	 	 		\textit{Journal of Electronic Testing: Theory and Applications (JETTA)}  		June 2000. 16  (3)  p. .  	 
\bibitem[Manich et al. (1999)]{b29}\label{b29} 	 		‘Low Power BIST by Filtering Non-Detecting Vectors’.  		 			S Manich 		,  		 			A Gabarro 		,  		 			J Figueras 		,  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			P Teixeira 		,  		 			M Santos 		.  	 	 		\textit{IEEE European Test Workshop}  		May 1999.  	 
\bibitem[Girard et al. (2000)]{b127}\label{b127} 	 		‘Low Power BIST Design by Hypergraph Partitioning: Methodology and Architectures’.  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  	 	 		\textit{InProceedings IEEE In-ternational Test Conference (ITC)},  				October 2000. p. .  	 
\bibitem[Corno et al. ()]{b54}\label{b54} 	 		‘Low power BIST via non-linear hybrid cellular automata’.  		 			F Corno 		,  		 			M Rebaudengo 		,  		 			M Sonza Reorda 		,  		 			G Squillero 		,  		 			M Violante 		.  	 	 		\textit{18th IEEE VLSI Test Sym-posium},  				2000. p. .  	 
\bibitem[Gizopoulos et al. ()]{b75}\label{b75} 	 		‘Low power built-in self-test for datapath architectures’.  		 			D Gizopoulos 		,  		 			M Psarakis 		,  		 			A Paschalis 		,  		 			N Kranitis 		,  		 			Y Zorian 		.  	 	 		\textit{Proc. of the 2nd International Work-shop on Microprocessor Test and Verification (MTV 99)},  				 (of the 2nd International Work-shop on Microprocessor Test and Verification (MTV 99))  		1999. p. .  	 
\bibitem[Bakalis et al. ()]{b40}\label{b40} 	 		‘Low power dissipation in BIST schemes for modified booth multipliers’.  		 			D Bakalis 		,  		 			H T Vergos 		,  		 			D Nikolos 		,  		 			X Kavousianos 		,  		 			G Alexiou 		.  	 	 		\textit{International Symposium on Defect and Fault Tolerance in VLSI Systems},  				1999. p. .  	 
\bibitem[Girard et al. ()]{b70}\label{b70} 	 		‘Low power pseudorandom BIST: on selecting the LFSR seed’.  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			J Figueras 		,  		 			S Manich 		,  		 			P Teixeira 		,  		 			M Santos 		.  	 	 		\textit{Design of Circuits and Integrated Systems Conference (DCIS98)},  				1998. p. .  	 
\bibitem[Chow et al. (1996)]{b52}\label{b52} 	 		‘Low power realization of finite state machines -a decomposition approach’.  		 			S.-H Chow 		,  		 			Y.-C Ho 		,  		 			T Hwang 		,  		 			C L Liu 		.  	 	 		\textit{ACM Transactions on Design Automation of Electronic Systems (TODAES)}  		July 1996. 1  (3)  p. .  	 
\bibitem[Hertwig and Wunderlich ()]{b11}\label{b11} 	 		‘Low Power Serial Built-IN Self-Test’.  		 			A Hertwig 		,  		 			H J Wunderlich 		.  	 	 		\textit{IEEE European Test Workshop},  				1998. p. .  	 
\bibitem[Hertwigand and Wunderlich ()]{b25}\label{b25} 	 		‘Low Power Serial Built-IN Self-Test’.  		 			A Hertwigand 		,  		 			H J Wunderlich 		.  	 	 		\textit{IEEE European Test Workshop},  				1998. p. .  	 
\bibitem[Girard ()]{b66}\label{b66} 	 		‘Low power testing of VLSI circuits: Problems and solutions’.  		 			P Girard 		.  	 	 		\textit{First International Symposium on Quality of Electronic Design (ISQED)},  				2000. p. .  	 
\bibitem[Gizopoulos et al. ()]{b74}\label{b74} 	 		‘Low power/energy BIST for datapaths’.  		 			D Gizopoulos 		,  		 			N Kranitis 		,  		 			A Paschalis 		,  		 			M Psarakis 		,  		 			Y Zorian 		.  	 	 		\textit{Proc. of the 18th IEEE VLSI Test Sympo-sium},  				 (of the 18th IEEE VLSI Test Sympo-sium)  		2000. p. .  	 
\bibitem[Remersaro ()]{b152}\label{b152} 	 		‘Low Shift and Capture Power Scan Tests’.  		 			S Remersaro 		.  	 	 		\textit{Proc. IEEE International Conference on VLSI Design},  				 (IEEE International Conference on VLSI Design)  		2007. p. .  	 
\bibitem[Wen ()]{b135}\label{b135} 	 		‘Low-Capture-Power Test Generation for Scan-Based At-Speed Testing’.  		 			X Wen 		.  	 	 		\textit{InProceedings IEEE Inter-national Test Conference (ITC)},  				2005. p. .  	 
\bibitem[Wen ()]{b150}\label{b150} 	 		‘Low-capture-power test generation for scan-based at-speed testing’.  		 			X Wen 		.  	 	 		\textit{Proc. IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		2005. p. .  	 
\bibitem[Bhunia (2005)]{b139}\label{b139} 	 		‘Low-Power Scan Design Using First-Level Supply Gating’.  		 			S Bhunia 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems (TVLSI)},  				March 2005. p. .  	 
\bibitem[Hwang and Wu ()]{b77}\label{b77} 	 		‘Low-power testing for C-testable iterative logic ar-rays’.  		 			S.-A Hwang 		,  		 			C.-W Wu 		.  	 	 		\textit{Proceedings International Conference on VLSI Technology, Systems, and Applications},  				 (International Conference on VLSI Technology, Systems, and Applications)  		1997. p. .  	 
\bibitem[Tsui et al. (1998)]{b112}\label{b112} 	 		‘Lowpower state assignment targeting two-and multilevel logic implementations’.  		 			C.-Y Tsui 		,  		 			M Pedram 		,  		 			A M Despain 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		December 1998. 17  (2)  p. .  	 
\bibitem[Wang and Gupta ()]{b117}\label{b117} 	 		‘LT-RTPG: A new testper-scan BIST TPG for low heat dissipation’.  		 			S Wang 		,  		 			S K Gupta 		.  	 	 		\textit{Proc. IEEE International Test Conference},  				 (IEEE International Test Conference)  		1999. p. .  	 
\bibitem[Wang and Roy (2000)]{b113}\label{b113} 	 		‘Maximization of power dissipation in large CMOS circuits considering spurious transitions’.  		 			C.-Y Wang 		,  		 			K Roy 		.  	 	 		\textit{IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications},  				April 2000. 47 p. .  	 
\bibitem[Mckenzie et al. ()]{b160}\label{b160} 	 		 			T Mckenzie 		,  		 			W Ballouli 		,  		 			J Stroupe 		.  		\textit{Motorola wafer level burn-in and test in Proc. Burn-in Test Socket Work-shop},  				2001.  	 
\bibitem[Theodoridis et al. (1998)]{b109}\label{b109} 	 		‘Method for minimising the switching activity of two-level logic circuits’.  		 			G Theodoridis 		,  		 			S Theoharis 		,  		 			D Soudris 		,  		 			C E Goutis 		.  	 	 		\textit{IEE Proceedings -Computers and Digital Techniques},  				September 1998. 145 p. .  	 
\bibitem[Micron CMOS Process Parameters. Austria Mikro Systeme Interna-tional AG ()]{b37}\label{b37} 	 		\textit{Micron CMOS Process Parameters. Austria Mikro Systeme Interna-tional AG},  		 AMS. 0.35.  		1998.  	 
\bibitem[Gerstendorfer and Wunderlich ()]{b64}\label{b64} 	 		‘Minimized power consumption for scan-based BIST’.  		 			S Gerstendorfer 		,  		 			H J Wunderlich 		.  	 	 		\textit{Proc. IEEE International Test Conference},  				 (IEEE International Test Conference)  		1999. p. .  	 
\bibitem[Gerstendorfer and Wunderlich (2000)]{b65}\label{b65} 	 		‘Minimized power consumption for scan-based BIST’.  		 			S Gerstendorfer 		,  		 			H J Wunderlich 		.  	 	 		\textit{Journal of Electronic Testing: Theory and Applications (JETTA)}  		June 2000. 16  (3)  p. .  	 
\bibitem[Wang (1998)]{b114}\label{b114} 	 		\textit{Minimizing Heat Dissipation During Test Application},  		 			S Wang 		.  		May 1998.  	 	 (PhD thesis) 	 (Uni-versity of Southern California) 
\bibitem[Butler et al. ()]{b149}\label{b149} 	 		‘Minimizing power consumption in scan testing: pattern generation and DFT techniques’.  		 			K M Butler 		,  		 			J Saxena 		,  		 			A Jain 		,  		 			T Fryars 		,  		 			J Lewis 		,  		 			G Hetherington 		.  	 	 		\textit{Proc. IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		2004. p. .  	 
\bibitem[Needham (1999)]{b13}\label{b13} 	 		‘Nanometer technology challenges for test and test equipment’.  		 			W M Needham 		.  	 	 		\textit{Computer}  		November 1999. 32  (11)  p. .  	 
\bibitem[Needham (1999)]{b99}\label{b99} 	 		‘Nanometer technology challenges for test and test equipment’.  		 			W M Needham 		.  	 	 		\textit{Computer}  		November 1999. 32  (11)  p. .  	 
\bibitem[Li et al. ()]{b146}\label{b146} 	 		‘On Test Generation for Transition Faults with Minimized Peak Power Dissipation’.  		 			W Li 		,  		 			S M Reddy 		,  		 			I Pomeranz 		.  	 	 		\textit{Proc Design Automation Conference (DAC)},  				 (Design Automation Conference (DAC))  		2004. p. .  	 
\bibitem[Chandrakasan et al. (1995)]{b50}\label{b50} 	 		‘Op-timizing power using transformations’.  		 			A P Chandrakasan 		,  		 			M Potkonjak 		,  		 			R Mehra 		,  		 			J Rabaey 		,  		 			R W Brodersen 		.  	 	 		\textit{IEEE Transactions on Computer-Aided De-sign of Integrated Circuits and Systems}  		January 1995. 14  (1)  p. .  	 
\bibitem[Corno et al. ()]{b56}\label{b56} 	 		‘Optimal vector selection for low power BIST’.  		 			F Corno 		,  		 			M Rebaudengo 		,  		 			M Sonza Reorda 		,  		 			M Violante 		.  	 	 		\textit{IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems},  				1999. p. .  	 
\bibitem[Benini et al. (1999)]{b42}\label{b42} 	 		‘Policy optimization for dynamic power management’.  		 			L Benini 		,  		 			A Bogliolo 		,  		 			G A Paleologo 		,  		 			G De Micheli 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		June 1999. 18  (6)  p. .  	 
\bibitem[Brazzarola and Fummi ()]{b47}\label{b47} 	 		‘Power characterization of LFSRs’.  		 			M Brazzarola 		,  		 			F Fummi 		.  	 	 		\textit{International Symposium on Defect and Fault Tolerance in VLSI Systems},  				1999. p. .  	 
\bibitem[Muresan et al. ()]{b98}\label{b98} 	 		‘Power constrained block-test list scheduling’.  		 			V Muresan 		,  		 			X Wang 		,  		 			V Muresan 		,  		 			M Vladutiu 		.  	 	 		\textit{11th IEEE International Workshop on Rapid System Prototyping (RSP 2000)},  				2000. p. .  	 
\bibitem[Chakravarty et al. ()]{b49}\label{b49} 	 		‘Power dissipation during testing: Should we worry about it?’.  		 			S Chakravarty 		,  		 			J Monzel 		,  		 			V D Agrawal 		,  		 			R Aitken 		,  		 			J Braden 		,  		 			J Figueras 		,  		 			S Ku-Mar 		,  		 			H J Wunderlich 		,  		 			Y Zorian 		.  	 	 		\textit{15th IEEE VLSI Test Symposium (VTS)},  				1997. p. 456.  	 
\bibitem[Bonhomme et al. ()]{b140}\label{b140} 	 		‘Power Driven Chaining of Flip-Flops in Scan Architectures’.  		 			Y Bonhomme 		,  		 			P Girard 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  	 	 		\textit{Proc. IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		2002. p. .  	 
\bibitem[Lakshminarayana et al. (1999)]{b86}\label{b86} 	 		‘Power management in high level synthesis’.  		 			G Lakshminarayana 		,  		 			A Raghunathan 		,  		 			N K Jha 		,  		 			S Dey 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems},  				March 1999. 7 p. .  	 
\bibitem[Kumthekar et al. (2000)]{b82}\label{b82} 	 		‘Power optimisation of FPGA-based designs without rewiring’.  		 			B Kumthekar 		,  		 			L Benini 		,  		 			E Macii 		,  		 			F Somenzi 		.  	 	 		\textit{IEE Proceedings -Computers and Digital Tech-niques}  		May 2000. 147  (3)  p. .  	 
\bibitem[Bonhomme et al. (2004)]{b124}\label{b124} 	 		‘Power-Driven Routing-Constrained Scan Chain Design’.  		 			Y Bonhomme 		,  		 			P Girard 		,  		 			L Guiller 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		.  	 	 		\textit{Journal of Electronic Testing: Theory and Applications}  		December 2004. 20  (6)  p. .  	 
\bibitem[Yeh et al. (1999)]{b118}\label{b118} 	 		‘Powerdriven technology mapping using pattern-oriented power modelling’.  		 			C Yeh 		,  		 			C.-C Chang 		,  		 			J.-S Wang 		.  	 	 		\textit{IEE Proceedings -Computers and Digital Tech-niques}  		March 1999. 146  (2)  p. .  	 
\bibitem[Zhang et al. ()]{b26}\label{b26} 	 		‘POWERTEST: A Tool for Energy ConciousWeighted Random Pattern Testing’.  		 			K Zhang 		,  		 			S Roy 		,  		 			Bhawmik 		.  	 	 		\textit{IEEE Int. Conf. on VLSI Design},  				1999.  	 
\bibitem[Zhang et al. ()]{b120}\label{b120} 	 		‘POWERTEST: A tool for energy conscious weighted random pattern testing’.  		 			X Zhang 		,  		 			K Roy 		,  		 			S Bhawmik 		.  	 	 		\textit{12th International Conference on VLSI Design},  				1999. p. .  	 
\bibitem[Xu et al. ()]{b144}\label{b144} 	 		‘Precedence-Based, Preemptive, and Power-Constrained Test Scheduling for System-on-a-Chip’.  		 			Q Xu 		,  		 			D Hu 		,  		 			D Xiang ; Iyengar 		,  		 			K Chakrabarty 		.  	 	 		\textit{Proc. IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		2007. 2001. p. .  	 	 (Proc. IEEE VLSI Test Symp) 
\bibitem[Alidina et al. (1994)]{b36}\label{b36} 	 		‘Precomputation-based seque-ntial logic optimization for low power’.  		 			M Alidina 		,  		 			J Monteiro 		,  		 			S Devadas 		,  		 			A Ghosh 		,  		 			M Papaefthymiou 		.  	 	 		\textit{IEEE Trans-actions on Very Large Scale Integration (VLSI) Systems},  				December 1994. 2 p. .  	 
\bibitem[Remersaro et al. (2006)]{b129}\label{b129} 	 		‘Preferred Fill: A Scalable Method to Reduce Cap-ture Power for Scan Based Designs’.  		 			S Remersaro 		,  		 			Lin 		,  		 			S M Zhang 		,  		 			I Reddy 		,  		 			J Pomeranz 		,  		 			Rajski 		.  	 	 		\textit{Proceedings IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		Oct. 2006.  	 
\bibitem[Remersaro ()]{b151}\label{b151} 	 		‘Preferred Fill: A Scalable Method to Reduce Capture Power for Scan Based Designs’.  		 			S Remersaro 		.  	 	 		\textit{Proc. IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		2006. 32.  	 
\bibitem[Weste and Eshraghian ()]{b5}\label{b5} 	 		\textit{Principles of CMOS VLSI Design: A Systems Perspective},  		 			N H E Weste 		,  		 			K Eshraghian 		.  		1992. Addison-Wesley Publishing Company.  	 	 (2"d Edition) 
\bibitem[Gajski ()]{b61}\label{b61} 	 		\textit{Principles of Digital Design},  		 			D D Gajski 		.  		1997. Prentice-Hall International.  	 
\bibitem[Marculescu et al. (1998)]{b95}\label{b95} 	 		‘Probabilistic modelling of depen-decies during switching activity analysis’.  		 			R Marculescu 		,  		 			D Marculescu 		,  		 			M Pedram 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		February 1998. 17  (2)  p. .  	 
\bibitem[Debany ()]{b2}\label{b2} 	 		\textit{Quiescent Scan Design for Testing Digital Logic Circuits},  		 			W H Debany 		.  		1994. p. .  	 	 (Dual-Use Tech.\& App.) 
\bibitem[Girard et al. ()]{b72}\label{b72} 	 		‘Reducing power consumption during test application by test vector ordering’.  		 			P Girard 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			D Severac 		.  	 	 		\textit{Proc. International Symposium on Circuits and Systems (ISCAS)},  				 (International Symposium on Circuits and Systems (ISCAS))  		1998. p. .  	 
\bibitem[Girard et al. ()]{b128}\label{b128} 	 		‘Reducing power consumption during test application by test vector ordering’.  		 			P Girard 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			D Sev-Erac 		.  	 	 		\textit{InProceedings International Sym-posium on Circuits and Systems (ISCAS)},  				1998. p. .  	 
\bibitem[Sankaralingam et al. ()]{b143}\label{b143} 	 		‘Reducing Power Dissipation during Test Using Scan Chain Disable’.  		 			R Sankaralingam 		,  		 			B Pouya 		,  		 			N A Touba 		.  	 	 		\textit{Proc. IEEE VLSI Test Symp. (VTS)},  				 (IEEE VLSI Test Symp. (VTS))  		2001. p. .  	 
\bibitem[Girard et al. ()]{b71}\label{b71} 	 		‘Reduction of power consumption during test application by test vector ordering’.  		 			P Girard 		,  		 			C Landrault 		,  		 			S Pravossoudovitch 		,  		 			D Severac 		.  	 	 		\textit{IEE Electronics Let-ters}  		1997. 33  (21)  p. .  	 
\bibitem[References Références Referencias Signal VLSI Circuits ()]{b0}\label{b0} 	 		\textit{References Références Referencias Signal VLSI Circuits},  		2000. London: Kluwer Academic Publishers.  	 
\bibitem[Benini et al. ()]{b46}\label{b46} 	 		‘Saving power by synthesizing gated clocks for sequential circuits’.  		 			L Benini 		,  		 			Polly Siegel 		,  		 			G De Micheli 		.  	 	 		\textit{IEEE Design and Test of Computers}  		1994. 11  (4)  p. .  	 
\bibitem[Rosinger et al. (2006)]{b130}\label{b130} 	 		‘Scan Architecture with Mutually Exclusive Scan Method to Reduce Cap-ture Power for Scan Based Designs’.  		 			P M Rosinger 		,  		 			B M Al-Hashimi 		,  		 			N Nicolici 		.  	 	 		\textit{Proceedings IEEE International Test Conference (ITC)},  				 (IEEE International Test Conference (ITC))  		Oct. 2006.  	 
\bibitem[Rosinger et al. ()]{b131}\label{b131} 	 		‘Scan Architecture with Mutually Exclusive Scan Segment Activa-tion for Shift-and Capture-Power Reduction’.  		 			P M Rosinger 		,  		 			B M Al-Hashimi 		,  		 			N Nicolici 		.  	 	 		\textit{IEEE Trans-actions on Computer-Aided Design}  		2004. 23  (7)  p. .  	 
\bibitem[Rosinger et al. (2004)]{b138}\label{b138} 	 		‘Scan Architecture with Mutually Exclusive Scan Segment Activation for Shift and Capture Power Reduction’.  		 			P M Rosinger 		,  		 			B M Al-Hashimi 		,  		 			N Nicolici 		.  	 	 		\textit{IEEE Transactions on COMPUTER-AIDED DESIGN of Integrated Circuits and Systems (TCAD)},  				July 2004. p. .  	 
\bibitem[Nigh ()]{b162}\label{b162} 	 		‘Scan-based testing: The only practical solution for testing ASIC/consumer products inProc’.  		 			P Nigh 		.  	 	 		\textit{Int. Test Conf}  		2002. p. 1198.  	 
\bibitem[Chou and Saluja (1997)]{b51}\label{b51} 	 		‘Scheduling tests for VLSI systems un-der power constraints’.  		 			R M Chou 		,  		 			K K Saluja 		,  		 			VD 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems},  				June 1997. 5 p. .  	 
\bibitem[Singh et al. ()]{b159}\label{b159} 	 		‘Screening for known good die (KGD) based on defect clustering: An experimental study in’.  		 			A Singh 		,  		 			P Nigh 		,  		 			C M Krishna 		.  	 	 		\textit{Proc. Int. Test Conf},  				 (Int. Test Conf)  		1997. p. .  	 
\bibitem[Ravikumar et al. ()]{b101}\label{b101} 	 		‘Simultaneous module selection and scheduling for power-constrained testing of core based systems’.  		 			C P Ravikumar 		,  		 			G Chandra 		,  		 			A Verma 		.  	 	 		\textit{13th Interna-tional Conference on VLSI Design},  				2000. p. .  	 
\bibitem[Tsai et al. (2000)]{b110}\label{b110} 	 		‘Star test: The theory and its appli-cations’.  		 			K.-H Tsai 		,  		 			J Rajski 		,  		 			M Marek-Sadowska 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		September 2000. 19  (9)  p. .  	 
\bibitem[Benini and De Micheli (1995)]{b43}\label{b43} 	 		‘State assignment for low power dissipation’.  		 			L Benini 		,  		 			G De Micheli 		.  	 	 		\textit{IEEE Journal of Solid-State Circuits}  		March 1995. 30  (3)  p. .  	 
\bibitem[Sankaralingam et al. ()]{b132}\label{b132} 	 		‘Static Compaction Techniques to Control Scan Vector Power Dis-sipation’.  		 			R Sankaralingam 		,  		 			R R Oruganti 		,  		 			N A Touba 		.  	 	 		\textit{InProceedings IEEE VLSI Test Symposium (VTS)},  				2000. p. .  	 
\bibitem[Sankaralingam et al. ()]{b106}\label{b106} 	 		‘Static compaction techniques to control scan vector power dissipation’.  		 			R Sankaralingam 		,  		 			R R Oruganti 		,  		 			N A Touba 		.  	 	 		\textit{Proc. of the 18th IEEE VLSI Test Symposium},  				 (of the 18th IEEE VLSI Test Symposium)  		2000. p. .  	 
\bibitem[Sankaralingam et al. ()]{b168}\label{b168} 	 		‘Static compaction techniques to control scan vector power dissipation inProc’.  		 			R Sankaralingam 		,  		 			R R Oruganti 		,  		 			N A Touba 		.  	 	 		\textit{VLSI Test Symp}  		2000. p. .  	 
\bibitem[Girard (2002)]{b167}\label{b167} 	 		‘Survey of low-power testing of VLSI circuits IEEE Des’.  		 			P Girard 		.  	 	 		\textit{Test. Comput}  		May/Jun. 2002. 19  (3)  p. .  	 
\bibitem[Bahar et al. (1997)]{b39}\label{b39} 	 		‘Symbolic timing analysis and resynthesis for low power of combinational circuits containing false paths’.  		 			R I Bahar 		,  		 			H Cho 		,  		 			G D Hachtel 		,  		 			E Macii 		,  		 			F Somenzi 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		October 1997. 16  (10)  p. .  	 
\bibitem[De Micheli ()]{b59}\label{b59} 	 		\textit{Synthesis and Optimization of Digital Circuits},  		 			G De Micheli 		.  		1994. McGraw-Hill Inter-national Editions.  	 
\bibitem[Avra (1994)]{b38}\label{b38} 	 		\textit{Synthesis Techniques for Built-In Self-Testable Designs},  		 			L J Avra 		.  		June 1994.  		 			Stanford University 		 	 	 (PhD thesis) 
\bibitem[Reddy (1998)]{b173}\label{b173} 	 		‘Tech-niques for minimizing power dissipation in scan and combinational cir-cuits during test application’.  		 			M Reddy 		.  	 	 		\textit{IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst}  		Dec. 1998. 17  (12)  p. .  	 
\bibitem[Dabholkar et al. (1998)]{b58}\label{b58} 	 		‘Techniques for mini-mizing power dissipation in scan and combinational circuits during test application’.  		 			S Dabholkar 		,  		 			I Chakravarty 		,  		 			S M Pomeranz 		,  		 			Reddy 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		December 1998. 17  (12)  p. .  	 
\bibitem[Dabholkar et al. ()]{b126}\label{b126} 	 		‘Techniques for minimizing power dissipation in scan and combinational circuits during test application’.  		 			V Dabholkar 		,  		 			S Chakravarty 		,  		 			I Pomeranz 		,  		 			S M Reddy 		.  	 	 		\textit{IEEE Trans-actions on Computer-Aided Design}  		1998. 17  (12)  p. .  	 
\bibitem[Chandra and Chakrabarty (2000)]{b148}\label{b148} 	 		‘Test data compression for system-on-a-chip using Golomb codes’.  		 			A Chandra 		,  		 			K Chakrabarty 		.  	 	 		\textit{Proc. IEEE VLSI Test Symp. (VTS)},  				 (IEEE VLSI Test Symp. (VTS))  		Apr. 2000. p. .  	 
\bibitem[Larsson and Peng ()]{b89}\label{b89} 	 		‘Test infrastructure design and test scheduling optimization’.  		 			E Larsson 		,  		 			Z Peng 		.  	 	 		\textit{IEEE European Test Workshop},  				2000.  	 
\bibitem[Krstic et al. (1999)]{b6}\label{b6} 	 		‘Testing High Speed VLSI Devices Using Slower Testers’.  		 			A Krstic 		,  		 			K T Cheng 		,  		 			S T Chakradhar 		.  	 	 		\textit{IEEE VLSI Test Symp},  				May 1999. p. .  	 
\bibitem[Serra et al. (1990)]{b108}\label{b108} 	 		‘The analysis of one-dimensional linear cellular automata and their aliasing properties’.  		 			M Serra 		,  		 			T Slater 		,  		 			J C Muzio 		,  		 			M Miller 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		July 1990. 9  (7)  p. .  	 
\bibitem[The International Technology Roadmap for Semiconductors (ITRS) Edition ()]{b107}\label{b107} 	 		‘The International Technology Roadmap for Semiconductors (ITRS)’.  		 \url{http://public.itrs.net/1999SIARoadmap/Home.htm}  	 	 		\textit{Edition},  				1999. 1999.  	 	 (Semiconductor Industry Association (SIA)) 
\bibitem[Muresan et al. ()]{b96}\label{b96} 	 		‘The left edge algorithm and the tree growing technique in block-test scheduling under power constraints’.  		 			V Muresan 		,  		 			X Muresan 		,  		 			M Wang 		,  		 			Vladutiu 		.  	 	 		\textit{Proc. of the 18th IEEE VLSI Test Symposium},  				 (of the 18th IEEE VLSI Test Symposium)  		2000. p. .  	 
\bibitem[Muresan et al. ()]{b97}\label{b97} 	 		‘The left edge algorithm in block-test scheduling under power constraints’.  		 			V Muresan 		,  		 			V Muresan 		,  		 			X Wang 		,  		 			M Vladutiu 		.  	 	 		\textit{Proc. Internation Symposium on Circuits and Systems (ISCAS)},  				 (Internation Symposium on Circuits and Systems (ISCAS))  		2000.  	 
\bibitem[Marculescu et al. (2000)]{b94}\label{b94} 	 		‘Theoretical bounds for switching activity analysis in finite-state machines’.  		 			D Marculescu 		,  		 			R Marculescu 		,  		 			M Pedram 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems},  				June 2000. 8 p. .  	 
\bibitem[Tadayon ()]{b157}\label{b157} 	 		‘Thermal challenges during microprocessor testing Intel Technol’.  		 			P Tadayon 		.  	 	 		\textit{J}  		2000. 3 p. .  	 
\bibitem[Kapur and Williams (1999)]{b80}\label{b80} 	 		‘Tough challenges as design and test go nanometer’.  		 			R Kapur 		,  		 			T W Williams 		.  	 	 		\textit{Computer}  		November 1999. 32  (11)  p. .  	 
\bibitem[Tseng and Jon (1999)]{b111}\label{b111} 	 		‘Two-level logic minimization for low power’.  		 			J.-M Tseng 		,  		 			J.-Y Jon 		.  	 	 		\textit{ACM Transactions on Design Automation of Electronic Systems (TODAES)}  		January 1999. 4  (1)  p. .  	 
\bibitem[Khandros and Pedersen (2000)]{b158}\label{b158} 	 		‘Wafer-level burn-in and test’.  		 			A Y Khandros 		,  		 			D V Pedersen 		.  	 	 		\textit{Patent Office U.S. Patent}  		May 16, 2000. 6 p. .  	 
\bibitem[Maxwell (2003)]{b155}\label{b155} 	 		‘Wafer-package test mix for optimal defect detection and test time savings IEEE Des’.  		 			P C Maxwell 		.  	 	 		\textit{Test. Comput}  		Sep./Oct. 2003. 20  (5)  p. .  	 
\bibitem[Wang et al. ()]{b17}\label{b17} 	 		 			L.-T Wang 		,  		 			C.-W Wu 		,  		 			X Wen 		.  		\textit{VLSI Test Principles and Architectures: Design for Testability},  				 (San Francisco, CA)  		2006. Morgan Kaufmann.  	 
\bibitem[Lakshmi Narayana et al. (1999)]{b84}\label{b84} 	 		‘Wavesched: A novel scheduling technique for control-flow intensive designs’.  		 			G Lakshmi Narayana 		,  		 			K S Khouri 		,  		 			N K Jha 		.  	 	 		\textit{IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems}  		May 1999. 18  (5)  p. .  	 
\bibitem[Wen et al. ()]{b171}\label{b171} 	 		 			X Wen 		,  		 			Y Yamashita 		,  		 			S Kajihara 		,  		 			L T Wang 		,  		 			K K Saluja 		,  		 			K Kinoshita 		.  		\textit{on low-capture-power test generation for scan testing in Proc. VLSI Test Symp},  				2005. p. .  	 
\bibitem[Miyase and Kajihara (2004)]{b154}\label{b154} 	 		‘XID: Don"t Care Identification of Test Patterns for Combinational Circuits’.  		 			K Miyase 		,  		 			S Kajihara 		.  	 	 		\textit{IEEE Transactions on COMPUTER-AIDED DESIGN of Integrated Circuits and Systems (TCAD)},  				Feb, 2004. 23 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
