Memory-Based Logic Control for Embedded Systems

Implementation of logic control algorithms in embedded systems is limited by space and response time. Use of a single look-up table (LUT) for multiple-output Boolean function is almost always excluded due to the LUT size. The paper deals with implementation in a form of cascade of smaller LUTs with response time given by a series of few look-ups. Cascade length and memory required to store LUTs can be varied and it is shown that an optimal trade-offs can be reached. Changes in logic control can be implemented easily by re-loading data into LUTs. The presented method is thus useful for logic control in embedded systems or in microcontroller software.

[1]  Tsutomu Sasao,et al.  A Parallel Branching Program Machine for Sequential Circuits: Implementation and Evaluation , 2010, IEICE Trans. Inf. Syst..

[2]  Tadeusz Luba,et al.  Decomposition of Boolean Functions Specified by Cubes , 2003, J. Multiple Valued Log. Soft Comput..

[3]  Munehiro Matsuura,et al.  A method to decompose multiple-output logic functions , 2004, Proceedings. 41st Design Automation Conference, 2004..

[4]  Václav Dvorák,et al.  On Lookup Table Cascade-Based Realizations of Arbiters , 2008, 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools.

[5]  Rolf Drechsler,et al.  Binary Decision Diagrams - Theory and Implementation , 1998 .

[6]  Tsutomu Sasao A cascade realization of multiple-output function for reconfigurable hardware , 2001 .

[7]  Tsutomu Sasao,et al.  A Comparison of Architectures for Various Decision Diagram Machines , 2010, 2010 40th IEEE International Symposium on Multiple-Valued Logic.