Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Etiemble, Daniel"'
Autor:
Etiemble, Daniel
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 according to Cin. For any radix, the carry output is always 0/1. We present t
Externí odkaz:
http://arxiv.org/abs/2207.04839
Autor:
Etiemble, Daniel
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$_{out0}$ ($C_{in}$=0) and $C_{out1}$($C_{in}$=1). Then multiplex them to pr
Externí odkaz:
http://arxiv.org/abs/2207.01401
Autor:
Etiemble, Daniel
We compare N*N quaternary digit and 2N*2N bit CNTFET multipliers in terms of Worst case delay, Chip area, Power and Power Delay Product (PDP) for N=1, N=2 and N=4. Both multipliers use Wallace reduction trees. HSpice simulations with 32-nm CNTFET par
Externí odkaz:
http://arxiv.org/abs/2206.03252
Autor:
Etiemble, Daniel
As it is pretty sure that Moore's law will end some day, questioning about the post-Moore era is more than interesting. Similarly, looking for new computing paradigms that could provide solutions is important. Revisiting the history of digital electr
Externí odkaz:
http://arxiv.org/abs/2206.03201
Autor:
Etiemble, Daniel
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 transistor count. These designs are compared with the binary implementation
Externí odkaz:
http://arxiv.org/abs/2101.01516
Autor:
Etiemble, Daniel
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. While 4-valued signaling could divide by two the number of interconnect
Externí odkaz:
http://arxiv.org/abs/2012.01267
Autor:
Etiemble, Daniel
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 binary decoders and binary to quaternary encoders leads to a 4x4 mult
Externí odkaz:
http://arxiv.org/abs/2005.02678
Autor:
Etiemble, Daniel
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 implementations of quaternary adders. This simple implementation outper
Externí odkaz:
http://arxiv.org/abs/2005.02206
Autor:
Etiemble, Daniel
While many papers have proposed implementations of ternary adders and ternary multipliers, no comparisons have generally been done with the corresponding binary ones. We compare the implementations of binary and ternary adders and multipliers with th
Externí odkaz:
http://arxiv.org/abs/1908.07299
Autor:
Etiemble, Daniel
A demonstration that e=2.718 rounded to 3 is the best radix for computation is disproved. The MOSFET-like CNTFET technology is used to compare inverters, Nand, adders, multipliers, D Flip-Flops and SRAM cells. The transistor count ratio between terna
Externí odkaz:
http://arxiv.org/abs/1908.06841