Y=tx;

T=[13,12,5,3; 11,2,7,11; 6,9,15,7; 6,11,5,15]

Y1= 13x1+12x2+5x3+3x4;
Y2= 11x1+2x2+7x3+11x4;
Y3= 6x1+9x2+15x3+7x4;
Y4= 6x1+11x2+5x3+15x4;

a) Sub expression for each column are listed below:

Column 1 Column 2 Column 3 Column 4

0010 0010 0010 0011
0100 1001 0101 0100
1001 1100 1000 1000

b) Unique product expression are:

Column 1 Column 2 Column 3 Column 3

P1 – 0010 x1 P4 – 0010 x2 P7 – 0010 x3 P10 – 0011 x4
P2 – 0100 x1 P5 – 1001 x2 P8 – 0101 x3 P11 – 0100 x4
P6 – 1100 x2 P9 –1000 x3
P3 - 1001 x1 P12 – 1001 x4

c) Y1,y2,y3 and y4 are writtenin binary format as follows , when the bit positions presence or
absence of the product expressions:

Matching algorithm:

P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12

Y1 0 1 1 0 0 1 0 1 0 1 0 0
Y2 1 0 1 1 0 0 1 1 0 1 0 1
Y3 1 1 0 0 1 0 1 1 1 1 1 0
Y4 1 1 0 1 1 0 0 1 0 1 1 1

Compare matches
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12
0 1 1 0 0 1 0 1 0 1 0 0
Y1 &y2 1 0 1 1 0 0 1 1 0 1 0 1

Y1 & 0 1 1 0 0 1 0 1 0 1 0 0
y3 1 1 0 0 1 0 1 1 1 1 1 0
Y1&Y4 0 1 1 0 0 1 0 1 0 1 0 0

1 1 0 1 1 0 0 1 0 1 1 1

Constant Unsigned
Rem of y1 01000 10000 00
Rem of y2 100100 100001
Red of y1 , y2 00100001 0100
Y3 110010 111110
Y4 1101100 10111

compare P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12

1 1 0 0 1 0 1 1 1 1 1 0
Y3 &y4
1 1 0 1 1 0 0 1 0 1 1 1

Constant Unsigned
Rem of y1 01000 10000 00
Rem of y2 100100 100001
Red of y1 , y2 00100001 0100
Y3 110010 111110
Y4 1101100 10111
Rem of y1 00100 01000 0000
Rem of y2 010100 001001 00
Red of y1, y2 00000001 0000 00
Rem of Y3 0000001 01000
Rem of Y4 000100 000001

Red of y3,y4 110010010110

After iterative algorithm y1, y2, y3, y4 can be computed as:

Y1=(p8+p10)+p2+p3+p6
Y2=((p8+p10)+p1)+(p4+p12)+p3+p7
Y3=(((p8+p10)+p1)+p2+p5+p11)+p7+p9
Y4=(((p8+p10)+p1)+p2+p5+p11)+(p4+p12)

It requires 15 additions ,the computation of y1,y2,y3,y4 requires 20adds and 13 shifts ,as opposed to
37 adds and 29shifts.