Design of (3,2) and (4,2) CNTFET Ternary Counters for Multipliers - Laboratoire Interdisciplinaire des Sciences du Numérique Accéder directement au contenu
Article Dans Une Revue Asian Journal of Research in Computer Science Année : 2023

Design of (3,2) and (4,2) CNTFET Ternary Counters for Multipliers

Ramzi Jaber
  • Fonction : Auteur

Résumé

The reduction trees of combinational multipliers are widely applying counters. To be able to compare the ternary and the binary approaches, Nanotube Field-Effect Transistor (CNTFET) ternary (3,2) and ternary (4,2) counters have been designed. The ternary (4,2) counter is compared with the binary (7,3) counter as both compute approximately the same amount of information. The binary counter is more efficient. However, comparing counters is not enough: in the Wallace reduction tree of the ternary multiplier, there are two times more lines to reduce compared to the binary one, as a 1-trit multiplier generates both product and carry terms. Comparing the Wallace tree of an 8*8-trit multiplier and a 12*12-bit binary one also shows that the binary implementation is the most efficient.

Dates et versions

hal-04465608 , version 1 (19-02-2024)

Identifiants

Citer

Daniel Etiemble, Ramzi Jaber. Design of (3,2) and (4,2) CNTFET Ternary Counters for Multipliers. Asian Journal of Research in Computer Science, 2023, 16 (3), pp.103-118. ⟨10.9734/ajrcos/2023/v16i3349⟩. ⟨hal-04465608⟩
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More