\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={Novel Design of BCD to Excess-3 Code Converter in Quantum Dots Cellular Automata (QCA)},
 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{Novel Design of BCD to Excess-3 Code Converter in Quantum Dots Cellular Automata (QCA)}
\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]{Ali  Bahar}

             \affil[1]{  Mawlana Bhashani Science and Technology University}

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2013 Accepted: 3 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Quantum-dot cellular automata (QCA) represent a new technology at the nanotechnology level.Conventional digital technologies use ranges of voltage or current to represent binary values. In contrast, QCA uses the positions of electrons in quantum dots to represent binary Values '0' and '1'. Quantum technology has gradually applied in various fields. A quantum-dot cellular automaton is projected as a promising nanotechnology for future ICs. A QCA is an array of structures known as quantum-dots. The advantages of using QCA technology are smaller circuit size, higher clock frequency, and lower power consumption. Two electrons occupy each cell. Each electron is free to tunnel between dots within one cell, but cannot leave the cell. The two electrons within each cell repel each other to diagonally opposite corners of the cell. This leaves only two stable states for each cell. These two states are used to represent logic values. The occupation of upper-left and lower-right dots represent logic '0'. In this case, the QCA cell is said to be polarized to -1. Similarly, the occupation of upper-right and lower left dots represent logic '1'. In this case, the QCA cell is said to be polarized to +1. In this paper, a BCD to excess-3 code converter circuit is proposed based on QCA logic gates: the 3-input MV OR gate, 3-input MV AND gate, MV NOT gate. This 3-input AND & 3-input OR gates, 3-input complex gates, multi-input complex gates. The proposed circuit is a remising future in constructing of nano-scale low power consumption information processing system and can stimulate higher digital applications in QCA.

\end{abstract}


\keywords{quantum cellular automata (QCA); QCA logic gates; BCD-to-excess-3 code converter in QCA; 3-input QCA and gate, BCD by QCA.}

