1
00:00:01,300 --> 00:00:07,570
The question motivated this election is how can we reduce the propagation delay of the party generator

2
00:00:07,570 --> 00:00:10,330
digital circuit to improve its performance?

3
00:00:12,220 --> 00:00:18,070
As we saw in the previous lecture, if you consider that the propagation delay of an or gate is Delta,

4
00:00:18,340 --> 00:00:23,890
then the propagation delay of the whole design would be at least W minus one times Delta.

5
00:00:25,580 --> 00:00:31,640
Traditionally, designers are responsible for dealing with all the details are providing an optimum

6
00:00:31,640 --> 00:00:32,370
logic circuit.

7
00:00:33,830 --> 00:00:42,140
However, nowadays, Etchells Tools can perform almost all details, just with a little help from designers

8
00:00:42,260 --> 00:00:49,550
following a proper coding Stine's and Etchells optimization guidelines to be able to follow these coding

9
00:00:49,550 --> 00:00:50,120
styles.

10
00:00:50,390 --> 00:00:56,520
Understanding the underlying concept behind several optimization techniques is essential here.

11
00:00:56,780 --> 00:01:03,170
I'm going to explain one of the computation related optimization idea using the power generator.

12
00:01:06,810 --> 00:01:14,160
Addicts or operators are commutative and associative, restructuring the chain of gates into a balanced

13
00:01:14,160 --> 00:01:15,790
three give the same result.

14
00:01:16,170 --> 00:01:20,100
Therefore, this balance three also implements the parity with generate.

15
00:01:21,440 --> 00:01:28,880
If you assume W equals to two to the power of N. despite oratory shows the power to generator, which

16
00:01:28,880 --> 00:01:36,620
has any level of gates thrown W divided by two or gates in the first layer, w divided by four in the

17
00:01:36,620 --> 00:01:44,560
second layer and one X or gate in the last layer, then it needs W minus one X or gaits in total.

18
00:01:44,750 --> 00:01:50,690
If we consider the delta odelay for each X or gate, the delay of the circuit is a logarithmic function

19
00:01:50,690 --> 00:01:55,060
of the bitrate, which is much less than that of our first implementation.

20
00:01:56,960 --> 00:02:02,390
After understanding the concept of a part of it, the question is, how can we describe the power to

21
00:02:02,510 --> 00:02:03,740
generate in each of us?

22
00:02:04,490 --> 00:02:06,560
The next lecture will address this question.

23
00:02:08,730 --> 00:02:12,090
The balance, three extra structure implements, apparently to generate.

24
00:02:13,030 --> 00:02:14,800
That is optimized for performance.

25
00:02:16,620 --> 00:02:24,210
Now, the question for the propagation delay of uneven parity with generator for an 11 data if the delay

26
00:02:24,210 --> 00:02:26,190
of unexpurgated is one nanosecond.