Principles of CMOS VLSI design: a systems perspective
Principles of CMOS VLSI design: a systems perspective
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Analog VLSI and neural systems
Analog VLSI and neural systems
The ring of k-regular sequences
Theoretical Computer Science
Programmable active memories: reconfigurable systems come of age
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the vector space of the automatic reals
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
IEEE Transactions on Computers
| Hi-index | 0.00 |
A digital function maps sequences of binary inputs, into sequences of binary outputs. It is causal when the output at cycle N is a boolean function of the input, from cycles 0 through N. A causal digital function f is characterized byit s truth table, an infinite sequence of bits (FN) which gathers all outputs for all inputs. It is identified to the power series ΣFNzN, with coefficients in the two elements field F2.