Richards controller
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The Richards controller is a method of implementing a finite-state machine using simple integrated circuits and combinational logic. The method was named after its inventor, Charles L. Richards. It allows for easier design of complex finite-state machines than the traditional techniques of state diagrams, state-transition tables and Boolean algebra offer. Using Richards's technique, it becomes easier to implement finite-state machines with hundreds or even thousands of states. Because of the Richards controller's ability to scale to use many states easily, it can be used in many practical applications.
The Richards controller is a method of implementing a finite-state machine using simple integrated circuits and combinational logic. The method was named after its inventor, Charles L. Richards. It allows for easier design of complex finite-state machines than the traditional techniques of state diagrams, state-transition tables and Boolean algebra offer. Using Richards's technique, it becomes easier to implement finite-state machines with hundreds or even thousands of states. Because of the Richards controller's ability to scale to use many states easily, it can be used in many practical applications. ==References== Richards, Charles L.; An easy way to design complex program controllers. Electronics, 1 (February 1973): 107–113. Wakerly, John F.; Digital Design – 3rd Edition. Upper Saddle River, NJ: Prentice-Hall Inc. 2001.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1325488122 under CC BY-SA 4.0; modifications have been made.