scholarly journals Transparent Memory Tests Based on the Double Address Sequences

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 894
Author(s):  
Ireneusz Mrozek ◽  
Vyacheslav N. Yarmolik
Keyword(s):  
Control Systems ◽  
Time Complexity ◽  
Computer Applications ◽  
Testing Methods ◽  
Functional Diagnostics ◽  
Automated Control ◽  
New Approach ◽  
Modern Computer ◽  
Network Servers ◽  
Periodic Testing

An important achievement in the functional diagnostics of memory devices is the development and application of so-called transparent testing methods. This is especially important for modern computer systems, such as embedded systems, systems and networks on chips, on-board computer applications, network servers, and automated control systems that require periodic testing of their components. This article analyzes the effectiveness of existing transparent tests based on the use of the properties of data stored in the memory, such as changing data and their symmetry. As a new approach for constructing transparent tests, we propose to use modified address sequences with duplicate addresses to reduce the time complexity of tests and increase their diagnostic abilities.

An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code

2019 ◽  
Vol 17 (10) ◽  
pp. 2050004
Author(s):  
Mikhail Selianinau
Keyword(s):  
Computational Complexity ◽  
Chinese Remainder Theorem ◽  
Computer Applications ◽  
Ancient China ◽  
New Approach ◽  
Low Computational Complexity ◽  
Modern Computer ◽  
Residue Code ◽  
Number Formula ◽  
Efficiency Factors

The Chinese remainder theorem (CRT), which appeared in ancient China, is widely used in many modern computer applications. This paper presents the CRT implementation by using the interval-index characteristic and minimum redundancy residue code. The proposed algorithm does not use large modulo addition operations and provides low computational complexity compared to conventional non-redundant RNS. The efficiency factors of using the minimally redundant RNS increase with the number [Formula: see text] of non-redundant moduli, asymptotically approaching the threshold [Formula: see text]. The new approach presented here will have a significant impact on many non-modular operations in RNS arithmetic, which currently use the CRT.

Technology of Information Safety Control in Automated Control Systems

2005 ◽  
Vol 63 (4) ◽  
pp. 295-304
Author(s):  
Ya. E. Lvovich ◽  
A. S. Dubrovin ◽  
E. A. Rogozin ◽  
V. I. Sumin
Keyword(s):  
Control Systems ◽  
Automated Control ◽  
Safety Control ◽  
Information Safety

The effect of pressure on the compressibility of aluminum alloys

2020 ◽  
pp. 102-107
Keyword(s):  
Mechanical Properties ◽  
Mathematical Model ◽  
Liquid Metal ◽  
Control Systems ◽  
Physical And Mechanical Properties ◽  
Reliable Data ◽  
Output Process ◽  
Automated Control ◽  
Input And Output ◽  
Crystallization Under Pressure

To obtain reliable data on the properties of liquid metal and create automated control systems, the technological process of molding with crystallization under pressure is studied. A mathematical model of the input and output process parameters is developed. It is established that the compressibility of the melt can represent the main controlled parameter influencing on the physical-mechanical properties of the final products. The obtained castings using this technology are not inferior in their physical and mechanical properties to those produced by forging or stamping.

ANALYSIS AND MANAGEMENT OF RISKS, CONCERNED WITH INFORMATION SUPPORT OF HUMAN-MACHINE AUTOMATED CONTROL SYSTEMS, OPERATING IN REAL TIME

2016 ◽  
Vol 34 (2) ◽  
pp. 082-097
Author(s):  
Dmitrij Yu. Uchaev ◽  
◽  
Yurij M. Brumshteyn ◽  
Iskandar M. Azhmukhamedov ◽  
Oksana M. Knyazeva ◽  
...  
Keyword(s):  
Control Systems ◽  
Real Time ◽  
Information Support ◽  
Automated Control

scholarly journals Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System

2021 ◽  
Author(s):  
Mikhail Selianinau
Keyword(s):  
Chinese Remainder Theorem ◽  
Number System ◽  
Residue Number System ◽  
Computer Applications ◽  
Efficient Approach ◽  
Residue Modulo ◽  
Modern Computer ◽  
New Variant ◽  
Residue Number ◽  
Residue Code

AbstractIn this paper, we deal with the critical problem of performing non-modular operations in the Residue Number System (RNS). The Chinese Remainder Theorem (CRT) is widely used in many modern computer applications. Throughout the article, an efficient approach for implementing the CRT algorithm is described. The structure of the rank of an RNS number, a principal positional characteristic of the residue code, is investigated. It is shown that the rank of a number can be represented by a sum of an inexact rank and a two-valued correction to it. We propose a new variant of minimally redundant RNS, which provides low computational complexity for the rank calculation, and its effectiveness analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the excess residue modulo 2, the complexity of the rank calculation goes down from $O\left (k^{2}\right )$ O k 2 to $O\left (k\right )$ O k with respect to required modular addition operations and lookup tables, where k equals the number of non-redundant RNS moduli.

Sign in / Sign up

Export Citation Format

Share Document