Search

The ancient Vedic mathematics is well known for quicker handy multiplications but its recognition as an integrated circuit core against existing hardware multipliers is not established. As optimized hardware implementation of binary multiplier is one of the prominent unsolved problems in computer architecture, this paper proposes efficient Urdhava Tiryakbhyam Vedic multiplier architecture and compares it with the set of hierarchical multiplication algorithms which generate multiplication result in a single clock cycle. Two innovative algorithms are proposed here, one with a compact structure and another for faster execution. Also, its optimized transistor level layout is designed and implemented. To maintain homogeneity for comparison, all the algorithms are programmed on a common HDL language platform and analyzed with the same tool and technology. Final results indicate that the proposed architecture delivers 15.5% less power delay product (PDP) compared to closest competitor algorithm. [ABSTRACT FROM AUTHOR]

Passive synthesis of fractional driving-point immittance function is one of the most important research topics in fractional circuits. The synthesis method for a class of fractional driving-point immittance function is proposed in this paper. Firstly, the immittance function of passive fractional circuit is transformed to multivariable positive-real function by proper variable substitution. Secondly, to synthesize the function, except one variable, other high-order variables are transformed to the combination of products of different one-order variables by introducing new variables. Thirdly, synthesize the new function by traditional method. At last, substitute elements inversely twice and the final circuit for fractional driving-point immittance function can be achieved. The method is verified by giving synthesis demonstration. [ABSTRACT FROM AUTHOR]

When a CDMA signal is passed through an RF transmitter, nonlinear elements cause spectral regrowth which result in reduction of spectral efficiency. CDMA signal has a pseudo noise nature; hence its mathematical treatment is too complex to analysis. In this paper, first it will be shown how to simplify the complex mathematics of CDMA signal. Then, a deterministic signal replaces the CDMA signal and the system response to both of them is calculated. In this paper, for the first time, ACPR is explicitly calculated for both the CDMA and deterministic signals. ACPR is calculated in terms of the nonlinear system coefficients and input power, and therefore, can be used in design objectives. In addition, it will be shown that if input power of the deterministic signal is multiplied by $\sqrt{20}$ (i.e., correction factor), ACPR error of these kinds of signals in -55 dBc is less than 2.2% for the system nonlinearity orders up to 13. This correction factor is obtained by both theoretical and simulation methods. [ABSTRACT FROM AUTHOR]

An emulated digital CNN-UM (CASTLE) architecture was published few years ago.1 Different emulated digital CNN-UM architectures are analyzed in the paper. These new modified architectures are optimized according to the silicon area, operating speed or dissipated power. A reconfigurable arithmetic core will also be shown in the paper, by which solution of the neighborhood size can be changed. An advanced CASTLE with pipe-lining is presented. The operation frequency is increased by using this solution in approximately 10 times. [ABSTRACT FROM AUTHOR]

In mobile systems, some nodes link dynamically through different channels at different times. The π-calculus is a popular process algebra for specification and verification of systems with dynamic linking and synchronous, rendezvous message passing communication of component processes. Dynamic linking can be elegantly specified in it by sending channels to be used for further communication as messages. However, in order to be able to use the π-calculus, one has to learn its process-algebraic concepts and laws. On the other hand, specification and verification in the Temporal Logic of Actions (TLA) is almost entirely based on ordinary mathematics (i.e., first-order predicate logic, set theory, etc.). Therefore, this paper proposes a TLA approach to the specification and verification of systems with synchronous communication and dynamic linking similar to the π-calculus one. It is presented with help of a TLA specification and verification of a parametric mobile network handover procedure which has previously been specified with the π-calculus. In fact, TLA+ is used as the specification language, thus achieving completely formal specifications. [ABSTRACT FROM AUTHOR]

An algorithm is proposed in this paper that finds exact exclusive-or sum-of-products of an arbitrary function, provided the number of product terms is less than eight. If the number of product terms in the minimal expression is more than seven, then the algorithm detects it and heuristically returns near-optimal expressions. The algorithm is time and space efficient even for functions with many input variables. [ABSTRACT FROM AUTHOR]

We are watching the news on TV: the change of the background tells us when a new story begins. A glance at the clock and we can clearly see what time it is. These are special spatial-temporal episodes caused by ballistic eye movements and sudden optical changes. In this paper we give a useful definition for generalized sudden global change events, present its main properties and give an algorithm to recognize them in any video-flow. The proposed algorithm is implemented on a standard Cellular Nonlinear Network Universal Machine (CNN-UM). The processing time of the detection is roughly one millisecond on the ACE4k CNN-UM chip in the Aladdin environment. Therefore it can serve as a common function in any online, real-time spatial-temporal algorithm. The sudden global change event can be used to define the instant when the time-dependent part of that algorithm, e.g., homotopy, has to be initialized. The first steps of the multimedia processing, such as searching for key frames — for compression, browsing or indexing — can be helped by the proposed algorithm as a robust video shot change detection method. [ABSTRACT FROM AUTHOR]