请帮忙翻译一下,急用
用括号里的词语翻译...1.她在法国居住后很快学会了法语(pickup)2.他的懒惰导致他的失败(resultin)3.科学家声称发现了一颗新行星(claim)4.评价一...
用括号里的词语翻译...
1.她在法国居住后很快学会了法语(pick up)
2.他的懒惰导致他的失败(resultin)
3.科学家声称发现了一颗新行星(claim)
4.评价一个人要充分考虑他的成绩(take account of)
5.它已成为各种贸易和商务的最强有力的手段(medium) 展开
1.她在法国居住后很快学会了法语(pick up)
2.他的懒惰导致他的失败(resultin)
3.科学家声称发现了一颗新行星(claim)
4.评价一个人要充分考虑他的成绩(take account of)
5.它已成为各种贸易和商务的最强有力的手段(medium) 展开
3个回答
展开全部
This
scheme
is
called
the
second-generation
wavelets.
Obviously,
it
can
be
used
to
build
first-generation
wavelets
and
leads
to
a
faster,
full
in-place
implementation
of
the
wavelet
transform.
The
basic
idea
behind
the
lifting
scheme
is
a
relationship
among
all
biorthogonal
wavelets
that
share
the
same
scaling
function
such
that
one
can
construct
the
desired
wavelet
from
a
simple
one.
Daubechies
and
Sweldens
proved
[3]
that
any
wavelet
with
FIR
filters
can
be
factorized
into
a
finite
number
of
alternating
lifting
and
dual
lifting
steps
starting
from
the
Lazy
wavelet.
This
implies
that
any
wavelet
can
be
derived
from
arbitrary
wavelet,
including
the
Lazy
wavelet,
by
a
finite
number
of
lifting
and
dual
lifting.
The
main
feature
of
the
lifting-based
DWT
scheme
is
to
break
up
the
high-pass
and
low-pass
filters
into
a
sequence
of
upper
and
lower
triangular
matrices
and
convert
the
filter
implementation
into
banded
matrix
multiplications
[
3
]
.
Such
a
scheme
has
several
advantages,
including
"in-place''
computation
of
DWT,
integer-to-integer
wavelet
(IWT),
symmetric
forward
and
inverse
transform
etc.
Therefore,
it
comes
as
no
surprise
that
lifting
has
been
chosen
in
the
new
still
image
compression
standard
JPEG2000
[
1].
Let
h(z)
and
g(z)
denote
the
low-pass
and
high-pass
analysis
filters,
h(z)
and
g(z)
the
low-pass
and
high-pass
synthesis
filters,
respectively,
then
the
corresponding
decomposition
and
reconstruction
poIyphase
matrices,
denoted
as
p(z)
and
p(z)
,
respectively,
are
defined
as
follows:
[图](略)
where
he(z)
and
ge(z)
[ho(z)
and
go(z)]
represent
the
even
parts
[odd
parts]
of
the
Iowpass
and
highpass
wavelet
filters,
respectively.
It
has
been
shown
in
[2]
and
[3]
that
if
the
h(z)
and
g(z)
are
a
pair
of
complementary
filters
for
each
other,
then
the
p(z)is
always
factorized
by
lifting
scheme
as
follows
[3]:
[图](略)
in
which
K
is
a
constant,
;i(z)and
s
;
(
z
)
are
denoted
as
primary
lifting
and
dual
lifting
polynomial
(or
vice
versa)
respectively,
and
m
represents
the
total
lifting
steps
required.
3.
NEW
LIFTING
SCHEME
The
polyphase
matrix
of
the
(6,lO)
filter
can
be
decomposed
as
(3)
[SI.
[图](略)
where
a,
b,
c,
d,
e,
f;
K2,
K,
are
the
corresponding
lifting
coefficients
and
scale
normalization
coefficients,
respectively,
which
can
be
referred
to
[I].
From
(1),
the
parallel-based
lifting
scheme
for
forward
transform
of
(6,lO)
filter
can
be
obtained
as
(4):
[图](略)
We
use
x[n]
to
represent
the
original
input
sequence,
and
x[Zn]
(x[2n+
I])
to
represent
even
(odd)
indexed
samples,
the
intermediate
values
computed
during
lifting
are
denoted
as
&"'[n]
and
L'")[n]
(m=Z,2),
and
the
lowand
high-
frequency
coefficients
are
expressed
as
the
sequence
L[n]
and
H[n],
respectively.
Hence,
from
(2),
the
implementation
of
forward
transform
for
(6,
IO)
filter
can
be
written
as
(3)
by
using
mathematical
notations.
[图](略)
4.
PROPOSED
ARCHITECTURE
From
(3),
the
flow
diagram
of
lifting-based
architecture
for
the
(6,lO)
filter
can
be
proposed
as
shown
in
Fig.1,
in
which
the
critical
path
is
calculated
as
(4T,
+
U,).
While
according
to
(5),
The
flow
diagram
of
a
VLSI
architecture
based
on
the
proposed
PLS
(named
as
PLSAj
for
the
(6,lO)
DWT
is
illustrated
as
shown
in
Fig.Z(a).
It
can
be
calculated
that
the
critical
path
latency
of
the
proposed
PLSA
is
(T,,,
+
4T,)
if
only
the
order
of
addition
operations
is
optimized.
The
critical
path
of
the
architecture
shown
in
Fig.l(a)
can
be
further
reduced
by
pipelining.
The
proposed
PLSA
with
2
stages
of
pipeline
denoted
as
dot
lines
is
shown
in
Fig.2(b),
in
which
4
additional
pipeline
registers
are
used
and
the
critical
path
is
reduced
from
(T',
+
4T0)
to
(T,
+
ZT,).
The
proposed
PLSA
with
5
stages
of
pipeline
is
shown
in
Fig.Z(c),
in
which
11
additional
pipeline
registers
are
used
and
the
critical
path
is
reduced
to
T,.
The
total
number
of
registers
required
can
be
efficiently
reduced
if
the
retiming
technique
is
employed.
Equations
(5a)-(5d)
can
be
rewritten
as
(6a)-(6d)
if
retiming
is
employed.
Following
(6),
a
PLS-based
architecture
combining
retiming
and
5
stages
of
pipeline
for
the
(6,lO)
1-D
DWT
can
be
proposed
as
shown
in
Fig.2(d).
Compared
with
the
architecture
shown
in
Fig.2(c),
the
total
number
of
register
required
is
reduced
from
I5
to
14.
Performance
comparison
for
the
architectures
of
the
(6,iO)
filter
is
illustrated
in
Table
1.
Comparison
results
demonstrate
the
PLS-based
architectures
gains
better
performance
than
the
flipping
structure
in
the
case
of
(6,lO)
filter
chosen,
and
the
later
is
a
special
case
of
PLSA
[图](略)
[图](略)
Fig.2
Proposed
PLS-based
architecture
(PLSA)
of
(6,lO)
1-D
DWT.
(a)
PLSA
without
pipeline,
(b)
PLSA
with
2
stages
of
pipeline,
(c)
PLSA
with
5
stages
of
pipeline,
(d)
PLSA
with
combining
retiming
and
5
stages
of
pipeline
TABLE
1
PERFORMANCE
COMPARISON
OF
ARCHITECTURES
FOR
THE
(6,lO)
I-D
DWT
[图](略)
5.
CONCLUSIONS
A
modified
lifting
algorithm
for
the
(6,lO)
wavelet
filters,
as
well
as
the
fast
VLSI
architectures,
have
been
proposed,
in
which
parallelism
of
arithmetic
operations
in
each
lifting
step
is
exploited,
and
a
retiming
technique
is
employed
to
optimize
design.
Compared
with
the
previous
lifting-based
designs,
the
new
implementations
is
a
more
efficient
altemative
in
reducing
critical
path
and
hardware
cost.
郁闷,一次还发不完。
scheme
is
called
the
second-generation
wavelets.
Obviously,
it
can
be
used
to
build
first-generation
wavelets
and
leads
to
a
faster,
full
in-place
implementation
of
the
wavelet
transform.
The
basic
idea
behind
the
lifting
scheme
is
a
relationship
among
all
biorthogonal
wavelets
that
share
the
same
scaling
function
such
that
one
can
construct
the
desired
wavelet
from
a
simple
one.
Daubechies
and
Sweldens
proved
[3]
that
any
wavelet
with
FIR
filters
can
be
factorized
into
a
finite
number
of
alternating
lifting
and
dual
lifting
steps
starting
from
the
Lazy
wavelet.
This
implies
that
any
wavelet
can
be
derived
from
arbitrary
wavelet,
including
the
Lazy
wavelet,
by
a
finite
number
of
lifting
and
dual
lifting.
The
main
feature
of
the
lifting-based
DWT
scheme
is
to
break
up
the
high-pass
and
low-pass
filters
into
a
sequence
of
upper
and
lower
triangular
matrices
and
convert
the
filter
implementation
into
banded
matrix
multiplications
[
3
]
.
Such
a
scheme
has
several
advantages,
including
"in-place''
computation
of
DWT,
integer-to-integer
wavelet
(IWT),
symmetric
forward
and
inverse
transform
etc.
Therefore,
it
comes
as
no
surprise
that
lifting
has
been
chosen
in
the
new
still
image
compression
standard
JPEG2000
[
1].
Let
h(z)
and
g(z)
denote
the
low-pass
and
high-pass
analysis
filters,
h(z)
and
g(z)
the
low-pass
and
high-pass
synthesis
filters,
respectively,
then
the
corresponding
decomposition
and
reconstruction
poIyphase
matrices,
denoted
as
p(z)
and
p(z)
,
respectively,
are
defined
as
follows:
[图](略)
where
he(z)
and
ge(z)
[ho(z)
and
go(z)]
represent
the
even
parts
[odd
parts]
of
the
Iowpass
and
highpass
wavelet
filters,
respectively.
It
has
been
shown
in
[2]
and
[3]
that
if
the
h(z)
and
g(z)
are
a
pair
of
complementary
filters
for
each
other,
then
the
p(z)is
always
factorized
by
lifting
scheme
as
follows
[3]:
[图](略)
in
which
K
is
a
constant,
;i(z)and
s
;
(
z
)
are
denoted
as
primary
lifting
and
dual
lifting
polynomial
(or
vice
versa)
respectively,
and
m
represents
the
total
lifting
steps
required.
3.
NEW
LIFTING
SCHEME
The
polyphase
matrix
of
the
(6,lO)
filter
can
be
decomposed
as
(3)
[SI.
[图](略)
where
a,
b,
c,
d,
e,
f;
K2,
K,
are
the
corresponding
lifting
coefficients
and
scale
normalization
coefficients,
respectively,
which
can
be
referred
to
[I].
From
(1),
the
parallel-based
lifting
scheme
for
forward
transform
of
(6,lO)
filter
can
be
obtained
as
(4):
[图](略)
We
use
x[n]
to
represent
the
original
input
sequence,
and
x[Zn]
(x[2n+
I])
to
represent
even
(odd)
indexed
samples,
the
intermediate
values
computed
during
lifting
are
denoted
as
&"'[n]
and
L'")[n]
(m=Z,2),
and
the
lowand
high-
frequency
coefficients
are
expressed
as
the
sequence
L[n]
and
H[n],
respectively.
Hence,
from
(2),
the
implementation
of
forward
transform
for
(6,
IO)
filter
can
be
written
as
(3)
by
using
mathematical
notations.
[图](略)
4.
PROPOSED
ARCHITECTURE
From
(3),
the
flow
diagram
of
lifting-based
architecture
for
the
(6,lO)
filter
can
be
proposed
as
shown
in
Fig.1,
in
which
the
critical
path
is
calculated
as
(4T,
+
U,).
While
according
to
(5),
The
flow
diagram
of
a
VLSI
architecture
based
on
the
proposed
PLS
(named
as
PLSAj
for
the
(6,lO)
DWT
is
illustrated
as
shown
in
Fig.Z(a).
It
can
be
calculated
that
the
critical
path
latency
of
the
proposed
PLSA
is
(T,,,
+
4T,)
if
only
the
order
of
addition
operations
is
optimized.
The
critical
path
of
the
architecture
shown
in
Fig.l(a)
can
be
further
reduced
by
pipelining.
The
proposed
PLSA
with
2
stages
of
pipeline
denoted
as
dot
lines
is
shown
in
Fig.2(b),
in
which
4
additional
pipeline
registers
are
used
and
the
critical
path
is
reduced
from
(T',
+
4T0)
to
(T,
+
ZT,).
The
proposed
PLSA
with
5
stages
of
pipeline
is
shown
in
Fig.Z(c),
in
which
11
additional
pipeline
registers
are
used
and
the
critical
path
is
reduced
to
T,.
The
total
number
of
registers
required
can
be
efficiently
reduced
if
the
retiming
technique
is
employed.
Equations
(5a)-(5d)
can
be
rewritten
as
(6a)-(6d)
if
retiming
is
employed.
Following
(6),
a
PLS-based
architecture
combining
retiming
and
5
stages
of
pipeline
for
the
(6,lO)
1-D
DWT
can
be
proposed
as
shown
in
Fig.2(d).
Compared
with
the
architecture
shown
in
Fig.2(c),
the
total
number
of
register
required
is
reduced
from
I5
to
14.
Performance
comparison
for
the
architectures
of
the
(6,iO)
filter
is
illustrated
in
Table
1.
Comparison
results
demonstrate
the
PLS-based
architectures
gains
better
performance
than
the
flipping
structure
in
the
case
of
(6,lO)
filter
chosen,
and
the
later
is
a
special
case
of
PLSA
[图](略)
[图](略)
Fig.2
Proposed
PLS-based
architecture
(PLSA)
of
(6,lO)
1-D
DWT.
(a)
PLSA
without
pipeline,
(b)
PLSA
with
2
stages
of
pipeline,
(c)
PLSA
with
5
stages
of
pipeline,
(d)
PLSA
with
combining
retiming
and
5
stages
of
pipeline
TABLE
1
PERFORMANCE
COMPARISON
OF
ARCHITECTURES
FOR
THE
(6,lO)
I-D
DWT
[图](略)
5.
CONCLUSIONS
A
modified
lifting
algorithm
for
the
(6,lO)
wavelet
filters,
as
well
as
the
fast
VLSI
architectures,
have
been
proposed,
in
which
parallelism
of
arithmetic
operations
in
each
lifting
step
is
exploited,
and
a
retiming
technique
is
employed
to
optimize
design.
Compared
with
the
previous
lifting-based
designs,
the
new
implementations
is
a
more
efficient
altemative
in
reducing
critical
path
and
hardware
cost.
郁闷,一次还发不完。
展开全部
1.she picked up French quickly after she lived in France
2.his laziness resulted in hia failure
3.scientists claimed they had found a new planet
4.to evaluate a person should takes accout of his attainment
5.it has been the strongest medium of all kinds of trades and business
2.his laziness resulted in hia failure
3.scientists claimed they had found a new planet
4.to evaluate a person should takes accout of his attainment
5.it has been the strongest medium of all kinds of trades and business
本回答被提问者采纳
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
1.she soon picked up the French when living in Frence
2.the lazyness resulted in his failure
3.the scientists claimed that they had found a new planet
4.evaluating a people needs fully to take account of his acheivements
5.it has becomed the most forceful medium in all various trades and commercial affairs
2.the lazyness resulted in his failure
3.the scientists claimed that they had found a new planet
4.evaluating a people needs fully to take account of his acheivements
5.it has becomed the most forceful medium in all various trades and commercial affairs
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询