Approximate ripple carry adders (RCAs) and carry lookahead adders (CLAs) are presented which are compared with accurate RCAs and CLAs for performing a 32-bit addition. The accurate and approximate RCAs and CLAs are implemented using a 32/28nm CMOS process. Approximations ranging from 4to 20-bits are considered for the less significant adder bit positions. The simulation results show that approx...

For estimating delay parameters appearing in the CDMA (Code Division Multiple Access) model, several authors have proposed subspace-based solutions. Unfortunately, these methods , for example the eigenvector-based multiple signal clas-siication (MUSIC) method may yield poor results in noisy conditions. In this paper, we introduce subspace type delay estimation algorithms which are more eecient ...

One of the central problems in the eld of knowledge discovery is the development of good measures of in terestingness of discovered patterns Such measures of interestingness are divided into objectivemeasures those that depend only on the structure of a pat tern and the underlying data used in the discovery process and the subjective measures those that also depend on the class of users who exa...

Adding examples of the majority class to the training set can have a detrimental eeect on the learner's behavior: noisy or otherwise unreliable examples from the majority class can overwhelm the minority class. The paper discusses criteria to evaluate the utility of clas-siiers induced from such imbalanced training sets, gives explanation of the poor behavior of some learners under these circum...

Abstract -This paper presents an architecture for a high-speed carry select adder with very long bit lengths utilizing a conflict-free bypass scheme. The proposed scheme has almost half the number of transistors and is faster than a conventional carry select adder. A comparative study is also made between the proposed adder and a Manchester carry chain adder which shows that the proposed scheme...