the art of the propagator alexey radul and gerald jay
play

The Art of the Propagator Alexey Radul and Gerald Jay Sussman CSAIL - PowerPoint PPT Presentation

The Art of the Propagator Alexey Radul and Gerald Jay Sussman CSAIL and EECS MIT +V CC R B1 R C C out c + + C in b Q + + v v e C out + v v in B R B2 R E v E (define-propagator (ce-amplifier)


  1. The Art of the Propagator Alexey Radul and Gerald Jay Sussman CSAIL and EECS MIT

  2. +V CC R B1 R C C out c + + C in b Q + + v v e C out + v v in B R B2 R E v E − − − − −

  3. (define-propagator (ce-amplifier) (let-cells ((Rb1 (resistor)) (Rb2 (resistor)) (Rc (resistor)) (Re (resistor)) (Cin (capacitor)) (Cout (capacitor)) (Q (infinite-beta-bjt)) (+rail-w (short-circuit)) (-rail-w (short-circuit))) (let-cells ((+rail-node (node (the t1 Rb1) (the t1 Rc) (the t2 +rail-w))) (-rail-node (node (the t2 Rb2) (the t2 Re) (the t2 -rail-w))) (e (node (the t1 Re) (the emitter Q))) (c (node (the t2 Rc) (the t2 Cout) (the collector Q))) (b (node (the t2 Rb1) (the t1 Rb2) (the base Q) (the t2 Cin)))) (let-cells ((+rail (the t1 +rail-w)) (-rail (the t1 -rail-w)) (sigin (the t1 Cin)) (sigout (the t1 Cout))) (e:inspectable-object +rail -rail sigin sigout ...)))))

  4. (let-cells ((power (bias-voltage-source)) (vin (signal-voltage-source)) (vout (open-circuit)) (amp (ce-amplifier))) (let-cells ((gnd (node (the t2 power) (the t2 vin) (the t2 vout) (the -rail amp))) (+V (node (the t1 power) (the +rail amp))) (in (node (the t1 vin) (the sigin amp))) (out (node (the t1 vout) (the sigout amp)))) ((constant 0) (the potential gnd)))) (assume! (the strength power amp) (& 15. volt)) (assume! (the resistance rc amp) (& 5000. ohm)) (assume! (the resistance re amp) (& 1000. ohm)) (assume! (the resistance rb1 amp) (& 51000. ohm)) (assume! (the resistance rb2 amp) (& 10000. ohm)) (assume! (the vthreshold q amp bias) (& +0.7 volt)) (assume! (the I0 q amp) (& 1e-15 ampere)) (assume! (the beta q amp) 100)

  5. (presume! (the amplifying operation q amp bias))) (presume! (the beta-infinite q amp bias))) (presume! (the emitter-follows q amp bias))) (value (the potential b amp bias)) ; (plunk (potential b amp bias) e12) ; CEP97 0=(+ -2.94e-4 (* 1.20e-4 e12)) ; CEP109 (> (+ -.0007 (* .001 e12)) 0) ; CEP122 (> (+ 20.67 (* -6.60 e12)) .2) ; ((potential b amp bias) = 2.46) ; (from (resistance rb2 amp) ; (beta-infinite q amp bias) ; (resistance rb1 amp) ; (strength power)) ;Value: (& 2.459016393442623 volt) (value (the potential e amp bias)) ; ((potential e bias) = 1.76) ; (set by (-rhs:kvl-be q amp bias)) ; (because (potential b amp bias) ; (vbe q amp bias)) ;Value: (& 1.759016393442623 volt)

  6. (why? (the potential e amp bias)) ;(CEP132 (potential e bias) = 1.76 ; set by (-rhs:kvl-be q amp bias) (CEP130 CEP71)) ;(CEP130 (potential b amp bias) = 2.46 ; because CEP60 CEP15 CEP58 CEP52) ;(CEP71 (vbe q amp bias) = .7 ; set by (emitter-follows q bias) (CEP62 CEP18)) ;(CEP60 (resistance rb2 amp) = 10000. ; set by assumption (CEP61)) ;(CEP15 beta-infinite PREMISE) ;(CEP58 (resistance rb1 amp) = 51000. ; set by assumption (CEP59)) ;(CEP52 (strength power) = 15. ; set by assumption (CEP53)) ;(CEP62 (vthreshold q amp bias) = .7 ; set by assumption (CEP63)) ;(CEP18 emitter-follows PREMISE) ;Value: QED

  7. The Propagator Idea Independent Stateless Machines Connecting Stateful Cells

  8. Expressions to Propagators An expression has anonymous connections (/ (+ (/ x g) g) 2) _____ x ---->| | | / | _____ g --*->|___|--->| | | | + | _____ ----------->|___|--->| | | / | 2 ------>|___|--->

  9. In propagators, we make these explicit: _____ x ---->| | | / | _____ g --*->|___|-x/g->| | | | + | _____ ------------->|___|-x/g+g->| | | / | 2 --two->|___|-h-> (define (heron-step x g h) (let ((x/g (make-cell)) (g+x/g (make-cell)) (two (make-cell))) (p:/ x g x/g) (p:+ g x/g g+x/g) ((constant 2) two) (p:/ g+x/g two h)))

  10. (initialize-scheduler) (define x (make-cell)) (define guess (make-cell)) (define better-guess (make-cell)) (heron-step x guess better-guess) (add-content x 2) (add-content guess 1.4) (run) (content better-guess) => 1.4142857142857141

  11. Iteration: a Recursive Machine x good−enuf? answer sqrt−iter g Heron−step sqrt−iter Building is delayed until change on boundary.

  12. (define sqrt-iter (delayed-propagator (lambda (x g answer) (let ((done (make-cell)) (not-done (make-cell)) (x-again (make-cell)) (g-again (make-cell)) (new-g (make-cell)) (new-answer (make-cell))) (good-enuf? g x done) (switch done g answer) (inverter done not-done) (switch not-done new-answer answer) (switch not-done x x-again) (switch not-done g g-again) (heron-step x-again g-again new-g) (sqrt-iter x-again new-g new-answer)))))

  13. It works. (define (sqrt-network x answer) (let ((one (make-cell))) ((constant 1.) one) (sqrt-iter x one answer))) (define x (make-cell)) (define answer (make-cell)) (sqrt-network x answer) (add-content x 2) (run) (content answer) => 1.4142135623730951

  14. How Propagators Work Simulating in SCHEME

  15. A First Cut at Implementation (define (make-cell) (let ((neighbors ’()) (content nothing)) (define (new-neighbor! new-neighbor) (if (not (memq new-neighbor neighbors)) (begin (set! neighbors (cons new-neighbor neighbors)) (alert-propagators new-neighbor)))) (define (add-content increment) (cond ((nothing? increment) ’ok) ((nothing? content) (set! content increment) (alert-propagators neighbors)) (else (if (equal? content increment) ’ok (error "Inconsistency!"))))) (define (me message) (cond ((eq? message ’new-neighbor!) new-neighbor!) ((eq? message ’add-content) add-content) ((eq? message ’content) content) (else (error "Unknown message")))) me))

  16. For Convenience... (define (new-neighbor! cell neighbor) ((cell ’new-neighbor!) neighbor)) (define (add-content cell increment) ((cell ’add-content) increment)) (define (content cell) (cell ’content)) No information (define nothing #(*the-nothing*)) (define (nothing? thing) (eq? thing nothing))

  17. (define (propagator neighbors to-do) (for-each (lambda (cell) (new-neighbor! cell to-do)) (listify neighbors)) (alert-propagators to-do)) (define (handling-nothings f) (lambda args (if (any nothing? args) nothing (apply f args)))) (define (function->propagator-constructor f) (lambda cells (let ((output (car (last-pair cells))) (inputs (except-last-pair cells))) (propagator inputs (lambda () (add-content output (apply f (map content inputs))))))))

  18. Some primitive Propagators (define p:+ (function->propagator-constructor (handling-nothings +))) (define p:- (function->propagator-constructor (handling-nothings -))) (define p:* (function->propagator-constructor (handling-nothings *))) ;;; ... many more ... (define (switch-function control input) (if control input nothing)) (define switch (function->propagator-constructor (handling-nothings switch-function)))

  19. Compound Propagators (define (delayed-propagator builder) (lambda cells (one-shot-prop cells (lambda () (apply builder cells))))) (define (one-shot-prop neighbors action) (let ((done? #f) (neighbors (listify neighbors))) (define (test) (if done? ’ok (if (every nothing? (map content neighbors)) ’ok (begin (set! done? #t) (action))))) (propagator neighbors test)))

  20. Propagators to Multidirectional Constraints (define (c:+ a b c) (p:+ a b c) (p:- c a b) (p:- c b a)) (define (c:* a b c) (p:* a b c) (p:/ c a b) (p:/ c b a)) (define pass-through (function->propagator-constructor (lambda (x) x))) (define (identity-constraint a b) (pass-through a b) (pass-through b a))

  21. Back to electricity! (define ((2-terminal-device vic) t1 t2) (let ((i1 (current t1)) (e1 (potential t1)) (i2 (current t2)) (e2 (potential t2))) (let ((v (make-cell)) (Power (make-cell)) (zero (make-cell))) ((constant 0) zero) (c:+ v e2 e1) (c:+ i1 i2 zero) (c:* i1 v Power) (vic v i1) P))) ;;; For example (define (linear-resistor R) (2-terminal-device (lambda (v i) (c:* i R v))))

  22. Monotonic Information The Power of Merge How to use a barometer, a stopwatch, and a ruler to measure the height of a building.

  23. Sunlight and Similar Triangles: H bldg H bar = S bldg S bar (define (similar-triangles s-bar h-bar s-bld h-bld) (let ((ratio (make-cell))) (c:* s-bar ratio s-bld) (c:* h-bar ratio h-bld))) (define baro-height (make-cell)) (define baro-shadow (make-cell)) (define bldg-height (make-cell)) (define bldg-shadow (make-cell)) (similar-triangles baro-shadow baro-height bldg-shadow bldg-height) (add-content bldg-shadow (make-interval 54.9 55.1)) (add-content baro-height (make-interval 0.3 0.32)) (add-content baro-shadow (make-interval 0.36 0.37)) (run) (content bldg-height) => #(interval 44.514 48.978)

  24. Drop the Barometer! s = g 2 t 2 (define (fall-duration t h) (let ((g (make-cell)) (one-half (make-cell)) (t^2 (make-cell)) (gt^2 (make-cell))) ((constant (make-interval 9.789 9.832)) g) ((constant (make-interval 1/2 1/2)) one-half) (c:square t t^2) (c:* g t^2 gt^2) (c:* one-half gt^2 h))) (define fall-time (make-cell)) (define bldg-height (make-cell)) (fall-duration fall-time bldg-height) (add-content fall-time (make-interval 2.9 3.1)) (run) (content bldg-height) => #(interval 41.163 47.243)

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend