We present an optical shift register that consist out of two serially connected optical flip-flop memories driven by common clock pulses. Each optical flip-flop consists out of two ring lasers sharing a single active element, which makes the optical flip-flops easily cascade with each other. The two cascaded optical flip-flops are controlled by the clock pulses in such a way that the input data...

In this paper we present QR based principal component analysis (PCA) method. Similar to the singular value decomposition (SVD) based PCA method this method is numerically stable. We have carried out analytical comparison as well as numerical comparison (on Matlab software) to investigate the performance (in terms of computational complexity) of our method. The computational complexity of SVD ba...

The Proteus architecture is a highly parallel MIMD, multiple instruction multiple data, machine, optimized for large granularity tasks such as machine vision and image processing. The system can achieve 20 G-flops (80 G-flops peak). It accepts data via multiple serial links at a rate of up to 640 megabytes/second. The system employs hierarchical reconfigurable interconnection network with the h...

The power consumption is critically important in modern VLSI circuits especially for low-power applications. Optimization of power at the logic level is one of the most important tasks to minimize the power. Among logic components, latches and flip-flops are critical to the performance of digital systems. It is important to reduce the power dissipation in both clock distribution networks (CDN) ...

Flip-flops and latches are the most important elements of a design for both a delay and energy point of view. In many electronics design low power consumption is basic need in most of the applications. The energy performance requirements enhance the most designers of next generation system towards the least possible power consumption. The power consumption is basically reduced by scaling of a p...

Interpolation polynomial pn at the Chebyshev nodes cosπj/n (0 ≤ j ≤ n) for smooth functions is known to converge fast as n → ∞. The sequence {pn} is constructed recursively and efficiently in O(n log2 n) flops for each pn by using the FFT, where n is increased geometrically, n = 2i (i = 2, 3, . . . ), until an estimated error is within a given tolerance of ε. This sequence {2j}, however, grows ...

In this article, we determine the explicit toric variety structure of Hilb A1(n) (C n) for n = 4, 5, where A 1 (n) is the special diagonal group of all order 2 elements. Through the toric data of Hilb A1(n) (C n), we obtain certain toric crepant resolutions of C n /A 1 (n), and the different crepant resolutions are connected by flops of n-folds for n = 4, 5.

We investigate D=4, N=1 F theory models realized by type IIB string compactification on toric threefolds. Massless spectra, gauge symmetries, phase transitions associated with divisor contractions and flops, and non-perturbative superpotentials are analyzed using elementary toric methods.

The concept of fuzzy flip-flop was introduced in the middle of 1980’s by Hirota (with his students). The Hirota Lab recognized the essential importance of the concept of a fuzzy extension of a sequential circuit and the notion of fuzzy memory. From this point of view they proposed alternatives for “fuzzifying” digital flip-flops. The starting elementary digital units were the binary J-K flipflo...