{"title":"探索数字电路中的软错误率降低算法行为","authors":"C. Menaka, Nidhi Saraswat, Shri Bhagwan","doi":"10.1109/ICOCWC60930.2024.10470803","DOIUrl":null,"url":null,"abstract":"Smooth mistakes in virtual circuits, which talk over with inadvertent modifications to saved bits or transmitted records because of temporary faults caused by external radiation, continue to be a trouble that ought to be tackled for the green functioning of virtual circuits. This technical abstract offers an overview of a research paper that examines the effectiveness of diverse gentle-blunders fee reduction algorithms in digital circuits. The research paper starts by introducing three techniques for mitigating tender error costs in virtual circuits: duplication, scrubbing, and blunders-correction codes. The paper then provides an evaluation of the behavior of several present smooth-mistakes charge reduction algorithms, including the Triple-creation Code, the DSP Compressor Code, the DFT feet Fault Codes, and the Alpha Detector-based Code. Through simulations and modeling, the paper evaluates the efficiency of those algorithms and compares their performances in opposition to each other and in opposition to baseline values. The paper reports that the Triple-creation Code, DSP Compressor Codes, and Alpha Detector-based total Code are able to present a powerful softerror charge reduction of up to 4 instances of the baseline values in digital circuits. There was also determined to be a sizable development in the robustness of virtual circuits when such algorithms are carried out.","PeriodicalId":518901,"journal":{"name":"2024 International Conference on Optimization Computing and Wireless Communication (ICOCWC)","volume":"44 27","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Exploring the Behavior of Soft-Error Rate Reduction Algorithms in Digital Circuits\",\"authors\":\"C. Menaka, Nidhi Saraswat, Shri Bhagwan\",\"doi\":\"10.1109/ICOCWC60930.2024.10470803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Smooth mistakes in virtual circuits, which talk over with inadvertent modifications to saved bits or transmitted records because of temporary faults caused by external radiation, continue to be a trouble that ought to be tackled for the green functioning of virtual circuits. This technical abstract offers an overview of a research paper that examines the effectiveness of diverse gentle-blunders fee reduction algorithms in digital circuits. The research paper starts by introducing three techniques for mitigating tender error costs in virtual circuits: duplication, scrubbing, and blunders-correction codes. The paper then provides an evaluation of the behavior of several present smooth-mistakes charge reduction algorithms, including the Triple-creation Code, the DSP Compressor Code, the DFT feet Fault Codes, and the Alpha Detector-based Code. Through simulations and modeling, the paper evaluates the efficiency of those algorithms and compares their performances in opposition to each other and in opposition to baseline values. The paper reports that the Triple-creation Code, DSP Compressor Codes, and Alpha Detector-based total Code are able to present a powerful softerror charge reduction of up to 4 instances of the baseline values in digital circuits. There was also determined to be a sizable development in the robustness of virtual circuits when such algorithms are carried out.\",\"PeriodicalId\":518901,\"journal\":{\"name\":\"2024 International Conference on Optimization Computing and Wireless Communication (ICOCWC)\",\"volume\":\"44 27\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2024 International Conference on Optimization Computing and Wireless Communication (ICOCWC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOCWC60930.2024.10470803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2024 International Conference on Optimization Computing and Wireless Communication (ICOCWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOCWC60930.2024.10470803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Exploring the Behavior of Soft-Error Rate Reduction Algorithms in Digital Circuits
Smooth mistakes in virtual circuits, which talk over with inadvertent modifications to saved bits or transmitted records because of temporary faults caused by external radiation, continue to be a trouble that ought to be tackled for the green functioning of virtual circuits. This technical abstract offers an overview of a research paper that examines the effectiveness of diverse gentle-blunders fee reduction algorithms in digital circuits. The research paper starts by introducing three techniques for mitigating tender error costs in virtual circuits: duplication, scrubbing, and blunders-correction codes. The paper then provides an evaluation of the behavior of several present smooth-mistakes charge reduction algorithms, including the Triple-creation Code, the DSP Compressor Code, the DFT feet Fault Codes, and the Alpha Detector-based Code. Through simulations and modeling, the paper evaluates the efficiency of those algorithms and compares their performances in opposition to each other and in opposition to baseline values. The paper reports that the Triple-creation Code, DSP Compressor Codes, and Alpha Detector-based total Code are able to present a powerful softerror charge reduction of up to 4 instances of the baseline values in digital circuits. There was also determined to be a sizable development in the robustness of virtual circuits when such algorithms are carried out.