T
E
L
KO
M
N
I
KA
T
e
lec
om
m
u
n
icat
ion
,
Com
p
u
t
i
n
g,
E
lec
t
r
on
ics
an
d
Cont
r
ol
Vol.
18
,
No.
1
,
F
e
br
ua
r
y
2020
,
pp.
234
~
2
39
I
S
S
N:
1693
-
69
30,
a
c
c
r
e
dit
e
d
F
ir
s
t
G
r
a
de
by
Ke
me
nr
is
tekdikti
,
De
c
r
e
e
No:
21/E
/KP
T
/2018
DO
I
:
10.
12928/
T
E
L
KO
M
NI
KA
.
v18i1.
12645
234
Jou
r
n
al
h
omepage
:
ht
tp:
//
jour
nal.
uad
.
ac
.
id/
index
.
php/T
E
L
K
OM
N
I
K
A
N
ovel
hi
gh
f
unct
i
onal
i
t
y
f
aul
t
t
ol
e
rant
A
L
U
S
h
ave
t
a
T
h
ak
r
al,
Dip
ali
B
an
s
al
D
ep
ar
t
men
t
o
f
E
l
ect
r
o
n
i
cs
an
d
Co
mm
u
n
i
cat
i
o
n
E
n
g
i
n
ee
ri
n
g
,
Facu
l
t
y
o
f
E
n
g
i
n
eeri
n
g
an
d
T
ec
h
n
o
l
o
g
y
,
Man
av
Rach
n
a
In
t
ern
a
t
i
o
n
a
l
In
s
t
i
t
u
t
e
o
f
Res
earch
an
d
St
u
d
i
es
,
In
d
i
a
Ar
t
icle
I
n
f
o
AB
S
T
RA
CT
A
r
ti
c
le
h
is
tor
y
:
R
e
c
e
ived
M
a
r
11
,
2019
R
e
vis
e
d
J
ul
3
,
20
19
Ac
c
e
pted
Ju
l
2
1
,
20
19
Mi
n
i
at
u
ri
za
t
i
o
n
,
co
s
t
,
f
u
n
c
t
i
o
n
a
l
i
t
y
,
c
o
mp
l
ex
i
t
y
an
d
p
o
w
er
d
i
s
s
i
p
a
t
i
o
n
are
i
mp
o
rt
a
n
t
an
d
n
eces
s
ary
d
e
s
i
g
n
t
ra
i
t
s
w
h
i
ch
n
ee
d
at
t
en
t
i
o
n
i
n
ci
rcu
i
t
d
es
i
g
n
i
n
g
.
T
h
ere
i
s
a
t
ra
d
e
o
ff
b
e
t
w
ee
n
mi
n
i
a
t
u
ri
zat
i
o
n
an
d
p
o
w
er
d
i
s
s
i
p
at
i
o
n
.
Smart
t
ech
n
o
l
o
g
y
i
s
al
w
ay
s
s
earc
h
i
n
g
f
o
r
n
ew
p
ara
d
i
g
ms
t
o
co
n
t
i
n
u
e
i
mp
r
o
v
e
p
o
w
er
d
i
s
s
i
p
at
i
o
n
.
Rev
er
s
i
b
l
e
l
o
g
i
c
i
s
o
n
e
o
f
s
mart
co
mp
u
t
i
n
g
d
ep
l
o
y
ed
t
o
a
v
o
i
d
p
o
w
er
d
i
s
s
i
p
at
i
o
n
.
Res
ea
rch
ers
h
av
e
p
r
o
p
o
s
ed
man
y
rev
er
s
i
b
l
e
l
o
g
i
c
-
b
a
s
ed
ari
t
h
me
t
i
c
a
n
d
l
o
g
i
c
u
n
i
t
s
(A
L
U
).
H
o
w
ev
er,
t
h
e
res
earch
i
n
t
h
e
area
o
f
fau
l
t
t
o
l
eran
t
A
L
U
i
s
s
t
i
l
l
u
n
d
er
p
ro
g
re
s
s
.
T
h
e
ai
m
o
f
t
h
i
s
p
ap
er
i
s
t
o
b
ri
d
g
e
t
h
e
k
n
o
w
l
ed
g
e
g
ap
fo
r
a
n
ew
res
earch
er
i
n
area
o
f
fau
l
t
t
o
l
eran
ce
u
s
i
n
g
p
ar
i
t
y
p
res
er
v
i
n
g
l
o
g
i
c
g
a
t
es
rat
h
er
t
h
an
s
earc
h
i
n
g
h
u
g
e
d
at
a
t
h
ro
u
g
h
v
ari
o
u
s
s
o
u
rce
s
.
T
h
i
s
p
a
p
er
al
s
o
p
res
e
n
t
s
a
h
i
g
h
fu
n
c
t
i
o
n
a
l
i
t
y
b
as
e
d
n
o
v
el
fa
u
l
t
t
o
l
era
n
t
ari
t
h
me
t
i
c
a
n
d
l
o
g
i
c
u
n
i
t
arch
i
t
ec
t
u
re.
A
co
m
p
ari
s
o
n
o
n
o
p
t
i
mi
za
t
i
o
n
a
s
p
ec
t
s
i
s
p
re
s
en
t
ed
i
n
t
ab
u
l
ar
f
o
rm
an
d
res
u
l
t
s
s
h
o
w
s
t
h
a
t
p
ro
p
o
s
ed
A
L
U
arc
h
i
t
ect
u
re
i
s
o
p
t
i
m
u
m
b
al
a
n
ce
i
n
t
erms
o
f
al
l
as
p
ect
s
o
f
rev
er
s
i
b
l
e
l
o
g
i
c
s
y
n
t
h
e
s
i
s
.
T
h
e
p
r
o
p
o
s
e
d
A
L
U
arch
i
t
e
ct
u
re
i
s
co
d
e
d
i
n
V
eri
l
o
g
H
D
L
an
d
s
i
m
u
l
a
t
ed
u
s
i
n
g
X
i
l
i
n
x
ISE
d
es
i
g
n
s
u
i
t
1
4
.
2
t
o
o
l
.
T
h
e
q
u
an
t
u
m
co
s
t
o
f
al
l
g
at
e
s
u
s
e
d
i
n
p
r
o
p
o
s
e
d
arch
i
t
ec
t
u
re
i
s
v
eri
f
i
ed
u
s
i
n
g
RCV
i
ew
er
+
t
o
o
l
.
K
e
y
w
o
r
d
s
:
AL
U
F
a
ult
tol
e
r
a
nt
P
owe
r
dis
s
ipation
R
e
ve
r
s
ibl
e
logi
c
S
ynthes
is
Th
i
s
i
s
a
n
o
p
en
a
c
ces
s
a
r
t
i
c
l
e
u
n
d
e
r
t
h
e
CC
B
Y
-
SA
l
i
ce
n
s
e
.
C
or
r
e
s
pon
din
g
A
u
th
or
:
S
ha
ve
ta
T
ha
kr
a
l,
De
pa
r
tm
e
nt
of
E
lec
tr
onics
a
nd
C
omm
unica
ti
on
E
n
ginee
r
ing,
F
a
c
ult
y
of
E
nginee
r
ing
a
nd
T
e
c
hnology
,
M
a
na
v
R
a
c
hna
I
nter
na
ti
ona
l
I
ns
ti
tut
e
of
R
e
s
e
a
r
c
h
&
S
tudi
e
s
,
F
a
r
idaba
d,
I
nd
ia.
E
mail:
s
ha
ve
ta.
f
e
t@m
r
iu.
e
du.
in
1.
I
NT
RODU
C
T
I
ON
R
e
ve
r
s
ibl
e
c
omput
ing
is
f
ound
to
be
one
of
the
e
mer
ging
a
nd
pr
omi
s
ing
tec
hnologi
e
s
to
ove
r
c
ome
powe
r
dis
s
ipation
due
to
los
s
of
bit
s
.
R
olf
L
a
nda
u
e
r
[
1]
a
nd
C
.
H
.
B
e
nne
tt
[
2]
,
joi
ntl
y
a
ddr
e
s
s
e
d
the
is
s
ue
a
nd
s
hown
the
dir
e
c
ti
on
to
wor
k
in
thi
s
a
r
e
a
.
A
s
igni
f
i
c
a
nt
wor
k
ha
s
be
e
n
a
lr
e
a
dy
done
by
many
r
e
s
e
a
r
c
he
r
s
a
nd
e
f
f
icie
nt
a
r
c
hit
e
c
tur
e
s
ha
ve
be
e
n
inves
ti
ga
ted.
S
mar
t
r
e
ve
r
s
ibl
e
c
ompu
ti
ng
is
incor
por
a
ti
ng
f
a
ult
tol
e
r
a
nc
e
mec
ha
nis
m
in
e
xis
ti
ng
a
r
c
hit
e
c
tur
e
s
.
C
ir
c
uit
de
s
ig
ne
d
f
o
r
a
ny
a
ppli
c
a
ti
on
is
r
e
li
a
ble
a
nd
r
obus
t
onl
y
if
f
a
ult
c
ove
r
a
ge
a
nd
tes
table
f
e
a
tur
e
s
a
r
e
e
mbedde
d
int
o
it
.
F
a
ult
tol
e
r
a
nc
e
e
mbedding
a
voids
a
ddit
ional
ha
r
dwa
r
e
a
nd
c
ompl
e
xit
y
ove
r
he
a
d.
I
n
or
de
r
to
a
c
hieve
r
ob
us
tnes
s
a
nd
making
r
e
ve
r
s
ibl
e
logi
c
ba
s
e
d
de
s
ig
ne
d
s
ys
tem
f
a
ult
tol
e
r
a
nt;
pa
r
it
y
p
r
e
s
e
r
ving
logi
c
ga
tes
a
r
e
us
e
d.
C
ompl
e
x
c
omput
ing
e
nvir
onment
is
s
witching
f
r
om
pe
ta
s
c
a
le
to
e
xa
s
c
a
le
a
nd
f
a
ult
tol
e
r
a
nt
AL
U
is
he
a
r
t
o
f
it
.
P
a
r
it
y
p
r
e
s
e
r
ving
logi
c
ga
tes
a
r
e
ba
s
e
d
on
pr
inciple
of
holdi
ng
pa
r
it
y
.
I
f
in
put
ve
c
tor
(
AB
C
)
o
f
3*3
ga
te
holds
e
ve
n/odd
pa
r
it
y
,
then
outpu
t
ve
c
t
or
(
P
QR
)
s
hould
a
ls
o
hold
e
ve
n/odd
pa
r
i
ty.
C
ons
e
r
va
ti
ve
ga
te
is
not
only
pa
r
it
y
pr
e
s
e
r
ving
bu
t
it
a
ls
o
maintains
e
qua
l
number
of
1’
s
in
both
input
a
nd
output
v
e
c
tor
s
.
I
t
is
e
a
s
y
to
inves
t
igate
pa
r
it
y
pr
e
s
e
r
ving
r
e
ve
r
s
ibl
e
logi
c
ga
te
but
making
it
c
ons
e
r
va
ti
ve
is
a
bit
int
r
a
c
table
.
Evaluation Warning : The document was created with Spire.PDF for Python.
T
E
L
KO
M
NI
KA
T
e
lec
omm
un
C
omput
E
l
C
ontr
ol
N
ov
e
l
high
functional
it
y
faul
t
tol
e
r
ant
A
L
U
(
Shav
e
ta
T
hak
r
al
)
235
F
r
e
dkin
ga
te
is
e
xc
lus
ively
de
s
igned
to
maintain
c
ons
e
r
va
ti
ve
pr
ope
r
ty
.
R
e
s
e
a
r
c
he
r
s
ha
ve
inves
ti
ga
t
e
d
many
pa
r
it
y
pr
e
s
e
r
ving
logi
c
ga
tes
.
S
ome
o
f
them
a
r
e
one
th
r
ough
a
nd
c
ons
e
r
va
ti
ve
a
ls
o.
M
os
t
o
f
the
r
e
s
e
a
r
c
he
s
ha
ve
s
hown
qua
ntum
e
quivale
nc
e
of
their
pr
opos
e
d
ga
tes
a
nd
de
f
ined
their
c
or
r
e
s
ponding
qua
ntum
c
os
t
ye
t
qua
ntum
c
os
t
of
s
ome
is
s
ti
ll
unknown
a
nd
ne
e
d
to
be
inves
ti
ga
ted
li
ke
P
R
UG
a
nd
P
P
P
G
ga
tes
.
I
n
the
p
a
s
t
f
e
w
ye
a
r
s
r
e
s
e
a
r
c
he
r
s
h
a
ve
made
e
f
f
or
ts
to
de
s
ign
r
e
ve
r
s
ibl
e
logi
c
ba
s
e
d
A
L
U
[3
-
6
]
.
How
e
ve
r
,
ti
ll
now
a
va
il
a
ble
r
e
s
e
a
r
c
h
r
e
s
ult
s
on
f
a
ult
tol
e
r
a
nt
a
r
it
hmetic
logi
c
unit
a
r
e
ve
r
y
f
e
w.
Gua
n
e
t
a
l
.
[
6]
pr
opos
e
d
opt
im
ize
d
a
r
i
thm
e
ti
c
a
nd
logi
c
c
ir
c
uit
but
f
a
ult
tol
e
r
a
nc
e
is
mi
s
s
ing
in
their
de
s
ign.
R
a
ks
hit
h
a
nd
S
a
li
gr
a
m
[
7]
p
r
opos
e
d
f
a
ult
tol
e
r
a
nt
a
r
it
hmetic
logi
c
unit
us
ing
pa
r
it
y
pr
e
s
e
r
ving
l
ogic
but
c
ompl
e
xit
y
of
c
ir
c
uit
is
high
f
or
n
bit
AL
U
a
s
divi
de
a
nd
c
onque
r
a
ppr
oa
c
h
is
mi
s
s
ing.
M
a
ny
other
r
e
s
e
a
r
c
h
e
r
s
ha
ve
obtaine
d
good
r
e
s
ult
s
in
AL
U
o
pti
mi
z
a
ti
on
[
8
,
9]
.
S
a
li
gr
a
m
e
t
a
l.
,
[
10]
ha
ve
p
r
op
os
e
d
two
f
a
ult
s
tol
e
r
a
nt
AL
U
a
r
c
hit
e
c
tur
e
s
but
qua
ntu
m
c
os
t
of
both
c
ir
c
uit
s
is
uns
pe
c
if
ied
.
B
a
s
hir
i
a
nd
Ha
ghpa
r
a
s
t
[
11]
pr
opos
e
d
f
a
ult
tol
e
r
a
nt
AL
U
a
r
c
hit
e
c
tur
e
but
ga
r
ba
ge
a
nd
a
nc
il
lar
y
li
ne
s
r
e
main
unopti
mi
z
e
d
as
c
ompar
e
to
number
of
ope
r
a
ti
ons
pe
r
f
or
med
.
Author
s
pr
opos
e
d
a
nd
a
na
lyze
d
a
ba
s
ic
model
of
f
a
ult
tol
e
r
a
nt
r
e
ve
r
s
ibl
e
AL
U
but
qua
ntum
c
os
t
is
high
a
nd
number
of
ope
r
a
ti
ons
a
r
e
li
mi
ted
[
12
]
.
F
a
ult
t
oler
a
nc
e
i
s
incor
por
a
ted
in
1
-
bit
AL
U
s
tr
uc
tur
e
ba
s
e
d
on
7
pa
r
it
y
pr
e
s
e
r
ving
ga
tes
including
F
T
R
A,
F
r
e
dkin
a
nd
double
F
e
ynman
ga
tes
.
T
he
r
e
is
opti
mum
uti
l
iza
ti
on
of
r
e
s
our
c
e
s
but
f
unc
ti
ona
li
ty
is
li
mi
te
d
[
13]
.
M
oa
ll
e
m
e
t
a
l.
,
[
14]
pr
ovided
a
nother
a
ppr
oa
c
h
of
de
s
ig
ning
a
r
it
hmetic
a
nd
logi
c
unit
but
f
a
ult
t
oler
a
nc
e
f
e
a
tur
e
is
no
t
a
dde
d
to
c
ir
c
uit
.
Anothe
r
unique
a
p
pr
oa
c
h
of
AL
U
de
s
ign
is
pr
e
s
e
nted
in
r
e
s
e
a
r
c
h
w
or
k
[
15
]
.
S
e
n
e
t
a
l.
,
[
16]
p
r
opos
e
d
1
-
bit
AL
U
s
tr
uc
tur
e
but
many
de
s
ign
tr
a
it
s
r
e
main
unopti
mi
z
e
d
.
P
r
opos
e
d
de
s
ign
doe
s
not
e
ve
n
s
uppor
t
f
a
ult
tol
e
r
a
nc
e
.
T
ha
kr
a
l
a
nd
B
a
ns
a
l
[
17]
p
r
opos
e
d
f
a
ult
tol
e
r
a
nt
AL
U
a
r
c
hit
e
c
tur
e
us
ing
pa
r
it
y
pr
e
s
e
r
ving
logi
c
ga
tes
but
una
ble
to
pr
ove
it
c
ompl
e
tely
f
a
ult
tol
e
r
a
nt
du
e
to
us
e
of
HN
G
ga
te.
S
ome
r
e
s
e
a
r
c
he
r
s
ha
ve
inv
e
s
ti
ga
te
d
pa
r
it
y
pr
e
s
e
r
ving
r
e
ve
r
s
ibl
e
logi
c
-
ba
s
e
d
ga
tes
a
n
d
uti
li
z
e
d
them
to
de
s
ign
f
a
ult
tol
e
r
a
nt
AL
U
but
qua
ntum
c
os
t
of
their
pr
opos
e
d
AL
U
r
e
mains
uns
p
e
c
if
ied
[
18
,
19]
.
I
mpl
e
menta
ti
on
a
nd
c
ompar
a
ti
ve
a
n
a
lys
is
of
e
xis
ti
ng
AL
U
de
s
igns
is
f
oc
us
s
e
d
to
inves
ti
ga
te
s
c
ope
of
im
p
r
ove
ment
in
s
tate
o
f
the
a
r
t
[
20
]
.
I
n
2016,
M
is
r
a
e
t
a
l.
,
[
21]
pr
opos
e
d
ne
w
tec
hnique
f
or
f
a
ult
tol
e
r
a
nt
AL
U
de
s
ign
with
32
ope
r
a
ti
ons
but
the
r
e
a
r
e
s
ome
r
e
dunda
nt
ope
r
a
ti
ons
.
R
a
him
pour
a
nd
J
a
f
a
r
i
[
22]
pr
opos
e
d
f
a
ult
to
ler
a
nt
AL
U
us
ing
QC
A
te
c
hnology
QC
A
a
na
lys
is
s
how
s
good
r
e
s
ult
s
a
s
f
a
r
a
s
de
lay
a
nd
a
r
e
a
a
r
e
c
onc
e
r
ne
d
but
f
unc
ti
ona
li
ty
a
nd
qua
ntum
c
os
t
a
ls
o
ne
e
d
to
be
f
oc
us
e
d
in
thi
s
wo
r
k.
B
a
ha
dor
i
e
t
a
l.
,
[
23
]
pr
opos
e
d
r
e
ve
r
s
ibl
e
c
ontr
ol
unit
wi
th
f
a
ult
t
oler
a
nc
e
mec
ha
nis
m.
T
he
qua
ntum
c
os
t
is
opti
mum
in
ter
m
s
of
number
of
ope
r
a
ti
ons
but
f
o
r
c
ompl
e
te
AL
U,
qua
ntum
c
os
t
will
r
is
e
with
c
i
r
c
uit
e
xpa
ns
ion.
Da
s
a
nd
C
h
a
nda
r
a
n
[
24]
p
r
opos
e
d
1
-
bit
AL
U
incor
por
a
ted
w
it
h
f
a
ul
t
tol
e
r
a
nc
e
.
T
he
r
e
is
opt
im
um
uti
li
z
a
ti
on
of
r
e
s
our
c
e
s
li
ke
c
ons
tant
input
li
n
e
s
,
ga
r
ba
ge
output
li
ne
s
a
nd
ga
te
c
ount
a
s
f
a
r
a
s
number
of
ope
r
a
ti
ons
a
r
e
c
onc
e
r
n
e
d
but
the
r
e
is
s
c
ope
o
f
i
mpr
ove
ment
o
f
it
s
f
unc
t
ions
a
nd
qua
ntum
c
os
t.
T
ha
k
r
a
l
a
nd
B
a
ns
a
l
[
25
,
26]
pr
opos
e
d
r
e
duc
e
d
qua
ntum
c
os
t
-
ba
s
e
d
f
a
ult
tol
e
r
a
nt
AL
U
a
r
c
hit
e
c
tur
e
s
.
E
a
c
h
e
xis
ti
ng
de
s
ign
ha
s
s
ome
a
dva
ntage
s
a
nd
li
mi
tations
.
How
e
ve
r
,
ther
e
is
a
lot
of
s
c
ope
f
or
f
ur
ther
im
pr
ove
ment
of
opti
mi
z
a
ti
on
metr
ics
li
ke
qua
ntum
c
os
t,
a
nc
il
lar
y
input
s
,
number
of
ope
r
a
ti
ons
a
nd
ga
r
ba
ge
output
s
.
T
his
pa
pe
r
p
r
e
s
e
nts
a
nove
l
l
ow
c
ompl
e
x
an
d
high
f
unc
ti
ona
li
ty
-
ba
s
e
d
f
a
ult
tol
e
r
a
nt
a
r
it
hmetic
logi
c
unit
.
P
r
opos
e
d
f
a
ult
tol
e
r
a
nt
a
r
it
hmetic
logi
c
unit
is
de
s
igned
ba
s
e
d
on
c
ons
e
r
va
ti
ve
a
nd
pa
r
it
y
pr
e
s
e
r
ving
“
F
r
e
dkin
”
,
low
qua
ntum
c
os
t
pa
r
it
y
pr
e
s
e
r
ving
ba
s
e
d
“D
ouble
F
e
ynman
”
a
nd
high
f
unc
ti
ona
li
ty
pa
r
it
y
pr
e
s
e
r
ving
ba
s
e
d
“
F
T
R
A”
ga
t
e
s
.
A
br
ief
ins
ight
int
o
us
e
d
pa
r
it
y
pr
e
s
e
r
ving
log
ic
ga
tes
a
long
with
e
xpr
e
s
s
ion
a
nd
qua
ntum
im
p
leme
ntation
is
given
in
T
a
ble
1
.
T
he
methodology
o
f
p
r
opos
e
d
AL
U
de
s
ign,
pr
opos
e
d
nove
l
a
r
c
hit
e
c
tur
e
,
de
s
ign
t
r
a
it
s
c
ompar
is
on
a
nd
c
onc
lus
ion
a
r
e
given
in
s
e
c
ti
on
2
to
5
.
T
a
ble
1.
P
opular
pa
r
it
y
pr
e
s
e
r
ving
logi
c
ga
tes
R
e
ve
r
s
ib
le
lo
gi
c
ga
te
E
xpr
e
s
s
io
n
Q
ua
nt
um
i
mpl
e
me
nt
a
ti
on
F
r
e
dki
n
D
oubl
e
F
e
ynma
n
F
a
ul
t
to
le
r
a
nt
r
e
ve
r
s
ib
le
a
dde
r
(
F
T
R
A
)
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
S
N
:
1693
-
6930
T
E
L
KO
M
NI
KA
T
e
lec
omm
un
C
omput
E
l
C
ontr
ol
,
Vol.
18
,
No.
1
,
F
e
br
ua
r
y
2020:
2
34
-
2
39
236
2.
M
E
T
HO
DOL
OG
Y
OF
P
RO
P
OS
E
D
DE
S
I
GN
T
he
pr
opos
e
d
f
a
ult
tol
e
r
a
nt
a
r
it
hmetic
logi
c
unit
a
r
c
hit
e
c
tur
e
is
de
s
igned
to
ke
e
p
in
view
e
nha
nc
ing
f
unc
ti
ona
li
ty.
P
r
opos
e
d
c
i
r
c
uit
is
de
s
igned
us
ing
s
ix
“
F
r
e
dkin
”
ga
tes
,
f
ou
r
“
D
ouble
F
e
ynman
”
g
a
te
s
a
nd
one
“
F
T
R
A
ga
te
”
whic
h
a
r
e
pa
r
it
y
pr
e
s
e
r
ving
ga
tes
.
P
r
opos
e
d
C
ir
c
uit
is
s
hown
in
F
igu
r
e
1
.
“
Double
F
e
ynman
ga
te
1
”
is
pa
s
s
ing
B
or
B
’
a
s
p
e
r
s
e
lec
t
li
ne
S
0.
“
F
r
e
dkin
ga
te
1
”
is
a
c
ti
ng
a
s
2:1
mul
ti
plexe
r
.
S
2
a
nd
T
1
a
r
e
input
s
of
mul
ti
plexe
r
a
nd
S
1
i
s
a
c
ti
ng
a
s
s
e
lec
ti
on
li
ne
.
“
F
r
e
dkin
ga
te
1
”
is
pa
s
s
ing
0,
1,
B
a
nd
B
’
a
s
pe
r
de
s
ir
e
d
logi
c
de
pe
nding
upon
c
ombi
na
ti
on
o
f
S
1
a
nd
S
2.
“
Double
F
e
ynman
ga
te
2
”
is
dupli
c
a
ti
ng
a
s
we
ll
a
s
inver
ti
ng
the
input
s
ignal.
“
Double
F
e
ynman
ga
te
2
”
is
pa
s
s
ing
B
or
B
’
a
s
pe
r
de
s
ir
e
d
logi
c
de
pe
ndi
ng
upon
s
e
lec
t
li
ne
S
3.
“
F
r
e
dkin
ga
te
2
”
is
a
c
ti
ng
a
s
2:1
mu
lt
ipl
e
xe
r
.
S
5
a
nd
T
3
a
r
e
two
input
li
ne
s
a
nd
S
3
is
a
c
ti
ng
a
s
s
e
lec
t
li
ne
.
I
t
is
pa
s
s
ing
S
5
(
logi
c
0
/l
ogic
1
)
o
r
T
3
(
s
ignal
B
/B
’
)
a
s
pe
r
de
s
ir
e
d
logi
c
de
pe
ndi
ng
upon
c
omb
ination
of
S
4
a
nd
S
5
.
“
Double
F
e
ynman
ga
te
3
”
is
dupl
ica
ti
ng
a
s
we
ll
a
s
inver
ti
ng
input
s
ign
a
l
a
s
pe
r
r
e
quir
e
ment.
“
Double
F
e
ynman
ga
te
3
”
is
pa
s
s
ing
A
a
s
we
ll
a
s
A’
a
s
pe
r
de
s
ir
e
d
logi
c
de
pe
nding
up
on
s
e
lec
t
li
ne
s
S
6
a
nd
S
7
.
“
Double
F
e
ynman
ga
te
4
”
is
us
e
d
to
a
void
f
a
n
out
p
r
oblem
a
nd
c
opying
S
8
s
ign
a
l
on
a
ll
thr
e
e
output
li
ne
s
.
“
Double
F
e
ynman
ga
te
4
”
is
pa
s
s
ing
‘
0
’
o
r
‘
1
’
c
hos
e
n
by
s
e
lec
t
li
ne
S
8.
“
F
r
e
dkin
g
a
te
3
”
is
pa
s
s
ing
logi
c
‘
0
’
or
logi
c
‘
1
’
or
s
ignal
A
o
r
A
B
or
AB
’
or
A’
B
or
A+
B
or
A+
B
’
a
s
pe
r
de
s
ir
e
d
logi
c
de
pe
nding
upon
c
ombi
na
ti
on
of
T
6
,
T
4
a
nd
T
7
.
I
f
T
7
is
0
,
then
AN
D
o
f
c
ompl
e
ment
o
f
s
ignal
on
T
6
input
li
ne
a
nd
s
ignal
on
T
4
input
li
ne
is
p
r
oduc
e
d
on
T
8
output
li
ne
.
I
f
T
7
is
1
,
T
he
n
OR
o
f
s
ignals
on
T
6
a
nd
T
4
input
li
ne
s
is
pr
oduc
e
d
on
T
8
outpu
t
li
ne
.
F
igur
e
1.
P
r
opos
e
d
high
f
unc
ti
ona
li
ty
f
a
ult
tol
e
r
a
nt
r
e
ve
r
s
ibl
e
AL
U
a
r
c
hit
e
c
tur
e
“
F
T
R
A
ga
te
”
is
5x5
pa
r
it
y
pr
e
s
e
r
ving
f
a
ult
tol
e
r
a
nt
r
e
ve
r
s
ibl
e
a
dde
r
ga
te
whic
h
c
a
n
wor
k
a
s
f
ull
a
dde
r
a
s
we
ll
a
s
f
ull
s
ubtr
a
c
tor
a
long
with
pe
r
f
or
mi
ng
other
l
ogica
l
ope
r
a
ti
ons
;
pr
oving
it
to
be
a
univer
s
a
l
logi
c
ga
te.
F
T
R
A
is
ope
r
a
ted
unde
r
va
r
ious
c
ombi
na
ti
ons
of
s
e
lec
ti
on
l
ines
to
pe
r
f
or
m
12
logi
c
a
l
op
e
r
a
ti
ons
a
nd
28
a
r
i
thm
e
ti
c
ope
r
a
ti
ons
.
I
n
tot
a
l
it
c
a
n
pe
r
f
or
m
40
ope
r
a
ti
ons
.
T
his
high
f
unc
ti
ona
li
ty
p
r
ove
s
it
to
be
opti
mum
a
r
it
hmetic
logi
c
unit
.
F
our
tee
n
s
e
lec
ti
on
li
ne
s
a
r
e
us
e
d
to
c
ontr
ol
ope
r
a
ti
on
of
a
r
i
thm
e
ti
c
a
nd
logi
c
unit
.
F
o
r
pe
r
f
or
mi
ng
logi
c
a
l
ope
r
a
ti
ons
,
S
3
is
put
d
on’
t
c
a
r
e
,
S
4,
S
6
a
nd
S
7
a
r
e
put
to
z
e
r
o
.
L
ogica
l
op
e
r
a
ti
ons
Evaluation Warning : The document was created with Spire.PDF for Python.
T
E
L
KO
M
NI
KA
T
e
lec
omm
un
C
omput
E
l
C
ontr
ol
N
ov
e
l
high
functional
it
y
faul
t
tol
e
r
ant
A
L
U
(
Shav
e
ta
T
hak
r
al
)
237
XO
R
,
XN
OR
,
A
a
nd
A’
a
r
e
ob
taine
d
on
F
1
output
li
ne
,
AN
D,
NO
R
,
OR
,
NA
ND
a
r
e
obtaine
d
on
F
2
li
ne
a
nd
(
A+
B
’
)
,
(
A’
+
B
)
,
AB
’
,
A
’
B
a
r
e
obtaine
d
on
F
3
output
li
ne
.
I
f
input
ve
c
to
r
of
F
T
R
A
is
c
ons
i
de
r
e
d
a
s
A,
B
,
C
,
D,
E
a
nd
output
ve
c
tor
is
c
ons
ider
e
d
a
s
P
,
Q,
R
,
S
,
T
then
F
T
R
A
wor
ks
a
s
f
ull
a
dde
r
with
thr
e
e
input
s
A,
B
a
nd
C
in
a
r
e
pr
ovided
on
A,
B
,
C
li
ne
s
a
nd
D,
E
a
r
e
put
to
z
e
r
o
.
I
n
thi
s
a
r
r
a
nge
ment,
s
um
is
obtaine
d
on
R
li
ne
a
nd
C
out
is
obtaine
d
on
S
li
ne
.
W
hil
e
f
or
s
ubtr
a
c
ti
on
input
s
A,
B
a
nd
B
in
a
r
e
pr
ovided
on
A,
B
a
nd
D
li
ne
s
r
e
s
pe
c
ti
ve
ly
a
n
d
C
,
E
a
r
e
put
to
z
e
r
o
.
I
n
thi
s
a
r
r
a
nge
ment,
Dif
f
e
r
e
nc
e
is
obtaine
d
on
R
li
ne
a
nd
B
out
is
obtaine
d
on
T
li
ne
.
“
F
r
e
dkin
ga
te
5
”
is
a
c
ti
ng
a
s
2:1
mul
ti
plexe
r
.
F
1
a
nd
F
2
a
r
e
two
input
li
ne
s
a
n
d
S
12
is
a
c
ti
ng
a
s
s
e
lec
t
li
ne
.
I
t
is
pa
s
s
ing
F
1
o
r
F
2
on
f
u
nc
1
out
put
li
ne
a
s
pe
r
de
s
ir
e
d
logi
c
de
pe
nding
up
on
s
e
lec
t
li
ne
S
12
.
“
F
r
e
dkin
ga
te
6
”
is
a
c
ti
ng
a
s
2:1
mul
ti
ple
xe
r
.
I
t
is
pa
s
s
ing
f
unc
1
(
F
1
o
r
F
2
)
o
r
F
3
on
f
unc
ou
tput
li
ne
a
s
pe
r
de
s
ir
e
d
logi
c
de
pe
nding
upon
s
e
lec
t
li
ne
S
1
3.
3.
P
ROP
OS
E
D
F
AU
L
T
T
OL
E
RA
NT
AL
U
AR
C
HI
T
E
C
T
UR
E
T
he
p
r
opos
e
d
F
a
ult
tol
e
r
a
nt
AL
U
a
r
c
hit
e
c
tur
e
is
c
onf
igu
r
e
d
to
pe
r
f
or
m
40
ope
r
a
ti
ons
including
12
logi
c
a
l
a
nd
28
a
r
it
hmetic
ope
r
a
ti
ons
.
L
is
t
of
logi
c
a
l
ope
r
a
ti
ons
pe
r
f
o
r
med
by
pr
opos
e
d
a
r
it
hm
e
ti
c
a
nd
logi
c
a
l
unit
is
s
hown
in
T
a
ble
2.
F
or
pe
r
f
o
r
mi
ng
l
ogica
l
ope
r
a
ti
ons
;
S
3
is
put
to
don
’
t
c
a
r
e
c
ondit
i
on
while
S
4,
S
6
,
S
7
a
nd
S
9
a
r
e
put
to
0.
L
is
t
of
a
r
it
hmetic
ope
r
a
ti
ons
a
r
e
divi
de
d
int
o
two
s
e
ts
.
Ar
it
hmetic
o
pe
r
a
ti
ons
s
e
t
1
c
ompr
is
e
s
of
a
ddit
ion
r
e
late
d
ope
r
a
ti
ons
a
nd
Ar
it
hmetic
ope
r
a
ti
ons
s
e
t
2
c
ompr
is
e
s
of
s
ubtr
a
c
ti
on
r
e
late
d
ope
r
a
ti
ons
.
F
or
s
e
t
-
1ope
r
a
ti
ons
;
S
9,
S
10,
S
11,
S
12
a
nd
S
13
a
r
e
put
to
0
while
f
o
r
s
e
t
-
2
ope
r
a
ti
ons
;
S
9
is
put
e
qua
l
to
1
a
nd
S
10
,
S
11
,
S
12
a
nd
S
13
a
r
e
pu
t
to
0
.
L
is
t
of
a
r
it
h
metic
ope
r
a
ti
ons
pe
r
f
or
med
by
p
r
opos
e
d
a
r
it
hmetic
a
nd
lo
gic
unit
is
s
hown
in
T
a
ble
3.
T
ot
a
l
ope
r
a
ti
ons
c
ount
is
40
making
it
high
f
unc
ti
ona
li
ty
f
a
ult
tol
e
r
a
nt
a
r
it
hmetic
a
nd
logi
c
a
l
unit
.
P
r
opos
e
d
high
f
unc
ti
ona
li
ty
f
a
ult
tol
e
r
a
nt
r
e
ve
r
s
ibl
e
AL
U
a
r
c
hit
e
c
tur
e
is
s
hown
in
F
igur
e
1.
As
p
r
opos
e
d
nove
l
a
r
c
hit
e
c
tur
e
c
ons
is
ts
of
s
ix
F
r
e
dkin
ga
tes
(
with
qua
ntum
c
os
t
o
f
5
e
a
c
h
)
,
f
our
double
F
e
ynman
ga
tes
(
with
qua
ntu
m
c
os
t
of
2
e
a
c
h)
a
nd
one
F
T
R
A
ga
te
with
qua
ntu
m
c
os
t
of
8.
T
he
r
e
f
or
e
,
tot
a
l
qua
ntum
c
os
t
c
a
lcula
ted
is
46.
T
he
s
im
ulation
wa
ve
f
o
r
m
of
pr
opos
e
d
high
f
unc
ti
o
na
li
ty
f
a
ult
tol
e
r
a
nt
r
e
ve
r
s
ibl
e
AL
U
a
r
c
hit
e
c
tur
e
is
s
hown
in
F
igu
r
e
2
T
a
ble
2.
L
ogica
l
ope
r
a
ti
ons
S0
S1
S2
S5
S8
S
10
S
11
S
12
S
13
f
unc
0
1
x
0
0
0
1
0
0
A
X
O
R
B
0
1
X
0
0
0
1
1
0
A
A
N
D
B
0
1
X
0
0
0
1
X
1
A
+
B
’
0
1
X
0
0
1
0
0
0
A
X
N
O
R
B
0
1
X
0
0
1
0
1
0
A
N
O
R
B
0
1
X
0
0
1
0
X
1
A
’
+
B
0
1
X
1
1
0
0
1
0
A
O
R
B
0
1
X
1
1
0
0
X
1
A
B
’
0
1
X
1
1
1
1
1
0
A
N
A
N
D
B
0
1
X
1
1
1
1
X
1
A
’
B
X
0
0
0
0
0
1
0
0
A
X
0
1
0
0
0
1
0
0
A’
T
a
ble
3.
Ar
it
hmetic
ope
r
a
ti
ons
S0
S1
S2
S3
S4
S5
S6
S7
S8
F
unc
(
S
e
t
-
1)
F
unc
(
S
e
t
-
2)
X
0
0
1
1
X
1
1
0
A
pl
us
A
B
’
A
mi
nus
A
B
’
1
1
X
0
1
X
1
1
0
A
pl
us
B
’
pl
us
A
B
A
mi
nus
B
’
mi
nus
A
B
0
1
X
1
1
X
1
1
0
A
pl
us
B
pl
us
A
B
’
A
mi
nus
B
mi
nus
A
B
’
0
1
X
X
0
0
0
0
0
A
pl
us
B
A
mi
nus
B
1
1
X
X
0
0
0
0
0
A
pl
us
B
’
A
mi
nus
B
’
X
0
0
0
1
X
1
1
0
A
pl
us
A
B
A
mi
nus
A
B
1
1
X
X
0
0
0
0
1
A
pl
us
B
’
pl
us
A
A
mi
nus
B
’
mi
nus
A
0
1
X
X
0
0
0
0
1
A
pl
us
B
pl
us
A
A
mi
nus
B
mi
nus
A
X
0
0
0
1
X
0
0
0
A
pl
us
A
’
B
A
mi
nus
A
’
B
0
1
X
0
1
X
0
0
0
A
pl
us
B
pl
us
A
’
B
A
mi
nus
B
mi
nus
A
’
B
1
1
X
0
1
X
0
0
0
A
pl
us
B
’
pl
us
A
’
B
A
mi
nus
B
’
mi
nus
A
’
B
X
0
0
0
1
X
0
0
1
A
pl
us
(
A
+
B
)
A
mi
nus
(
A
+
B
)
X
0
0
1
1
X
0
0
1
A
pl
us
(
A
+
B
’
)
A
mi
nus
(
A
+
B
’
)
X
0
0
X
0
0
0
0
1
A
pl
us
A
A
mi
nus
A
Evaluation Warning : The document was created with Spire.PDF for Python.
I
S
S
N
:
1693
-
6930
T
E
L
KO
M
NI
KA
T
e
lec
omm
un
C
omput
E
l
C
ontr
ol
,
Vol.
18
,
No.
1
,
F
e
br
ua
r
y
2020:
2
34
-
2
39
238
F
igur
e
2.
S
im
ulation
wa
ve
f
or
m
of
pr
opos
e
d
f
a
ult
t
oler
a
nt
r
e
ve
r
s
ibl
e
AL
U
a
r
c
hit
e
c
tur
e
4.
COM
P
AR
I
S
ON
AN
D
RE
S
UL
T
S
T
he
pr
opos
e
d
nove
l
high
f
unc
ti
ona
li
ty
f
a
ult
tol
e
r
a
nt
AL
U
a
r
c
hit
e
c
tur
e
is
c
ompar
e
d
wit
h
De
s
ign
1
[
6]
,
De
s
ign
2
[
7]
a
nd
De
s
ign
3
[
21
]
in
ter
ms
of
im
po
r
tant
r
e
ve
r
s
ibl
e
de
s
ign
tr
a
it
s
.
T
he
p
r
opos
e
d
a
r
c
hit
e
c
tur
e
is
de
s
igned
with
mi
nim
um
qua
ntum
c
os
t
;
46
a
nd
highes
t
ope
r
a
ti
ons
:
40
.
T
he
r
e
i
s
dr
a
s
ti
c
r
e
duc
ti
on
in
r
e
ve
r
s
ibl
e
logi
c
ga
tes
,
c
ons
tant
inpu
t
li
ne
s
a
nd
c
ompl
e
xit
y
is
a
ls
o
a
voided.
R
e
ve
r
s
ibl
e
de
s
ign
tr
a
it
c
ompar
is
on
s
he
e
t
of
va
r
ious
AL
U
de
s
ign
s
is
p
r
e
s
e
nted
in
T
a
ble
4
.
A
c
ompa
r
is
on
on
opti
mi
z
a
ti
on
a
s
pe
c
ts
is
pr
e
s
e
nted
in
tabula
r
f
o
r
m
a
nd
r
e
s
ult
s
s
hows
that
pr
opos
e
d
AL
U
a
r
c
hit
e
c
tur
e
is
opti
mum
ba
lanc
e
in
ter
ms
of
a
ll
a
s
pe
c
ts
of
r
e
ve
r
s
ibl
e
logi
c
s
ynthes
is
.
B
a
r
c
ha
r
t
r
e
pr
e
s
e
ntation
is
s
hown
in
F
igur
e
3
to
c
ompar
e
e
v
a
luation
r
e
s
ult
s
a
nd
c
lea
r
unde
r
s
tanding.
F
igur
e
3.
B
a
r
c
ha
r
t
c
ompar
is
on
f
o
r
qua
nti
tative
a
n
a
lys
is
T
a
ble
4.
R
e
ve
r
s
ibl
e
de
s
ign
tr
a
it
c
ompar
is
on
s
he
e
t
A
L
U
D
E
S
I
G
N
S
D
e
s
ig
n
1
[
6]
D
e
s
ig
n
2
[
7]
D
e
s
ig
n
3
[
21]
P
r
opos
e
d
F
a
ul
t
T
ol
e
r
a
nt
A
L
U
A
r
c
hi
te
c
tu
r
e
N
o. of
G
a
te
s
24
17
16
1
1
Q
ua
nt
um
C
os
t
70
595
77
46
O
pe
r
a
ti
ons
32
32
32
40
G
a
r
ba
ge
O
ut
put
s
12
37
25
20
A
nc
il
la
r
y
I
nput
s
12
33
25
4
F
a
ul
t
T
ol
e
r
a
nc
e
No
Y
e
s
Y
e
s
Y
e
s
5.
CONC
L
USI
ON
T
he
pr
opos
e
d
nove
l
high
f
unc
ti
ona
li
ty
f
a
ult
to
ler
a
n
t
AL
U
d
e
s
ign
pr
omi
s
e
s
the
low
qua
ntum
c
os
t
a
nd
high
f
unc
ti
ona
li
ty
a
s
c
ompar
e
to
other
e
xis
ti
ng
d
e
s
igns
.
T
he
ba
r
c
ha
r
t
c
ompar
is
on
o
f
p
r
opos
e
d
no
ve
l
high
Evaluation Warning : The document was created with Spire.PDF for Python.
T
E
L
KO
M
NI
KA
T
e
lec
omm
un
C
omput
E
l
C
ontr
ol
N
ov
e
l
high
functional
it
y
faul
t
tol
e
r
ant
A
L
U
(
Shav
e
ta
T
hak
r
al
)
239
f
unc
ti
ona
li
ty
f
a
ult
tol
e
r
a
nt
AL
U
de
s
ign
ove
r
e
xi
s
ti
ng
AL
U
de
s
ign
1,
2
a
nd
3
qua
nti
tatively
de
m
ons
tr
a
tes
25%
incr
e
a
s
e
in
f
unc
ti
ona
li
ty
with
40%
r
e
duc
t
io
n
in
qua
ntum
c
os
t
a
s
c
ompar
e
to
be
s
t
r
e
s
ult
s
in
l
it
e
r
a
tur
e
.
F
a
ult
tol
e
r
a
nc
e
a
nd
tes
t
pa
tt
e
r
ns
not
only
make
s
ys
tem
r
obus
t
but
a
ls
o
de
mande
d
by
s
mar
t
c
o
mput
ing
r
e
quir
e
d
f
or
indus
tr
ial
a
nd
c
omm
e
r
c
ial
a
ppli
c
a
ti
on
s
.
T
his
r
e
s
e
a
r
c
h
may
be
f
ur
ther
e
xtende
d
f
o
r
mul
ti
bit
f
a
ult
de
tec
ti
on
a
nd
c
or
r
e
c
ti
on
a
long
with
f
unc
ti
ona
li
ty
e
nha
nc
e
ment
.
RE
F
E
RE
NC
E
S
[1
]
L
an
d
au
er
R.
,
“
Irrev
er
s
i
b
i
l
i
t
y
an
d
H
ea
t
G
en
erat
i
o
n
i
n
t
h
e
Co
m
p
u
t
i
n
g
Pr
o
ces
s
,
”
IB
M
Jo
u
r
n
a
l
o
f
R
es
e
a
r
c
h
a
n
d
D
evel
o
p
m
en
t
,
v
o
l
.
5
,
n
o
.
3
,
p
p
.
1
8
3
-
1
9
1
,
1
9
6
1
.
[2
]
Ben
n
e
t
t
C.
,
“
L
o
g
i
cal
Rev
ers
i
b
i
l
i
t
y
o
f
Co
mp
u
t
a
t
i
o
n
,
”
IB
M
Jo
u
r
n
a
l
o
f
R
es
e
a
r
c
h
a
n
d
D
eve
l
o
p
m
e
n
t
,
v
o
l
.
1
7
,
n
o
.
6
,
p
p
.
5
2
5
-
5
3
2
,
1
9
7
3
.
[3
]
T
h
o
ms
e
n
M
.
,
G
l
ü
ck
R
.
,
A
x
el
s
e
n
H
.
,
“
Rev
ers
i
b
l
e
A
ri
t
h
met
i
c
L
o
g
i
c
U
n
i
t
fo
r
Q
u
an
t
u
m
A
ri
t
h
me
t
i
c,
”
Jo
u
r
n
a
l
o
f
P
h
y
s
i
c
s
A
:
M
a
t
h
em
a
t
i
ca
l
a
n
d
Th
e
o
r
e
t
i
c
a
l
,
v
o
l
.
4
3
,
n
o
.
3
8
,
2
0
1
0
.
[4
]
Mat
t
h
ew
M,
Mat
t
h
e
w
L
,
Ri
ch
ard
M,
N
ag
araj
a
n
R.
,
“D
es
i
g
n
o
f
a
N
o
v
e
l
Rev
ers
i
b
l
e
A
L
U
u
s
i
n
g
an
E
n
h
a
n
ced
Carr
y
L
o
o
k
A
h
ead
A
d
d
er,
”
11
th
IE
E
E
In
t
er
n
a
t
i
o
n
a
l
C
o
n
f
er
e
n
c
e
o
n
Na
n
o
t
ech
n
o
l
o
g
y
,
2
0
1
2
.
[5
]
Sy
amal
a
Y
,
T
i
l
ak
A
.
,
“
Rev
er
s
i
b
l
e
A
ri
t
h
me
t
i
c
L
o
g
i
c
U
n
i
t
,
”
2
0
1
1
3
rd
I
n
t
e
r
n
a
t
i
o
n
a
l
Co
n
f
er
en
ce
o
n
E
l
ect
r
o
n
i
cs
Co
m
p
u
t
er
Tech
n
o
l
o
g
y
,
2
0
1
1
.
[6
]
G
u
an
Z
.
,
L
i
W
.
,
D
i
n
g
W
.
,
H
an
g
Y
.
,
N
i
L
.
,
“
A
n
A
r
i
t
h
me
t
i
c
L
o
g
i
c
U
n
i
t
D
es
i
g
n
Bas
e
d
o
n
Rev
ers
i
b
l
e
L
o
g
i
c
G
at
es
,
”
P
r
o
ceed
i
n
g
s
o
f
2
0
1
1
IE
E
E
P
a
ci
f
i
c
R
i
m
C
o
n
f
er
e
n
ce
o
n
Co
m
m
u
n
i
c
a
t
i
o
n
s
,
Co
m
p
u
t
e
r
s
a
n
d
S
i
g
n
a
l
P
r
o
ce
s
s
i
n
g
,
2
0
1
1
.
[7
]
Rak
s
h
i
t
h
,
T
.
R.
an
d
Sal
i
g
ram,
R.
,
“
Pari
t
y
Pres
er
v
i
n
g
L
o
g
i
c
Bas
ed
Fau
l
t
T
o
l
era
n
t
Re
v
ers
i
b
l
e
A
L
U
,
”
2
0
1
3
IE
E
E
Co
n
f
er
e
n
ce
o
n
I
n
f
o
r
m
a
t
i
o
n
&
Co
m
m
u
n
i
ca
t
i
o
n
Tech
n
o
l
o
g
i
e
s
,
2
0
1
3
.
[8
]
Si
n
g
h
R,
U
p
a
d
h
y
a
y
S,
S
S,
J
ag
an
n
a
t
h
K
,
H
ar
i
p
ra
s
ad
S.
,
“
E
ffi
ci
en
t
D
e
s
i
g
n
o
f
A
ri
t
h
m
et
i
c
L
o
g
i
c
U
n
i
t
u
s
i
n
g
Rev
ers
i
b
l
e
L
o
g
i
c
G
at
es
,”
In
t
er
n
a
t
i
o
n
a
l
Jo
u
r
n
a
l
o
f
A
d
v
a
n
ce
d
R
es
e
a
r
c
h
i
n
Co
m
p
u
t
er
E
n
g
i
n
ee
r
i
n
g
&
Tech
n
o
l
o
g
y
(IJA
R
C
E
T),
v
o
l
.
3
,
n
o
.
4
,
p
p
.
1
4
7
4
-
1
4
7
7
,
2
0
1
4
.
[9
]
G
u
p
t
a
A
,
Mal
v
i
y
a
U
,
K
a
p
s
e
V
.
,
“
D
e
s
i
g
n
o
f
S
p
eed
,
E
n
erg
y
a
n
d
Po
w
er
E
ff
i
ci
e
n
t
Rev
er
s
i
b
l
e
L
o
g
i
c
Bas
e
d
V
ed
i
c
A
L
U
fo
r
D
i
g
i
t
a
l
Pro
ce
s
s
o
rs
,
”
2
0
1
2
N
i
r
m
a
U
n
i
ver
s
i
t
y
In
t
er
n
a
t
i
o
n
a
l
C
o
n
f
er
e
n
ce
o
n
E
n
g
i
n
ee
r
i
n
g
(N
U
i
C
O
NE
),
2
0
1
4
.
[1
0
]
Sal
i
g
ram
R.
,
Sh
ri
d
h
ar
H
e
g
d
e
S.
,
A
.
K
u
l
k
arn
i
S,
H
.
R.
Bh
ag
y
a
l
ak
s
h
m
i
,
M.
K
.
V
en
k
at
e
s
h
a,
“
D
es
i
g
n
o
f
Pari
t
y
Pres
erv
i
n
g
L
o
g
i
c
Bas
e
d
Fau
l
t
T
o
l
eran
t
Rev
er
s
i
b
l
e
A
ri
t
h
met
i
c
L
o
g
i
c
U
n
i
t
,”
In
t
er
n
a
t
i
o
n
a
l
J
o
u
r
n
a
l
o
f
V
LS
I
D
es
i
g
n
&
Co
m
m
u
n
i
ca
t
i
o
n
S
ys
t
em
s
,
v
o
l
.
4
,
p
p
.
5
3
-
6
8
,
2
0
1
3
.
[1
1
]
Bas
h
i
ri
R
.
,
H
ag
h
p
ara
s
t
M
.
,
“
D
es
i
g
n
i
n
g
a
N
o
v
el
N
an
o
m
et
ri
c
Pari
t
y
Pres
erv
i
n
g
Rev
ers
i
b
l
e
A
L
U
,”
Jo
u
r
n
a
l
o
f
B
a
s
i
c
a
n
d
A
p
p
l
i
ed
S
ci
e
n
t
i
f
i
c
R
es
e
a
r
c
h
,
v
o
l
.
3
,
n
o
.
6
,
p
p
.
5
7
2
-
5
8
0
,
2
0
1
3
.
[1
2
]
Safari
P
.
,
H
ag
h
p
aras
t
M
.
,
A
zari
A
.
,
Bran
c
h
A
.
,
“
A
D
e
s
i
g
n
o
f
Fau
l
t
T
o
l
er
an
t
Rev
ers
i
b
l
e
A
r
i
t
h
met
i
c
L
o
g
i
c
U
n
i
t
,”
Li
f
e
S
c
i
en
ce
J
o
u
r
n
a
l
,
v
o
l
.
9
,
n
o
.
3
,
p
p
.
6
4
3
-
6
4
6
,
2
0
1
2
.
[1
3
]
Sen
B
.
,
G
an
eri
w
a
l
S
.
,
Si
k
d
ar
B
.
K.
,
“
Rev
er
s
i
b
l
e
L
o
g
i
c
-
Bas
ed
Fa
u
l
t
-
T
o
l
era
n
t
N
an
o
ci
rc
u
i
t
s
i
n
Q
CA
,”
I
n
t
e
r
n
a
t
i
o
n
a
l
S
ch
o
l
a
r
l
y
R
es
e
a
r
c
h
No
t
i
ce
s
,
v
o
l
.
2
0
1
3
,
p
p
.
1
-
9
,
2
0
1
3
.
[1
4
]
Mo
al
l
em
P.
,
E
h
s
a
n
p
o
u
r
M.
,
Bo
l
h
a
s
an
i
A
.
,
Mo
n
t
azer
i
M.
,
“
O
p
t
i
m
i
zed
Re
v
ers
i
b
l
e
A
r
i
t
h
met
i
c
L
o
g
i
c
U
n
i
t
s
,”
Jo
u
r
n
a
l
o
f
E
l
ect
r
o
n
i
c
s
(Ch
i
n
a
)
,
v
o
l
.
3
1
,
n
o
.
5
,
p
p
.
3
9
4
-
4
0
5
,
2
0
1
4
.
[1
5
]
G
o
p
al
L
.
,
Sy
ah
i
ra
N
.
,
Mah
ay
a
d
i
n
M.
,
Ch
o
w
d
h
u
r
y
A
.
,
G
o
p
a
l
ai
A
.
,
Si
n
g
h
A
.
,
“
D
e
s
i
g
n
an
d
Sy
n
t
h
e
s
i
s
o
f
Rev
er
s
i
b
l
e
A
ri
t
h
me
t
i
c
a
n
d
L
o
g
i
c
U
n
i
t
(A
L
U
)
,”
I
n
t
e
r
n
a
t
i
o
n
a
l
C
o
n
f
er
e
n
ce
o
n
Co
m
p
u
t
e
r
,
Co
m
m
u
n
i
ca
t
i
o
n
s
,
a
n
d
C
o
n
t
r
o
l
Tech
n
o
l
o
g
y
(I4
CT),
2
0
1
4
.
[1
6
]
Sen
B.
,
D
u
t
t
a
M.
,
G
o
s
w
am
i
M.
,
Si
k
d
ar
B.
,
“
Mo
d
u
l
ar
D
es
i
g
n
o
f
T
es
t
ab
l
e
Rev
ers
i
b
l
e
A
L
U
b
y
Q
CA
Mu
l
t
i
p
l
e
x
er
w
i
t
h
i
n
creas
e
i
n
Pro
g
rammab
i
l
i
t
y
,
”
M
i
c
r
o
e
l
ec
t
r
o
n
i
cs
Jo
u
r
n
a
l
,
v
o
l
.
4
5
,
n
o
.
1
1
,
p
p
.
1
5
2
2
-
1
5
3
2
,
2
0
1
4
.
[1
7
]
T
h
a
k
ral
S.
,
Ban
s
al
D
.
,
“
Fau
l
t
T
o
l
er
an
t
A
L
U
u
s
i
n
g
P
ari
t
y
Pres
erv
i
n
g
Rev
ers
i
b
l
e
L
o
g
i
c
G
at
es
,”
In
t
e
r
n
a
t
i
o
n
a
l
Jo
u
r
n
a
l
o
f
M
o
d
e
r
n
E
d
u
c
a
t
i
o
n
a
n
d
Co
m
p
u
t
e
r
S
c
i
en
ce,
v
o
l
,
8
,
n
o
.
8
,
p
p
.
5
1
-
5
8
,
2
0
1
6
.
[1
8
]
Sas
amal
T
.
,
Si
n
g
h
A
.
,
Mo
h
an
A
.
,
“
E
ffi
ci
e
n
t
D
e
s
i
g
n
o
f
Re
v
ers
i
b
l
e
A
L
U
i
n
Q
u
an
t
u
m
-
D
o
t
Cel
l
u
l
ar
A
u
t
o
ma
t
a
,”
O
p
t
i
k
,
v
o
l
.
1
2
7
,
n
o
.
1
5
,
p
p
.
6
1
7
2
-
6
1
8
2
,
2
0
1
6
.
[1
9
]
K
ri
s
h
n
a
Mu
rt
h
y
M.
,
“
D
es
i
g
n
o
f
E
ff
i
ci
e
n
t
A
d
d
er
Ci
r
cu
i
t
s
U
s
i
n
g
Pro
p
o
s
ed
Par
i
t
y
Pres
er
v
i
n
g
G
at
e
(
PPPG
),
”
In
t
e
r
n
a
t
i
o
n
a
l
Jo
u
r
n
a
l
o
f
V
L
S
I
D
e
s
i
g
n
&
Co
m
m
u
n
i
ca
t
i
o
n
S
ys
t
e
m
s
,
v
o
l
.
3
,
n
o
.
3
,
p
p
.
8
3
-
3
9
,
2
0
1
2
.
[2
0
]
T
h
a
k
ral
S.
,
Ban
s
al
D
.
,
Ch
a
k
arv
ar
t
i
S.
,
“
Imp
l
emen
t
at
i
o
n
an
d
A
n
al
y
s
i
s
o
f
Rev
er
s
i
b
l
e
l
o
g
i
c
Bas
e
d
A
ri
t
h
me
t
i
c
L
o
g
i
c
U
n
i
t
,
”
TE
LKO
M
NIKA
Te
l
eco
m
m
u
n
i
ca
t
i
o
n
C
o
m
p
u
t
i
n
g
E
l
ect
r
o
n
i
c
s
a
n
d
Co
n
t
r
o
l
,
v
o
l
.
1
4
,
n
o
.
4
,
1
2
9
2
-
1
2
9
8
,
2
0
1
6
.
[2
1
]
Mi
s
ra
N
.
K
.
,
W
ai
ry
a
S.
,
&
Si
n
g
h
V
.
K
.
,
“
A
p
p
ro
ac
h
t
o
D
es
i
g
n
a
H
i
g
h
-
Perfo
rma
n
ce
Fau
l
t
-
T
o
l
era
n
t
Rev
er
s
i
b
l
e
A
L
U
,
”
In
t
e
r
n
a
t
i
o
n
a
l
Jo
u
r
n
a
l
o
f
Ci
r
cu
i
t
s
a
n
d
A
r
ch
i
t
ec
t
u
r
e
D
es
i
g
n
,
v
o
l
.
2
,
n
o
.
1
,
p
p
.
8
3
-
1
0
3
,
2
0
1
6
.
[2
2
]
G
ad
i
m
M.
R.
,
N
av
i
mi
p
o
u
r
N.
J
.
,
“A
N
ew
T
h
ree
-
L
ev
e
l
Fau
l
t
T
o
l
er
an
ce
A
r
i
t
h
met
i
c
an
d
L
o
g
i
c
U
n
i
t
Bas
e
d
o
n
Q
u
a
n
t
u
m
D
o
t
Cel
l
u
l
ar
A
u
t
o
ma
t
a,
”
M
i
c
r
o
s
ys
t
em
t
ech
n
o
l
o
g
i
es
,
v
o
l
.
2
4
,
n
o
.
2
,
p
p
.
1
2
9
5
-
1
3
0
5
,
2
0
1
8
.
[2
3
]
Bah
ad
o
ri
G
.
,
H
o
u
s
h
ma
n
d
M.
,
Z
o
mo
r
o
d
i
-
Mo
g
h
a
d
am
M.
,
“
D
es
i
g
n
o
f
a
Fau
l
t
-
T
o
l
eran
t
Rev
er
s
i
b
l
e
Co
n
t
r
o
l
U
n
i
t
in
Mo
l
ec
u
l
ar
Q
u
an
t
u
m
-
D
o
t
Cel
l
u
l
ar
A
u
t
o
mat
a
,”
In
t
er
n
a
t
i
o
n
a
l
J
o
u
r
n
a
l
o
f
Q
u
a
n
t
u
m
In
f
o
r
m
a
t
i
o
n
,
v
o
l
.
1
6
,
n
o
.
1
,
2
0
1
8
.
[2
4
]
D
as
B.
an
d
Ch
a
n
d
ra
n
S.
,
“T
o
w
ar
d
s
t
h
e
D
es
i
g
n
i
n
g
o
f
E
ffi
ci
e
n
t
C
o
mp
u
t
i
n
g
Rev
er
s
i
b
l
e
Fa
u
l
t
T
o
l
era
n
t
A
ri
t
h
me
t
i
c
Ci
rcu
i
t
s
an
d
A
L
U
,”
E
u
r
o
p
ea
n
Jo
u
r
n
a
l
o
f
S
c
i
en
t
i
f
i
c
R
es
e
a
r
c
h
,
v
o
l
.
1
5
0
,
n
o
.
2
,
p
p
.
1
2
6
-
1
5
1
,
2
0
1
8
.
[2
5
]
T
h
a
k
ral
S.
,
an
d
Ban
s
al
D
.
,
“
Fau
l
t
T
o
l
era
n
t
A
ri
t
h
me
t
i
c
L
o
g
i
c
U
n
i
t
,”
In
t
er
n
a
t
i
o
n
a
l
Co
n
f
e
r
en
ce
o
n
E
m
er
g
i
n
g
Cu
r
r
e
n
t
T
r
en
d
s
i
n
Co
m
p
u
t
i
n
g
a
n
d
E
x
p
er
t
Tech
n
o
l
o
g
y
,
p
p
.
2
2
6
-
2
3
3
,
2
0
1
9
.
[2
6
]
T
h
a
k
ral
S.
,
an
d
Ban
s
al
D
.
,
“
Imp
ro
v
ed
Fa
u
l
t
T
o
l
eran
t
A
L
U
A
rch
i
t
ec
t
u
re
,”
I
n
t
e
r
n
a
t
i
o
n
a
l
Jo
u
r
n
a
l
o
f
E
n
g
i
n
ee
r
i
n
g
and
A
d
v
a
n
ce
d
Tech
n
o
l
o
g
y
(IJE
A
T)
,
v
o
l
.
8
,
n
o
.
6
,
p
p
.
1
4
7
7
-
1
4
8
4
,
2
0
1
9
.
Evaluation Warning : The document was created with Spire.PDF for Python.