I
nte
rna
t
io
na
l J
o
urna
l o
f
Rec
o
nfig
ura
ble a
nd
E
m
bedd
e
d Sy
s
t
em
s
(
I
J
RE
S)
Vo
l.
9
,
No
.
3
,
No
v
em
b
er
2
0
2
0
,
p
p
.
2
13
~
22
3
I
SS
N
: 2
0
8
9
-
4
8
6
4
,
DOI
: 1
0
.
1
1
5
9
1
/ij
r
es
.
v
9
.i
3
.
p
p
2
13
-
22
3
213
J
o
ur
na
l ho
m
ep
a
g
e
:
h
ttp
:
//ij
r
es.ia
esco
r
e.
co
m
Spa
ce
-
time
t
r
ellis
co
des: F
i
eld prog
ra
mm
a
ble ga
te
a
rray
appro
a
ch
M
a
llik
a
rj
un
a
G
o
wda
C.
P
.
,
Ra
j
u H
a
j
a
re
De
p
a
rtme
n
t
o
f
El
e
c
tro
n
ics
a
n
d
Te
lec
o
m
m
u
n
ica
ti
o
n
En
g
in
e
e
rin
g
,
B
M
S
In
sti
tu
te
o
f
Tec
h
n
o
l
o
g
y
a
n
d
M
a
n
a
g
e
m
e
n
t,
In
d
ia
Art
icle
I
nfo
AB
S
T
RAC
T
A
r
ticle
his
to
r
y:
R
ec
eiv
ed
Feb
1
8
,
2
0
2
0
R
ev
is
ed
Ma
r
1
9
,
2
0
2
0
Acc
ep
ted
Ma
y
1
7
,
2
0
2
0
In
t
h
is
p
a
p
e
r,
a
n
e
ffe
c
ti
v
e
m
e
th
o
d
o
f
im
p
lem
e
n
tatio
n
o
f
S
p
a
c
e
-
Ti
m
e
Trelli
s
Co
d
e
s
(S
TT
C)
f
o
r
4
-
sta
te
o
n
F
ie
ld
P
ro
g
ra
m
m
a
b
le
G
a
t
e
Arra
y
is
p
re
se
n
ted
.
To
re
a
c
h
t
h
e
v
e
ry
h
i
g
h
d
a
ta
ra
tes
p
ro
v
id
e
d
i
n
S
T
TC,
a
lo
t
o
f
e
x
p
e
n
siv
e
h
i
g
h
-
sp
e
e
d
Dig
it
a
l
S
i
g
n
a
l
P
ro
c
e
ss
o
rs
(
DSP
s)
sh
o
u
ld
b
e
e
m
p
l
o
y
e
d
f
o
r
t
h
e
re
a
l
ti
m
e
a
p
p
li
c
a
ti
o
n
s,
wh
i
le
it
m
ig
h
t
n
o
t
b
e
a
ffo
r
d
a
b
le.
T
h
is
fa
c
t
h
a
s
m
o
ti
v
a
ted
in
d
e
sig
n
in
g
d
e
d
ica
ted
h
a
rd
wa
re
imp
lem
e
n
tatio
n
s
u
si
n
g
F
ield
P
r
o
g
ra
m
m
a
b
le
G
a
t
e
Arra
y
(F
P
G
A)
with
lo
w
c
o
st
a
n
d
p
o
we
r
c
o
n
su
m
p
ti
o
n
.
Th
e
h
a
rd
wa
re
d
e
v
ice
XC3
S
4
0
0
,
fa
m
il
y
Xili
n
x
S
p
a
rtan
-
3
,
a
n
d
p
a
c
k
a
g
e
P
Q2
0
8
a
re
u
se
d
in
th
is
p
ro
jec
t,
in
w
h
ich
th
e
S
TT
C
e
n
c
o
d
e
r
a
n
d
d
e
c
o
d
e
r
u
ti
li
z
e
s
m
a
x
imu
m
1
0
%
a
n
d
2
2
%
a
s
th
a
t
o
f
a
v
a
il
a
b
l
e
d
e
v
ice
c
a
p
a
c
it
y
re
sp
e
c
ti
v
e
l
y
.
T
h
e
d
e
sig
n
h
a
s
b
e
e
n
sim
u
late
d
a
n
d
sy
n
th
e
siz
e
d
su
c
c
e
ss
fu
ll
y
in
Xili
n
x
in
teg
ra
ted
so
ftwa
re
e
n
v
iro
n
m
e
n
t.
K
ey
w
o
r
d
s
:
Dig
ital sig
n
al
p
r
o
ce
s
s
o
r
s
FP
GA
Sp
ac
e
-
tim
e
tr
ellis
co
d
es
Sq
u
ar
ed
eu
clid
ea
n
d
is
tan
ce
Viter
b
i d
ec
o
d
in
g
alg
o
r
ith
m
T
h
is i
s
a
n
o
p
e
n
a
c
c
e
ss
a
rticle
u
n
d
e
r th
e
CC B
Y
-
SA
li
c
e
n
se
.
C
o
r
r
e
s
p
o
nd
ing
A
uth
o
r
:
Ma
llik
ar
ju
n
a
Go
wd
a
C
.
P.,
Dep
ar
tm
en
t o
f
E
lectr
o
n
ics an
d
T
elec
o
m
m
u
n
icatio
n
E
n
g
in
ee
r
in
g
,
B
M
S I
n
s
titu
te
o
f
T
ec
h
n
o
l
o
g
y
an
d
Ma
n
a
g
em
en
t,
Do
d
d
ab
allap
u
r
Ma
in
R
o
ad
,
Av
alah
alli,
Yela
h
an
k
a,
B
en
g
alu
r
u
,
Kar
n
ata
k
a
5
6
0
0
6
4
,
I
n
d
ia
.
E
m
ail: c
p
m
allik
ar
ju
n
ag
o
wd
a
@
b
m
s
it.in
1.
I
NT
RO
D
UCT
I
O
N
Sp
ac
e
-
T
im
e
T
r
ellis
C
o
d
in
g
(
STT
C
)
is
a
ch
an
n
el
co
d
in
g
t
ec
h
n
iq
u
e
th
at
ca
n
b
e
u
s
ed
to
im
p
r
o
v
e
th
e
p
er
f
o
r
m
an
ce
o
f
wir
eless
co
m
m
u
n
icatio
n
s
y
s
tem
s
o
v
er
f
ad
in
g
ch
a
n
n
els.
STT
C
co
m
b
in
es
b
o
th
s
p
ac
e
an
d
tim
e
d
iv
er
s
ity
to
av
o
id
m
u
ltip
ath
f
ad
in
g
.
Sev
er
al
r
esear
c
h
er
s
h
av
e
u
n
d
er
tak
en
th
e
co
n
s
tr
u
ctio
n
o
f
s
p
ac
e
-
tim
e
tr
ellis
co
d
es
[
1
]
.
T
h
e
r
an
k
a
n
d
d
eter
m
in
an
t c
r
iter
io
n
(
R
DC
)
an
d
E
u
clid
ea
n
d
is
tan
ce
cr
iter
io
n
(
E
DC
)
h
av
e
b
ee
n
d
ev
elo
p
e
d
as
d
esig
n
cr
iter
ia.
T
h
e
s
p
ac
e
-
tim
e
(
ST)
co
d
in
g
ca
n
m
ak
e
g
o
o
d
u
s
e
o
f
th
e
tr
an
s
m
it
d
iv
er
s
ity
to
allev
iate
th
e
ef
f
ec
t
o
f
f
ad
in
g
an
d
ac
h
iev
e
h
ig
h
d
ata
tr
an
s
m
is
s
io
n
r
ate
with
o
u
t
ad
d
in
g
ex
tr
a
b
an
d
wid
th
an
d
p
o
wer
co
n
s
u
m
p
tio
n
.
T
h
e
f
i
r
s
t
ST
co
d
e
with
a
n
o
r
m
alize
d
r
ate
o
f
1
s
y
m
b
o
l
p
er
c
h
an
n
el
u
s
e
(
p
cu
)
was
p
r
o
p
o
s
ed
b
y
Alam
o
u
ti
o
v
er
t
wo
tr
an
s
m
it
an
ten
n
as
a
n
d
two
tim
e
p
er
io
d
s
[
2
]
.
I
n
[
3
]
,
T
ar
o
k
h
g
av
e
t
h
e
d
esig
n
cr
iter
ia,
wh
ich
is
a
tr
a
d
eo
f
f
b
e
twee
n
co
n
s
tellatio
n
s
ize,
d
ata
r
ate,
co
m
p
lex
ity
,
an
d
d
iv
e
r
s
ity
ad
v
an
tag
e
f
o
r
ST
co
d
e;
h
e
p
r
esen
ted
s
p
ac
e
-
ti
m
e
tr
ellis
co
d
e
(
STT
C
)
is
a
b
le
to
co
m
b
at
th
e
ef
f
ec
t
o
f
f
ad
in
g
,
wh
ich
ca
n
s
im
u
ltan
eo
u
s
ly
o
f
f
e
r
a
s
u
b
s
tan
tial
co
d
in
g
g
ain
,
s
p
ec
tr
al
ef
f
i
cien
cy
,
an
d
d
iv
e
r
s
ity
im
p
r
o
v
e
m
en
t
o
n
f
lat
f
ad
i
n
g
ch
an
n
els
[4
-
10]
.
2.
H
ARDWA
R
E
I
M
P
L
E
M
E
N
T
AT
I
O
N
T
h
e
h
ar
d
war
e
im
p
lem
en
tatio
n
o
f
STT
C
en
co
d
er
f
o
r
an
y
n
u
m
b
er
o
f
s
tates
is
les
s
co
m
p
lex
an
d
f
o
r
m
o
r
e
n
u
m
b
er
o
f
s
tates
in
th
e
d
ec
o
d
er
th
e
im
p
lem
en
tatio
n
co
m
p
lex
ity
o
f
h
ar
d
war
e
in
cr
ea
s
es.
T
h
e
Viter
b
i
alg
o
r
ith
m
to
p
e
r
f
o
r
m
m
a
x
im
u
m
-
lik
elih
o
o
d
d
e
co
d
in
g
is
attr
ac
tiv
e
f
o
r
ef
f
icien
t
VL
SI
h
ar
d
war
e
im
p
lem
en
tatio
n
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
20
89
-
4
8
6
4
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
,
Vo
l.
9
,
No
.
3
,
No
v
e
m
b
er
2
0
2
0
:
21
3
–
22
3
214
2
.
1
.
ST
T
C
enco
der
Sp
ac
e
-
tim
e
tr
ellis
co
d
es
(
ST
T
C
s
)
co
m
b
in
e
m
o
d
u
latio
n
an
d
tr
ellis
co
d
in
g
to
tr
a
n
s
m
it
in
f
o
r
m
atio
n
o
v
er
m
u
ltip
le
tr
an
s
m
it
a
n
ten
n
as
[
1
]
.
T
o
ac
h
iev
e
f
u
ll
d
iv
e
r
s
ity
,
a
STT
C
s
h
o
u
l
d
s
atis
f
y
th
e
r
an
k
cr
iter
io
n
wh
e
r
e
as
to
ac
h
iev
e
f
u
ll
d
ata
r
ate,
s
h
o
u
ld
s
atis
f
y
th
e
d
eter
m
in
an
t
cr
iter
io
n
.
L
et
u
s
ass
u
m
e
a
co
n
s
t
ellatio
n
th
at
m
ap
s
c
b
its
o
f
d
ata
to
a
s
y
m
b
o
l,
th
e
d
elay
d
iv
er
s
ity
s
ch
em
e
u
s
e
s
ev
er
y
c
in
p
u
t
b
it
to
p
ick
o
n
e
s
y
m
b
o
l
th
at
is
tr
an
s
m
itted
f
r
o
m
th
e
s
ec
o
n
d
a
n
ten
n
a.
T
h
e
n
,
th
e
f
ir
s
t
an
ten
n
a
tr
an
s
m
its
th
e
s
am
e
s
y
m
b
o
ls
with
a
d
elay
o
f
o
n
e
s
y
m
b
o
l
.
Sin
ce
t
h
e
s
y
m
b
o
ls
g
o
th
r
o
u
g
h
two
in
d
e
p
en
d
e
n
t
ch
a
n
n
el
p
ath
g
ain
s
,
a
d
iv
e
r
s
ity
o
f
two
is
ac
h
iev
ed
f
o
r
o
n
e
o
r
m
o
r
e
r
ec
eiv
e
an
te
n
n
as.
T
h
e
b
lo
ck
d
iag
r
am
o
f
STT
C
en
co
d
er
is
s
h
o
wn
in
Fig
u
r
e
1
.
I
n
o
u
r
im
p
lem
en
tatio
n
,
we
c
o
n
s
id
er
ed
a
4
-
s
tate
s
p
ac
e
-
tim
e
tr
ellis
co
d
e
d
QPSK
s
ch
em
e
with
2
-
t
r
an
s
m
it
an
ten
n
as.
T
h
e
en
c
o
d
er
co
n
s
is
t
s
o
f
a
b
it
s
p
litt
er
,
two
f
ee
d
f
o
r
war
d
s
h
if
t
r
e
g
is
ter
s
,
f
o
u
r
m
u
ltip
lier
s
,
a
n
d
m
o
d
u
l
o
4
-
a
d
d
er
.
A
b
it
s
p
litt
er
s
p
lits
th
e
in
p
u
t
s
eq
u
en
ce
,
c
,
in
to
two
p
ar
allel
b
it
s
tr
ea
m
s
wh
ich
ar
e
d
elay
ed
b
y
o
n
e
b
it
d
elay
cir
cu
it.
T
h
e
b
its
,
1
t
c
&
2
t
c
,
an
d
th
e
d
elay
ed
b
its
,
1
1
−
t
c
&
2
2
−
t
c
,
ar
e
m
u
ltip
lied
with
an
en
co
d
e
r
co
ef
f
i
cien
t
s
et
an
d
h
e
n
ce
,
th
e
r
esu
lts
o
f
all
th
e
m
u
ltip
lier
s
ar
e
ad
d
ed
b
y
m
o
d
u
lo
-
4
ad
d
e
r
.
T
h
e
ad
d
er
o
u
tp
u
ts
,
1
t
x
&
2
t
x
,
ar
e
p
o
in
ts
f
r
o
m
a
QPS
K
co
n
s
tellatio
n
; th
ey
ar
e
tr
a
n
s
m
itted
s
im
u
ltan
eo
u
s
ly
th
r
o
u
g
h
th
e
1
st
an
d
2
nd
an
ten
n
a,
r
esp
ec
tiv
ely
.
Fig
u
r
e
1
.
B
lo
ck
d
iag
r
am
o
f
ST
T
C
en
co
d
er
2
.
1
.
1
.
B
it
s
pli
t
t
er
T
h
e
C
ir
cu
it
d
iag
r
am
o
f
B
it
S
p
litt
er
as
illu
s
tr
ated
in
Fig
u
r
e
2
.
T
h
e
in
p
u
t
s
eq
u
e
n
ce
,
c,
is
ap
p
lied
to
th
e
f
lip
-
f
lo
p
-
1
,
wh
ich
o
u
tp
u
t
is
g
iv
en
as
in
p
u
t
to
f
lip
-
f
l
o
p
-
2
with
a
co
m
m
o
n
clo
c
k
.
A
f
lip
-
f
lo
p
-
3
is
a
m
o
d
-
2
co
u
n
ter
wh
ich
o
u
tp
u
t
is
u
s
ed
as
a
clo
ck
f
o
r
th
e
f
lip
-
f
lo
p
-
4
&
5
.
I
n
itially
,
all
th
e
f
lip
-
f
lo
p
s
ar
e
r
eset
to
ze
r
o
wh
ich
ar
e
tr
ig
g
er
e
d
at
n
eg
ativ
e
ed
g
e
clo
ck
.
Du
r
in
g
f
ir
s
t
clo
c
k
cy
cle
th
e
f
ir
s
t
L
SB
o
f
d
ata
is
s
to
r
ed
in
th
e
f
li
p
-
f
lo
p
-
1
wh
ile
f
lip
-
f
lo
p
-
1
o
u
tp
u
t
is
s
to
r
ed
in
th
e
f
lip
-
f
lo
p
-
2
a
n
d
th
e
f
lip
-
f
lo
p
-
3
g
e
n
er
ates
t
h
e
lo
g
ic
‘
1
’
o
u
tp
u
t.
Fo
r
n
ex
t
clo
ck
cy
cle
th
e
f
ir
s
t L
SB
o
f
d
ata
is
s
to
r
ed
in
th
e
f
li
p
-
f
lo
p
-
2
wh
ile
s
ec
o
n
d
L
SB
o
f
d
ata
will
b
e
in
f
lip
-
f
lo
p
-
1
an
d
th
e
f
lip
-
f
lo
p
-
3
g
en
er
ates
lo
g
ic
‘
0
’
.
So
,
i
n
th
is
in
s
tan
t
th
e
f
lip
-
f
lo
p
-
4
&
5
will
s
im
u
ltan
eo
u
s
ly
b
e
tr
ig
g
er
ed
a
n
d
th
e
f
lip
-
f
lo
p
-
4
g
i
v
es f
ir
s
t L
SB
o
f
d
ata
wh
er
ea
s
th
e
f
lip
-
f
lo
p
-
5
g
iv
es seco
n
d
L
SB
o
f
d
ata.
Fig
u
r
e
2
.
C
ir
cu
it d
iag
r
am
o
f
b
i
t sp
litt
er
2
.
1
.
2
.
Dela
y
g
ener
a
t
o
r
T
h
e
C
ir
cu
it
d
iag
r
am
f
o
r
Dela
y
g
en
e
r
ato
r
as
illu
s
tr
ated
in
F
ig
u
r
e
3
.
T
h
e
s
tate
s
elec
tio
n
is
tak
en
f
o
r
64
-
s
tate
b
u
t
we
h
av
e
d
o
n
e
f
o
r
o
n
ly
3
2
-
s
tate,
an
d
ex
p
la
n
a
tio
n
with
an
ex
am
p
le
is
g
iv
en
f
o
r
4
-
s
tate
o
n
ly
.
‘1’
D
rst Q
c
lk
1
D
rst
Q
c
lk
2
T
rst
Q
c
lk
3
D
rst
Q
c
lk
4
D r
st
Q
c
lk
5
1
t
c
c
l
k
c
I
nput
,
g
en
c
lk
2
t
c
reset
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
I
SS
N:
2089
-
4
8
6
4
S
p
a
ce
-
time
tr
ellis
co
d
es:
F
ield
p
r
o
g
r
a
mma
b
le
g
a
te
a
r
r
a
y
a
p
p
r
o
a
ch
(
Ma
llika
r
ju
n
a
Go
w
d
a
C
.
P
)
215
Ho
wev
er
,
s
ix
d
elay
elem
en
ts
r
eq
u
ir
ed
f
o
r
6
4
-
s
tate
in
wh
ich
th
r
ee
d
elay
elem
en
ts
ar
e
u
s
ed
in
u
p
p
er
lin
e
&
an
o
th
er
th
r
ee
d
elay
e
d
elem
en
ts
ar
e
in
lo
wer
lin
es.
Fig
u
r
e
3
,
s
h
o
ws
th
e
cir
cu
it
d
iag
r
am
o
f
d
elay
g
en
er
ato
r
,
wh
ich
co
n
s
is
ts
o
f
th
r
ee
D
f
lip
-
f
lo
p
s
ar
e
co
n
n
ec
te
d
in
s
er
ies
in
u
p
p
er
l
in
e
wh
er
e
as
an
o
th
e
r
th
r
ee
D
f
lip
-
f
lo
p
s
ar
e
co
n
n
ec
ted
in
s
er
ies
in
lo
wer
lin
e.
T
h
e
u
p
p
er
lin
e
f
lip
-
f
lo
p
s
ar
e
r
eq
u
ir
e
d
to
g
en
er
ate
o
n
e
-
b
it
d
elay
f
o
r
th
e
d
ata,
wh
er
ea
s
th
e
l
o
wer
lin
e
f
lip
-
f
lo
p
s
ar
e
u
s
ed
to
g
en
er
at
e
o
n
e
-
b
it
d
elay
f
o
r
th
e
d
ata.
Fig
u
r
e
3
.
C
ir
cu
it d
iag
r
am
f
o
r
d
elay
g
en
e
r
ato
r
2
.
1
.
3
.
Co
der
A
co
d
er
co
n
s
is
ts
o
f
m
u
ltip
lier
,
s
tate
s
elec
to
r
,
an
d
m
o
d
u
lo
-
4
ad
d
er
.
T
h
e
in
te
r
n
al
ar
ch
itec
tu
r
e
(
R
T
L
Sch
em
atic)
o
f
co
d
er
is
s
h
o
wn
in
th
e
ap
p
en
d
i
x
.
I
f
an
e
n
co
d
e
r
wh
ich
is
o
p
er
ated
with
eith
er
4
-
s
tate
o
r
8
-
s
tate
o
r
16
-
s
tate
o
r
3
2
-
s
tate,
th
e
s
tate
s
elec
to
r
s
h
o
u
l
d
s
elec
t
eith
er
0
1
0
o
r
0
1
1
o
r
1
0
0
o
r
1
0
1
r
esp
ec
t
iv
ely
.
T
h
e
en
c
o
d
er
co
ef
f
icien
t
s
et
ar
e
m
u
ltip
lied
with
in
p
u
t
b
its
an
d
d
elay
ed
b
i
ts
b
y
m
u
ltip
lier
an
d
th
en
m
o
d
u
lo
-
4
a
d
d
er
is
u
s
ed
to
ad
d
all
t
h
e
m
u
ltip
lier
o
u
tp
u
ts
,
s
in
ce
th
e
en
co
d
ed
s
y
m
b
o
ls
0
,
1
,
2
,
&
3
ar
e
u
s
ed
to
m
o
d
u
late
f
o
r
QPSK
m
o
d
u
lato
r
.
T
h
e
ad
d
er
o
u
t
p
u
ts
1
t
x
&
2
t
x
ar
e
p
o
in
ts
f
r
o
m
a
QPSK
co
n
s
tellatio
n
wh
ich
ar
e
tr
an
s
m
itted
s
im
u
ltan
eo
u
s
ly
th
r
o
u
g
h
t
h
e
f
ir
s
t a
n
d
s
ec
o
n
d
an
te
n
n
a,
r
esp
ec
tiv
ely
.
2
.
2
.
Alg
o
rit
hm
f
o
r
ST
T
C
en
c
o
der
Step
1
: Cl
ea
r
all
th
e
m
em
o
r
y
e
lem
en
ts
(
s
h
if
t r
eg
is
ter
s
)
to
ze
r
o
,
s
ay
d
1
=
0
; d
2
=
0
.
Step
2
: I
n
p
u
t seq
u
en
ce
,
c
,
is
s
p
litt
ed
in
to
two
s
tr
ea
m
s
o
f
b
its
,
s
ay
1
t
c
&
2
t
c
.
Step
3
:
B
it
s
tr
ea
m
s
,
1
t
c
&
2
t
c
,
an
d
b
i
ts
f
r
o
m
all
s
h
if
t
r
e
g
is
ter
s
ar
e
m
u
ltip
lied
b
y
1
st
tr
an
s
m
it
a
n
te
n
n
a
e
n
co
d
er
co
ef
f
icien
t
s
et.
T
h
e
STT
C
s
y
m
b
o
l
f
o
r
1
st
tr
an
s
m
it
an
ten
n
a,
s
ay
1
t
x
,
is
o
b
tain
ed
b
y
th
e
m
u
ltip
lier
o
u
tp
u
ts
f
r
o
m
all
s
h
if
t r
eg
is
ter
s
ar
e
m
o
d
u
lo
-
4
ad
d
e
d
.
Step
4
:
B
it
s
tr
ea
m
s
,
1
t
c
&
2
t
c
,
an
d
b
it
s
f
r
o
m
all
s
h
if
t
r
eg
is
ter
s
ar
e
m
u
ltip
lied
b
y
2
nd
tr
an
s
m
it
an
te
n
n
a
en
c
o
d
e
r
co
ef
f
icien
t
s
et.
T
h
e
STT
C
s
y
m
b
o
l
f
o
r
2
nd
tr
a
n
s
m
it
an
ten
n
a,
s
ay
2
t
x
,
i
s
o
b
tain
ed
b
y
th
e
m
u
ltip
lier
o
u
tp
u
ts
f
r
o
m
all
s
h
if
t r
eg
is
ter
s
ar
e
m
o
d
u
lo
-
4
ad
d
e
d
.
Step
5
: Bi
t stre
am
s
,
1
t
c
&
2
t
c
,
ar
e
d
elay
ed
b
y
o
n
e
b
it a
n
d
s
to
r
ed
in
t
h
e
s
h
if
t r
eg
is
ter
s
.
Step
6
: Fo
r
2
n
d
tim
e,
3
r
d
tim
e
,
…
r
ep
ea
ts
th
e
s
tep
s
f
r
o
m
s
tep
2
to
5
.
2
.
3
.
F
l
o
w
cha
rt
f
o
r
ST
T
C
en
co
der
T
h
e
f
lo
wc
h
ar
t
f
o
r
STT
C
en
c
o
d
er
is
s
h
o
wn
i
n
Fig
u
r
e
4
,
a
s
a
f
ir
s
t
s
tep
all
th
e
s
h
if
t
r
e
g
is
ter
s
ar
e
clea
r
ed
,
i.e
.
,
r
eset
to
ze
r
o
,
th
en
th
e
in
p
u
t
s
eq
u
en
ce
is
s
p
li
tted
in
to
to
two
s
tr
ea
m
s
o
f
b
its
,
i.e
.
,
1
t
c
&
2
t
c
.
2
t
c
reset
D
rst
Q
c
kl
D
rst
Q
c
kl
D
rst
Q
c
kl
D
rst
Q
c
kl
D
rst
Q
c
kl
D
rst
Q
c
kl
1
t
c
g
en
c
lk
1
1
−
t
c
1
2
−
t
c
1
3
−
t
c
2
3
−
t
c
2
2
−
t
c
2
1
−
t
c
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
20
89
-
4
8
6
4
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
,
Vo
l.
9
,
No
.
3
,
No
v
e
m
b
er
2
0
2
0
:
21
3
–
22
3
216
Th
e
S
T
TC
s
y
m
b
o
ls
f
o
r
f
irst
a
n
d
se
c
o
n
d
tra
n
sm
it
a
n
ten
n
a
s
1
t
x
&
2
t
x
,
a
r
e
c
o
m
p
u
ted
b
y
t
h
e
m
u
l
ti
p
l
ier
o
u
t
p
u
ts
fr
o
m
a
l
l
th
e
sh
if
t
re
g
isters
a
re
m
o
d
u
l
o
4
a
d
d
e
d
.
Bit
stre
a
m
s
1
t
c
&
2
t
c
a
re
d
e
lay
e
d
b
y
o
n
e
b
it
a
n
d
sto
re
d
i
n
th
e
s
h
ift
re
g
isters
.
Th
is p
r
o
c
e
ss
is r
e
p
e
a
ted
ti
ll
th
e
i
n
p
u
t
e
x
ists.
Fig
u
r
e
4
.
Flo
wch
ar
t
f
o
r
STT
C
en
co
d
er
2
.
4
.
ST
T
C
deco
der
T
h
e
im
p
lem
en
tatio
n
o
f
STT
C
Dec
o
d
er
o
n
FP
GA
is
s
h
o
wn
in
Fig
u
r
e
5
wh
ic
h
co
n
s
i
s
ts
o
f
co
d
e
co
n
v
er
ter
,
Sq
u
a
r
ed
E
u
clid
ea
n
Dis
tan
ce
(
SED)
g
en
er
ato
r
,
f
ea
s
ib
le
s
tate
s
elec
to
r
,
f
ea
s
ib
l
e
b
r
a
n
ch
s
elec
to
r
,
PISO
co
n
v
er
ter
,
an
d
Dete
cto
r
.
T
h
e
r
ec
eiv
ed
s
y
m
b
o
ls
f
r
o
m
r
ec
eiv
e
an
ten
n
as
ar
e
s
elec
ted
f
r
o
m
th
e
d
iv
e
r
s
ity
s
elec
to
r
an
d
d
em
o
d
u
lated
f
r
o
m
th
e
QPSK
d
em
o
d
u
lato
r
.
T
h
e
d
em
o
d
u
lated
o
u
tp
u
ts
ar
e
i
n
th
e
f
o
r
m
o
f
b
in
ar
y
b
its
,
wh
ich
a
r
e
c
o
n
v
e
r
ted
t
o
d
ec
im
al
s
y
m
b
o
ls
f
r
o
m
t
h
e
co
d
e
co
n
v
er
ter
.
T
h
ese
s
y
m
b
o
ls
ar
e
g
iv
e
n
t
o
th
e
s
q
u
ar
ed
E
u
clid
ea
n
d
is
tan
ce
g
en
er
ato
r
,
wh
ich
g
e
n
er
ate
s
th
e
s
q
u
ar
ed
E
u
clid
ea
n
d
is
tan
ce
s
f
o
r
all
s
tates.
T
h
e
s
q
u
ar
ed
E
u
clid
ea
n
d
is
ta
n
ce
s
ar
e
ca
lcu
lated
f
o
r
ea
c
h
s
tate
wh
ich
co
n
tain
s
4
b
r
an
ch
es
an
d
h
e
n
ce
th
e
s
q
u
ar
ed
E
u
clid
ea
n
d
is
tan
c
e
is
to
b
e
ca
lcu
lated
f
o
r
all
s
i
x
te
en
co
m
b
in
atio
n
s
f
o
r
4
-
s
tate.
T
h
e
SEDs
f
o
r
all
s
tates
ar
e
f
ed
in
to
th
e
f
ea
s
ib
le
s
tate
s
elec
to
r
,
wh
ich
s
elec
ts
t
h
e
r
eq
u
i
r
ed
s
tates.
An
d
it
co
u
n
ts
th
e
n
u
m
b
e
r
o
f
s
tates
ar
e
s
elec
ted
an
d
g
iv
es
th
e
co
r
r
esp
o
n
d
i
n
g
Mo
s
t
Sig
n
i
f
ican
t
Dig
it
(
MSD)
f
o
r
ea
ch
s
tate.
T
h
e
r
e
q
u
ir
ed
s
tate
is
th
at
th
e
SEDs o
f
a
s
tat
e
o
f
its
b
r
an
c
h
es a
r
e
less
th
an
o
r
eq
u
al
t
o
2
.
I
n
4
-
s
tates
STT
C
,
m
ax
im
u
m
th
r
ee
r
e
q
u
ir
e
d
s
tates
ar
e
o
b
tain
ed
b
y
th
e
f
ea
s
ib
le
s
tate
s
elec
to
r
.
T
h
ese
s
tates
ar
e
g
iv
en
to
th
e
th
r
ee
f
ea
s
ib
le
b
r
an
c
h
s
elec
to
r
s
.
T
h
e
f
ea
s
ib
l
e
b
r
an
c
h
s
elec
to
r
s
elec
ts
th
e
r
eq
u
ir
ed
b
r
an
ch
es
f
r
o
m
ea
ch
s
tate.
R
eq
u
ir
ed
b
r
a
n
ch
is
th
at
th
e
SED
o
f
th
e
b
r
an
ch
o
f
a
s
tate
is
less
th
an
o
r
e
q
u
al
to
2
.
An
d
f
ea
s
ib
le
b
r
an
c
h
s
elec
to
r
g
iv
es th
e
co
r
r
esp
o
n
d
in
g
L
ea
s
t
Sig
n
if
ican
t D
ig
it (
L
SD)
f
o
r
ea
ch
b
r
an
c
h
an
d
g
i
v
es
th
e
SEDs
f
o
r
r
eq
u
ir
ed
b
r
an
ch
e
s
in
a
s
tate
ar
e
g
iv
en
to
th
e
d
etec
to
r
.
T
h
e
d
etec
to
r
c
o
n
s
is
ts
o
f
r
ef
er
en
ce
s
y
m
b
o
l
g
en
er
ato
r
,
co
m
p
a
r
ato
r
,
s
u
b
tr
a
cto
r
,
an
d
d
ec
o
d
er
.
T
h
e
r
ef
e
r
e
n
ce
s
y
m
b
o
ls
ar
e
in
itially
s
et
to
ze
r
o
.
T
h
e
s
q
u
ar
ed
E
u
clid
ea
n
d
is
tan
ce
f
o
r
th
e
r
ef
er
e
n
ce
s
y
m
b
o
ls
ar
e
ca
lcu
la
ted
with
its
r
ef
e
r
en
ce
s
tate
(
MSD
o
f
r
e
f
er
en
ce
s
y
m
b
o
ls
)
f
r
o
m
th
e
SED
g
e
n
er
ato
r
.
T
h
e
f
ea
s
ib
le
b
r
an
ch
es
ar
e
s
elec
ted
f
r
o
m
th
e
v
a
lu
es
o
f
SEDs
f
o
r
th
e
r
ef
er
en
ce
s
y
m
b
o
ls
.
T
h
e
f
e
asib
le
b
r
an
ch
s
elec
to
r
g
iv
es th
e
SEDs a
n
d
L
SDs
f
o
r
f
ea
s
ib
le
b
r
an
ch
es.
T
h
e
d
etec
to
r
c
o
m
p
ar
es
th
e
al
l
SEDs
wh
ich
ar
e
tak
en
f
r
o
m
th
e
th
r
ee
f
ea
s
ib
le
b
r
a
n
ch
s
el
ec
to
r
s
f
o
r
s
tates
an
d
th
e
r
ef
er
e
n
ce
s
y
m
b
o
ls
.
An
d
it
s
elec
ts
an
y
o
n
e
s
u
r
v
iv
e
(
lik
ely
)
p
at
h
,
f
ea
s
ib
le
r
ef
er
en
ce
s
y
m
b
o
ls
,
an
d
r
e
q
u
ir
e
d
o
u
tp
u
t
d
ata.
T
h
e
o
u
tp
u
t
d
ata
is
in
th
e
f
o
r
m
o
f
d
ec
im
al
d
ig
it,
w
h
ich
is
c
o
n
v
er
t
ed
in
to
b
in
a
r
y
f
r
o
m
th
e
co
d
e
co
n
v
er
ter
.
T
h
ese
b
i
n
ar
y
b
its
ar
e
in
th
e
f
o
r
m
o
f
p
ar
allel
b
its
wh
ich
ar
e
co
n
v
e
r
ted
in
to
s
er
ial
d
ata.
T
h
e
s
er
ial
d
ata
is
ca
lled
in
f
o
r
m
atio
n
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
I
SS
N:
2089
-
4
8
6
4
S
p
a
ce
-
time
tr
ellis
co
d
es:
F
ield
p
r
o
g
r
a
mma
b
le
g
a
te
a
r
r
a
y
a
p
p
r
o
a
ch
(
Ma
llika
r
ju
n
a
Go
w
d
a
C
.
P
)
217
Fig
u
r
e
5
.
C
o
m
p
o
n
en
ts
f
o
r
ST
T
C
d
ec
o
d
er
2
.
5
.
Alg
o
rit
hm
f
o
r
ST
T
C
de
co
der
Step
1
:
C
lear
all
th
e
r
ef
er
en
c
e
s
y
m
b
o
ls
,
s
tates,
b
r
an
ch
m
e
tr
ics
f
o
r
all
th
e
1
6
co
m
b
in
atio
n
s
an
d
r
e
f
er
en
c
e
s
y
m
b
o
l,
m
em
o
r
y
elem
e
n
ts
wh
ich
ar
e
u
s
ed
to
s
to
r
e
an
d
p
r
o
ce
s
s
in
g
th
e
s
y
m
b
o
ls
to
ze
r
o
.
Step
2
: Rece
iv
ed
s
y
m
b
o
ls
,
1
t
r
an
d
2
t
r
ar
e
co
n
v
e
r
ted
in
to
d
ec
im
al
s
y
m
b
o
ls
,
1
t
rx
an
d
2
t
rx
,
r
esp
ec
tiv
ely
.
Step
3
: Fin
d
SEDs f
o
r
all
th
e
1
6
co
m
b
in
atio
n
s
an
d
th
e
r
esu
lt
s
ar
e
s
to
r
ed
in
to
m
e
m
o
r
y
.
Step
4
: Sele
ct
th
e
f
ea
s
ib
le
s
tates f
r
o
m
ab
o
v
e
s
tep
,
s
ay
,
'
0
S
,
'
1
S
an
d
'
2
S
.
Step
5
: Sele
ct
f
ea
s
ib
le
b
r
an
ch
m
etr
ics f
o
r
ea
ch
f
ea
s
ib
le
s
tate
an
d
th
e
r
esu
lts
ar
e
s
to
r
e
d
in
to
m
em
o
r
y
.
Step
6
: Fin
d
SEDs f
o
r
th
e
r
ef
e
r
en
ce
s
y
m
b
o
ls
,
dl
an
d
dr
an
d
t
h
e
r
esu
lts
ar
e
s
to
r
ed
in
to
m
em
o
r
y
.
Step
7
: Sele
ct
f
ea
s
ib
le
b
r
an
ch
m
etr
ics f
r
o
m
ab
o
v
e
s
tep
.
T
h
e
r
esu
lts
ar
e
s
to
r
ed
in
to
th
e
m
em
o
r
y
.
Step
8
: Su
b
tr
ac
t a
ll th
e
L
SD o
f
f
e
asib
le
b
r
an
c
h
es o
f
r
e
f
er
en
c
e
s
y
m
b
o
l f
r
o
m
th
e
i
n
p
u
t sy
m
b
o
l,
1
t
rx
(
MSD)
.
Step
9
:
C
o
m
p
ar
e
th
em
an
d
s
elec
t
leas
t
r
esu
lt
wh
ich
wa
s
g
en
er
ated
f
o
r
th
e
L
SD
o
f
r
ef
er
en
ce
s
y
m
b
o
l.
I
t r
ep
r
esen
ts
th
e
p
r
esen
t state
am
o
n
g
t
h
e
f
o
u
r
s
tates.
Step
1
0
:
Select
th
e
s
y
m
b
o
l
th
at
was
least
SED
am
o
n
g
f
o
u
r
b
r
an
ch
es
in
th
e
s
tate.
T
h
ese
s
y
m
b
o
ls
ar
e
r
ef
er
en
ce
s
y
m
b
o
ls
f
o
r
th
e
n
ex
t state.
Step
1
1
: Sele
ct
th
e
MSD
o
f
r
e
f
er
en
ce
s
y
m
b
o
l is th
e
o
u
t
p
u
t sy
m
b
o
l.
Step
1
2
:
T
h
e
o
u
tp
u
t
s
y
m
b
o
l
is
co
n
v
e
r
ted
in
to
b
in
a
r
y
,
wh
ich
is
co
n
v
er
ted
b
ac
k
to
s
e
r
ial
d
ata
wh
ich
is
th
e
ac
tu
al
in
f
o
r
m
atio
n
.
Step
1
3
: Rep
ea
t th
e
s
tep
s
f
r
o
m
2
to
1
2
f
o
r
n
ex
t
r
ec
eiv
e
d
ata.
2
.
6
.
F
l
o
w
cha
rt
f
o
r
ST
T
C
de
co
der
T
h
e
f
lo
w
c
h
ar
t
f
o
r
STT
C
d
e
co
d
er
is
s
h
o
wn
in
Fig
u
r
e
6
,
as
a
f
ir
s
t
s
tep
,
clea
r
all
th
e
r
ef
er
en
ce
s
y
m
b
o
ls
,
s
tates,
b
r
an
ch
m
etr
ics
an
d
m
em
o
r
y
elem
e
n
ts
to
ze
r
o
.
T
o
p
r
o
ce
s
s
th
e
r
ec
eiv
ed
s
y
m
b
o
ls
ea
s
ily
,
co
n
v
er
t
th
em
in
to
d
ec
im
al
s
y
m
b
o
ls
.
C
alcu
late
th
e
SEDs
f
o
r
all
th
e
s
i
x
teen
co
m
b
in
atio
n
s
an
d
r
ef
er
en
ce
s
y
m
b
o
ls
,
th
en
s
elec
t
th
e
f
ea
s
ib
le
s
tate
s
an
d
b
r
an
ch
es
f
r
o
m
th
e
f
o
u
r
s
tates
an
d
also
s
elec
t
th
e
f
ea
s
ib
le
b
r
an
ch
es
f
o
r
r
e
f
er
en
ce
s
y
m
b
o
ls
.
Su
b
tr
a
ct
all
th
e
L
SD
o
f
f
ea
s
ib
le
b
r
an
ch
es
o
f
r
ef
er
en
ce
s
y
m
b
o
l
f
r
o
m
th
e
MSD
o
f
in
p
u
t
r
ec
eiv
ed
s
y
m
b
o
ls
.
Dete
r
m
i
n
e
th
e
p
r
esen
t
s
tate,
r
ef
er
e
n
ce
s
y
m
b
o
l
a
n
d
o
u
tp
u
t.
T
h
e
o
u
tp
u
t
is
to
s
er
ial
d
ata.
T
h
is
p
r
o
ce
s
s
is
r
ep
ea
ted
till
th
e
co
m
p
letio
n
o
f
all
s
tates.
F
e
a
s
i
b
l
e
b
r
a
n
c
h
s
e
l
e
c
t
o
r
F
e
a
s
i
b
l
e
b
r
a
n
c
h
s
e
l
e
c
t
o
r
F
e
a
s
i
b
l
e
b
r
a
n
c
h
s
e
l
e
c
t
o
r
3
D
i
st
L
S
D
3
3
3
3
D
e
t
e
c
t
o
r
3
L
S
D
D
i
st
F
e
a
s
i
b
l
e
b
r
a
n
c
h
s
e
l
e
c
t
o
r
S
qua
r
e
d
E
uc
l
i
de
a
n
di
s
t
a
n
c
e
ge
n
e
r
a
t
o
r
P
IS
O
Co
n
v
e
r
t
e
r
Co
de
Co
n
v
e
r
t
er
2
1
rs
2
rs
2
2
2
6
3
sd
Co
de
Co
n
v
e
r
t
e
r
S
qua
r
e
d
E
uc
l
i
de
a
n
di
s
t
a
n
c
e
ge
n
e
r
a
t
o
r
1
t
rx
2
t
r
1
t
r
2
t
rx
M
S
D
3
6
2
2
2
2
6
6
c
o
u
n
t
2
F
e
a
s
i
b
l
e
S
t
a
t
e
s
e
l
e
c
t
o
r
6
6
6
6
3
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
20
89
-
4
8
6
4
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
,
Vo
l.
9
,
No
.
3
,
No
v
e
m
b
er
2
0
2
0
:
21
3
–
22
3
218
Fig
u
r
e
6
.
Flo
wch
ar
t
f
o
r
STT
C
d
ec
o
d
er
3.
M
E
T
H
O
DO
L
O
G
Y
L
et
th
e
tr
an
s
m
itted
s
ig
n
al
s
eq
u
en
ce
s
f
r
o
m
th
e
two
tr
an
s
m
it a
n
ten
n
as a
r
e
1
t
x
=
{0
,
2
,
1
,
3
,
0
,
2
,
1
,
3
,
…….
.
}
2
t
x
=
{2
,
1
,
3
,
0
,
2
,
1
,
3
,
0
,
…….
.
}
an
d
r
ec
eiv
e
d
s
eq
u
en
ce
s
f
r
o
m
t
h
e
two
r
ec
eiv
e
a
n
ten
n
as a
r
e
1
t
r
=
{0
,
3
,
0
,
3
,
0
,
1
,
2
,
3
,
…….
.
}
2
t
r
=
{1
,
2
,
2
,
1
,
3
,
0
,
3
,
1
,
…….
.
}
L
et
at
tim
e,
t
=
0
,
th
e
r
ef
er
e
n
ce
s
y
m
b
o
ls
,
d
l
(
MSD)
an
d
d
r
(
L
SD)
ar
e
in
itially
0
an
d
0
,
r
esp
ec
tiv
ely
an
d
th
e
r
ec
eiv
ed
s
y
m
b
o
ls
1
t
r
(
MSD)
an
d
2
t
r
(
L
SD)
ar
e
0
an
d
1
,
r
esp
ec
tiv
ely
.
T
h
e
SED
f
o
r
r
e
f
er
en
ce
s
y
m
b
o
ls
(
0
,
0
)
an
d
r
ec
eiv
ed
s
y
m
b
o
ls
(
0
,
1
)
ar
e
s
h
o
wn
in
T
ab
le
1
.
T
ab
le
1
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
0
.
0
,
0
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
0
,
0
0
0
,
1
0
,
0
1
1
,
0
2
2
,
0
5
3
,
0
10
0
,
1
1
0
,
1
0
1
,
1
1
2
,
1
4
3
,
1
9
0
,
2
4
0
,
2
1
1
,
2
2
2
,
2
5
3
,
2
10
0
,
3
9
0
,
3
4
1
,
3
5
2
,
3
8
3
,
3
13
T
h
e
b
r
a
n
ch
es
an
d
s
tates,
wh
ich
ar
e
h
av
in
g
h
ig
h
SEDs
(
≥
4
)
,
ar
e
elim
in
ate
d
.
T
h
e
ab
s
o
lu
t
e
v
alu
es
is
th
at
th
e
s
u
b
tr
ac
to
r
s
u
b
tr
ac
ts
all
th
e
L
SD
(
d
r
)
o
f
r
ef
er
en
ce
s
y
m
b
o
l
s
tate
f
r
o
m
th
e
MS
D
(
1
t
r
)
o
f
r
ec
eiv
ed
s
y
m
b
o
l,
(
1
t
r
-
d
r
)
is
a
b
s
(
0
–
0
)
=
0
,
&
abs
(
0
–
1
)
=
1
.
T
h
e
least
d
if
f
er
en
ce
v
alu
e
f
r
o
m
r
ef
er
en
c
e
s
y
m
b
o
l
0
is
0
.
T
h
er
ef
o
r
e,
r
ef
e
r
en
ce
f
o
r
th
e
n
ex
t
s
tate
is
0
an
d
th
e
s
y
m
b
o
l
wh
ich
h
as
least
SED
in
th
e
s
tate
-
0
(
S
0
)
is
(
0
,
1
)
.
T
h
e
n
ex
t
r
ef
er
e
n
ce
s
y
m
b
o
l
i
s
(
0
,
1
)
an
d
o
u
tp
u
t
is
0
.
Fo
r
tim
e,
t
=
1
,
th
e
r
ef
er
en
ce
s
y
m
b
o
ls
,
(
0
,
1
)
an
d
th
e
r
ec
eiv
ed
s
y
m
b
o
ls
(
3
,
2
)
a
r
e
s
h
o
wn
in
T
ab
le
2
.
S
t
a
r
t
Cl
e
a
r
a
l
l
t
h
e
r
e
f
e
r
e
n
c
e
s
y
m
b
o
l
s
,
s
t
a
t
e
s
,
b
r
a
n
c
h
m
e
t
r
i
c
s
,
a
nd
m
e
m
o
r
y
e
l
e
m
e
n
t
s
t
o
z
e
r
o
R
e
c
e
i
v
e
d
s
y
m
bo
l
s
a
r
e
c
o
n
v
e
r
t
e
d
i
n
t
o
de
c
i
m
a
l
s
y
m
b
o
l
s
t
o
e
a
s
i
l
y
pr
o
c
e
s
s
e
s
t
h
e
m
Ca
l
c
ul
a
t
e
S
E
D
s
f
o
r
a
l
l
t
h
e
16
c
o
m
b
i
na
t
i
o
n
s
a
n
d
r
e
f
e
r
e
n
c
e
s
y
m
bo
l
s
S
e
l
e
c
t
t
h
e
f
e
a
s
i
b
l
e
s
t
a
t
e
s
a
n
d
b
ra
n
c
h
e
s
f
r
o
m
t
h
e
f
o
ur
s
t
a
t
e
s
.
S
e
l
e
c
t
t
h
e
f
e
a
s
i
b
l
e
b
r
a
n
c
h
e
s
f
o
r
r
e
f
e
r
e
n
c
e
s
y
m
bo
l
D
e
t
e
r
m
i
n
e
t
h
e
p
r
e
s
e
n
t
s
t
a
t
e
,
r
e
f
e
r
e
n
c
e
s
y
m
b
o
l
,
a
n
d
o
ut
put
.
T
h
e
o
ut
put
i
s
t
o
s
e
ri
a
l
d
a
t
a
S
ub
t
r
a
c
t
a
l
l
t
h
e
L
S
D
o
f
f
e
a
s
i
b
l
e
b
r
a
n
c
h
e
s
of
r
e
f
e
r
e
n
c
e
s
y
m
bo
l
f
r
o
m
t
h
e
M
S
D
o
f
i
n
put
r
e
c
e
i
v
e
d
s
y
m
bo
l
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
I
SS
N:
2089
-
4
8
6
4
S
p
a
ce
-
time
tr
ellis
co
d
es:
F
ield
p
r
o
g
r
a
mma
b
le
g
a
te
a
r
r
a
y
a
p
p
r
o
a
ch
(
Ma
llika
r
ju
n
a
Go
w
d
a
C
.
P
)
219
T
ab
le
2
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
1
0
,
1
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
0
,
0
1
3
,
2
0
,
0
13
1
,
0
8
2
,
0
5
3
,
0
4
0
,
1
0
0
,
1
10
1
,
1
5
2
,
1
2
3
,
1
1
0
,
2
1
0
,
2
9
1
,
2
4
2
,
2
1
3
,
2
0
0
,
3
4
0
,
3
10
1
,
3
5
2
,
3
2
3
,
3
1
T
h
e
b
r
a
n
ch
es
an
d
s
tates,
wh
ich
ar
e
h
a
v
in
g
h
ig
h
SEDs
(
≥
4
)
,
ar
e
elim
in
ated
.
T
h
e
a
b
s
o
lu
t
e
v
alu
es
o
f
1
t
r
-
d
r
ar
e
3
,
2
an
d
1
.
T
h
e
least
d
if
f
er
en
ce
v
alu
e
f
r
o
m
r
e
f
er
en
ce
s
y
m
b
o
l
2
is
1
.
T
h
er
ef
o
r
e,
r
ef
er
en
ce
f
o
r
th
e
n
ex
t
s
tate
is
2
an
d
th
e
s
y
m
b
o
l
wh
ich
h
as
least
SED
in
th
e
s
tate
-
2
(
S
2
)
is
(
2
,
2
)
.
T
h
e
n
e
x
t
r
ef
e
r
en
ce
s
y
m
b
o
l
is
(
2
,
2
)
an
d
o
u
tp
u
t
is
0
.
Fo
r
tim
e
t
=
2
,
t
h
e
r
e
f
er
en
ce
s
y
m
b
o
ls
,
(
2
,
2
)
an
d
th
e
r
ec
eiv
e
d
s
y
m
b
o
ls
,
(
0
,
2
)
ar
e
s
h
o
w
in
T
ab
le
3
.
T
ab
le
3
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
2
2
,
2
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
0
,
0
4
0
,
2
0
,
0
4
1
,
0
5
2
,
0
8
3
,
0
13
0
,
1
1
0
,
1
1
1
,
1
2
2
,
1
5
3
,
1
10
0
,
2
0
0
,
2
0
1
,
2
1
2
,
2
4
3
,
2
9
0
,
3
1
0
,
3
1
1
,
3
2
2
,
3
5
3
,
3
10
T
h
e
b
r
a
n
ch
es
an
d
s
tates,
wh
ich
ar
e
h
a
v
in
g
h
ig
h
SEDs
(
≥
4
)
,
ar
e
elim
in
ated
.
T
h
e
a
b
s
o
lu
t
e
v
alu
es
o
f
1
t
r
-
d
r
ar
e
1
,
2
an
d
3
.
T
h
e
least
d
if
f
er
en
ce
v
alu
e
f
r
o
m
r
e
f
er
en
ce
s
y
m
b
o
l
1
is
1
.
T
h
er
ef
o
r
e,
r
ef
er
en
ce
f
o
r
th
e
n
ex
t
s
tate
is
1
an
d
th
e
s
y
m
b
o
l
wh
ich
h
as
least
SED
in
th
e
s
tate
-
1
(
S
1
)
is
(
1
,
2
)
.
T
h
e
n
e
x
t
r
ef
e
r
en
ce
s
y
m
b
o
l
is
(
1
,
2
)
a
n
d
th
e
o
u
tp
u
t
is
2
.
F
o
r
tim
e
t
=
3
,
th
e
r
ef
er
en
c
e
s
y
m
b
o
ls
,
(
1
,
2
)
a
n
d
th
e
r
ec
eiv
ed
s
y
m
b
o
ls
,
(
3
,
1
)
ar
e
s
h
o
wn
in
T
ab
le
4
.
T
ab
le
4
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
3
1
,
2
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
1
,
0
4
3
,
1
0
,
0
10
1
,
0
5
2
,
0
2
3
,
0
1
1
,
1
1
0
,
1
9
1
,
1
4
2
,
1
1
3
,
1
0
1
,
2
0
0
,
2
10
1
,
2
5
2
,
2
2
3
,
2
1
1
,
3
1
0
,
3
13
1
,
3
8
2
,
3
5
3
,
3
4
T
h
e
b
r
an
ch
es
a
n
d
s
tates,
wh
ich
ar
e
h
av
i
n
g
h
ig
h
SEDs
(
≥
4
)
,
ar
e
elim
in
ated
.
T
h
e
ab
s
o
lu
t
e
v
alu
es
o
f
1
t
r
-
d
r
ar
e
2
,
1
an
d
0
.
T
h
e
least
d
if
f
er
en
ce
v
alu
e
f
r
o
m
r
e
f
er
en
ce
s
y
m
b
o
l
3
is
0
.
T
h
er
ef
o
r
e,
r
ef
er
en
ce
f
o
r
th
e
n
ex
t
s
tate
is
3
an
d
th
e
s
y
m
b
o
l
wh
ich
h
as
least
SED
in
th
e
s
tate
-
3
(
S
3
)
is
(
3
,
1
)
.
T
h
e
n
e
x
t
r
ef
e
r
en
ce
s
y
m
b
o
l
is
(
3
,
1
)
a
n
d
th
e
o
u
tp
u
t
is
1
.
F
o
r
tim
e
t
=
4
,
th
e
r
ef
er
en
c
e
s
y
m
b
o
ls
,
(
3
,
1
)
a
n
d
th
e
r
ec
eiv
ed
s
y
m
b
o
ls
,
(
0
,
3
)
ar
e
s
h
o
wn
in
T
ab
le
5
.
T
ab
le
5
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
4
3
,
1
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
3
,
0
4
0
,
3
0
,
0
9
1
,
0
10
2
,
0
13
3
,
0
18
3
,
1
1
0
,
1
4
1
,
1
5
2
,
1
8
3
,
1
13
3
,
2
0
0
,
2
1
1
,
2
2
2
,
2
5
3
,
2
10
3
,
3
1
0
,
3
0
1
,
3
1
2
,
3
4
3
,
3
9
T
h
e
b
r
a
n
ch
es
an
d
s
tates,
wh
ich
ar
e
h
a
v
in
g
h
ig
h
SEDs
(
≥
4
)
,
ar
e
elim
in
ated
.
T
h
e
a
b
s
o
lu
t
e
v
alu
es
o
f
1
t
r
-
d
r
ar
e
0
an
d
1
.
T
h
e
least
d
if
f
er
en
ce
v
alu
e
f
r
o
m
r
ef
er
en
ce
s
y
m
b
o
l
0
is
0
.
T
h
er
ef
o
r
e,
r
ef
er
en
ce
f
o
r
th
e
n
ex
t
s
tate
is
0
an
d
th
e
s
y
m
b
o
l
wh
ic
h
h
as
least
SED
in
th
e
s
tate
-
0
(
S
0
)
is
(
0
,
3
)
.
T
h
e
n
e
x
t
r
ef
er
e
n
ce
s
y
m
b
o
l
is
(
0
,
3
)
an
d
th
e
o
u
tp
u
t
is
3
.
Similar
ly
,
f
o
r
ti
m
e
t
=
5
,
6
an
d
7
th
e
r
ef
er
en
ce
s
y
m
b
o
ls
an
d
th
e
r
e
ce
iv
ed
s
y
m
b
o
ls
ar
e
s
h
o
wn
in
T
ab
le
6
,
T
ab
le
7
an
d
T
ab
le
8
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
20
89
-
4
8
6
4
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
,
Vo
l.
9
,
No
.
3
,
No
v
e
m
b
er
2
0
2
0
:
21
3
–
22
3
220
T
ab
le
6
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
5
0
,
3
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
0
,
0
9
1
,
0
0
,
0
1
1
,
0
0
2
,
0
1
3
,
0
4
0
,
1
4
0
,
1
2
1
,
1
1
2
,
1
2
3
,
1
5
0
,
2
1
0
,
2
5
1
,
2
4
2
,
2
5
3
,
2
8
0
,
3
0
0
,
3
10
1
,
3
9
2
,
3
10
3
,
3
13
T
ab
le
7
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
6
2
,
0
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
2
,
0
0
2
,
3
0
,
0
13
1
,
0
10
2
,
0
9
3
,
0
10
2
,
1
1
0
,
1
8
1
,
1
5
2
,
1
4
3
,
1
5
2
,
2
4
0
,
2
5
1
,
2
2
2
,
2
1
3
,
2
2
2
,
3
9
0
,
3
4
1
,
3
1
2
,
3
0
3
,
3
1
T
ab
le
8
.
C
alcu
latio
n
o
f
SEDs f
o
r
t =
7
1
,
3
S
ED
r
t
S
0
S
ED
S
1
S
ED
S
2
S
ED
S
3
S
ED
1
,
0
9
3
,
1
0
,
0
10
1
,
0
5
2
,
0
2
3
,
0
1
1
,
1
4
0
,
1
9
1
,
1
4
2
,
1
1
3
,
1
0
1
,
2
1
0
,
2
10
1
,
2
5
2
,
2
2
3
,
2
1
1
,
3
0
0
,
3
13
1
,
3
8
2
,
3
5
3
,
3
4
O
utput
=
{
0
,
0
,
2
,
1
,
3
,
0
,
2
,
1
,
…….
}
W
e
s
elec
t
th
e
d
ev
ice
XC
3
S4
0
0
wh
ich
co
n
tain
s
4
0
0
k
g
ates,
f
am
ily
is
Xilin
x
Sp
ar
tan
-
3
,
p
ac
k
ag
e
PQ2
0
8
,
an
d
s
p
ee
d
-
5
ar
e
u
s
ed
to
im
p
lem
en
t
th
e
h
ar
d
war
e
f
o
r
STT
C
en
co
d
er
an
d
d
ec
o
d
er
.
T
h
e
T
ab
le
1
,
T
ab
le
2
an
d
T
a
b
le
3
d
escr
ib
e
th
e
h
a
r
d
war
e
u
tili
za
tio
n
f
o
r
en
co
d
er
a
n
d
d
ec
o
d
er
r
esp
ec
tiv
ely
.
W
e
n
o
te
th
at
th
e
m
ax
im
u
m
s
p
ac
e
u
tili
za
tio
n
f
o
r
an
e
n
co
d
er
in
a
d
ev
ice
av
ailab
le
s
p
ac
e
is
ju
s
t
1
0
%.
T
h
e
f
iv
e
1
-
b
it
r
eg
is
ter
s
,
two
3
-
b
it
r
eg
is
ter
s
,
two
2
-
b
it
L
atch
e
s
,
n
in
e
1
-
b
it
x
o
r
s
ar
e
u
s
ed
.
T
h
e
m
in
im
u
m
p
er
io
d
:
2
.
8
8
2
n
s
(
Ma
x
im
u
m
Fre
q
u
en
cy
:
3
4
6
.
9
3
3
MH
z)
,
m
i
n
im
u
m
in
p
u
t
ar
r
iv
al
tim
e
b
ef
o
r
e
c
lo
ck
:
4
.
1
6
1
n
s
,
an
d
m
ax
im
u
m
o
u
tp
u
t
r
eq
u
ir
e
d
tim
e
af
ter
clo
ck
:
6
.
1
4
1
n
s
f
o
r
d
ev
i
ce
s
p
ee
d
g
r
a
d
e:
-
5
is
u
s
ed
.
W
e
n
o
te
th
at
t
h
e
m
a
x
im
u
m
s
p
ac
e
u
tili
za
tio
n
f
o
r
a
d
ec
o
d
e
r
in
a
d
ev
ice
av
ailab
le
s
p
ac
e
i
s
ju
s
t
2
2
%.
T
h
e
o
n
e
4
x
1
-
b
it
R
OM
,
two
4
x
2
-
b
it
R
OM
s
,
o
n
e
ea
ch
4
x
6
-
b
it
R
OM
an
d
8
x
6
-
b
it
R
OM
,
twelv
e
7
x
7
-
b
it
m
u
ltip
lier
s
,
s
ix
teen
6
-
b
it
ad
d
er
s
,
f
if
teen
7
-
b
it
ad
d
er
s
,
th
r
ee
7
-
b
it
s
u
b
t
r
ac
to
r
s
,
th
r
ee
1
-
b
it
r
eg
is
ter
s
,
two
2
-
b
it
r
eg
is
ter
s
,
eig
h
t 6
-
b
it r
e
g
is
ter
s
,
s
ix
teen
6
-
b
it latc
h
es,
f
o
r
t
y
o
n
e
6
-
b
it c
o
m
p
ar
ato
r
e
q
u
al,
s
ix
tee
n
6
-
b
it c
o
m
p
ar
ato
r
g
r
ea
t
eq
u
al,
f
o
r
ty
eig
h
t
6
-
b
it
co
m
p
ar
ato
r
less
,
s
ix
ty
f
o
u
r
6
-
b
it
c
o
m
p
ar
ato
r
less
eq
u
al,
eig
h
tee
n
8
-
b
it
co
m
p
ar
ato
r
less
eq
u
al,
an
d
s
ev
en
t
ee
n
6
-
b
it
4
-
to
-
1
m
u
ltip
l
ex
er
s
ar
e
u
s
ed
.
T
h
e
m
in
im
u
m
p
er
io
d
:
1
2
.
5
8
4
n
s
(
Ma
x
im
u
m
Fre
q
u
en
c
y
:
7
9
.
4
6
6
MH
z)
,
m
in
im
u
m
i
n
p
u
t
ar
r
i
v
al
tim
e
b
ef
o
r
e
clo
ck
:
3
.
4
4
2
n
s
,
an
d
m
ax
im
u
m
o
u
tp
u
t r
eq
u
ir
e
d
tim
e
af
ter
clo
c
k
:
6
.
2
1
6
n
s
f
o
r
a
d
ev
ice
s
p
ee
d
g
r
ad
e:
-
5
is
u
s
ed
.
T
h
e
tr
ellis
s
t
r
u
ctu
r
e
f
o
r
r
ec
eiv
ed
s
y
m
b
o
ls
is
s
h
o
wn
in
Fig
u
r
e
5
.
T
h
e
s
u
r
v
iv
e
p
ath
s
ar
e
s
h
o
wn
in
b
o
ld
li
n
es in
Fig
u
r
e
7
.
Fig
u
r
e
7
.
T
r
ellies d
iag
r
am
f
o
r
4
-
s
tate
STT
C
d
ec
o
d
er
Evaluation Warning : The document was created with Spire.PDF for Python.
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
I
SS
N:
2089
-
4
8
6
4
S
p
a
ce
-
time
tr
ellis
co
d
es:
F
ield
p
r
o
g
r
a
mma
b
le
g
a
te
a
r
r
a
y
a
p
p
r
o
a
ch
(
Ma
llika
r
ju
n
a
Go
w
d
a
C
.
P
)
221
T
h
e
d
ev
ice
lo
g
ic
u
tili
za
tio
n
li
k
e
n
u
m
b
er
o
f
s
lices,
n
u
m
b
er
o
f
s
lice
f
lip
-
f
lo
p
s
,
n
u
m
b
e
r
o
f
f
o
u
r
in
p
u
t
L
UT
s
,
n
u
m
b
er
o
f
b
o
n
d
ed
I
O
B
s
,
n
u
m
b
er
o
f
m
u
ltip
lier
s
,
n
u
m
b
er
o
f
GC
L
Ks
f
o
r
STT
C
en
co
d
er
,
d
ec
o
d
er
an
d
STT
C
s
y
s
tem
ar
e
s
h
o
wn
in
T
ab
le
9
,
T
ab
le
1
0
a
n
d
T
a
b
le
1
1
r
esp
ec
tiv
ely
.
T
ab
le
9
.
Dev
ice
u
tili
za
tio
n
f
o
r
en
co
d
er
Lo
g
i
c
U
t
i
l
i
z
a
t
i
o
n
U
sed
A
v
a
i
l
a
b
l
e
U
t
i
l
i
z
a
t
i
o
n
N
u
mb
e
r
o
f
S
l
i
c
e
s
9
3
5
8
4
0%
N
u
mb
e
r
o
f
S
l
i
c
e
F
l
i
p
F
l
o
p
s
10
7
1
6
8
0%
N
u
mb
e
r
o
f
4
i
n
p
u
t
LU
Ts
14
7
1
6
8
0%
N
u
mb
e
r
o
f
b
o
n
d
e
d
I
O
B
s
10
1
4
1
7%
N
u
mb
e
r
o
f
G
C
L
K
s
1
8
1
2
%
T
ab
le
1
0
.
De
v
ice
u
tili
za
tio
n
f
o
r
d
ec
o
d
e
r
Lo
g
i
c
U
t
i
l
i
z
a
t
i
o
n
U
sed
A
v
a
i
l
a
b
l
e
U
t
i
l
i
z
a
t
i
o
n
N
u
mb
e
r
o
f
S
l
i
c
e
s
7
1
8
3
5
8
4
2
0
%
N
u
mb
e
r
o
f
S
l
i
c
e
F
l
i
p
F
l
o
p
s
1
2
5
7
1
6
8
1%
N
u
mb
e
r
o
f
4
i
n
p
u
t
LU
Ts
1
3
0
4
7
1
6
8
1
8
%
N
u
mb
e
r
o
f
b
o
n
d
e
d
I
O
B
s
7
1
4
1
4%
N
u
mb
e
r
o
f
M
U
L
T1
8
X
1
8
s
10
16
6
2
%
N
u
mb
e
r
o
f
G
C
L
K
s
2
8
2
5
%
T
ab
le
1
1
.
De
v
ice
u
tili
za
tio
n
f
o
r
STT
C
s
y
s
tem
Lo
g
i
c
U
t
i
l
i
z
a
t
i
o
n
U
sed
A
v
a
i
l
a
b
l
e
U
t
i
l
i
z
a
t
i
o
n
N
u
mb
e
r
o
f
S
l
i
c
e
s
7
2
0
3
5
8
4
2
0
%
N
u
mb
e
r
o
f
S
l
i
c
e
F
l
i
p
F
l
o
p
s
1
3
8
7
1
6
8
1%
N
u
mb
e
r
o
f
4
i
n
p
u
t
LU
Ts
1
3
0
7
7
1
6
8
1
8
%
N
u
mb
e
r
o
f
b
o
n
d
e
d
I
O
B
s
5
1
4
1
3%
N
u
mb
e
r
o
f
M
U
L
T1
8
X
1
8
s
10
16
6
2
%
N
u
mb
e
r
o
f
G
C
L
K
s
2
8
2
5
%
4.
SI
M
UL
A
T
I
O
N
R
E
S
UL
T
S
T
h
e
s
im
u
latio
n
r
esu
lts
f
o
r
S
T
T
C
en
co
d
er
an
d
d
ec
o
d
e
ar
e
s
h
o
wn
b
elo
w.
W
e
s
elec
t
th
e
d
ev
ice
XC
3
S4
0
0
wh
ich
co
n
tain
s
4
0
0
k
g
ates,
f
am
ily
is
Xilin
x
Sp
ar
tan
-
3
,
p
ac
k
a
g
e
PQ2
0
8
,
a
n
d
s
p
ee
d
-
5
a
r
e
u
s
ed
to
im
p
lem
en
t
th
e
h
a
r
d
war
e
f
o
r
STT
C
en
co
d
e
r
an
d
d
ec
o
d
er
.
T
h
e
T
ab
le
1
a
n
d
T
ab
le
2
d
escr
ib
e
th
e
d
ev
ice/h
ar
d
wa
r
e
u
tili
za
tio
n
f
o
r
e
n
co
d
e
r
an
d
d
ec
o
d
e
r
r
esp
ec
tiv
ely
.
W
e
n
o
te
th
at
th
e
m
ax
im
u
m
s
p
ac
e
u
tili
za
tio
n
f
o
r
a
n
en
co
d
er
in
a
d
ev
ice
av
ailab
le
s
p
ac
e
is
ju
s
t
1
0
%.
T
h
ese
d
etails ar
e
g
iv
e
n
b
elo
w:
T
h
e
f
iv
e
1
-
b
it
r
eg
is
ter
s
,
two
3
-
b
it
r
eg
is
ter
s
,
two
2
-
b
it
L
atch
es,
n
in
e
1
-
b
it
x
o
r
s
ar
e
u
s
ed
.
T
h
e
m
in
im
u
m
p
er
io
d
:
2
.
8
8
2
n
s
(
M
ax
im
u
m
Fre
q
u
en
cy
:
3
4
6
.
9
3
3
MH
z)
,
m
in
im
u
m
in
p
u
t
ar
r
i
v
al
tim
e
b
ef
o
r
e
clo
ck
:
4
.
1
6
1
n
s
,
an
d
m
ax
im
u
m
o
u
t
p
u
t
r
eq
u
ir
e
d
tim
e
af
ter
clo
c
k
: 6
.
1
4
1
n
s
f
o
r
d
ev
ice
s
p
ee
d
g
r
a
d
e:
-
5
is
u
s
ed
.
W
e
n
o
te
th
at
th
e
m
ax
im
u
m
s
p
ac
e
u
tili
za
tio
n
f
o
r
a
d
ec
o
d
e
r
in
a
d
ev
ice
av
ailab
le
s
p
ac
e
is
ju
s
t
2
2
%
.
T
h
ese
d
etails
ar
e
g
iv
en
:
T
h
e
o
n
e
4
x
1
-
b
it
R
OM
,
two
4
x
2
-
b
it
R
OM
s
,
o
n
e
ea
ch
4
x
6
-
b
it
R
OM
an
d
8
x
6
-
b
it
R
OM
,
twelv
e
7
x
7
-
b
it
m
u
ltip
lier
s
,
s
ix
teen
6
-
b
it
ad
d
er
s
,
f
if
teen
7
-
b
it
ad
d
er
s
,
th
r
ee
7
-
b
it
s
u
b
tr
ac
to
r
s
,
th
r
ee
1
-
b
it
r
eg
is
ter
s
,
two
2
-
b
it
r
eg
i
s
ter
s
,
eig
h
t
6
-
b
it
r
eg
is
ter
s
,
s
ix
teen
6
-
b
it
latch
es,
f
o
r
ty
o
n
e
6
-
b
it
co
m
p
ar
ato
r
eq
u
al,
s
ix
teen
6
-
b
it
co
m
p
ar
ato
r
g
r
ea
t
eq
u
al,
f
o
r
ty
eig
h
t
6
-
b
it
co
m
p
ar
ato
r
less
,
s
ix
ty
f
o
u
r
6
-
b
it
co
m
p
ar
ato
r
less
eq
u
al,
eig
h
teen
8
-
b
it
co
m
p
ar
a
to
r
less
eq
u
al,
an
d
s
ev
en
teen
6
-
b
it
4
-
to
-
1
m
u
ltip
lex
er
s
a
r
e
u
s
ed
.
T
h
e
m
in
im
u
m
p
er
io
d
:
1
2
.
5
8
4
n
s
(
Ma
x
im
u
m
Fre
q
u
en
cy
:
7
9
.
4
6
6
MH
z)
,
m
in
im
u
m
in
p
u
t
ar
r
iv
al
tim
e
b
ef
o
r
e
clo
ck
:
3
.
4
4
2
n
s
,
an
d
m
ax
im
u
m
o
u
tp
u
t
r
eq
u
ir
e
d
tim
e
af
ter
clo
ck
:
6
.
2
1
6
n
s
f
o
r
a
d
ev
ice
s
p
ee
d
g
r
ad
e:
-
5
is
u
s
ed
.
T
h
e
s
im
u
latio
n
r
esu
lts
f
o
r
STT
C
en
co
d
er
a
n
d
d
ec
o
d
er
a
r
e
s
h
o
wn
i
n
Fig
u
r
e
8
,
Fig
u
r
e
9
,
an
d
Fig
u
r
e
1
0
.
Evaluation Warning : The document was created with Spire.PDF for Python.
I
SS
N
:
20
89
-
4
8
6
4
I
n
t J Reco
n
f
ig
u
r
a
b
le
&
E
m
b
ed
d
ed
Sy
s
t
,
Vo
l.
9
,
No
.
3
,
No
v
e
m
b
er
2
0
2
0
:
21
3
–
22
3
222
Fig
u
r
e
8
.
Ou
t
p
u
t o
f
STT
C
en
co
d
er
Fig
u
r
e
9
.
Ou
t
p
u
t o
f
STT
C
d
ec
o
d
er
with
an
er
r
o
r
Fig
u
r
e
1
0
.
Ou
tp
u
t
o
f
b
o
th
STT
C
en
co
d
er
an
d
d
ec
o
d
er
o
u
tp
u
t
5.
CO
NCLU
SI
O
N
I
n
th
is
p
ap
er
we
h
a
v
e
p
r
esen
ted
th
e
im
p
lem
en
tatio
n
o
f
ST
T
C
en
co
d
er
an
d
d
ec
o
d
er
f
o
r
4
-
s
tate
o
n
FP
GA.
T
h
e
d
ev
ice
XC
3
S4
0
0
wh
ich
co
n
tain
s
4
0
0
k
g
ates,
f
am
ily
is
Xilin
x
Sp
ar
tan
-
3
,
p
a
ck
ag
e
PQ2
0
8
,
an
d
s
p
ee
d
-
5
ar
e
u
s
ed
f
o
r
STT
C
im
p
lem
en
tatio
n
.
I
n
STT
C
d
ec
o
d
er
im
p
lem
en
tatio
n
,
th
e
d
ec
o
d
in
g
co
m
p
le
x
ity
in
cr
ea
s
es
with
n
u
m
b
e
r
o
f
s
tates,
th
er
ef
o
r
e,
a
n
o
p
tim
al
d
ec
o
d
in
g
tech
n
iq
u
e
s
u
c
h
as
s
o
f
t
d
ec
is
io
n
Viter
b
i
d
ec
o
d
in
g
alg
o
r
ith
m
is
u
s
ed
an
d
m
ak
es
it
ea
s
y
h
ar
d
war
e
im
p
lem
en
tatio
n
,
r
ed
u
ce
s
th
e
co
m
p
lex
ity
in
b
r
an
ch
m
etr
ics
ca
lc
u
latio
n
s
,
an
d
h
ar
d
war
e
c
o
s
t.
Ho
wev
er
,
th
e
b
r
an
c
h
m
etr
ics
ca
lcu
latio
n
s
an
d
d
if
f
icu
lties
in
d
etec
to
r
s
ig
n
i
f
ican
tly
in
cr
ea
s
e
with
n
u
m
b
er
o
f
s
tates.
T
h
e
lo
g
ic
u
tili
za
tio
n
f
o
r
STT
C
en
co
d
er
an
d
d
ec
o
d
er
is
1
0
%
an
d
2
2
%
as
th
at
o
f
av
ailab
le
d
e
v
ice
r
eso
u
r
ce
s
,
r
esp
ec
tiv
ely
.
Evaluation Warning : The document was created with Spire.PDF for Python.