\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={Design and FPGA Implementation of High Speed DWT-IDWT Architecture with Pipelined SPIHT 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Design and FPGA Implementation of High Speed DWT-IDWT Architecture with Pipelined SPIHT 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]{  T.Vijayakumar}

             \author[2]{S.  Ramachandran}

             \affil[1]{  S J B Institute of Technology}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


Image compression demands high speed architectures for transformation and encoding process. Medical image compression demands lossless compression schemes and faster architectures. A trade-off between speed and area decides the complexity of image compression algorithms. In this work, a high speed DWT architecture and pipelined SPIHT architecture is designed, modeled and implemented on FPGA platform. DWT computation is performed using matrix multiplication operation and is implemented on Virtex-5 FPGA that consumes less than 1% of the hardware resource. The SPIHT algorithm that is performed using pipelined architecture and hence achieves higher throughput and latency. The SPIHT algorithm operates at a frequency of 260 MHz and occupies area less than 15% of the resources. The architecture designed is suitable for high speed image compression applications.

\end{abstract}


\keywords{SPIHT, DWT, pipelined architecture, FPGA, High speed, image compress ion.}

\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
echnological growth of semiconductor industry has led to unprecedented demand for low power, high speed complex and reliable integrated circuits for medical, defence and consumer applications. Today's electronic equipment comes with user friendly interfaces such as keypads and graphical displays. As images convey more information to a user, many of the equipment today have image displays and interfaces. Image storage on these smaller, handled devices is a challenge as they occupy huge storage space; also image transmission requires higher bandwidth. Hence most of the signal processing technologies today has dedicated hardwares that act as co-processors to compress and decompress images. Discrete Wavelet Transforms have been widely used for image compression and decompression. Much architecture has been proposed for high-speed 2-D DWT computation. The architectures can be broadly classified as separable and non-separable architectures \hyperref[b0]{[1]}. Vishwanath etal. \hyperref[b1]{[2]} Have proposed a low-storage short-latency separable architecture in which the rowwise operations are performed by systolic filters and the column-wise operations by parallel filters. Liao et al. \hyperref[b2]{[3]} Have introduced architecture in which each of the rowand column-wise filtering operations are decomposed using the so called lifting operations into a cascade of sub-filtering operations. Chakrabarti et al. \hyperref[b3]{[4]} have proposed two non-separable architectures, one using parallel 2-D filters and the other an SIMD 2-D array. Cheng et al. \hyperref[b4]{[5]} have proposed an architecture in which a number of parallel FIR filters with a polyphase structure are used to improve the processing speed at the expense of increased hardware. Hung et al. \hyperref[b5]{[6]}, in an effort to provide a reduced count of multipliers and to facilitate the processing of the boundary data, have proposed an architecture that is a pipeline of one stage of parallel multipliers and two stages of accumulators to perform the accumulation tasks of the filters in each of the two directions. Marino \hyperref[b6]{[7]} has proposed a two-stage pipeline architecture in which the first stage performs the task of the first decomposition level and the second stage decomposes all the remaining levels and has aimed at providing a short computation time. These existing architectures have not exploited the computational parallelism inherent in the DWT operation to the extent possible in order to provide a high speed. The proposed architecture is modular and allows extension to any precision without much effect on the clock frequency. Simulation results have established that the proposed fast implementation scheme can produce high-quality reconstructed signals. The parallel DWT processor enhances throughput by producing two outputs in one clock cycle. The speed of the presented architecture does not depend on the number of filter taps and the number of bits per sample value. Since DWT was introduced, several codec algorithms were proposed to compress the transform coefficients as much as possible. Among them, Embedded Zerotree Wavelet (EZW), Set Partitioning In Hierarchical Trees (SPIHT) and Embedded Block Coding with Optimized Truncation (EBCOT) are the most famous ones \hyperref[b7]{[8]}\hyperref[b8]{[9]}. In \hyperref[b8]{[9]}, if no entropy coding or arithmetic coding methods are incorporated coding tables are not required with slight loss in compression ratio. Moreover, SPIHT can be easily used for either fixed bit rate or variable bit rate applications and it is also very suitable for progressive transmission \hyperref[b7]{[8]}. Furthermore, SPIHT has about 0.6 dB peak signal-to-noise-ratios (PSNR) gain over EZW \hyperref[b9]{[10]} and is very close to EBCOT in many circumstances \hyperref[b8]{[9]}.( D D D D D D D D )\par
In this work a pipelined SPIHT algorithm is designed for high speed applications. Section 2 discusses image compression and DWT algorithm, section 3 discusses DWT based image compression, Section 4 discusses design of DWT architectures and Section 5 discusses SPIHT encoder, Section 6 is conclusion. 
\section[{II.}]{II.} 
\section[{Background Theory}]{Background Theory}\par
An image (from Latin imago) is an artifact, for example a two-dimensional picture that has a similar appearance to some subject-usually a physical object or a person. Images may be two-dimensional, such as a photograph, screen display and as well as a threedimensional, such as a statue. They may be captured by optical devices-such as cameras, mirrors, lenses, telescopes, microscopes, etc. and natural objects and phenomena, such as the human eye or water surfaces. A still image is a single static image, as distinguished from a moving image. This phrase is used in photography, visual media and the computer industry to emphasize that one is not talking about movies or in very precise or pedantic technical writing such as a standard. Image file size-expressed as the number of bytes-increases with the number of pixels composing an image and the color depth of the pixels. The greater the number of rows and columns, the greater the image resolution, and larger the file. Also, each pixel of an image increases in size when its color depth increases-an 8-bit pixel (1 byte) stores 256 colors, a 24-bit pixel (3 bytes) stores 16 million colors, the latter known as true color. The need for image compression becomes apparent when the number of bits per image resulting from typical sampling and quantization schemes is computed. Considering the amount of storage for the 'Lena' digital image, the monochrome (grayscale) version of this image with a resolution 512x512x8 bits/pixel requires a total of 2,097,152 bits, or 786,432 bytes. Such image should be compressed for efficient storage or transmission. Image compression refers to algorithms which reduce image data redundancy in order to store the image efficiently. Uncompressed multimedia data demands considerable storage capacity and bandwidth. Digital images can be compressed due to two factors which are \hyperref[b10]{[11]}:\par
1. Spatial redundancy 2. Perceptual redundancy.\par
Spatial redundancy refers to intra frame redundancy that when the image are taken in dark back ground or when the background will be same colour most of the data required to represent the image will be same and are redundant which can be ignored to save storage space. This can also be defined as the correlation between the adjacent pixel values. A pixel in an image will be represented as 8 bits. If we observe the two figures shown in Figure \hyperref[fig_0]{1} above, the first one is represented with 6 bits and seems to be good in quality where as the other which is represented with 4 bits looks blurred. Human eye will not be able to distinguish even when the image is represented with 6 bits which is short of some information; this is called perceptual redundancy and is taken as advantage for compressing the images. Compression is of two types: Lossless compression and Lossy compression. Lossless compression is one where the information can be recovered after decompressing such that no loss of data occurs. For example 212 214 220 222 216 212 212 214 is the data in one line we can represent this as +212 +2 +6 +2 -6 -4 0 +2 and so on. This method is called predictive encoding. There is another way of lossless compression where for example k is the letter that repeats frequently in an image data so instead of representing k we replace all k's with '.' Simple dot as data represented for '.' is much less than a alphabet 'k'. In this way frequent symbols are represented with symbols which require less data to represent thus reducing the space required to store the image. This technique is called statistical encoding. In both the cases data can be recovered and no loss occurs. Lossy compression is one where the data compressed cannot be recovered. For example a 1024x1024 resolution image is transmitted as 512x512 pixels it is a lossy compression. There are different forms of lossy compression of which we are interested in transform encoding based lossy compression. Transform encoding involves mathematical transformation separating image information based on gradual spatial variation of brightness from information with faster variation of brightness at edges of the image. In the next step, the information on slower changes is transmitted lossless, but information on faster local changes is transmitted with lower accuracy by quantizing the data. This results in loss of data which cannot be recovered. 
\section[{III. Wavelet b ased Image Compression}]{III. Wavelet b ased Image Compression}\par
Wavelet coding has become very popular due to its robustness under transmission and decoding errors at higher compression rates avoiding blocking artifacts. Wavelet based compression is based on subband coding. Sub band coding involves splitting the frequency band of the image into sub bands and then to code each sub band using a coder and bit rate accurately matched to the statistics of the band. Simple DWT consists of a low pass filter and high pass filter which splits the image into low frequency and high frequency sub bands. Figure  {\ref 2} shows the two dimensional decomposition of image where the first one is row decomposition and the second stage is column decomposition.\par
Figure  {\ref 3} : Representation of decomposed image \hyperref[b1]{[2]} Decomposition is done till the image decomposes to 4x4 block. Figure  {\ref 3} shows the decomposed image where the low frequencies are at the top left corner of the image and purely higher frequency at bottom right corner.\par
Figure  {\ref 4} : Framing the decomposed blocks \hyperref[b1]{[2]} Once decomposed in to 4x4 blocks they are arranged in a 16x1 matrix in zigzag order as shown Figure  {\ref 4}, in this way all the blocks are arranged in the matrix finally it forms a 16xN matrix. Finally after wavelet transformation image data is compressed and transmitted through channel and decompressed at the receiver, after that IDWT will recover the image data that represents the image. In this work compression and de-compression algorithm have been developed as shown in Figure \hyperref[fig_3]{5} using the existing wavelet transformation on FPGA hardware. In order to demonstrate the working of the proposed hardware DWT values stored in a memory to compress and after de-compressing as shown in Figure \hyperref[fig_4]{6}.\par
IV. 
\section[{Design of dwt Architecture}]{Design of dwt Architecture}\par
In \hyperref[b11]{[12]}\hyperref[b12]{[13]}\hyperref[b13]{[14]}\hyperref[b14]{[15]} DWT architectures have been discussed that use techniques like distributive arithmetic, lifting scheme and symmetric logic for hardware implementation to meet speed and power requirements. In \hyperref[b15]{[16]}\hyperref[b16]{[17]} parallel processing algorithms are discussed for DWT implementation. In this work, high speed architectures for DWT and SPIHT encoding schemes are designed. Compressor involves converting a matrix of 16x64 elements into 4x64 elements by multiplying with fixed matrix of order4x64, this way memory required to store 16x64 elements is reduced and it is flexible to transmit 4x64 instead of 16x64 elements. Each column of 16x64 represents a 4x4 decomposed block and each element consists of 8 bits with sign-magnitude representation as shown in Figure \hyperref[fig_5]{7}. Compression basically done here is the multiplication of the input matrix with a fixed matrix to produce reduced number of elements for transmission and storage. Basic matrix multiplication involves multiplying and accumulating the row elements of one matrix with the other matrix. To perform this number of columns of first matrix should be equal to number of rows of the second matrix. One important consideration here as discussed in the previous step that 4x4 block is framed on to 16x1 matrix then input matrix is fed to the compressor as column by column. So that when the first column is received serially will be multiplied with 4 rows of the fixed matrix simultaneously as the input data is of real time nature, storing and processing input, would take much hardware hence we will proceed with 4multipliers instead of one. So by the time when one complete column is received, it is processed and provides four outputs simultaneously. Output generation will require series of multiply and accumulate operations. If the input is in 2's complement one adder will be sufficient but as the input is signed format we need additional logic to decide whether addition or subtraction has to be performed. Since the last bit is sign bit we use only 7-bit multiplier instead of 8-bit thus balancing the hardware used for sign detection circuitry. Output will be stored in 8-bit, but after multiplication of two elements we get 15-bit including sign bit and if it is to be accumulated for 16 times which is the number of elements in the input column we get around 18 bits. So we will transmit only 8-MSB bits ignoring others, this is considered as quantization where certain information is lost. Another important aspect is storing the fixed matrix elements in memory. If we store all the elements of matrix in a single memory, we can access only one element for one cycle. To perform 4 multiplications simultaneously and to access 4 row elements simultaneously, different row elements are stored in different memories of smaller size such that they can be accessed simultaneously. Another challenge occurs where output is available after every 16 cycles which is after receiving one complete column serially, 4 outputs will be available which cannot be sent serially in a single clock cycle. So we will transmit each output element for every 4 cycles because of a specific reason which we will discuss with de-compression section. After sending 4 elements for 16 cycles another set of outputs will be available to transmit. Since data is received serially we need to have a mechanism for synchronizing the data. An active high signal called 'vi' which is valid input is provided which is high if the input is valid, also a valid out signal is asserted when we transmit the data for each 4 cycles of the compressor. If this input is low data will not be received and no operation is performed.   In De-compression we have 16 rows of fixed coefficient as it is transposed so it infers that we need to use 16 multipliers to process real time input. This will consume more hardware so we will take advantage of the input property that input is available for every 4 cycles but not for every cycle which we intentionally designed for in the compressor section. Using this as advantage if we have the same 4 multipliers which multiplies an incoming element with 4 rows and before the next element comes that is after the next 4 cycles multiplication with all the sixteen rows will be completed thus with reduced hardware and same throughput is achieved by taking advantage of the input property. Using 16 multipliers has certain disadvantages which are when using 16 multipliers is input is not available for certain cycles for which no operation will be done causing reduced efficiency. Efficiency can be increased by operating de-compressor unit at 4 times faster than the previous block which is compressor, if it operates at high frequency 16 outputs will be available for each 4 cycles which have to be sent out serially in 4 cycles this imposes frequency constraints on the next computing block which is IDWT. So using 4 multipliers will have less hardware and high efficiency without latency and it is still capable of processing the real time compressed input. Output is again quantized to 8-bits to fit output register.  We can observe that 4 multipliers are used for four cycles to multiply 16 rows and after 4 cycles next input will be received and the process repeats. For every 16 cycles we will get 16 outputs simultaneously which will be stored in 16 registers and will be sent serially for every cycle and after 16 cycles we will obtain new set of outputs. Latency here is 16 but as the output is sent for every cycle throughput is 100\%. This system can be called as a pipelined architecture. D is the output of memory which is fed to compressor and o1 is the output of compressor fed to de-compressor and out is final de-compressed output which is again stored in the memory further to integrate with IDWT. Valid input and outputs used will provide synchronization between the multiple blocks and vo is asserted when data is available at out port. 
\section[{Table 4 : Device utilization for Virtex-2 after integration}]{Table 4 : Device utilization for Virtex-2 after integration}\par
Device utilization is combination of the utilization of compressor and de-compressor.\par
Table  {\ref 5} : Device utilization for Virtex-5 after integration V.\par
piht Architecture DWT decomposes input image into sub bands of various frequency components. The decomposed sub bands contain the low frequency components and higher frequency components. The low sub band component is further decomposed using 2D DWT into another four sets of sub bands, the higher sub bands are retained as it is after one level of decomposition. The lowest sub band which is low frequency component is considered as the parent, all other sub bands are considered as the child. In order to compress the decomposed image, SPIHT algorithm is used for compression. SPIHT makes use of three lists -the List of Significant Pixels (LSP), List of Insignificant Pixels (LIP) and List of Insignificant Sets (LIS). These are coefficient location lists that contain their coordinates. After the initialization, the algorithm takes two stages for each level of threshold -the sorting pass (in which lists are organized) and the refinement pass (which does the actual progressive coding transmission). The result is in the form of a bit stream. SPIHT keeps three lists: LIP, LSP and LIS. LIP stores insignificant pixels, LSP stores significant pixels and LIS stores insignificant sets. At the beginning, LSP is empty, LIP keeps all coefficients in the lowest sub band and LIS keeps all tree roots which are at the lowest sub band. SPIHT starts coding by running two passes. The first pass is the sorting pass browses the LIP and moves all significant coefficients to LSP and outputs its sign. Then it browses LIS executing the significance information and following the partitioning sorting algorithms. The second pass is the refining pass browses the coefficients in LSP and outputs a single bit alone based on the current threshold. After the two passes are finished, the threshold is divided by 2 and the encoder executes the two passes again. This procedure is recursively applied until the number of output bits reaches the desired number. An input of image size 16 x 16 is encoded using SPIHT algorithm, the input image after DWT decomposition and different pass of SPIHT is shown in Figure \hyperref[fig_8]{12}. For a 16 x 16 input image each of 8 bits, the total number of input bits before encoding is 768, after sixth pass encoding the compressed bits are 277 at the receiver, 277 bits are decoded to obtain 768 bits. For higher compression, it is required to stop SPIHT with lower number of pass.  SPIHT encoder algorithm encodes the ten sub bands into bit stream based on the compression ratio expressed in terms of bits per pixel (bpp). Input image is represented using 8 bit per pixel, the compressed image can be represented using bpp less than 8, thus leading to compression. Figure \hyperref[fig_15]{13} shows the top level architecture of SPIHT encoder, the input image is stored in an input register, for each pass the SPIHT encoder algorithm is realized using logic gates and the output is stored in an intermediate register. The intermediate memory is further processed by the second stage SPIHT encoder and multiple stages of SPIHT encoder is designed for processing the inout data in pipeline. The master clock is used for synchronization of pipeline stages. Figure \hyperref[fig_16]{14} shows the internal architecture of SPIHT encoder that consists of LIP memory for LL coefficients, LIS memory for higher sub bands. The LIP elements are compared for its significance and are transferred into LSP memory; similarly the LIS elements are partitioned and stored in sorted coefficients memory. Based on the LSP memory elements the bit stream is generated in the refinement pass. The pipelined architecture designed in this work achieves higher throughput and better latency. Independent memory modules used for every iteration increases area, however increases frequency of operation.  The hierarchical sub bands obtained after two level 2-D DWT is stored in an input memory as shown in Figure \hyperref[fig_17]{15}. The SPIHT iteration 1 module generates the bit stream as discussed in Figure \hyperref[fig_16]{14}. The threshold module further scales the sub bands for generation of bit stream in the second iteration. The threshold levels are set according to the compression ratio required. In this work, variable threshold is set for LL and higher sub bands. The SPIHT encoder is repeatedly computes the bit stream until the sub bands in the input memory have elements greater than 10. The number 10 is fixed based on trial and error analysis carried out for achieving highest compression ratio of 120\%. The final bit stream obtained after concatenation is regrouped and is transmitted over noisy channel. The SPIHT encoder is modeled using HDL and synthesized using Xilinx ISE targeting Virtex-5 FPGA. The synthesis results of first stage pipeline architecture for SPIHT encoder are shown in Figure \hyperref[fig_18]{16}.  \hyperref[tab_0]{6} shows the synthesis results of SPIHT encoder on Virtex-5 FPGA. The HDL code is optimized for power and timing performances. From the simulation results and synthesis results obtained, it is demonstrated that the SPIHT algorithm developed functionally correct and is also optimized for high speed applications.  
\section[{Conclusion}]{Conclusion}\par
Image compression technique with DWT is well understood and has been implemented on hardware. Entire architecture was split into individual blocks and developed for reduced hardware and higher throughput. De-compressor will take advantage of the input property that will be available for each 4 cycles and because of which 75\% of the multipliers were reduced with 100\% throughput and latency of 16. One important observation with XST toll is it will synthesize a block ROM when array is declared and used as memory where as if memory is defined in terms of look up tables XST will use CLB's. SPIHT encoder is designed using pipelined architecture and operates at maximum frequency of 265MHz. DWT combined with SPIHT occupy less than 5\% of the resources on Virtex-5 FPGA. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{22}\includegraphics[]{image-3.png}
\caption{\label{fig_2}Figure 2 : 2 -}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-4.png}
\caption{\label{fig_3}GlobalFigure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-7.png}
\caption{\label{fig_7}Figure 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-8.png}
\caption{\label{fig_8}Table 1 :Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9}\includegraphics[]{image-9.png}
\caption{\label{fig_9}Figure 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-10.png}
\caption{\label{fig_10}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-11.png}
\caption{\label{fig_11}Figure 10 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{311}\includegraphics[]{image-12.png}
\caption{\label{fig_12}Table 3 :Figure 11 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-13.png}
\caption{\label{fig_14}Figure 12 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{13}\includegraphics[]{image-14.png}
\caption{\label{fig_15}Figure 13 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{14}\includegraphics[]{image-15.png}
\caption{\label{fig_16}Figure 14 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{15}\includegraphics[]{image-16.png}
\caption{\label{fig_17}Figure 15 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{16}\includegraphics[]{image-17.png}
\caption{\label{fig_18}Figure 16 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6} \par 
\begin{longtable}{P{0.43134328358208956\textwidth}P{0.4186567164179104\textwidth}}
Parameters\tabcellsep Resource utilization\\
No. of slices\tabcellsep 2389 out of 69120\\
No. of LUTs\tabcellsep 3321 out of 69120\\
Max. Frequency\tabcellsep 265 MHz\\
Power Dissipation\tabcellsep 0.9mW\\
VI.\tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}Table 6 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{Global Journals Inc. (US) Guidelines Handbook 2014}]{Global Journals Inc. (US) Guidelines Handbook 2014}\par
www.GlobalJournals.org			 			  				\begin{bibitemlist}{1}
\bibitem[Said and Pearlman]{b7}\label{b7} 	 		\textit{A new fast and efficient image codec based on set partitioning in},  		 			A Said 		,  		 			W A Pearlman 		.  		 	 
\bibitem[Hung et al. (2001)]{b5}\label{b5} 	 		‘A nonseparable VLSI architecture for two-dimensional discrete periodized wavelet transform’.  		 			K C Hung 		,  		 			Y S Hung 		,  		 			Y J Huang 		.  	 	 		\textit{IEEE Trans. Very Large Scale Integr. (VLSI) Syst}  		Oct. 2001. 9  (5)  p. .  	 
\bibitem[Zhang and Ahmad (2012)]{b0}\label{b0} 	 		‘A pipeline vlsi architecture for fast computation of the 2-d discrete wavelet transform’.  		 			Chengjun Zhang 		,  		 			M Ahmad 		.  	 	 		\textit{IEEE transactions on circuits and systems-i: regular papers},  				august 2012. 59 p. .  	 
\bibitem[Zhang et al. (2007)]{b16}\label{b16} 	 		‘A VLSI architecture for a fast computation of the 2-D discrete wavelet transform’.  		 			C Zhang 		,  		 			C Wang 		,  		 			M O Ahmad 		.  	 	 		\textit{Proc. IEEE Int. Symp. Circuits Syst. (ISCAS)},  				 (IEEE Int. Symp. Circuits Syst. (ISCAS))  		May 2007. p. .  	 
\bibitem[Christopoulos et al. (2000)]{b14}\label{b14} 	 		 			Charilaos Christopoulos 		,  		 			Athanassios Skodras 		,  		 			Touradj Ebrahimi 		.  		\textit{Published in IEEE Transactions on Consumer Electronics},  				November 2000. 46 p. .  	 	 (THE JPEG2000 STILL IMAGE CODING SYSTEM -AN OVERVIEW) 
\bibitem[Liao et al. (2004)]{b2}\label{b2} 	 		‘Efficient architectures for 1-D and 2-D lifting-based wavelet transforms’.  		 			H Y Liao 		,  		 			M K Mandal 		,  		 			B F Cockburn 		.  	 	 		\textit{IEEE Trans. Signal Process}  		May 2004. 52  (5)  p. .  	 
\bibitem[Marino (2000)]{b6}\label{b6} 	 		‘Efficient high-speed low-power pipelined architecture for the direct 2-D discrete wavelet transform’.  		 			F Marino 		.  	 	 		\textit{IEEE Trans. Circuits Syst.II, Analog. Digit. Signal Process}  		Dec. 2000. 47  (12)  p. .  	 
\bibitem[Chakrabarti and Vishwanath (1995)]{b3}\label{b3} 	 		‘Efficient realizations of the discrete and continuous wavelet transforms: From single chip implementations to mapping on SIMD array computers’.  		 			C Chakrabarti 		,  		 			M Vishwanath 		.  	 	 		\textit{IEEE Trans. Signal Process}  		Mar. 1995. 43  (3)  p. .  	 
\bibitem[Shapiro (1993)]{b9}\label{b9} 	 		‘Embedded image coding using zerotrees of wavelet coefficients’.  		 			J M Shapiro 		.  	 	 		\textit{IEEE Trans. Signal Process}  		Dec. 1993. 41  (12)  p. .  	 
\bibitem[Taubman (2000)]{b8}\label{b8} 	 		‘High performance scalable image compression with EBCOT’.  		 			D Taubman 		.  	 	 		\textit{IEEE Trans. Image Process}  		July 2000. 9  (7)  p. .  	 
\bibitem[Cheng and Parhi (2008)]{b4}\label{b4} 	 		‘High-speed VLSI implementation of 2-D discrete wavelet transform’.  		 			C Cheng 		,  		 			K K Parhi 		.  	 	 		\textit{IEEE Trans. Signal Process}  		Jan. 2008. 56  (1)  p. .  	 
\bibitem[Taubman and Michael]{b10}\label{b10} 	 		\textit{Marcellin -JPEG 2000 -Image compression, fundamentals, standards and practice},  		 			David S Taubman 		,  		 			W Michael 		.  		Kluwer academic publishers.  	 	 (Second printing -2002) 
\bibitem[Song and Park (2009)]{b15}\label{b15} 	 		‘Pipelined discrete wavelet transform architecture scanning dual lines’.  		 			J Song 		,  		 			I Park 		.  	 	 		\textit{IEEE Trans. Circuits Syst. II, Exp. Briefs}  		Dec. 2009. 56  (12)  p. .  	 
\bibitem[Knowles ()]{b11}\label{b11} 	 		‘VLSI Architecture for the Discrete Wavelet Transform’.  		 			G Knowles 		.  	 	 		\textit{Electronics Letters}  		1990. 26 p. .  	 
\bibitem[Lewis and Knowles (1991)]{b12}\label{b12} 	 		‘VLSI Architectures for 2-D Daubechies Wavelet Transform without Multipliers’.  		 			A S Lewis 		,  		 			G Knowles 		.  	 	 		\textit{Electron Letter}  		Jan 1991. 27 p. .  	 
\bibitem[Vishwanath et al. (1995)]{b1}\label{b1} 	 		‘VLSI architectures for the discrete wavelet transform’.  		 			M Vishwanath 		,  		 			R Owens 		,  		 			M J Irwin 		.  	 	 		\textit{Analog. Digit. Signal Process}  		May 1995. II  (5)  p. .  	 	 (IEEE Trans. Circuits Syst) 
\bibitem[Parhi and Nishitani (1993)]{b13}\label{b13} 	 		‘VSLSi Architecture for Discrete Wavelet Transform’.  		 			K K Parhi 		,  		 			T Nishitani 		.  	 	 		\textit{IEEE Trans. VLSI Systems}  		June 1993. 1 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
