\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={Modified Distributive Arithmetic based 2d-Dwt for Hybrid (Neural Network-Dwt) 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Modified Distributive Arithmetic based 2d-Dwt for Hybrid (Neural Network-Dwt) 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]{Mr. Murali  Mohan.S}

             \author[2]{Dr.  P.Satyanarayana}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 16 December 2013 Accepted: 2 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Artificial Neural Networks (ANN) is significantly used in signal and image processing techniques for pattern recognition and template matching. Discrete Wavelet Transform (DWT) is combined with neural network to achieve higher compression if 2D data such as image. Image compression using neural network and DWT have shown superior results over classical techniques, with 70% higher compression and 20% improvement in Mean Square Error (MSE). Hardware complexity and power  issipation are the major challenges that have been addressed in this work for VLSI implementation. In this work, modified distributive arithmetic DWT and multiplexer based DWT architecture are designed to reduce the computation complexity of hybrid architecture for image compression. A 2D DWT architecture is designed with 1D DWT architecture and is implemented on FPGA that operates at 268 MHz consuming power less than 1W.

\end{abstract}


\keywords{DWT, neural network, image compression, VLSI implementation, high speed, low power, modified DAA.}

\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
mage compression is one of the most promising subjects in image processing. Images captured need to be stored or transmitted over long distances. Raw image occupies memory and hence need to be compressed. With the demand for high quality video on mobile platforms there is a need to compress raw images and reproduce the images without any degradation. Several standards such as JPEG200, MPEG-2/4 recommend use of Discrete Wavelet Transforms (DWT) for image transformation \hyperref[b0]{[1]} which leads to compression with when encoded. Wavelets are a mathematical tool for hierarchically decomposing functions in multiple hierarchical sub bands with time scale resolutions. Image compression using Wavelet Transforms is a powerful method that is preferred by scientists to get the compressed images at higher compression ratios with higher PSNR values \hyperref[b1]{[2]}. It is a popular transform used for some of the image compression standards in lossy compression methods. Unlike the discrete cosine transform, the wavelet transform is not Fourier-based and therefore wavelets do a better job of handling discontinuities in data. On the other hand, Artificial Neural Networks (ANN) for image compression applications has marginally increased in recent years. Neural networks are inherent adaptive systems \hyperref[b2]{[3]}[4] \hyperref[b4]{[5]} \hyperref[b5]{[6]}; they are suitable for handling nonstationaries in image data. Artificial neural network can be employed with success to image compression. Image Compression Using Neural Networks by Ivan Vilovic \hyperref[b6]{[7]} reveals a direct solution method for image compression using the neural networks. An experience of using multilayer perceptron for image compression is also presented. The multilayer perceptron is used for transform coding of the image. Image compression with neural networks by J. Jiang \hyperref[b7]{[8]} presents an extensive survey on the development of neural networks for image compression which covers three categories: direct image compression by neural networks; neural network implementation of existing techniques, and neural network based technology which provide improvement over traditional algorithms. Neural Networks-based Image Compression System by H. Nait Charif and Fathi. M. Salam \hyperref[b8]{[9]} describes a practical and effective image compression system based on multilayer neural networks. The system consists of two multilayer neural networks that compress the image in two stages. The algorithms and architectures reported in these papers sub divided the images into sub blocks and the sub blocks are reorganized for processing. Reordering of sub blocks leads to blocking artifacts. Hence it is required to avoid reorganization of sub blocks. One of the methods was to combine neural networks with wavelets for image compression. Image compression using wavelet transform and a neural network was suggested previously \hyperref[b9]{[10]}. Wavelet networks (WNs) were introduced by Zhang and Benveniste \hyperref[b10]{[11]}, \hyperref[b11]{[12]} in 1992 as a combination of artificial neural networks and wavelet decomposition. Since then, however, WNs have received only little attention. In the wavelet networks, the basis radial functions in some RBF-networks are replaced by wavelets. Szu et al. \hyperref[b12]{[13]}, \hyperref[b14]{[14]} have shown usage of WNs for signals representation and classification. They have explained how a set of WN, "a super wavelet", can be produced and the original ideas presented can be used for the assortment of model. Besides, they have mentioned the big compression of data achieved by such a representation of WN's. Zhang \hyperref[b15]{[15]} has proved that the WN's can manipulate the non-linear regression of the moderately big dimension of entry with the data of training. Ramanaiah and Cyril \hyperref[b16]{[16]} in their paper have reported the use of neural networks and wavelets for image compression. Murali et al. \hyperref[b17]{[17]} reports use of neural networks with DWT improves compression ratio by 70\% and MSE by 20\%. The complexities of hardware implementation on VLSI platform are not discussed in this paper. Murali et. al \hyperref[b18]{[18]} reports the use of FPGA for implementation of neural network and DWT architecture, the design operates are 127 MHz and consumes 0.45 mW on Virtex-5 FPGAs. Sangyun et. al., \hyperref[b19]{[19]} in their work have proposed a new logic for distributive arithmetic algorithm and have designed for FIR filters. The develop logic is optimized for low power applications. In their work, the LUT coefficients are computed based on a suitable number system, and are stored in LUT. Low power techniques such as block enabling logic, memory bank logic and clock gating logic have been used for optimization. However, the work does not consider the FPGA resources for power optimization; as well the developed architecture is suitable for higher order filter coefficients. Hence there is a need for customized architecture for DWT filters that can efficiently utilize the FPGA resources. Cyril P. Raj, et. al., \hyperref[b20]{[20]} in their work have developed a parallel and pipelined distributive arithmetic architecture for DWT, the design achieves higher throughput and lower latency, but consumes large area on FPGA. The symmetric property of DWT coefficients have not been used to reduce hardware complexities. Chengjun Zhang, Chunyan Wang, and M. Omair Ahmad \hyperref[b21]{[21]} propose a scheme for the design of pipeline architecture for fast computation of the DWT is developed. The goal of fast computation is achieved by minimizing the number and period of clock cycles. The main idea used for minimizing these two parameters is to optimally distribute the task of the DWT computation among the stages of the pipeline and to maximize the inter-and intra-stage parallelisms of the pipeline. In this paper 2D-DWT architecture is designed and implemented on VLSI platform for optimizing area, timing and power. Section II presents theoretical background on neural networks and DWT. Section III discusses the image compression architecture using DWT and ANN technique, section IV presents VLSI implementation of DWT architecture and conclusion is presented in section V. 
\section[{II. Neural Networks and dwt}]{II. Neural Networks and dwt}\par
In this section, neural network architecture for image compression is discussed. Feed forward neural network architecture and back propagation algorithm for training is presented. DWT based image transformation and compression is also presented in this section.\par
Compression is one of the major subject of research, the need for compression is discussed as follows \hyperref[b17]{[17]}: Uncompressed video of size 640 x 480 resolution, with each pixel of 8 bit (1 bytes), with 24 fps occupies 307.2 Kbytes per image (frame) or 7.37 Mbytes per second or 442 Mbytes per minute or 26.5 Gbytes per hour. If the frame rate is increased from 24 fps to 30 fps, then for 640 x 480 resolution, 24 bit (3 bytes) colour, 30 fps occupies 921.6 Kbytes per image (frame) or 27.6 Mbytes per second or 1.66 Gbytes per minute or 99.5 Gbytes per hour. Given a 100 Gigabyte disk can store about 1-4 hours of high quality video, with channel data rate of 64Kbits/sec -40 -438 secs/per frame transmission. For HDTV with 720 x 1280 pixels/frame, progressive scanning at 60 frames/s: 1.3Gb/s -with 20Mb/s available -70\% compression required -0.35bpp. In this work we propose a novel architecture based on neural network and DWT \hyperref[b18]{[18]}. a) Feed forward neural network architecture for image compression An Artificial Neural Network (ANN) is an information-processing paradigm that is inspired by the way biological nervous systems, such as the Brian, process information \hyperref[b16]{[16]}. The key element of this paradigm is the novel structure of the information processing system. The basic architecture for image compression using neural network is shown in fig. \hyperref[fig_0]{1}. The network has input layer, hidden layer and output layer. Inputs from the image are fed into the network, which are passed through the multi layered neural network. The input to the network is the original image and the output obtained is the reconstructed image. The output obtained at the hidden layer is the compressed image. The network is used for image compression by breaking it in two parts as shown in the Fig. \hyperref[fig_0]{1}. The transmitter encodes and then transmits the output of the hidden layer (only 16 values as compared to the 64 values of the original image). The receiver receives and decodes the 16 hidden outputs and generates the 64 outputs. Since the network is implementing an identity map, the output at the receiver is an exact reconstruction of the original image.\par
Three layers, one input layer, one output layer and one hidden layer, are designed. The input layer and output layer are fully connected to the hidden layer. Compression is achieved by designing the network such that the number of neurons at the hidden layer is less than that of neurons at both input and the output layers. The input image is split up into blocks or vectors of 8 X8, 4 X 4 or 16 X 16 pixels. Back-propagation is one of the neural networks which are directly applied to image compression coding \hyperref[b20]{[20]}[21] \hyperref[b22]{[22]}.\par
In the previous sections theory on the basic structure of the neuron was considered. The essence of the neural networks lies in the way the weights are updated. The updating of the weights is through a definite algorithm. In this paper Back Propagation (BP) algorithm is studied and implemented.  
\section[{b) DWT for Image Compression}]{b) DWT for Image Compression}\par
The DWT represents the signal in dynamic subband decomposition. Generation of the DWT in a wavelet packet allows sub-band analysis without the constraint of dynamic decomposition. The discrete wavelet packet transform (DWPT) performs an adaptive decomposition of frequency axis. The specific decomposition will be selected according to an optimization criterion. The Discrete Wavelet Transform (DWT), based on time-scale representation, provides efficient multi-resolution sub-band decomposition of signals. It has become a powerful tool for signal processing and finds numerous applications in various fields such as audio compression, pattern recognition, texture discrimination, computer graphics \hyperref[b24]{[24]}[25] \hyperref[b26]{[26]} etc. Specifically the 2-D DWT and its counterpart 2-D Inverse DWT (IDWT) play a significant role in many image/video coding applications. Fig. \hyperref[fig_1]{2} shows the DWT architecture, the input image is decomposed into high pass and low pass components using HPF and LPF filters giving rise to the first level of hierarchy. The process is continued until multiple hierarchies are obtained. A1 and D1 are the approximation and detail filters.      \hyperref[b16]{[16]} Several images are considered for training the network, the input image is resized to 256 x 256, the resized image is transformed using DWT, 2D DWT function is used for the transformation. There is several wavelet functions, in this work Haar and dB4 wavelet functions are used. The input image is decomposed to obtain the sub band components using several stages of DWT. The DWT process is stopped until the sub band size is 8 x 8. The decomposed sub band components are rearranged to column vectors; the rearranged vectors are concatenated to matrix and are set at the input to the neural network. The hidden layer is realized using 4 neurons and tansig function. The weights are biases obtained after training are used to compress the input to the required size and is further processed using weights and biases in the output layer to decompress. The decompressed is further converted from vector to blocks of sub bands. The sub band components are grouped together and are transformed using inverse DWT. The transformation is done using multiple hierarchies and the original image is reconstructed. The input image and the output image are used to compute MSE, PSNR. A detailed discussion on DWT with NN for image compression and the performance results are presented in \hyperref[b17]{[17]} \hyperref[b18]{[18]}. One of the major challenges in this work is the hardware complexity of DWT and NN architecture. In order to reduce the computation complexity on hardware platform, in this work a modified architecture for DWT is proposed, design, modeled and implemented on VLSI platform. Next section discusses the modified architecture. 
\section[{IV. Distributive Arithmetic Architecture}]{IV. Distributive Arithmetic Architecture}\par
for FIR Filters DWT is realized using low pass and high pass FIR filters. In an FIR filter, the incoming signal is processed by the filter coefficients to produce the output samples. The filters coefficients are designed or identified based on the required specifications and are used in design of filter architecture. Fig. \hyperref[fig_6]{9} shows the basic block of FIR filter. The relation between input, output and filter coefficients are related using convolution sum. ()\textbf{1}\par
The convolution operation is basically sum of products. Thus the convolution operation in equation ( \hyperref[formula_0]{1}) can be expressed as in equation ( \hyperref[formula_1]{2})Y k = ? H k N k?1 X k\textbf{(2)}\par
X k = Input samples, H k = Filter coefficients, Y k = Output and N = Filter order length In general X k and Y k are represented using 2's complement number system. Thus representing both positive and negative values of input and filter samples. In 2's complement format X k is represented as,X k = \{b k0 , b k1 , b k2 ? ? b kL ?1 \}\par
, where L is the number of bits or word length. In 2's complement number system MSB = 1 implies it is a negative number and thus sign extension is carried out. For analysis X k can be mathematically represented as in equation (  {\ref 3})X k = ?b k0 + ? b kn 2 ?n L?1 n=1\par
(3) Where b k0 = sign bit and b kn = binary bits representing magnitude. Substituting (3) in (2), equation ( \hyperref[formula_0]{1}) can be expressed as in equation ( \hyperref[formula_4]{4})Y = ? H k [?b k0 + ? b kn 2 ?n L?1 n=1 ] N k=1\textbf{(4)}\par
Rearranging . equation (4), equation (  {\ref 5}) is obtained,?? = ? ?? ?? ?? ?? ???? ?? ??=1 ? ?? ??=1 2 ??? + ? ?? ?? (??? ??0 ) ?? ??=1\par
?? = 1 (5) equation (  {\ref 5}) has two terms, the first term is with the magnitude and the second term is with the sign bit. Considering 1st term in equation (  {\ref 5})?? = ? ?? ?? ?? ?? ???? ?? ??=1 ?2 ??? ?? ??=1\par
Which can be expanded for every value of n. Assuming k=4 and expanding term ?? = ?? ?? ?? ?? ??1 ?? ??=1\par
?2 ??? can be written as Year 2014 F be used as address to the memory and can be used to access the memory contents. Thus avoiding multiplication process. 3. The equation (  {\ref 7}) is similar to equation (  {\ref 6}), the only difference is the binary bits are the second MSB bits of input samples. Similarly, as discussed previously there are 16 possible combinations of partial products that can be accessed. 4. Comparing equation (  {\ref 6}) to equation \hyperref[b6]{(7)}, each bit of input samples are used in accessing the memory contents and have to be added with the previous partial products. Before every addition is performed the partial products are to be right shifted by 1 bit position as the terms 2 -1 , 2 -2 and so on. Thus the term ?? ?? ?? ?? ???? ?? ??=1?? = ?? 1 ?? 11 2 ?1 + ?? 2 ?? 21 2 ?1 + ?? 3 ?? 31 2 ?1 + ?? 4 ?? 41 2 ?1 for n=1 (6) ?? = ?? 1 ?? 12 2 ?2 + ?? 2 ?? 22 2 ?2 + ?? 3 ?? 32 2 ?2 + ?? 4 ?? 42 2 ?2 for n=2 (7) ?? = ?? 1 ?? 13 2 ?3 + ?? 2 ?? 23 2 ?3 + ?? 3 ?? 33 2 ?3 + ?? 4 ?? 43 2 ?3 for n=3\textbf{(}\par
?2 ??? has 2 ?? possible values. The coefficients are fixed and hence 2 ?? combination of coefficients can be pre-computed and stored in a LUT (ROM). The LUT depth is2 ?? , and width of LUT can be (L+1), where L is the maximum width of filter coefficients Fig. \hyperref[fig_8]{10} shows the top level block diagram of DA algorithm. The DA architecture consists of input registers, which are SISO registers that can be sequentially loaded with the input samples. The limitations of DA architecture is that as the number of inputs increase from 8 to 16, the size of LUT is 216. In order to reduce the LUT size, the inut sample accesses the bottom LUT. The size of top and bottom LUT is 24, and thus the total size of the LUT is 32. As the LUTs are split into two sections, the output of each LUT is independent and the accumulated data is further added to compute the final output. In the split DA architecture shown in Fig. \hyperref[fig_9]{11}  In this work, 9/7 filter based DWT is chosen for modulation and demodulation. Table \hyperref[tab_0]{1} shows the 9/7 filter coefficients. As there exist symmetry in the 9/7 filter coefficients, the modified equations for high pass and low pass filters can be expressed as follows: From the Table \hyperref[tab_0]{1}, as there are 9 low pass filter coefficients, and 7 high pass filter coefficients, the output samples can be expressed as in equation \hyperref[b9]{(10)} and equation (  {\ref 11}) respectively.?? ?? = ?? 0 ? 0 + ?? 1 ? 1 + ?? 2 ? 2 + ?? 3 ? 3 + ?? 4 ? 4 + ?? 5 ? 5 + ?? 6 ? 6 + ?? 7 ? 7 + ?? 8 ? 8 (10) ?? ?? = ?? 0 ð??"ð??" 0 + ?? 1 ð??"ð??" 1 + ?? 2 ð??"ð??" 2 + ?? 3 ð??"ð??" 3 + ?? 4 ð??"ð??" 4 + ?? 5 ð??"ð??" 5 + ?? 6 ð??"ð??" 6 (11)\par
In order to realize the low pass and high pass filters using DA logic the depth of low pass LUT will be 2 9 and high pass LUT will be 2 7 . In order to optimize the size of LUT, the symmetric property of filter coefficients are considered and the equation \hyperref[b9]{(10)} and equation \hyperref[b10]{(11)} are rewritten as in equation ( \hyperref[formula_9]{12}) and equation \hyperref[b12]{(13)},?? ?? = ?? 0 ? 0 + (?? 1 + ?? 8 )? 1 + (?? 2 + ?? 7 )? 2 + (?? 3 + ?? 6 )? 3 + (?? 4 + ?? 5 )? 4 (\textbf{12})\par
?? ?? = ?? 0 ð??"ð??" 0 + (?? 1 + ?? 6 )ð??"ð??" 1 + (?? 2 + ?? 5 )ð??"ð??" 2 + (?? 3 + ?? 4 )ð??"ð??" 3 \hyperref[b12]{(13)} Thus in order to realize the filter the low pass LUT depth is 2 5 and high pass LUT depth is 2 4 . Thus the total depth of LUT for DWT computation is (2 5 +2 4 ) compared to the original LUT depth of (2 9 +2 7 ). Thus the memory size is reduced by 97.5\%. However, it is observed that the number of adders required is 5 and 4 for the low pass and high pass filter respectively. In this research work, one of the major contributions is the design of DA architecture that combines split DA logic with symmetric property of filters. The modified DA architecture is shown in Fig. \hyperref[fig_10]{12}. In the modified DA logic, the input samples are sequentially loaded into the SISO registers, it requires 8*9 clock cycles (the width of input samples are considered to be 8 bit wide), after the initial load operations are performed, the input samples are added using the first stage adders and the out of the adder is stored in the second stage PISO register, the addition and loading of second stage PISO register requires one clock cycle. The PISO registers in the second stage are split into two halves, and are further used in accessing the LUTs. As two PISO registers accesses one LUT, the LUT depth is 4. The bottom LUT is accessed by 3 PISO registers, and thus the depth is 8. The total LUT size (depth) is 12  {\ref (8 + 4)}. The output of each LUT is accumulated to compute the final output of the low pass filter used in DWT. Thus the number of adders required for low pass output filter computation is 7 and the LUT depth is 12. Similarly the architecture for high pass filter using modified DA logic can be designed. Fig. \hyperref[fig_11]{13} shows the modified DA logic for high pass filter used in DWT. The depth of LUT is 8 (4 + 4), and the number of adders required are 6. The PISO registers are used in accessing the LUTs and thus it requires 9 clock cycles (the width of input samples is 8 bit, after addition the width of each sample is 8+1 bit, thus 9 clock cycles are required to access the LUTs). Thus the first output from low pass filter is available at 9*8 + 1 + 9 clock cycles and the first output from high pass filter is available at 7*8 + 1 + 9 clock cycles. Hence the latency is 82 and 66 clock cycles respectively. The first stage and second stage adders are isolated with the use of SISO and PISO registers, thus the addition in the first stage and the accumulation in the second stage can be performed simultaneously. Thus the loading of SISO register can be done in parallel, thus reducing one clock cycle, and the throughput in low pass and high pass filter output computation is found to be 9 and 9 clock cycles respectively. Table \hyperref[tab_1]{2} shows the comparison of various DA algorithms for DWT computation. From the Table  {\ref 3}, it is found that the proposed DA logic reduces the LUT size from 512 to 12 in low pass and 128 to 8 in high pass filter computation. The number of adders is increased; however, the throughput is 9 for both low pass and high pass computation. The proposed architecture is modeled using Verilog HDL and is verified for its functionality using suitable test cases. A test environment is developed to test the logic correctness of the proposed DA logic. From the simulation results obtained in ModelSim, the developed HDL model is found to produce correct results for all possible test vectors. The proposed model is implemented using Xilinx ISE and is targeted on Virtex devices. The implementation results are discussed in detail in next chapter. Another approach for DWT computation is using multiplexers based approach. Next section discusses the multiplexers based approach with DA for DWT computation. 
\section[{b) Multiplexer based DA for DWT}]{b) Multiplexer based DA for DWT}\par
The split DA logic discussed in the previous section uses two LUT structure to store the precomputed partial products, which are accessed by the The modified DA logic based architecture is optimized for area and speed performances, however, when the design is implemented on FPGA, there are limitations. FPGA consists of Configurable Logic Blocks (CLBs), dedicated RAM (block RAM), dedicated multipliers and routing resources. CLB consists of LUTs, registers (flip flop), multiplexers, fast carry adders and buffers. As the modified DA logic uses LUTs and adders, the multiplexer logic and registers are not utilized within a CLB. Thus for implementation of modified DA logic more number of CLBs is utilized and every CLB resource is not completely utilized. Hence in order to utilize the resources fully within a CLB, a novel FIR filter architecture is proposed and implemented.?? ?? = ? ?? ?? ?? ?? ???1 ??=0\par
N=9 (or) 7 for DWT filters. (  {\ref 14}) The above equation can be expanded and written as equation \hyperref[b15]{(15)},?? ?? = ? ?? ?? ?? ?? + ? ?? ?? ?? ?? 8 ??=5 4 ??=0\par
(15) Equation (  {\ref 15}) can be realized using DA algorithm and mux based logic in order to fully utilize the FPGA resources. Equation (  {\ref 15}) consists of two terms, the first term is realized using mux based logic and the second term is realized using split DA logic. The Term ? ?? ?? ?? ?? 8 ??=5\par
is realized using split DA logic and is as shown in Fig. \hyperref[fig_13]{14}. , Expanding the term equation (  {\ref 16}) is obtained,?? ??1 = ?? 0 ?? 0 + ?? 1 ?? 1 + ?? 2 ?? 2 + ?? 3 ?? 3 + ?? 4 ?? 3 (16)\par
As the filter parameters (H) are fixed coefficients, and ?? ?? being binary number the term ?? 0 ?? 0 can be expressed as ?? 0 ?? 0 = ?? 0 [?? 0 7 ?? 0 6 ?? 5 5 ?? 0 4 ?? 0 3 ?? 0 2 ?? 0 1 ?? 0 0 ] , where ?? 0 7 is the MSB and ?? 0 0 is LSB. Multiplication of ?? 0 ?? 0 is performed by checking individual bits of?? 0 , if ?? 0 0 is '1' then ?? 0 is the first partial product else if ?? 0 0 is '0' then the partial product is all zeros. Similarly every bit of X 0 is checked for its weight and the H 0 coefficient is added with the previous bit partial product. Prior to addition ?? 0 ?? 0 0 partial product should be shifted right by 1 bit and added with ?? 0 1 ?? 0 partial product. In order to realize equation (  {\ref 16}) using multiplexer, as there are five terms, five 2:1 multiplexers are required. One input of the multiplexers is the filter coefficient ?? 0 ?? 1 ?? 2 ?? 3 ?? 4 and the other input is all zeros. The ?? 0 ?? bit forms the select line of the multiplexer. If ?? 0 ?? bit is 1 then the output of mux is zero else the output of the mux is the corresponding filter coefficient. After every output is chosen from the mux for every bit of input sample, the outputs are accumulated and the final product is computed. Fig. \hyperref[fig_4]{16} shows the mux based filter design for the first term of equation \hyperref[b15]{(15)}. The use of multiplexers and adders in computing the filter output eliminates the use of LUTs and hence at the input of every multiplexer two registers are required one stores the filter coefficient and the other is hardwired to ground as shown in Fig. \hyperref[fig_0]{15}. The multiplexer based logic is combined with split DA logic in computation of low pass filter outputs.    \hyperref[tab_3]{5} presents the performance parameters of the novel DWT architecture designed using mux with split DA logic. The advantage of novel algorithm for DWT computation is that it fully utilizes the CLB resources and hence the area occupancy on FPGA is optimized. As the filter coefficients are biorthogonal, the IDWT processor can be realized just by interchanging the high pass and low pass filters used for DWT computation. The designed 1D DWT architecture is used to compute 2D DWT for the input image. The top level architecture for 2D DWT processor is implemented using the modified 1D-DWT architecture discussed in Fig. \hyperref[fig_10]{12} and Fig. \hyperref[fig_11]{13}. The 2D-DWT processor consists of input memory, output memory and three 1D-DWT processors as shown in Fig. \hyperref[fig_7]{18}.\par
HDL code for 1D DWT processor, input memory and output memory is developed and are integrated to top module. The top module is verified using test bench written in Verilog and with know set of input vectors. The simulation results and synthesis results are obtained using Xilinx ISE. The synthesis results obtained are verified with various constraints options provided in the tool. The default options were producing best results. The area report in terms of slices, the power report and timing report have been generated and are reported in this work. Conventional DWT architecture was realized in \hyperref[b19]{[19]} on Spartan device hence the results reported have been used for comparison. In order to compare the performance improvements in the proposed architecture, the conventional DWT architecture is modeled using HDL and implemented on Virtex-5 device. The results obtained are reported in table 6.  From the comparison results it is demonstrated that the proposed architecture consumes very less resources, as the multipliers are replaced with shift operations, the operating frequency is increased to 268 MHz and power dissipation is reduced by setting the low power constraints. One of the major challenges in the design is data synchronization in DWT computing, as the shift operations are used for multiplication operation, it is mandatory to carefully design the control unit to keep track of the data output and read the data into register for further computation and hence there is need for a predesigned control logic to monitor the data flow logic.\par
V. 
\section[{Conclusion}]{Conclusion}\par
Use of NN for image compression has superior advantage compared with classical techniques, however the NN architecture requires image to be decomposed to several blocks of each 8 x 8, and hence introduces blocking artifact errors and checker box errors in the reconstructed image. In order to overcome the checker errors in this work, we have used DWT for image decomposition prior to image compression using NN architecture. In this work, we proposed a hybrid architecture that combines NN with DWT and the input image is used to train the network. The network architecture is used to compress and decompress several images and it is proven to achieve better MSE compared with reference design. The hybrid technique uses hidden layer consisting of tansig function and output layer with purelin function to achieve better MSE. In order to reduce the computation complexity of DWT architecture in this work two different architectures for DWT computation is proposed, designed and implemented on FPGA. The modified DA algorithm and the Multiplexer based DA algorithm is designed to reduce the number of logic gates and to improve throughput on FPGA platform. The 2D DWT architecture is designed with the proposed 1D DWT architecture and the design is implemented on FPGA that operates at a maximum speed of 268 MHz with power consumption less than 1W. The proposed design can be integrated with NN architecture for hybrid architecture for image compression.  
\section[{Global}]{Global}\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 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}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{45}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 4 :FFigure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-9.png}
\caption{\label{fig_7}8 )}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-10.png}
\caption{\label{fig_8}Figure 10 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{11}\includegraphics[]{image-11.png}
\caption{\label{fig_9}FFigure 11 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-12.png}
\caption{\label{fig_10}Figure 12 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{13}\includegraphics[]{image-13.png}
\caption{\label{fig_11}Figure 13 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-14.png}
\caption{\label{fig_12}ModifiedF}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{14}\includegraphics[]{image-15.png}
\caption{\label{fig_13}Figure 14 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1516}\includegraphics[]{image-16.png}
\caption{\label{fig_14}Figure 15 :FFigure 16 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-17.png}
\caption{\label{fig_15}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1718}\includegraphics[]{image-18.png}
\caption{\label{fig_16}Figure 17 :Figure 18 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-19.png}
\caption{\label{fig_17}Modified}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-20.png}
\caption{\label{fig_18}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.08717948717948718\textwidth}P{0.5811965811965812\textwidth}P{0.18162393162393162\textwidth}}
Order\tabcellsep Co-efficient\tabcellsep values\\
3\tabcellsep 0.0912717\tabcellsep 47\\
2\tabcellsep -0.0575435\tabcellsep 29\\
1\tabcellsep -0.5912717\tabcellsep -303\\
0\tabcellsep 1.11150870\tabcellsep 569\\
6\tabcellsep -0.5912717\tabcellsep -303\\
5\tabcellsep -0.0575435\tabcellsep 29\\
4\tabcellsep 0.0912717\tabcellsep 47\end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.11013289036544849\textwidth}P{0.11013289036544849\textwidth}P{0.16661129568106312\textwidth}P{0.11295681063122924\textwidth}P{0.09318936877076411\textwidth}P{0.1496677740863787\textwidth}P{0.10730897009966776\textwidth}}
\tabcellsep \tabcellsep High Pass\tabcellsep \tabcellsep \tabcellsep Low Pass\tabcellsep \\
\tabcellsep DA\tabcellsep Split DA\tabcellsep Modified DA\tabcellsep DA\tabcellsep Split DA\tabcellsep Modified DA\\
LUT Size\tabcellsep 2 7 = 128\tabcellsep 2 4 + 2 3 = 24\tabcellsep 8\tabcellsep 2 9\tabcellsep 2 5 + 2 4\tabcellsep 12\\
Latency\tabcellsep 8*9+8\tabcellsep 8*7+8\tabcellsep 7*8+1+9=66\tabcellsep 8*9+8\tabcellsep 8*9+8\tabcellsep 9*8+1+9\\
Throughput\tabcellsep 16\tabcellsep 16\tabcellsep 9\tabcellsep 16\tabcellsep 16\tabcellsep 9\\
Adders\tabcellsep 1\tabcellsep 3\tabcellsep 6\tabcellsep 1\tabcellsep 3\tabcellsep 7\\
SISO\tabcellsep Required\tabcellsep Required\tabcellsep Required\tabcellsep Required\tabcellsep Required\tabcellsep Required\\
PISO\tabcellsep Not required\tabcellsep Not required\tabcellsep Required\tabcellsep Not required\tabcellsep Not required\tabcellsep Required\end{longtable} \par
 
