The complexity of Boolean functions
The complexity of Boolean functions
Variants of an Improved Carry Look-Ahead Adder
IEEE Transactions on Computers
Area-Time Optimal Adder Design
IEEE Transactions on Computers
On the power of neural networks for solving hard problems
Journal of Complexity
Depth-Size Tradeoffs for Neural Computation
IEEE Transactions on Computers - Special issue on artificial neural networks
IEEE Transactions on Computers - Special issue on computer arithmetic
A Spanning Tree Carry Lookahead Adder
IEEE Transactions on Computers - Special issue on computer arithmetic
ELM-A Fast Addition Algorithm Discovered by a Program
IEEE Transactions on Computers
Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
SIAM Journal on Discrete Mathematics
Circuit complexity and neural networks
Circuit complexity and neural networks
On the Size of Weights for Threshold Gates
SIAM Journal on Discrete Mathematics
Neural Computation
2-1 Addition and Related Arithmetic Operations with Threshold Logic
IEEE Transactions on Computers
On the circuit complexity of sigmoid feedforward neural networks
Neural Networks
Journal of the ACM (JACM)
Two Operand Binary Adders with Threshold Logic
IEEE Transactions on Computers
Threshold logic circuit design of parallel adders using resonant tunneling devices
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special issue on the 11th international symposium on system-level synthesis and design (ISSS'98)
Handbook of Neural Computation
Handbook of Neural Computation
IEEE Transactions on Computers
Computing with Almost Optimal Size Neural Networks
Advances in Neural Information Processing Systems 5, [NIPS Conference]
Area-time efficient addition in charge based technology
DAC '81 Proceedings of the 18th Design Automation Conference
A Regular Layout for Parallel Adders
IEEE Transactions on Computers
Limitations on Carry Lookahead Networks
IEEE Transactions on Computers
A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
IEEE Transactions on Computers
IBM Journal of Research and Development
VLSI implementations of threshold logic-a comprehensive survey
IEEE Transactions on Neural Networks
Using kolmogorov inspired gates for low power nanoelectronics
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Ultra low-power neural inspired addition: when serial might outperform parallel architectures
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Hi-index | 0.00 |
This paper presents a comprehensive review of the constructive results obtained over the last tvelwe years for the addition of two binary numbers using threshold logic gates. Such solutions are intended for very practical VLSI implementations. A comparison of nine different solutions is included.