A 4.4 ns CMOS 54 × 54-b Multiplier Using Pass-Transistor Multiplexer

Central Res. Lab., Hitachi Ltd., Tokyo
IEEE Journal of Solid-State Circuits (Impact Factor: 3.01). 04/1995; 30(3):251 - 257. DOI: 10.1109/4.364439
Source: IEEE Xplore


A 54×54-b multiplier using pass-transistor multiplexers has
been fabricated by 0.25 μm CMOS technology. To enhance the speed
performance, a new 4-2 compressor and a carry lookahead adder (CLA),
both featuring pass-transistor multiplexers, have been developed. The
new circuits have a speed advantage over conventional CMOS circuits
because the number of critical-path gate stages is minimized due to the
high logic functionality of pass-transistor multiplexers. The active
size of the 54×54-b multiplier is 3.77×3.41 mm. The
multiplication time is 4.4 ns at a 3.5-V power supply

24 Reads
  • Source
    • "Figure 11(a) shows one of the CTD-based representations for constanttime BCS addition. Figures 11(b), (c) and (d) show the binary logic implementations reported in [15]–[17] "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents an algorithm-level interpretation of fast adder structures in binary/multiple-valued logic. The key idea is to employ a unified representation of addition algorithms called Counter Tree Diagrams (CTDs). The use of CTDs makes it possible to describe and analyze addition algorithms at various levels of abstraction. A high-level CTD represents a network of coarse-grained components associated with multiple-valued logic devices, while a low-level CTD represents a network of primitive components directly mapped onto binary logic devices. The level of abstraction in circuit representation can be changed by decomposition of CTDs. We can derive possible variations of adder structures by decomposing a high-level CTD into low-level CTDs. This paper demonstrates the interpretation of redundant arithmetic adders based on CTDs. We first introduce an extension of CTDs to represent possible redundant arithmetic adders with limited carry propagation. Using the extended version of CTDs, we can classify the conventional adder structures including those using emerging devices into three types in a systematic way.
    IEICE Transactions on Electronics 11/2006; E89C(11). DOI:10.1093/ietele/e89-c.11.1645 · 0.28 Impact Factor
  • Source
    • "Proposed Transistors in Encoder 30 26 20 18 MUXs in Selector -3 2 3 2 Critical Path (gate) 6 5 3 3 Delay (ns) 1.06 0.71 0.68 0.64 TABLE 3 COMPARISON OF MULTIPLIER Ohkubo[2] "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we describe a 64×64-bit high performance multiplier based on multiplexer cells which is implemented with pass transistor logic. A multiplexer-select Booth encoders was developed to increase speed and reduce the hardware cost. Moreover, a partitioned method was introduced in the design to save the propagate time of final adder. Realistic simulation using extracted timing parameters from the layout shows that the propagation time of the critical path is 2.82ns at 1.8V on 0.18μm CMOS technology.
    The 6th International Conference On ASIC, 2005 (ASICON 2005), Shanghai, China; 11/2005
  • Source
    • "We therefore decided not to experiment with counters like (7,3), (15,4) and (31,5). However, in recent years (4;2) compressors [3] have become common in parallel multiplier designs, and very efficient implementations for them have been proposed (e.g., [8]). Consequently, we studied the possibility of using (4;2) compressors instead of (3,2) counters in one or more levels of the saturating counter. "
    [Show abstract] [Hide abstract]
    ABSTRACT: We define a new class of parallel counters, Saturating Counters, which provide the exact count of the inputs that are 1 only if this count is below a given threshold. Such counters are useful in, for example, a self-test and repair unit for embedded memories in a system-on-a-chip. We describe this application and present several alternatives for the design of the saturating counter. We then compare the delay and area of the proposed design alternatives. 1.
Show more

Preview (2 Sources)

24 Reads
Available from