Fig 8 - uploaded by Shadrokh Samavi
Content may be subject to copyright.
4 Binary tree of two operand adders 

4 Binary tree of two operand adders 

Source publication
Chapter
Full-text available
In Chapters 6 and 7, we covered several speedup methods for adding two operands. Our primary motivation in dealing with multi-operand addition in this chapter is that both multiplication and inner-product computation can be reduced to adding a set of numbers, namely, the partial products or the component products. The main idea used is that of defe...

Similar publications

Preprint
Full-text available
Despite the recent success in many applications, the high computational requirements of vision transformers limit their use in resource-constrained settings. While many existing methods improve the quadratic complexity of attention, in most vision transformers, self-attention is not the major computation bottleneck, e.g., more than 80% of the compu...
Article
Full-text available
In order to accurately assess the health status of distribution terminals, it is necessary to solve the problems of strong subjectivity and high redundancy of the index membership results in the evaluation index system. According to the empirical score given by experts, the cloud model is used to describe the actual index state and the level bounda...
Article
Full-text available
Curve reconstruction is a fundamental task in many visual computing applications. In this paper, a data-driven approach for curve reconstruction is proposed. We present an inception layered deep neural network structure, capable of learning simultaneously the number of control points and their positions in order to reconstruct the curve. To train t...
Article
Full-text available
Unsupervised feature learning via auto-encoders results in low-dimensional representations in latent space that capture the patterns of input data. The auto-encoders with robust regularization learn qualified features that are less sensitive to small perturbations of inputs. However, the previous robust autoencoders highly depend on pre-defined str...
Article
Full-text available
Problems of motion on graphs are addressed in this paper. These problems represent an abstraction for a variety of tasks which goal is to construct a spatial-temporal plan for a set of entities that move in a certain environment and need to reach giv-en goal positions. Specifically, the quality (length) of solutions of these problems is studied. Ex...