DDA Scaling Graph

R. J. Leake, H. L. Althaus · IEEE Transactions on Computers · 1968

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.

Read the paper · More papers on PaperTik