Biomedical Engineering Reference
In-Depth Information
.
b.. For.any.cutting.position.
c
n
,.which.cuts.no.actual.bits.in.ξ
n
,.and.for.
any. pasting. position.
k
n
,. if. some. actual. bits. in.
M
c
′
. are. compared.
,
k
n
n
with.don't-care.bits.in.
M
c
n n
.of.ξ
i
,.it.is.possible.to.lip.the.rightmost.
of.those.actual.bits.to.find.a.corresponding.
,
.such.that
ξ
∈
Z
′
n
′
∑
∆ ξ
(
,
M
;
ξ
,
M
′
) (
∆ ξ
,
R
;
ξ
,
R
)
i
c
,
k
n
c
,
k
i
c
,
k
n
c
,
k
n
n
n
n
n
n
n
n
ξ
∈
Z
n
∑
−
∆ ξ
(
,
M
;
ξ
,
M
′
) (
∆ ξ
,
R
;
ξ
,
R
) 0
=
i
c
,
k
n
c
,
k
i
c
,
k
n
c
,
k
n
n
n
n
n
n
n
n
.
ξ
∈
Z
′
n
.
c.. For.any.cutting.position.
c
n
,.which.cuts.no.actual.bits.in.
ξ
,.and.for.
any.pasting.position.
k
n
,.if.all.actual.bits.in.
M
c
′
.are.compared.with.
,
k
n
n
actual.bits.in.
M
c
n
.
of.
ξ
,.it.is.easy.to.verify.that.there.are.no.actual.
,
k
n
bits.in.
M
c
′
..So,.all.actual.bits.are.located.inside.
R
c
n
..We.deine.a.
,
k
,
k
n
n
n
set
S
=
{(
c
,
k
) : no actual bits in cutting and moving regions}.
.
.
ck
n
n
.
.
For.any.pair.of.
(
c
∈
,.we.have
c
,
k
)
S
n
n
∆ ξ
(
,
I
;
ξ
,
G
) 1
=
.
i
c
,
k
m
c
,
c
,
k
n
n
m n
n
.
.
and
∑
(
)
∆ ξ
,
M
;
ξ
,
M
′
∆ ξ
(
,
R
;
ξ
,
R
)
i
c
,
k
n
c
,
k
i
c
,
k
n
c
,
k
n
n
n
n
n
n
n
n
ξ
∈
Z
n
∑
(
)
−
∆ ξ
,
M
;
ξ
,
M
∆ ξ
(
,
R
;
ξ
,
R
)
= ±
1
′
i
c
,
k
n
c
,
k
i
c
,
k
n
c
,
k
n
n
n
n
n
n
n
n
.
.
ξ
∈
Z
′
n
By.summing.cases.a.to.c,.we.get
L L
−
g
1
∑
∑
∑
∑
( )
i
( )
i
b
−
b
= ±
1
mn
mn
3
(
L L
−
+
1)
g
ξ
∈
Z
ξ
∈
′
Z
c
=
0
(
c
,
k
)
∈
S
n
n
m
n
n
ck
N
L L
′
0
= ±
2
(
−
+
1)
g
≡
C
′
.
row
Search WWH ::
Custom Search