Abstract

A method for computing the scales needed for programming a digital differential analyzer (DDA) is developed. DDA program (interconnection) maps containing integrators and servos are considered. The scales must satisfy ``equilibrium,'' ``topological,'' and ``boundary'' constraints. These constraints are shown to be equivalent to a set of linear inequalities. Linear programming techniques are used to find both feasible and ``optimal'' scales. The use of linear programming eliminates the need for the usual trial-and-error scaling techniques and makes the scheme amenable to programming on a general-purpose digital computer.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.