Bibliographic record
Abstract
This paper presents three novel designs for a signed-digit half adder based on ternary logic implemented with carbon nanotube FETs (CNFETs). In the past, multiple-valued logic (MVL) has mostly been associated with some form of multi-threshold CMOS and, in certain cases, by relying on depletion-mode MOSFETs which are largely absent from current processes. However, CNFETs, which have emerged as a promising avenue for VLSI evolution beyond CMOS, offer an appealing alternative for MVL since it is possible to adjust their threshold which is inversely proportional to the nanotube diameter. For this reason, they have received considerable research attention as an enabling technology for ternary logic and other forms of MVL. Here, we use ternary logic to represent redundant binary digits. The three proposed designs adopt three different approaches which together form a cohesive framework for ternary logic design in general. For the first two designs, the operands first pass through a ternary decoder so that the subsequent core logic can be designed with ordinary binary gates, with the results then passing through ternary encoders to return to the ternary domain. The difference between the two is the binary encoding used for the core logic. In the first design, a one-of-three (one-hot) encoding is used, such that 3 lines are required per operand. In the second design, a binary encoding on 2 lines is employed. A third design is proposed which avoids the binary core and works directly with the ternary signals. All three designs achieve significant savings in number of transistors compared to similar reported efforts. All designs are fully active and avoid both resistive loads and transmission gates. Design principles are emphasized.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".