Time-Component Complexity of Two Approaches to Multioperand Binary Addition
Abstract
- Time-Component Complexity of Two Approaches to Multioperand Binary Addition
Recommendations
An Efficient Hardware-Based Higher Radix Floating Point MAC Design
This article proposes an effective way of implementing a multiply accumulate circuit (MAC) for high-speed floating point arithmetic operations. The real-world applications related to digital signal processing and the like demand high-performance ...
Interlock Collapsing ALU's
A device capable of executing interlocked fixed point arithmetic logic unit (ALU) instructions in parallel with other instructions causing the execution interlock is presented. The device incorporates the design of a 3-1 ALU and can execute two's ...
A binary floating-point adder with the signed-digit number arithmetic
CEA'07: Proceedings of the 2007 annual Conference on International Conference on Computer Engineering and ApplicationsIn a conventional binary floating-point number arithmetic system, two's complement number representation is often used to perform addition/subtraction in a floating-point adder. Since the significand of an addition operand is usually expressed as a sign-...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
IEEE Computer Society
United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0