Study of the characteristics of error detection with Hamming codes, the consideration of which is appropriate for the synthesis of automatic devices with fault detection
Bibliographic record
Abstract
The peculiarities of using Hamming codes in the synthesis of automatic devices with fault detection are investigated. Such devices imply the organization of embedded control schemes to detect occurring faults indirectly based on the results of calculating the values of operational functions. Various methods can be used by the implementation of embedded control schemes. In this study, the focus is shifted to the issues of synthesizing embedded control schemes using the method of logical signal correction (the method of logical complementation). This method involves transforming all or part of the signals coming from the diagnostic object in the embedded control scheme in such a way that the code word generated after the signal correction block belongs to a preselected block uniform code. The study considers the application of classical Hamming codes for these purposes. The use of the method of logical signal correction allows obtaining the values of the informational symbols of the code words of the Hamming code directly as values at the operational outputs of the diagnostic object, while the check symbols are obtained by correcting signals from some of the operational outputs. However, it is also possible to use transformations of operational function values to obtain informational symbols, which expands the number of ways to organize the embedded control scheme. The article presents previously unknown absolute and relative error detection metrics in the code words of the Hamming code, taking into account their categorization based on types (according to the number of distortions in zero and one bits) and multiplicities. The experimental results with test combinational circuits confirm the effectiveness of using the method of logical signal correction with computation control using Hamming codes for synthesizing embedded control schemes. The results obtained in this study extend the theory of synthesis for self-checking digital devices and computational systems and can be practically applied in improving the methods for synthesizing automatic devices with fault detection.
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.001 | 0.011 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".