\caption{\label{tab_1}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{P{0.4513274336283186\textwidth}P{0.23318584070796458\textwidth}P{0.1654867256637168\textwidth}}
Performance\tabcellsep \multicolumn{2}{l}{Low pass filter High pass}\\
Parameters\tabcellsep \tabcellsep filter\\
LUT size\tabcellsep 2 LUTs of size\tabcellsep 2 LUTs of size\\
\tabcellsep 4x9\tabcellsep 4x9\\
Number of multiplexers\tabcellsep 4\tabcellsep 3\\
Number of adders\tabcellsep 5\tabcellsep 3\\
Number of\tabcellsep 6\tabcellsep 4\\
accumulators\tabcellsep \tabcellsep \\
Throughput\tabcellsep 17\tabcellsep 17\\
Latency\tabcellsep 9*8 + 8 +1\tabcellsep 7*8 + 8 + 1\\
CLB utilization\tabcellsep 100\%\tabcellsep 100\%\end{longtable} \par
 
\caption{\label{tab_2}Table 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5} \par 
\begin{longtable}{P{0.19419475655430712\textwidth}P{0.19101123595505617\textwidth}P{0.23876404494382023\textwidth}P{0.22602996254681645\textwidth}}
Parameters\tabcellsep Conventional DWT [19] (on Spartan)\tabcellsep Conventional DWT\tabcellsep Proposed Design\\
No of Slices\tabcellsep 566 out of 768\tabcellsep 31105 out of 69120 45\%\tabcellsep 7235 out of 69120 12\%\\
No of gates\tabcellsep 37K\tabcellsep 31105 out of 69120 45\%\tabcellsep 7235 out of 69120 42\%\\
Clock Speed\tabcellsep 36MHZ\tabcellsep 237 MHz\tabcellsep 268 MHz\\
Power dissipation\tabcellsep 51mW\tabcellsep 1.37 W\tabcellsep 0.9 W\end{longtable} \par
 
\caption{\label{tab_3}Table 5 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 			\footnote{© 2014 Global Journals Inc. (US) © 2014 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Zhang et al. ()]{b1}\label{b1} 	 		‘A Pipeline VLSI Architecture for Fast Computation of the 2-D Discrete Wavelet Transform’.  		 			Chengjun Zhang 		,  		 			Chunyan Wang 		,  		 			M Ahmad 		.  	 	 		\textit{IEEE Trans. on Circuits and Systems}  		2012. 59 p. .  	 
\bibitem[Liying and Khashayar ()]{b23}\label{b23} 	 		‘Adaptive Constructive Neural Networks Using Hermite Polynomials for Image Compression’.  		 			M Liying 		,  		 			K Khashayar 		.  	 	 		Lecture Notes in Computer Science  		2005. Springer-Verlag. 3497 p. .  	 
\bibitem[Lai and Chang ()]{b19}\label{b19} 	 		‘Adaptive Data Hiding for Images Based on Haar Discrete Wavelet Transform’.  		 			Bo-Luen Lai 		,  		 			Long-Wen Chang 		.  	 	 		Lecture Notes in Computer Science  		2006. Springer-Verlag. 4319 p. .  	 
\bibitem[Lekutai ()]{b10}\label{b10} 	 		\textit{Adaptive Self-tuning Neuro Wavelet Network Controllers},  		 			G Lekutai 		.  		1997. Blacksburg-Virgina, Mars.  	 	 (Thèse de Doctorat) 
\bibitem[Vilovic ()]{b27}\label{b27} 	 		‘An Experience in Image Compression Using Neural Networks’.  		 			Vilovic 		.  	 	 		\textit{48th International Symposium ELMAR-2006 focused on Multimedia Signal Processing and Communications},  				2006. IEEE. p. .  	 
\bibitem[Minasyan et al. ()]{b20}\label{b20} 	 		‘An Image Compression Scheme Based on Parametric Haar-like Transform’.  		 			S Minasyan 		,  		 			J Astola 		,  		 			D Guevorkian 		.  	 	 		\textit{ISCAS 2005. IEEE International Symposium on Circuits and Systems},  				2005. p. .  	 
\bibitem[D'souza Winston and Spracklen ()]{b12}\label{b12} 	 		‘Application of Artificial Neural Networks for real time Data Compression’.  		 			A D'souza Winston 		,  		 			Tim Spracklen 		.  	 	 		\textit{8th International Conference On Novembre},  				2001.  	 
\bibitem[Ch et al. (1998)]{b14}\label{b14} 	 		 			Ch 		,  		 			S Bernard 		,  		 			J-J Mallat 		,  		 			Slotine 		.  		\textit{Wavelet Interpolation Networks, International Workshop on CAGD and wavelet methods for Reconstructing Functions},  				 (Montecatini)  		Juin 1998. p. .  	 
\bibitem[Foucher and Vaucher ()]{b7}\label{b7} 	 		\textit{Compression d'images et réseaux de neurones, revue Valgo n°01-02},  		 			C Foucher 		,  		 			G Vaucher 		.  		17-19 octobre 2001. Ardèche.  	 
\bibitem[Baron ()]{b6}\label{b6} 	 		\textit{Contribution à l'étude des réseaux d'ondelettes},  		 			R Baron 		.  		1997. Février.  		 			Ecole Normale Supérieure de Lyon 		 	 	 (Thèse de doctorat) 
\bibitem[Grossmann and Torrésani ()]{b5}\label{b5} 	 		 			A Grossmann 		,  		 			B Torrésani 		.  		\textit{Les ondelettes, Encyclopedia Universalis},  				1998.  	 
\bibitem[Talukder and Harada ()]{b18}\label{b18} 	 		‘Haar Wavelet Based Approach for Image Compression and Quality Assessment of Compressed Image’.  		 			K H Talukder 		,  		 			K Harada 		.  	 	 		\textit{IAENG International Journal of Applied Mathematics}  		2007.  	 
\bibitem[Sang Yoon Park et al.]{b0}\label{b0} 	 		‘High-Throughput, and Low-Area Adaptive FIR Filter Based on Distributed Arithmetic’.  		 			Pramod Kumar Sang Yoon Park 		,  		 			Meher 		,  		 			Low-Power 		.  	 	 		\textit{IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-II: EXPRESS BRIEFS}  		p. .  	 
\bibitem[Jiang ()]{b8}\label{b8} 	 		‘Image compressing with neural networks -A survey’.  		 			J Jiang 		.  	 	 		\textit{Signal processing: Image communication},  				1999. ELSEVIER. 14 p. .  	 
\bibitem[Cierniak ()]{b24}\label{b24} 	 		‘Image Compression Algorithm Based on Soft Computing Techniques’.  		 			R Cierniak 		.  	 	 		Lecture Notes in Computer Science  		2004. Springer-Verlag. 3019 p. .  	 
\bibitem[Kulkarni et al. ()]{b9}\label{b9} 	 		‘Image Compression Using a Direct Solution Method Based Neural Network’.  		 			S Kulkarni 		,  		 			B Verma 		,  		 			M Blumenstein 		.  	 	 		\textit{The Tenth Australian Joint Conference on Artificial Intelligence},  				 (Perth, Australia)  		1997. p. .  	 
\bibitem[Osowski et al. ()]{b22}\label{b22} 	 		‘Image compression using feed forward neural networks -Hierarchical approach’.  		 			S Osowski 		,  		 			R Waszczuk 		,  		 			P Bojarczak 		.  	 	 		Lecture Notes in Computer Science  		2006. Springer-Verlag. 3497 p. .  	 
\bibitem[Northan and Dony ()]{b25}\label{b25} 	 		‘Image Compression with a multiresolution neural network’.  		 			B Northan 		,  		 			R D Dony 		.  	 	 		\textit{Canadian Journal of Electrical and Computer Engineering}  		2006. 31  (1)  p. .  	 
\bibitem[Veisi and Jamzad ()]{b26}\label{b26} 	 		‘Image Compression with Neural Networks Using Complexity Level of Images’.  		 			S Veisi 		,  		 			M Jamzad 		.  	 	 		\textit{Proceedings of the 5th International 16 Mai 2003. Symposium on image and Signal Processing and Analysis},  				 (the 5th International 16 Mai 2003. Symposium on image and Signal Processing and Analysis)  		2007. IEEE. 07 p. .  	 
\bibitem[Ye et al. ()]{b21}\label{b21} 	 		‘Information Measures for Biometric Identification via 2D Discrete Modified Distributive Arithmetic based 2d-Dwt for Hybrid (Neural Network-Dwt) Image Compression Wavelet Transform’.  		 			Z Ye 		,  		 			H Mohamadian 		,  		 			Y Ye 		.  	 	 		\textit{Proceedings of the 3rd Annual IEEE Conference on Automation Science and Engineering},  				 (the 3rd Annual IEEE Conference on Automation Science and Engineering)  		2007, 2007. p. .  	 
\bibitem[Ratakonda and Ahuja ()]{b17}\label{b17} 	 		‘Lossless Image Compression with Multiscale Segmentation’.  		 			K Ratakonda 		,  		 			N Ahuja 		.  	 	 		\textit{IEEE Transactions Image Processing},  				2002. 11 p. .  	 
\bibitem[Dony and Haykin ()]{b11}\label{b11} 	 		‘Neural network approaches to image compression’.  		 			R D Dony 		,  		 			S Haykin 		.  	 	 		\textit{Proceedings of the IEEE, V83, N°2, Février},  				 (the IEEE, V83, N°2, Février)  		1995. p. .  	 
\bibitem[Neural Processing]{b13}\label{b13} 	 		\textit{Neural Processing},  				 (Shanghai, Chine)  		p. .  	 
\bibitem[Charalampidis]{b15}\label{b15} 	 		‘Novel Adaptive Image Compression’.  		 			D Charalampidis 		.  	 	 		\textit{Workshop on Information and Systems Technology},  				101.  		 			TRAC Building, University of New Orleans 		 	 
\bibitem[Cyril Prasanna ()]{b2}\label{b2} 	 		‘Review of 2D VLSI architectures for image Compression’.  		 			Raj P Cyril Prasanna 		.  	 	 		\textit{SASTech Journal}  		2006. 2  (4)  p. .  	 
\bibitem[Nadenau et al. ()]{b16}\label{b16} 	 		‘Wavelet Based Color Image Compression: Exploiting the Contrast Sensitivity Function’.  		 			M J Nadenau 		,  		 			J Reichel 		,  		 			M Kunt 		.  	 	 		\textit{EEE Transactions Image Processing},  				2003. 12 p. .  	 
\bibitem[Zang ()]{b3}\label{b3} 	 		‘Wavelet Network in Nonparametric Estimation’.  		 			Zang 		.  	 	 		\textit{IEEE Trans. Neural Networks}  		1997. 8  (2)  p. .  	 
\bibitem[Zang and Benveniste ()]{b4}\label{b4} 	 		‘Wavelet networks’.  		 			Q Zang 		,  		 			A Benveniste 		.  	 	 		\textit{IEEE Trans. Neural Networks}  		1992. 3 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
