An analog-to-digital conversion circuit using a stack of tunnel diodes each constructed from the same material
Bibliographic record
Abstract
This thesis describes a mathematical-graphical analysis and some analog computer simulation studies that were carried out to determine the feasibility of a proposed circuit to be used for analog-to-digital conversion. The circuit analysed and simulated contains a stack of tunnel diodes which are constructed from the same type of semiconductor material. The switching characteristics of this circuit are controlled primarily by the ratios and the values of the capacitances which shunt the individual tunnel diodes and to a lesser extent by the interdiode capacitances. This is revealed in a study of the effects of different circuit parameter variation A two tunnel diode stack circuit (two bits of information capacity) is analysed by studying the nature of the switching trajectories in the proximity of the singular points of the equations describing -the circuit operation. Three different modes of operation, each of which differs in the manner in which the 11 state is reached, are revealed for this circuit. The analysis indicates a feature of the circuit which can be used to determine the final state of the circuit before steady state conditions have been reached. An extension of the two tunnel diode stack circuit to one containing three tunnel diodes yielded eight stable and accessible states. This indicates that the circuit proposed will be able to realize 2[superscript n] states with n tunnel diodes. It is shown that different interdiode capacitance connections will facilitate the achievement of this result.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".