activity
20182022
most cited45-year CPU evolution: one law and two equations

16 citations · 36 across the 13 of their papers we have counts for

collaborators
Showing cs.ARShow all

10 papers · 1 filter

cs.AR2022★ 1 cited

Ternary and Quaternary CNTFET Full Adders are less efficient than the Binary Ones for Carry-Propagate Adders

Daniel Etiemble

In Carry Propagate Adders, carry propagation is the critical delay. The most efficient scheme is to generate Cout0 (Cin=0) and Cout1(Cin=1) and multiplex the correct output accordi…

cs.AR2022

Two New CNTFET Quaternary Full Adders for Carry-Propagate Adders

Daniel Etiemble

In Carry Propagate Adders, carry propagation is the critical delay. For the 1-digit adders that they use, the most efficient scheme is to generate two intermediate carries: C$_{out…

cs.AR2021

Best CNTFET Ternary Adders?

Daniel Etiemble

The MUX implementation of ternary half adders and full adders using predecessor and successor functions lead to the most efficient efficient implementation using the smallest trans…

cs.AR2020★ 2 cited

Multivalued circuits and Interconnect issues

Daniel Etiemble

Many papers have presented multi-valued circuits in various technologies as a solution to reduce or solve interconnection issues in binary circuits. This assumption is discussed. W…

cs.AR2020★ 1 cited

Comparing quaternary and binary multipliers

Daniel Etiemble

We compare the implementation of a 8x8 bit multiplier with two different implementations of a 4x4 quaternary digit multiplier. Interfacing this binary multiplier with quaternary to…

cs.AR2020★ 1 cited

Best implementations of quaternary adders

Daniel Etiemble

The implementation of a quaternary 1-digit adder composed of a 2-bit binary adder, quaternary to binary decoders and binary to quaternary encoders is compared with several recent i…