Documente Academic
Documente Profesional
Documente Cultură
(1.1)
p ( s1 s2 ... sn ) = p ( sk ) = p ( E ) = 1
(1.1)
k =1
p ( s1 ) ... p( s j ) ... p ( sn )
Sursa de informaie caracterizat prin experimentul S sau cmpul
de probabilitate cu distribuia dat de (1.2) se va numi discret, dac
furnizeaz un numr finit de mesaje s j , j = 1, n .
Sursa de informaie se va numi complet, dac este
ndeplinita relaia (1.1).
Sursa de informaie se va numi fr memorie, dac furnizarea
unui mesaj la un moment dat nu depinde de mesajele furnizate
anterior.
Deoarece informaia i gradul de nedeterminare pot avea
aceeai msur, iar gradul de nedeterminare este o funcie de
probabilitatea de realizare a evenimentului (mesajului), se poate
considera c informaia ataat (asociat) unui mesaj sk , notat cu
i ( sk ) este, de asemenea, o funcie de probabilitatea p( sk ) , cu care
(1.3)
19
(1.4)
p ( sk s j ) = p ( sk ) p ( s j )
(1.5)
(1.6)
innd cont de relaiile (1.3), (1.4) i (1.5), din (1.6) rezult ecuaia
funcional
F p ( sk ) p ( s j ) = F p ( sk ) + F p ( s j )
(1.7)
(1.8)
(1.10)
H ( S ) = i ( sk ) = p ( sk ) i ( sk )
(1.11)
k =1
unde
i ( sk )
a variabilei
aleatoare discrete i ( sk ) .
nlocuind (1.10) n (1.11), rezult
n
H ( S ) = p ( sk ) log 2 p ( sk ) <
k =1
bii
>
mesaj
(1.12)
= p ( sk ) k <secunde>
(1.13)
k =1
H (S )
<
bii
>
mesajsecunda
22
(1.14)
(1.16)
sn1
p( sn1 )
y1
...
p( y1 ) ...
ym
p ( ym )
(1.17)
iar
m
p ( sn ) = p ( y j )
(1.18)
j =1
k =1
j =1
H ( Sd ) = p ( sk ) log p ( sk ) p ( y j ) log p ( y j )
(1.19)
sau
n
k =1
j =1
p( yj )
H ( S d ) = H ( S ) p ( sn )
p ( sn )
j =1
Deoarece
0
p( yj )
log
p( yj )
p ( sn )
(1.20)
(1.21)
p( y )
p(s ) =1,
(1.22)
j =1
rezult c
m
j =1
p ( sn )
p( yj )
p ( sn )
log
p( yj )
p ( sn )
(1.23)
(1.24)
p ( sk ) = H ( s ) + p ( sk ) 1
k =1
(1.25)
24
p ( sk )
p ( sk )
=0
() k = 1, n
(1.26)
(1.27)
de unde rezult
p ( sk ) = 2 log e , ()k = 1, n
(1.28)
n ( 2 log e ) = 1
(1.29)
de unde se obine
e
n
innd cont de (1.30), relaia (1.28) devine
= log
1
p ( sk ) = ,
n
(1.30)
()k = 1, n
(1.31)
p ( sk ) =
1
n
= p ( sk ) log p ( sk )
k =1
p ( sk ) =
1
n
= log n
(1.32)
H ( S ) log n 0
ntr-adevr,
25
(1.34)
1
p ( s ) log p ( s ) log n p ( s ) =
k =1
k =1
(1.35)
n
1
1
= p ( sk ) log
log n = p ( sk ) log
p ( sk )
n p ( sk )
k =1
k =1
(1.36)
1
, relaia (1.35) devine
n p ( sk )
1
1
k =1 n p ( sk )
H ( S ) log n log e
sau, echivalent,
26
(1.37)
(1.38)
H ( S ) log n log e 1 p ( sk ) = 0
k =1
(1.39)
(1.40)
S =
H (S )
,
H max ( S )
(1.41)
S = 1 S
(1.42)
(1.44)
lim [ x log x ] = 0
x 0
(1.45)
(1.46)
(1.47)
(1.48)
28
1 s1s1 n+1 s2 s1
2 s1s2 n+ 2 s2 s2
..........................
n s1sn 2 n s2 sn
n +1
sn s1
n+ 2
sn s2
n sn sn
2
H (S
n2
) = p ( ) log p ( ) ,
k
mesaj
compus
k =1
Considernd
un
p ( k ) = p( si ) p ( s j ); i, j = 1, n ,
relaia
(l.49)
(l .49)
k = s1s j ,
se
poate
cu
scrie,
H ( S 2 ) = p ( si ) p ( s j ) log p ( si ) p ( s j ) =
i =1 j =1
i =1
j =1
= p ( si ) log p ( si ) p ( s j )
n
j =1
i =1
(1.50)
p ( s j ) log p ( s j ) p ( s j ) = H ( S ) +H ( S ) = 2 H ( S )
( )
H S m = mH ( S ) ,
se poate demonstra c
(1.51)
) = ( m + 1) H ( S )
(1.52)
) = p ( k ) log p ( k ), ()i = 1, n
(1.53)
H S
m +1
ntr-adevr
H (S
m +1
n m +1
k =1
unde
= k si , p ( k ) = p ( k ) p ( si ) ,
(1.54)
k = si si si ,() si S
(1.55)
iar
1
m +1
nm
) = p ( ) p ( s ) log p ( ) p ( s ) =
k1 =1 i =1
k1
30
k1
nm
( )
( )
nm
i =1
i =1
k =1
( )
= p k1 log p k1 p ( si ) p ( si ) log p ( si ) p k1 =
k1 =1
= H ( S m ) + H ( S ) = mH ( S ) + H ( S ) = ( m + 1) H ( S )
(1.56)
numit matrice de
p2,2
p2,nm
p2,1
[T ] =
(1.57)
p m
p
p
n m ,2
nm ,nm
n ,1
Matricea de trecere, [T], astfel ntocmit, este stochastic,
adic suma elementelor de pe fiecare linie este egal cu unitatea,
deoarece cu certitudine dintr-o anumit stare se ajunge n una din
strile posibile.
Prin definiie, sursa cu memorie se numete staionar, dac
probabilitile de trecere pij , sunt invariante n timp.
(1.58)
P ( t + 1) = p1 ( t + 1) p2 ( t + 1) ... pnm ( t + 1)
(1.59)
p j (t + 1) = pi (t ) pij , () j = 1, n m
(1.60)
i =1
, n=0,1,
(1.62)
(1.63)
P ( 2 ) = P (1) [T ]
sau, innd cont de (1.63), rezult, echivalent,
(1.64)
P ( 2 ) = P ( 0 ) [T ]
Raionnd n mod similar, se poate scrie n general
(1.65)
P ( n ) = P ( 0 ) [T ]
(1.66)
Prin definiie, o surs cu memorie, staionar se numete
n
34
(1.67)
[ P ] = p1
p2 ... pnm
(1.68)
[ P ] = [ P ][T ]
(1.69)
p
k =1
=1
(1.70)
z [ P ( z ) ] [ P(0) ] = [ P ( z ) ][T ]
(1.71),
[ P( z )] z [ I ] [T ] = z [ P(0)]
(1.72)
sau
unde [ I ] este matricea unitate de ordinul nm.
Din relaia (1.72) rezult
[ P( z )] = z [ P(0)] z [ I ] [T ]
(1.73)
[ P( z )] = [ P(0)] Z {[T ] }
n
(1.74)
{ } = z P ( 0) z [ I ] [T ]
P ( 0 ) Z [T ]
(1.75)
{ } = z z [ I ] [T ]
Z [T ]
de unde rezult
[T ]
= Z 1 z z [ I ] [T ]
(1.76)
},
(1.77)
(1.78)
(1.79)
i ( Sk ) = p s jS k log p s jS k
j =1
(1.80)
H = i ( S k ) = pk .i ( Sk )
(1.81)
k =1
(1.82)
mn } mulimea de mesaje pe
p(m1 | Snm )
p (m2 | S1 )
p(m2 | S2 )
p(m2 | S nm )
38
p (mn | S1 )
p(mn | S 2 )
p (mn | S nm )
(1.84)
(1.85)
[ P( S , M )] =
p( S nm mn )
p( S nm m1 ) p( Snm m2 )
poate fi uor obinut din [P(M|S)], prin multiplicarea primei linii cu
p( S1 ) , a celei de-a doua cu p ( S2 ) .a.m.d., a ultimei cu p ( S nm ) i
(1.86)
p (m j ) = p(m j S k ), () j = 1, m .
(1.87)
k =1
S k , k = 1, n m ,
dac
furnizat
mesajul
m j , j = 1, n .
Aceste
p ( S1 | mn )
p( S 2 | mn )
p ( S nm | mn )
(1.88)
p( S nm | m1 )
p ( S1 | m2 )
p( S 2 | m2 )
p( S nm | m2 )
p ( Sk m j ) = p(m j ) p ( Sk | m j )
(1.89)
(1.90)
H ( S , M ) = i ( S k m j ) = p( S k m j )i ( S k m j )
(1.91)
k =1 j =1
H ( S , M ) = p( Sk m j ) log p( S k m j )
(1.92)
k =1 j =1
H ( S , M ) = p(m j ) p( Sk | m j ) log p( S k m j )
j =1
k =1
Mrimea informaional
n
nm
not .
p( S k | m j ) log p( Sk m j ) = H ( S , m j )
(1.93)
(1.94)
k =1
H ( S , M ) = p( Sk ) p(m j | S k ) log p( S k m j )
k =1
j =1
Mrimea informaional
nm
not .
p(m j | S k ) log p( Sk m j ) = H ( Sk , M )
(1.95)
(1.96)
j =1
(1.97)
Valoarea
ei
medie,
notat
cu
H ( S | m j ) , este dat de
nm
H ( S | m j ) = i ( Sk | m j ) = p( S k | m j )i ( S k | m j )
(1.98)
k =1
H ( S | m j ) = p ( Sk | m j ) log p( S k | m j ) .
(1.99)
k =1
Mrimea informaional
H (S | m j )
este o msur a
H ( S | M ) = H ( S | m j ) = p(m j ) H ( S | m j )
(1.100)
j =1
H ( S | M ) = p( S k m j ) log p( S k | m j )
(1.101)
k =1 j =1
H ( S | M ) = p (m j ) p ( S k | m j ) log p ( S k | m j )
j =1
k =1
H ( S | M ) = p( Sk ) p( m j | S k ) log p( S k | m j )
k =1
j =1
Mrimea informaional
nm
nm
not .
p( S k | m j ) log p( S k | m j ) = H ( S | m j )
(1.102)
(1.103)
(1.104)
k =1
not .
p (m j | Sk ) log p( Sk | m j ) = H ( Sk | M )
(1.105)
j =1
cu relaia
nm
H ( M | S ) = p( S k ) p (m j | Sk ) log p(m j | Sk )
(1.106)
k =1 j =1
H ( M | S ) = p( Sk m j ) log p(m j | S k )
(1.107)
k =1 j =1
H ( M | S ) = p( m j ) p( S k | m j ) log p( m j | S k )
j =1
k =1
H ( M | S ) = p( Sk ) p( m j | S k ) log p(m j | S k )
k =1
j =1
Mrimea informaional
nm
nm
not .
p( S k | m j ) log p(m j | S k ) = H (m j | S )
(1.108)
(1.109)
(1.110)
k =1
not .
(1.111)
j =1
(1.112)
nm
k =1
k =1
H ( S ) = i ( S k ) = p ( S k )i ( S k ) = p ( S k ) log p ( Sk )
(1.113)
p( Sk ) = p( Sk m j ) ,
(1.114)
k =1
H ( S ) = p( S k m j ) log p( S k ) .
(1.115)
k =1 j =1
H ( M ) = p( Sk m j ) log p(m j )
(1.116)
k =1 j =1
i ( Sk , m j ) = log
p( Sk | m j )
(1.118)
p( Sk )
(1.119)
este
nm
I ( S , M ) = i ( S k , m j ) = p( S k m j )i ( Sk , m j )
(1.120)
k =1 j =1
I ( S , M ) = i ( Sk , m j ) = p( S k m j ) log
k =1 j =1
p( Sk m j )
p( Sk ) p(m j )
(1.121b)
nm
p( Sk m j )
j =1
k =1
p(m j ) p( Sk )
I ( S , M ) = p (m j ) p ( S k | m j ) log
Mrimea informaional
n
p ( S k m j ) not .
p (m j | S k ) log
= I ( Sk , M ) ,
p (m j ) p( Sk )
j =1
(1.123)
(1.124)
p (m j ) p( Sk )
k =1
(1.125)
I (S , M ) = H (S ) + H (M ) H (S , M )
(1.126b)
(1.127)
I (S , M ) = H (S ) H (S | M )
(1.128a)
I (S , M ) = H (M ) H (M | S )
(1.128b)
(1.129)
j =1
nm
H ( S , m j ) = H (m j | S ) p ( S k | m j ) log p ( S k ) =
k =1
= H ( S | m j ) log p (m j )
46
(1.130)
I ( S k , M ) = log p ( S k ) p (m j | S k ) log p (m j ) H ( S k , M ) =
j =1
log p ( S k ) H ( S k | M ) = p (m j | S k ) log p (m j ) H ( M | S k )
j =1
(1.131)
n
I ( S , m j ) = p( S k | m j ) log p( S k ) log p( m j ) H ( S , m j ) =
k =1
p( S k | m j ) log p( S k ) H ( S | m j ) = log p (m j ) H (m j | S )
k =1
(1.132)
pi , i = 1, m ,
H1 = pi log pi
(1.133)
i =1
i =1
j =1
H 2 = pi p j i log p j i
(1.134)
i =1
j =1
k =1
H 3 = pi p j i pk j ,i log pk j ,i
(1.135)
49