Skip to search formSkip to main contentSkip to account menu

Carry operator

Known as: Operator carry 
The carry operator, symbolized by the ¢ sign, is an abstraction of the operation of determining whether a portion of an adder network generates or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Adder (electronics)Carry (arithmetic)Carry-lookahead adder

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Area Efficient Sparse Modulo 2 n - 3 Adder
  • 2016
  • Corpus ID: 64385091
This paper presents area efficient architecture of modulo 2n - 3 adder. Modulo adder is one of the main components for the… 
2014
2014
Design of High Speed 128 bit Parallel Prefix Adders
In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders and compared with Ripple… 
2014
2014
Comparative Design of 16-Bit Sparse-Tree Rsfq Adder
In this paper, we propse 16-bit sparse tree RSFQ adder (Rapid single flux quantam), kogge-stone adder, carry lookahead adder. In… 
2014
2014
Design and Implementation of Adder for Modulo 2 n +1 Addition
Two architectures for modulo 2 n +1 adders are introduced in this paper. The first one is built around a sparse carry computation… 
2014
2014
An Efficient High Speed Design of 16-Bit Sparse-Tree RSFQ Adder
In this paper, we propse 16-bit sparse tree RSFQ adder (Rapid single flux quantam), kogge-stone adder, carry lookahead adder. In… 
2013
2013
Application and Study of University Teachers Configuration and Evaluation Based on GIOWA Operator
For complexity and uncertainty of objective things and fuzzy awareness of human,the data of evaluating multiple attribute group… 
2013
2013
Design of High Speed Modulo 2n+1 Adder
The two different architectures for adders are introduced in this paper. The first one is built around a sparse carry computation… 
2010
2010
Attractor information for discrete dynamical systems by means of optimal discrete Galerkin bases
2008
2008
A Novel Hybrid Parallel-Prefix Adder Architecture With Efficient Timing-Area Characteristic
Two-operand binary addition is the most widely used arithmetic operation in modern datapath designs. To improve the efficiency of… 
2001
2001
A unified adder design
  • Yuke WangK. Parhi
  • Conference Record of Thirty-Fifth Asilomar…
  • 2001
  • Corpus ID: 20576401
We present a unified framework to compare and optimize various adders in the literature including carry-ripple adders, carry-look… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)