This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
DDA Scaling Graph
January 1968 (vol. 17 no. 1)
pp. 81-84
R. J. Leake, Dept. of Elec. Engrg., University of Notre Dame, Notre Dame, Ind.
H. L. Althaus, Dept. of Elec. Engrg., University of Notre Dame, Notre Dame, Ind.
Finite graph theory is applied to the problem of scaling fixed point Digital Differential Analyzers. The DDA scaling graph is introduced as a representation of the essential scaling information rather than the conventional integrator servo program network. Using the scaling graph, optimal scales are obtained simply, by constructing a maximum distance tree.
Citation:
R. J. Leake, H. L. Althaus, "DDA Scaling Graph," IEEE Transactions on Computers, vol. 17, no. 1, pp. 81-84, Jan. 1968, doi:10.1109/TC.1968.5008876
Usage of this product signifies your acceptance of the Terms of Use.