\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={Fast Implementation of Lifting Based DWT Architecture for Image Compression},
 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{2012-03-15 (revised: 15 March 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-03-15}
\title{Fast Implementation of Lifting Based DWT Architecture for Image Compression}
\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]{Dr. M.  Nagabushanam}

             \author[2]{S.  Ramachandran}

             \affil[1]{  Anna University, Coimbatore, India.}

\renewcommand\Authands{ and }

\date{\small \em Received: 6 February 2012 Accepted: 1 March 2012 Published: 15 March 2012}

\maketitle


\begin{abstract}
        


Technological growth in semiconductor industry have led to unprecedented demand for faster, area efficient and low power VLSI circuits for complex image processing applications. DWT-IDWT is one of the most popular IP that is used for image transformation. In this work, a high speed, low power DWT/IDWT architecture is designed and implemented on ASIC using 130nm Technology. 2D DWT architecture based on lifting scheme architecture uses multipliers and adders, thus consuming power. This paper addresses power reduction in multiplier by proposing a modified algorithm for BZFAD multiplier. The proposed BZFAD multiplier is 65% faster and occupies 44% less area compared with the generic multipliers. The DWT architecture designed based on modified BZFAD multiplier achieves 35% less power reduction and operates at frequency of 200MHz with latency of 1536 clock cycles for 512x512 image. The developed DWT can be used as an IP for VLSI implementation.

\end{abstract}


\keywords{DWT, Image compression, BZFAD multiplier, FPGA, Lifting scheme.}

