返回
Two operand binary adders with Threshold Logic
DOI:10.1109/12.817389.png)
摘要
En 中文
The central topic of this paper is the implementation of binary adders with Threshold Logic using a new methodology that introduces two innovations: the use of the input and output carries of each bit for obtaining all the sum bits and a modification of the classic Carry Lookahead adder technique that allows us to obtain the expressions of the generation and propagation carries in a more appropriate way for Threshold Logic. In this way, it has been possible to systematize the process of design of a binary adder with Threshold Logic relating all its important parameters: number of bits of the operands, depth, size, maximum fan-in, and maximum weight. The results obtained are an improvement on those published to date and are summarized as follows: Depth 2 adder: s = 2n, omega(max) = 2(n), f(max) = 2n + 1. Depth 3 adder: s = 4n - 2[n/\root n\], omega(max) = 2([n/\root n\]), f(max) = 2[n/\root n\] + 1. Depth d adder (asymptotic behavior): s = O(n), omega(max) = O(2(root n)), f(max) = O((e-1)root n). If the weights are bounded by omega(max):n(max) = O(log(d-1) u(max)), d(min) = O(log n/log(log omega(max))).
Keyword:
Threshold Logic
computer arithmetic
binary adders
logic design
threshold gate
neural networks
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
1.1W
机构
暂无机构信息
引用论文
Solid‐Phase synthesis and stability of triple‐helical peptides incorporating native collagen sequences
Biopolymers
IF0
没有更多内容

