The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A generator modulo 3 (mod 3) is a circuit that generates a residue mod 3 from a binary vector. It is an essential circuit used to construct the encoding and checking circuitry for arithmetic error detecting codes, such as residue codes mod 3 and the 3N code, as well as some residue number system hardware. In this paper, we compare speed and area of varius VLSI implementations of 16-input generators...
This paper presents two adder compressors architectures addressing high-speed and low power. Adder compressors are used to implement arithmetic circuits such as multipliers and digital signal processing units like the Fast Fourier Transform (FTT). To address the objective of high-speed and low power, it is well known that optimization efforts should be applied in all abstraction levels. In this paper...
This paper presents a review of designs for performing arithmetic operations with Quantum-Dot Cellular Automata (QCA). An overview of implementations of adders, multipliers and dividers is provided. Ripple carry, carry lookahead and conditional sum adder designs are compared. The rather surprising result is that with a carefully tailored full adder, ripple carry adders are faster in QCA than carry...
This paper described a 16-bit multiplier. Modified booth algorithm and the Wallace tree were used to reduce the carry save partial product to sum and carry vectors, a carry look-ahead adder was designed to convert the sum and carry vectors to final format. Based on the research of the algorithm and the full-custom back end implementation, this multiplier is expected to achieve high performance, low...
A technology independent generator for CLA adders in BiCMOS and CMOS is presented. It allows full automatic construction of fast parallel adders with arbitrary word length and device sizing. The automatic design cycle comprises the schematics and layout generation, netlist extraction from layout, and verification with pseudo random numbers. Also, the critical path is analyzed and the worst case delay...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.