\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 wavelet transformation is a widely used technique for image processing applications. Unlike traditional transforms such as the Fast Fourier Transform (FFT) and Discrete Cosine Transform (DCT), the Discrete Wavelet Transform (DWT) holds both time and frequency information, based on a multiresolution analysis framework. This facilitates improved quality of reconstructed picture for the same compression than is possible by other transforms. In order to implement real time Codecs based on DWT, it needs to be targeted on a fast device. Field Programmable Gate Array (FPGA) implementation of DWT results in higher processing speed and lower costs when compared to other implementations such as PCs, ARM processors, DSPs etc. The Discrete wavelet transform is therefore increasingly used for image coding \hyperref[b0]{[1]}\hyperref[b1]{[2]}\hyperref[b2]{[3]}\hyperref[b3]{[4]}. This is because the DWT can decompose the signals into different sub-bands with both time and frequency information and facilitate to arrive a high compression ratio \hyperref[b4]{[5]}. It supports features like progressive image transmission (by quality, by resolution), ease of compressed image manipulation, region of interest coding, etc.\par
The JPEG 2000 incorporates the DWT into its standard \hyperref[b5]{[6]}. Recently several VLSI architectures have been proposed to realize single chip designs for DWT \hyperref[b6]{[7]}\hyperref[b7]{[8]}\hyperref[b8]{[9]}\hyperref[b9]{[10]}. Traditionally, such algorithms were implemented using programmable DSP chips for low-rate applications or VLSI application specific integrated circuits (ASICs) for higher rates. To perform the convolution, we require a fast multiplier which is crucial in making the operations efficient. 
\section[{II.}]{II.}\par
Lifting based dwt scheme decomposition. This process is continued as per the design requirements till the requisite quality is obtained. Every stage of DWT requires LPF and HPF filters with down sampling by 2. Lifting based DWT computation is widely being adopted for image decomposition. In this work, we propose a modified architecture based on BZFAD \hyperref[b10]{[11]} multiplier to realize the lifting based DWT.\par
Lifting scheme is one of the techniques that is used to realize DWT architecture. Lifting scheme is used in order to reduce the no of operations to be performed to half and filters can be decomposed into steps in lifting scheme. The memory required and also computation is less in case of lifting scheme. The implementation of the algorithm is fast and inverse transform is also simple in this method. The Fig. \hyperref[fig_1]{2}.shows the block diagram for lifting scheme \hyperref[b11]{[12]}. The z -1 blocks are for delay, ?, ?, ?, ?, ? are the lifting coefficients and the shaded blocks are registers.9/7 filter has been used for implementation which requires four steps for lifting and one step for scaling. The input signal is x i is split into two parts even part x 2i and odd part x 2i+1 then the first step of lifting is performed given by the equations \hyperref[b12]{[13]}:d i 1 = ? (x 2i + x 2i+2 ) + x 2i+1\textbf{(1)}a i 1 = ? (d i 1 + d i 1 -1 ) + x 2i\textbf{(2)}\par
The first equation is predict P1 and second equation is update U1.Then the second lifting step is performed which gives \hyperref[b12]{[13]}:d i 2 = ? (a i 1 + a i 1 +1 ) + d i 1\textbf{(3)}a i 2 = ? (d i 2 + d i 2 -1 ) + a i 1\textbf{(4)}\par
The third equation is predict P2 and fourth equation is update U2.Then scaling is performed and the following equations are obtained \hyperref[b12]{[13]}:a i = ? a i 2 = G 1 (\textbf{5})d i = d i 2 ? ? = G 2\textbf{(6)}\par
The equations 5 and 6 are scale G 1 and G 2 respectively. The predict step helps determine the correlation between the sets of data and predicts even data samples from odd. These samples are used in the update step for updating the present phase. Some of the properties of the original input data can be maintained in the reduced set also by construction of a new operator using the update step. The lifting coefficients have constant values of -1.58613, -0.0529, 0.882911, 0.44350, -1.1496 for ?, ?, ?, ?, ? respectively. By observation of the above equations, computing the final coefficients requires 6 steps. Data travels in sequence from stage 1 to stage 6, this introduces a delay of 6 stages. To speed up the process of computation, modified lifting scheme is proposed and realized. 
\section[{III.}]{III.} 
\section[{Arithmetic building blocks for lifting scheme implementation}]{Arithmetic building blocks for lifting scheme implementation}\par
High-speed multiplication has always been a fundamental requirement of high performance systems. Multiplier structure is one of the processing element consumes the maximum area and power and also constitutes delay. Therefore there is a need for highspeed architectures for N-bit multipliers with optimized area, speed and power. Multipliers are made up of adders, to reduce the Partial Product Reduction logic delay and regularize the layout. To improve regularity and compact layout, regularly structured tree with recurring blocks and rectangular-styled tree by folding are proposed at the expense of more complicated interconnects \hyperref[b13]{[14]}. The present work focuses on multiplier design for low power applications such as DWT by rapidly reducing the partial product rows by identifying the critical paths and signal races in the multiplier. In other words, the goals have been to optimize the speed, area and power of the multiplier that form the major block in lifting based DWT. 
\section[{a) Shift and Add Multiplier}]{a) Shift and Add Multiplier}\par
In shift and add based multiplier logic, the multiplicand (A) is multiplied by multiplier (B). If the register A and B storing multiplicand and multiplier respectively is of N bit, the shift and add multiplier logic requires two N bit registers, and an N bit adder and N+1 accumulator. It also requires a N-bit counter to control the number of addition operation. In shift and add logic, the LSB bit of multiplier is checked for 1 or 0, if the LSB bit is 0, then the accumulator is shifted right by 1-position. If the LSB bit is 1 then the multiplicand is added with the accumulator content and the accumulator is shifted right by one bit position. The counter is decremented for every operation; the addition is performed until the counter is set to zero, which is indicated by the signal Ready. The multiplied product available in the accumulator of N clock cycles is the final output. Figure \hyperref[fig_2]{3}   
\section[{Bz-fad multiplier}]{Bz-fad multiplier}\par
As discussed in shift and add logic, if the LSB position is 1 then the accumulator is added with the multiplicand. If the accumulator contains more number of 1s, the adder has to add the 1 and this triggers the Full adder block within the adder. As we know that the power dissipation is due to switching activity of input lines, when ever the input or output changes, the power is switched from Vdd to Vss, thus contributing power dissipation. In order to reduce power dissipation, it is requried to reduce switching activity in the I/O lines. BZ-FAD \hyperref[b22]{[23]} logic based multiplier reduces the switching activity and thus reduces power dissipation. In shift and logic for every operation the counter keeps track of number of cycles and thus controls the multiplication operation. In a binary counter, we know that the output bit change occurs in more than one bit, for example if the counter output is 2 and is changing to 3, there are two bit change occurring. This causes switching activity, and thus can be reduced by replacing the binary counter by ring counter. In a ring counter, at any given point of time only one bit change occurs, thus reducing switching activity and power dissipation. Another major source of power dissipation in shift and add logic is, for every bit 0 of the multiplier a shift operation is performed, thus all the bits in the accumulator are shifted by one bit position, this also introduces switching and thus power dissipation. In BZ-FAD logic, if the LSB bit is 0, then the shift operation is bypassed and a zero is introduced at the MSB, thus there is no shifting of accumulator content. In other words, if the LSB is zero, the accumulator is directly fed into the adder and there is no addition, but a zero is introduced by the control logic which is like right shift operation. The architecture of this multiplier is shown in Figure  {\ref 4}. Fig.  {\ref 4} : Low power multiplier architecture \hyperref[b15]{[16]} As the BZFAD, the control activity of ring counter, latch and bypass logic is realized using NMOS transistors, this introduces delay. The parasitic capacitance of NMOS transistors also increases the load capacitance and thus increases power dissipation. In order to reduce power dissipation we have replaced the transistor logic by MUX logic that have been designed to have ideal fanin and fanout capacitances. With MUX based logic the control signals can be suitably controlled to reduces switching activity as they are enabled only when required, based on the inputs derived from ring counter. However, the design requires more number of transistors and thus increases the chip area. We have also used the ripple carry adder which has the least average transition per addition among the look ahead, carry skip, carry-select and conditional sum adders to reduce power dissipation. Various multipliers are modeled in HDL and are analyzed for their performances and the results are tabulated for comparison. Next section discusses the comparison results of multiplier algorithms. 
\section[{a) Comparison of Results}]{a) Comparison of Results}\par
In this section, comparison of power, area for different types of multiplier with modified multiplier (BZ-FAD) is discussed. The results reveal that the modified BZ-FAD multiplier may be considered as a very lowpower, yet highly area efficient multiplier.     linearly with the input data width. This leads to a small increase in the leakage power which, as the results reveal, is less than the overall power reduction. The leakage power of the 8-bit BZFAD architecture is about 11\% more than that of the conventional architecture but the contribution of the leakage power in these multipliers is less than 3\% of the total power for the technology used in this work. Finally, note that since the critical paths for both architectures are the same neither of the two architectures has a speed advantage over the other.  
\section[{Discrete wavelet transform and Inverse Discrete wavelet transform implementation}]{Discrete wavelet transform and Inverse Discrete wavelet transform implementation}\par
The discrete wavelet transform (DWT) is being increasingly used for image coding. This is due to the fact that DWT supports features like progressive image transmission (by quality, by resolution), ease of compressed image manipulation, region of interest coding, etc. DWT has traditionally been implemented by convolution. Such an implementation demands both a large number of computations and a large storage features that are not desirable for either high-speed or low-power applications. Recently, a lifting-based scheme that often requires far fewer computations has been proposed for the DWT \hyperref[b19]{[20,}\hyperref[b20]{21,}\hyperref[b21]{22]}. The main feature of the lifting based DWT scheme is to break up the high pass and low pass filters into a sequence of upper and lower triangular matrices and convert the implementation into banded matrix multiplications. Such a scheme has several advantages, including "in-place" computation of the DWT, integer-to-integer wavelet transform (IWT), symmetric forward and inverse transform, etc. Therefore, it comes as no surprise that lifting has been chosen in the upcoming.\par
The proposed architecture computes multilevel DWT for both the forward and the inverse transforms one level at a time, in a row-column fashion. There are two row processors to compute along the rows and two column processors to compute along the columns. While this arrangement is suitable or filters that require two banded-matrix multiplications filters that require four banded-matrix multiplications require all four processors to compute along the rows or along the columns. The outputs generated by the row and column processors (that are used for further computations) are stored in memory modules.\par
The memory modules are divided into multiple banks to accommodate high computational bandwidth requirements. The proposed architecture is an extension of the architecture for the forward transform that was presented. A number of architectures have been proposed for calculation of the convolution-based DWT. The architectures are mostly folded and can be broadly classified into serial architectures (where the inputs are supplied to the filters in a serial manner) and parallel architectures (where the inputs are supplied to the filters in a parallel manner).\par
Recently, a methodology for implementing lifting-based DWT thatreduces the memoryrequirements and communication between the processors, when the image isbroken up into blocks. For a system that consists of the lifting-based DWT transform followed by an embedded zero-tree algorithm, a new interleaving scheme that reduces the number of memory accesses has been proposed. Finally, a lifting-based DWT architecture capable of performing filters with one lifting step, i.e., one predict and one update step. The outputs are generated in an interleaved fashion. The Discrete wavelet transforms and inverse discrete wavelet transform operates at a maximum clock frequency of 200MHz. the discrete wavelet transforms and inverse discrete wavelet transform is synthesized by using design compiler. The design of DWT and IDWT is checked design for testability. Every time checked( D D D D ) F 2012 Year h(i) =x(2i+1)+?(x(2i)+x(2i+2)) l(i)=x(2i)+?(h(i)+h(i-1)) hh(i, j) = h(2i +1, j) +? (h(2i, j) + h(2i + 2, j)) hl(i, j) = h(2i, j) + ? (hh(i, j) + hh(i ?1, j)) lh(i, j) = l(2i +1, j) +? (l(2i, j) + l(2i + 2, j))\par
ll(i, j) = l(2i, j) + ? (lh(i, j) + lh(i ?1, j)) l(2i,j)= ll(i,j)-?(lh(i,j)+lh(i-1,j)) l(2i+1,j)= lh(i,j)-?(L(2i,j)+l(2i+2,j)) h(2i,j)= hl(i,j)-?(hh(i,j)+hh(i-1,j)) h(2i+1,j)= hh(i,j)-?(h(2i,j)+h(2i+2,j))\par
x(i,2j) = l(i,j)-?(h(i,j)+h(i,j-1))\par
x(i,2j+1) = h(i,j)-?(x(i,2j)+x(i,2j+2)) timing reports and the power report is taken from the primetime. The architectures for DWT and IDWT perform compression and decompression in (4N 2 (1?4? j )   + 9N )/6 computation time. The total power consumption of the DWT/IDWT processor is \textasciitilde 0.367mW. The area of the designed architecture in 0.13 micron technology is 112 X 114 um square, and the frequency of operation is 200 MHz for discrete wavelet transform. 
\section[{VI.}]{VI.} 
\section[{Conclusion}]{Conclusion}\par
In this work low-power architecture for shift-andadd multipliers is proposed and implemented. The conventional architecture has been modified by removing the shift operation of the B register (in A × B), direct feeding of A to the adder, bypassing the adder whenever possible, use of a ring counter instead of the binary counter, and removal of the partial product shifter. The BZ-FAD multiplier is further modified using multiplexers and XOR gates, the modified multiplier is modeled and implemented using 130nm technology. The modified multiplier is used in constructing lifting based DWT/IDWT architecture. The DWT/IDWT architecture is modeled and synthesized using TSMC libraries. The BZ-FAD multiplier based DWT/IDWT architecture reduces power dissipation by 30\% and operates at 200 MHz. The adders in the lifting based DWT/IDWT can be further improved by replacing the adders by low power adders.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}FigFigure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Fig. 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Fig. 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-7.png}
\caption{\label{fig_7}Figure 2 .}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.2963815789473684\textwidth}P{0.008388157894736842\textwidth}P{0.17335526315789473\textwidth}P{0.13980263157894737\textwidth}P{0.10904605263157895\textwidth}P{0.12302631578947369\textwidth}}
\tabcellsep \tabcellsep \multicolumn{3}{l}{other multipliers}\\
\multicolumn{2}{l}{Multipliers}\tabcellsep Total Dynamic power (w)\tabcellsep Cell Internal Power (µw)\tabcellsep Net Switching Power\tabcellsep Cell Leakage power (µw)\\
\multicolumn{2}{l}{Modified}\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{BZ-FAD}\tabcellsep 126\tabcellsep 91.02\tabcellsep 21.2\tabcellsep 13.78\\
\multicolumn{2}{l}{Multiplier}\tabcellsep \tabcellsep \tabcellsep \\
Shift\tabcellsep and\tabcellsep \tabcellsep \tabcellsep \\
Add\tabcellsep \tabcellsep 194\tabcellsep 166.9\tabcellsep 15.2\tabcellsep 11.9\\
\multicolumn{2}{l}{Multiplier}\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{Booth Multiplier}\tabcellsep 379.12\tabcellsep 295.62\tabcellsep 62.2\tabcellsep 21.3\\
\multicolumn{2}{l}{Array Multiplier}\tabcellsep 231.5\tabcellsep 145.4\tabcellsep 66.3\tabcellsep 19.8\\
Wallace\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Tree\tabcellsep \tabcellsep 289.9\tabcellsep 195.9\tabcellsep 76.9\tabcellsep 17.1\\
\multicolumn{2}{l}{Multiplier}\tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.3330223880597015\textwidth}P{0.18395522388059699\textwidth}P{0.07611940298507462\textwidth}P{0.08563432835820896\textwidth}P{0.08246268656716418\textwidth}P{0.08880597014925373\textwidth}}
Multiplie\tabcellsep Total\tabcellsep Num\tabcellsep Nu\tabcellsep Num\tabcellsep Number\\
rs\tabcellsep Cell\tabcellsep ber of\tabcellsep mbe\tabcellsep ber\tabcellsep of\\
\tabcellsep Area\tabcellsep Ports\tabcellsep r of\tabcellsep of\tabcellsep Referen\\
\tabcellsep (µm2)\tabcellsep \tabcellsep nets\tabcellsep cells\tabcellsep ces\\
BZ-FAD Multiplier\tabcellsep 2479.9 0\tabcellsep 35\tabcellsep 133\tabcellsep 74\tabcellsep 43\\
Shift and\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Add Multiplier\tabcellsep 1726.2 5\tabcellsep 35\tabcellsep 99\tabcellsep 43\tabcellsep 12\\
Booth Multiplier\tabcellsep 4459.0 6\tabcellsep 34\tabcellsep 233\tabcellsep 163\tabcellsep 32\\
Array Multiplier\tabcellsep 3213.2 7\tabcellsep 34\tabcellsep 228\tabcellsep 156\tabcellsep 66\\
Wallace\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Tree Multiplier\tabcellsep 3476.2 7\tabcellsep 34\tabcellsep 241\tabcellsep 160\tabcellsep 67\end{longtable} \par
 
