计算机程序的构造和解释习题3.29
we know that A or B is equivalent to not ((not A) and (not B)) from Using De-Morgan’s rules. the diagram is:

so, the code is:
- ;;;Exercise 3.29
- (define (or-gate in1 in2 out)
- (let ((a (make-wire))
- (b (make-wire))
- (c (make-wire)))
- (inverter in1 a)
- (inverter in2 b)
- (add-gate a b c)
- (inverter c out)
- 'ok))
the delay time of or-gate = the delay time of and-gate + the delay time of inverter * 2。
本文深入探讨了利用De-Morgan法则构造OR门的过程,并通过具体代码实例展示了其设计实现。进一步,文章详细阐述了OR门延迟时间的计算方法,即OR门延迟等于AND门延迟加上两个反相器的延迟乘以2。

被折叠的 条评论
为什么被折叠?



