Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Shannon expansion theorem Reed-Muller expressions Kronecker expressions Generalized bit level expressions Walsh transform
X0 X1 X2 X3
00 01 10 11
X1
X2
= ( x1 x0 , x1 x0 , x1 x0 , x1 x0 ) F
2
a1,m B an ,m B
[ x1 x1 ] [ x0 x0 ] = [ x1 x0 x1 x0 x1 x0 x1 x0 ]
1 0 f0 f = ( xi xi ) f = X (1) B(1) F 0 1 1
By recursive application of Shannon expansion each n-variable switching function can be represented as
n 1 n 1 f = X (1) B(1) F i =0 i =0
4
Polynomial Representation
REED-MULLER EXPRESSION Theorem: An arbitrary n-variable function is uniquely represented as
f ( x1 , x 2 , , x n ) = a 0 ( a 1 x1 a 2 x 2 a n x n ) ( a 1 , 2 x1 x 2 a 1 , 3 x1 x 3 a n 1 , n x n 1 x n ) a 1 , 2 ,..., n x1 x 2 x n ,
= 00
1 k
1 n on which
f ( 1 n ) equals 1.
2. 3.
xi = 1 xi
From Shannon expansion we derive the positive Davio (pD) expansion (decomposition) rule, where f is represented as a polynomial
f = xi f 0 xi f1 = f 0 xi ( f 0 f1 ) = c0 c1 xi
In matrix notation the pD expansion rule can be expressed in terms of basic matrices Xrm(1) and R(1)
1 0 f 0 f = (1 xi ) f = X rm (1) R(1) F 1 1 1
By recursive application of pD expansion each n-variable switching function can be represented as Positive Polarity Reed-Muller (PPRM) expansion
n n f = X rm (1) R (1) F i =1 i =1
Reed-Muller spectrum
The matrix
R(n) = R (1)
i =1
Rm(0,x)
Rm(1,x)
is called the RM matrix, the matrix is non-singular. The columns of the matrix are RM functions rm(i,x) The RM spectrum is defined as thus
Rm(2,x)
Rm(3,x)
Rm(4,x)
Rm(5,x)
Rm(6,x)
Rm(7,x) 0 1 2 3 4 5 6 7
10
Definition:
The transeunt triangle for f(x1; x2;; xn) is a triangle of 0's and 1's where the bottom row is the truth vector of f. The j-th element in the i-th row of the triangle is denoted by
ei , j
to-bottom starting with i = 0 and j = 0, respectively. The truth vector corresponds to the elements
The element e n corresponds to f(k), where k is the binary representation 2 1, k of integer k. Other elements are related by
ei , j = ei +1, j ei +1, j +1
11
12
ei , j = ei + 2k , j ei + 2k , j + 2k
Theorem 2:
Let T be transeunt triangle for a switching function f(x1; x2; ; xn). If we divide T onto 3 triangles T0; T1 and T2 as shown in the figure, then T0 is the transeunt triangle for the function f(0; x2; ; xn), T1 is the transeunt triangle for the function f(1; x2; ; xn) and T2 is the transeunttriangle for the function f(0; x2; ; xn) f(1; x2; ; xn)
13
Where
xi x = xi
hi i
hi = 0 hi = 1
and
1 1 hi R (1) = 0 1
0 1 1 1 i
hi = 0 hi = 1
The number of terms in a FPRM expansion for a given polarity vector H is the
mod(2)
14
f ( z0 , z1 , z2 ) = (0, 4,5, 6, 7)
15
Kronecker expressions
Kronecker expressions are generalization of the FPRM expressions each variable can have different expansion rule : Shannon (S), positive Davio (pD) or negative Davio (nD).
17
Fourier transform
F ( ) =
t =
f (t )e jt dt
1 f (t ) = 2
t =
F ( )e jt d
F (k ) = f (n)e j 2 nk / M
n=0
M 1
19
Walsh transform
The Walsh matrix is defined as
W (n) = W (1),
i =1
Wall(0,x)
1 1 W (1) = 1 1
Wall(1,x)
Wall2,x)
Wi ,k = (1)
<i , k >
= (1)
is ks
s =0
n 1
=e
j <i , k >
Wall(3,x)
Wall(4,x)
S f = W ( n) F
Wall(5,x)
Wall(6,x)
F = 2 n W ( n) S f
Wall(7,x) 0 1 2 3 4 5 6 7
20
21
f ( x) = 2 n S f ( w) wal ( w, x)
w=0
2n 1
S f ( w) = f ( x) wal ( w, x)
x =0
2n 1
22
23