\caption{\label{tab_1}Table 2 :}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Kang and Gaudiot (2004)]{b18}\label{b18} 	 		‘A Fast and Well structured Multiplier’.  		 			J-Y Kang 		,  		 			J-L Gaudiot 		.  	 	 		\textit{EUROMICRO Symp. Digital System Design},  				Aug 2004. p. .  	 
\bibitem[Kuan et al. (2007)]{b10}\label{b10} 	 		‘A Low-Power Multiplier with the Spurious Power Suppression Technique’.  		 			Hung Kuan 		,  		 			Yuan-Sun Chen 		,  		 			Chu 		.  	 	 		\textit{IEEE Trans. On Very Large Scale Integration (VLSI) Systems}  		July 2007. 15  (7)  p. .  	 
\bibitem[Movva and Srinivasan (2003)]{b12}\label{b12} 	 		‘A novel architecture for lifting-based discrete wavelet transform for JPEG2000 standard suitable for VLSI Implementation" VLSI Design’.  		 			S Movva 		,  		 			S Srinivasan 		.  	 	 		\textit{Proceedings. 16 th International Conference On 4-8},  				 (16 th International Conference On 4-8Page(s)  		2003. Jan. 2003. p. .  	 
\bibitem[Dusansuvakovic and Andre ()]{b13}\label{b13} 	 		‘A Pipelined Multiply-Accumulate Unit Design for Energy Recovery DSP Systems’.  		 			C Dusansuvakovic 		,  		 			Salama Andre 		.  	 	 		\textit{IEEE International Symposium on Circuits and Systems},  				May 28-31, 2000.  	 
\bibitem[Kang and Gaudiot (2006)]{b14}\label{b14} 	 		‘A Simple High-Speed Multiplier Design’.  		 			Jung-Yup Kang 		,  		 			Jean-Luc Gaudiot 		.  	 	 		\textit{IEEE Transactions on computers}  		October 2006. 55  (10)  p. .  	 
\bibitem[Wallace ()]{b16}\label{b16} 	 		‘A Suggestion for a Fast Multiplier’.  		 			C S Wallace 		.  	 	 		\textit{IEEE Trans. computers}  		1964. 13  (2)  p. .  	 
\bibitem[Andra and Chaitalichakrabarti (2002)]{b11}\label{b11} 	 		‘A VLSI Architecture for Lifting-Based Forward and Inverse Wavelet Transform’.  		 			Kishore Andra 		,  		 			Tinkuacharya Chaitalichakrabarti 		.  	 	 		\textit{IEEE Transaction on signal processing}  		April 2002. 50  (4)  p. .  	 
\bibitem[Motra et al. (2003)]{b2}\label{b2} 	 		‘An efficient hardware implementation of DWT and IDWT’.  		 			A S Motra 		,  		 			P K Bora 		,  		 			I Chakrabarti 		.  	 	 		\textit{Conference on Convergent Technologies for Asia-Pacific Region},  				October 2003. p. .  	 
\bibitem[Mottaghi-Dastjerdi et al. (2009)]{b22}\label{b22} 	 		‘BZ-FAD: A Low-Power Low-Area Multiplier Based on Shift-and-Add Architecture’.  		 			M Mottaghi-Dastjerdi 		,  		 			A Afzali-Kusha 		,  		 			M Pedram 		.  	 	 		\textit{IEEE Transactions on Very large Scale Integration (VLSI)systems},  				feb 2009. 17.  	 
\bibitem[Vojin et al. (2005)]{b17}\label{b17} 	 		‘Comparison of high-performance VLSI adders in the energy-delay space’.  		 			G Vojin 		,  		 			Bart R Oklobzija 		,  		 			Zaydel 		,  		 			Q Hoang 		,  		 			Sanu Dao 		,  		 			Ram Mathew 		,  		 			Krishnamurthy 		.  	 	 		\textit{IEEE Trans. VLSI Systems}  		June 2005. 13  (6)  p. .  	 
\bibitem[Nagabushanam et al. ()]{b21}\label{b21} 	 		‘Design and FPGA implementation of Modified Distributive arithmetic based DWT-IDWT processor for image compression’.  		 			M Nagabushanam 		,  		 			Cyril Prasanna Raj 		,  		 			S Ramachandran 		.  	 	 		\textit{International Conference on Communication and Signal Processing},  				 (February, NIT, Calicut, India)  		2011. p. 69.  	 
\bibitem[Nagabushanam et al. ()]{b20}\label{b20} 	 		‘Design and implementation of parallel and pipelined Distributive arithmetic based discrete wavelet transform IP core’.  		 			M Nagabushanam 		,  		 			Cyril Prasanna Raj 		,  		 			S Ramachandran 		.  	 	 		\textit{EJSR International Journal}  		2009. 35  (3)  p. .  	 
\bibitem[Chang and Li (2001)]{b3}\label{b3} 	 		‘Design of highly efficient VLSI architectures for 2-D DWT and 2-D IDWT’.  		 			Yun-Nan Chang 		,  		 			Yan-Sheng Li 		.  	 	 		\textit{IEEE Workshop on Signal Processing Systems}  		September 2001. p. .  	 
\bibitem[Tsai and Bdti]{b7}\label{b7} 	 		\textit{Designing Low-Power Signal Processing Systems},  		 			Mel Tsai 		,  		 			Bdti 		.  		 \url{http://www.dspdesignline.com/showArticle.jhtml?articleID=187002923}  		 	 
\bibitem[Borgio et al. (2006)]{b6}\label{b6} 	 		‘Hardware DWT accelerator for MultiProcessor System-on-Chip on FPGA’.  		 			Simone Borgio 		,  		 			Davidebosisio 		,  		 			Fabrizioferrandi 		,  		 			Marco D Matteomonchiero 		,  		 			Donatella Santambrogio 		,  		 			Antoninotumeo Sciuto 		.  	 	 		\textit{Embedded Computer Systems: Architectures, Modeling and Simulation},  				2006. 2006. July 2006. p. .  	 
\bibitem[Huang and Ercegovac (2005)]{b15}\label{b15} 	 		‘Highperformance Low-power Left-to-Right Array Multiplier Design’.  		 			Zhijun Huang 		,  		 			Milos D Ercegovac 		.  	 	 		\textit{IEEE Transactions on computers}  		Mar 2005. 54  (3)  p. .  	 
\bibitem[Taubman and Marcellin ()]{b5}\label{b5} 	 		\textit{JPEG 2000 -Image compression, fundamentals, standards and practice},  		 			David S Taubman 		,  		 			Michael W Marcellin 		.  		2002. Kluwer academic publishers.  	 	 (Second Edition) 
\bibitem[Baloch et al. ()]{b9}\label{b9} 	 		‘Low power domain-specific reconfigurable array for discrete wavelet transforms targeting multimedia applications’.  		 			S Baloch 		,  		 			I Ahmed 		,  		 			T Arslan 		,  		 			A Stoica 		.  	 	 		\textit{International Conference on Field Programmable Logic and Applications},  				2005. p. .  	 	 (International Conference on Field Programmable Logic and Applications) 
\bibitem[Tze-Yun ()]{b8}\label{b8} 	 		‘Low-power and high-performance 2-D DWT and IDWT architectures based on 4-tap Daubechies filters’.  		 			Tze-Yun 		.  	 	 		\textit{Proceedings of the 7th WSEAS International Conference on Multimedia Systems and Signal Processing},  				 (the 7th WSEAS International Conference on Multimedia Systems and Signal ProcessingHangzhou, China)  		2007. p. .  	 
\bibitem[Sung et al. (2006)]{b0}\label{b0} 	 		‘Low-Power Multiplierless 2-D DWT and IDWT Architectures Using 4-tap Daubechies Filters’.  		 			Tze-Yun Sung 		,  		 			Hsi-Chin Hsin Yaw-Shih 		,  		 			Chun-Wang Shieh 		,  		 			Yu 		.  	 	 		\textit{Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies},  				December 2006.  	 
\bibitem[Nagabushanam et al.]{b19}\label{b19} 	 		‘ModifiedVLSI implementation of DA-DWT for image compression’.  		 			M Nagabushanam 		,  		 			Cyril Prasanna Raj 		,  		 			S Ramachandran 		.  	 	 		\textit{International Journal of Signal and Imaging Systems Engineering}  		x  (x) .  	 
\bibitem[Keshab et al. (1993)]{b4}\label{b4} 	 		‘VLSI architectures for discrete wavelet transforms’.  		 			K Keshab 		,  		 			Takao Parhi 		,  		 			Nishitani 		.  	 	 		\textit{IEEE Transactions on Very Large Scale Integration (VLSI) Systems},  				June 1993. 1 p. .  	 
\bibitem[Abdullah et al. (2004)]{b1}\label{b1} 	 		‘VLSI Implementation of Discrete Wavelet Transform (DWT) for Image Compression’.  		 			A L Abdullah 		,  		 			Md Muhit 		,  		 			Masuri Islam 		,  		 			Othman 		.  	 	 		\textit{2nd International Conference on Autonomous Robots and Agents},  				December 2004. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