\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
uantum technology has gradually applied in various fields \hyperref[b0]{[1,}\hyperref[b1]{2]}. Quantum-dot cellular automata are projected as a promising nanotechnology for future ICs \hyperref[b2]{[3,}\hyperref[b3]{4]}. A QCA is an array of structures known as quantum-dots. Computing with QCA is achieved by the tunneling of individual electrons among the quantum-dots inside individual electrons among the quantum-dots inside a cell and the classical columbic interaction among them.\par
Author ? ? ? ?: Department of Information and Communication Technology, Mawlana Bhashani Science and Technology University, Tangail, Bangladesh. e-mail: bahar\textunderscore mitdu@yahoo.com A quantum cell can be viewed as a set of four charge containers or dots positioned at the corners of a square, as shown in Fig. \hyperref[fig_0]{1}. It contains two extra mobile electrons. The electrons can quantum mechanically tunnel between dots but cannot come out from the cell and are forced to settle at the corner positions due to coulomb interaction. Thus, there exist two equivalent energetically minimal arrangements for the electrons in a QCA cell (Figure \hyperref[fig_0]{1}), a QCA cell and its binary Logic are shown, the energetically position of the diagonal electrons identifies the binary logic 0 or 1. This phenomenon is useful in nanotechnology which affects high resolution fast electronic circuits. The QCA cells themselves comprise the interconnecting wires as described in \hyperref[b3]{[4]}. An example of a QCA wire is shown in Figure \hyperref[fig_1]{2}. In this example, a value of 1 is transmitted along the wire. Only a slight polarization in a cell is required to fully polarize its neighbor. The direction for the flow of information through a gate or a wire is controlled by a four stage clocking system described in \hyperref[b3]{[4]} which raises and lowers barriers between the cells. Described in \hyperref[b2]{[3]} were other logic gates formed by restricting the polarity of one input to the 3-input majority gate to be a constant value. Figure \hyperref[fig_2]{3} illustrates a 2-input AND gate and a 2-input OR gate formed in this manner. By replacing input c with a cell having a fixed   
\section[{Proposed Circuit and Presentation a) BCD-to-EXCESS-3 code converter}]{Proposed Circuit and Presentation a) BCD-to-EXCESS-3 code converter}\par
A conversion circuit must be inserted between the two systems if each uses different codes for the same information. Thus, a code converter is a circuit that makes the two systems compatible even though each uses a different binary code. To convert from binary code A to binary code B, the input lines must supply the bit combination of elements as specified by code A and the output lines must generated the corresponding bit combination of code B. A combinational circuit performs this transformation by means of logic gate. The design procedure of code converters will be illustrated by means of a specific example of conversion from the BCD to the excess-3 code. The bit combinations for the BCD and excess-3 code \hyperref[b9]{[5]} listed in Table \hyperref[tab_0]{1}. Since each code uses four bits to represent a decimal digit, there must be four input variables and four output variables. Let us designate the four input binary variables by the symbols A,B,C and D and the four output variables by the W,X,Y and Z .The truth table relating the input and output variables is shown in Table \hyperref[tab_1]{2}. The bit combinations for the inputs and their corresponding outputs are obtain directly from Table \hyperref[tab_0]{1}. We note that four binary variables may have 16bit combinations, only 10 of which are listed in the truth table. The six bit combinations not listed for the input variables are don't-care combinations. Since they will never occur, we are liberty to assign to the output variables either a 1 or a 0, whichever gives a similar circuit. The manipulation of BCD-to-excess code converter, shown below, illustrates the flexibility obtain with multiple-output systems when implemented with three or more levels of gates.   
\section[{Z= D' Y= CD+(C+D)' Z= B'(C+D) + B(C+D)' W= A + B(C+D)}]{Z= D' Y= CD+(C+D)' Z= B'(C+D) + B(C+D)' W= A + B(C+D)}Input BCD Output Excess-3-code A B C D W X Y Z 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 0 0 1 1 1 0 1 0 1 1 0 0 0 0 1 1 0 1 0 0 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 1 1 1 0 0 1 1 1 0 0 b) BCD-to-EXCESS-3 code converter gate in QCA\par
The block diagram of QCA is the BCD-toexcess-3 code converter gate shown in Fig. \hyperref[fig_6]{5}. The BCDto-excess-3 code converter gate has four inputs and four outputs asshown in figure \hyperref[fig_6]{5}. Uses eight majority voter (MV) gate and two NOT gate to design BCD-toexcess-3 code converter in QCA as shown in Figure \hyperref[fig_6]{5}.The fundamental logic gate for QCA is the BCD-toexcess-3 code converter gate shown in Figure  {\ref 6} that is composed of two hundred (200) cells with total area of 0.06 ?m2. Four of these, representing the inputs to the cell, are labeled A, B, C and D. using the terminology of \hyperref[b2]{[3]}. The center cell is the "device cell" that performs the calculation for three input majority voter gates in QCA. The remaining cell, labeled out, provides the output. The circuit shown in Figure  {\ref 6}   
\section[{Methods}]{Methods}\par
First of all, the logic behind any proposed circuit is deduced and then the circuit diagram is drawn at gate level. The gate level circuit is converted to QCA layout using majority gates, inverters, etc. as described in the above sections and then these designs are simulated in QCA Designer which is the product of an ongoing research effort by the Walus Group at the University of British Columbia to create a design and simulation tool for QCA. The designer tool allows the designer to layout a QCA design and simulates it quickly. QCA Designer has provided a new platform for developers; results from simulations, using this tool, have been published by many international groups  {\ref [6]}\hyperref[b10]{[7]}\hyperref[b11]{[8]} {\ref [9]}\hyperref[b13]{[10]}\hyperref[b14]{[11]}. Results obtained by this tool are then compared to theoretical values to verify the correctness of the circuit.\par
IV. 
\section[{Simulation Result and Discussion}]{Simulation Result and Discussion}\par
The circuit was functionally simulated using the QCA Designer.  We can find the Output value of W, X, Y, Z is two level such as low and high when the various input digits of A,B,C,D . We look into the every output values of W, X, Y, Z are translating the input data successfully. Based on the mentioned reversible logic gate BCD-to-excess-3 code converter gate numeral logical circuit design method, we also construct BCD-to-excess-3 code converter gate by QCA. The sizes of layouts are measured on the basis of size of QCA cells. The All designs are carefully clocked and were functionally verified using QCADesigner; a layout and simulation tool for QCA. Finally, in Table  {\ref 3}, designs are compared according to number of cells, area, and delay. Table  {\ref 3} : Result analysis of proposed BCD-to-excess-3 code converter gate in QCA V. 
\section[{Conclusion}]{Conclusion}\par
This paper present a BCD-to-excess-3 code converter gate based on QCA does logic gates .This QCA circuit design provide a new functional paradigm for information encoding. In addition, QCA binary logic functions and the associated new nano-technology will provide high-speed computing, high-density applications. It is believed that QCA will become a more practical ways to create a faster and denser circuit\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{4}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Novel}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-7.png}
\caption{\label{fig_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-9.png}
\caption{\label{fig_7}}\end{figure}
  \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_1}Table 2 :}\end{figure}
 			\footnote{Year 2014 © 2014 Global Journals Inc. (US)} 			\footnote{© 2014 Global Journals Inc. (US) Novel Design of BCD to Excess-3 Code Converter in Quantum Dots Cellular Automata (QCA)} 			\footnote{Year 2014 © 2014 Global Journals Inc. (US) Y= CD+(C+D)'} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ Global Journal of Researches in Engineering]{b4}\label{b4} 	 		\textit{},  	 	 		\textit{Global Journal of Researches in Engineering}  		 	 
\bibitem[Maj]{b6}\label{b6} 	 		\textit{},  		 			= Maj 		.  		 	 	 (Maj\{(0)' ,0,Maj(0,1,1),\}1,Maj\{0,0,Maj(0,1,1)'\}] =Maj[Maj\{1,0,1\},1,Maj\{0,0,(1)'\}) 
\bibitem[W= A + B]{b7}\label{b7} 	 		\textit{},  		 			W= A + B 		.  		 	 	 (C+D) =Maj[A,1,Maj\{B,0,Maj(C,1,D)\}) 
\bibitem[ Global Journal of Researches in Engineering]{b15}\label{b15} 	 		\textit{},  	 	 		\textit{Global Journal of Researches in Engineering}  		 	 
\bibitem[Mostafarahimi et al. ()]{b11}\label{b11} 	 		‘A novel design for quantum-dot cellular automata cells and full adders’.  		 			A Mostafarahimi 		,  		 			O Kavehei 		,  		 			K Navi 		.  	 	 		\textit{J Appl Sci}  		2012. 7 p. .  	 
\bibitem[Li and Li ()]{b1}\label{b1} 	 		‘A Quantum Immune Evolutionary Algorithm and Its Application’.  		 			H Li 		,  		 			S Li 		.  	 	 		\textit{Journal of Computational Information Systems}  		2011. 7  (8)  p. .  	 
\bibitem[X= B']{b5}\label{b5} 	 		\textit{C+D) + B(C+D)' =Maj[Maj\{B},  		 			X= B' 		.  		0,Maj(C,1,D),\}1, Maj\{B,0,Maj(C,1,D.  	 
\bibitem[Townsend and Abraham (2004)]{b13}\label{b13} 	 		‘Complex gate implementations for quantum dot cellular automata’.  		 			W J Townsend 		,  		 			J A Abraham 		.  	 	 		\textit{Proc. 4th IEEE Conference Nanotechnology},  				 (4th IEEE Conference NanotechnologyPacific Grove)  		16-19 August 2004. p. .  	 
\bibitem[Orlov et al. ()]{b10}\label{b10} 	 		‘Experimental demonstration of clocked single-electron switching in quantum-dot cellular automata’.  		 			A Orlov 		,  		 			A Islamshah 		,  		 			Kummamuru 		,  		 			Rk 		,  		 			R Ramasubramaniam 		,  		 			G Toth 		,  		 			Lent 		,  		 			Cs 		,  		 			G H Bernstein 		,  		 			Snider 		,  		 			Gl 		.  	 	 		\textit{Appl Phys Lett}  		2000. 77  (2)  p. .  	 
\bibitem[Walus and Schulhof (2004)]{b12}\label{b12} 	 		‘GA: High level exploration of quantum-dot cellular automata (QCA)’.  		 			K Walus 		,  		 			G Schulhof 		,  		 			Jullien 		.  	 	 		\textit{Conf. Rec. 38 th Asilomar Conf. Signals, Systems and Computers},  				 (Pacific Grove)  		November 2004. p. 3033.  	 
\bibitem[Lent and Tougaw (1993)]{b3}\label{b3} 	 		‘Lines of interacting quantum-dot cells: A binary wire’.  		 			C S Lent 		,  		 			P D Tougaw 		.  	 	 		\textit{Journal of Applied Physics}  		November 15. 1993. 74  (10)  p. 6227.  	 
\bibitem[Liu ()]{b0}\label{b0} 	 		 			Yi Liu 		.  	 	 		\textit{Modified Quantum Genetic Algorithm Apply for Flow Shop Scheduling Problem},  				2008. 4 p. .  	 
\bibitem[Novel Design of BCD to Excess-3 Code Converter in Quantum Dots Cellular Automata (QCA)]{b8}\label{b8} 	 		\textit{Novel Design of BCD to Excess-3 Code Converter in Quantum Dots Cellular Automata (QCA)},  		 	 
\bibitem[Lent et al. ()]{b2}\label{b2} 	 		‘Quantum Cellular Automata: The physics of computing with quantum dot molecules’.  		 			C S Lent 		,  		 			P D Tougaw 		,  		 			W Prod 		.  	 	 		\textit{Physics and Computation}  		1994. p. .  	 
\bibitem[Kumar et al. (2009)]{b14}\label{b14} 	 		‘SP: A robust pulsed flip-flop and its use in enhanced scan design’.  		 			R Kumar 		,  		 			Bollapalli 		,  		 			Kc 		,  		 			R Garg 		,  		 			T Soni 		,  		 			Khatri 		.  	 	 		\textit{IEEE}  		2009. October 2009. p. .  	 
\bibitem[Morris Mano ; Walus and Jullien (2003)]{b9}\label{b9} 	 		‘V: Computer arithmetic structures for quantum cellular automata’.  		 			M Morris Mano ; Walus 		,  		 			K Jullien 		,  		 			G 		,  		 			Dimitrow 		.  	 	 		\textit{Conference Record of the Thirty-Seventh Asilomar Conference on Signals, Systems and Computers},  				November 2003. p. 12.  		 			professor of Engineering, California State University, Los Angeles, 		 	 	 (Pacific Grove) 
\end{bibitemlist}
 			 		 	 
\end{document}
