Optimizing Ternary Multiplier Design With Fast Ternary Adder
Jongho Yoon, Seunghan Baek, Sunmean Kim, Seokhyeong Kang
Abstract
Existing ternary multiplier designs are difficult to use in ternary systems. Thus, ternary Wallace tree multipliers that reduce the number of transistors by using 4-input ternary adders are proposed to improve the performance of existing ternary multipliers. A ternary carry-select adder is also proposed to reduce the carry propagation delay, used as a carry-chain adder of the Wallace tree. The proposed multipliers are designed with a custom ternary standard cell library synthesized by multi-threshold complementary metal-oxide-semiconductor (CMOS) with a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$28~nm$ </tex-math></inline-formula> process. Power and delay are verified via HSPICE simulation. The proposed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$36\times36$ </tex-math></inline-formula> ternary multiplier shows 79.3% power-delay product improvement over the previous ternary multiplier. The proposed <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$40\times40$ </tex-math></inline-formula> ternary multiplier shows a power-delay product comparable with that of the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$64\times64$ </tex-math></inline-formula> binary multiplier synthesized using Synopsys Design Compiler.