METHODS FOR ENSURING THE STABILITY OF THE ELECTRONIC COMPONENT BASE TO SINGLE EVENTS BY REDUNDANCY

The article discusses algorithmic methods for ensuring the fault tolerance of the electronic component base (ECB). The protection methods used in regular and irregular structures are described. The essence of Hamming code algorithms, composite code, error correction and detection codes is revealed. The advantages and disadvantages of using arithmetic residual code, the method of redundancy at the level of program code fragments, are shown.

Generalised Theory on the Effects of Sampling Frequency on GNSS Code Tracking

Synchronisation of the received Pseudorandom (PRN) code and its locally generated replica is fundamental when estimating user position in Global Navigation Satellite System (GNSS) receivers. It has been observed through experiments that user position accuracy decreases if sampling frequency is an integer multiple of the nominal code rate. This paper provides an accuracy analysis based on the number of samples and the residual code phase of each code chip. The outcomes reveal that the distribution of residual code phases in the code phase range [0, 1/ns), where ns is the number of samples per code chip, is the root cause of accuracy degradation, rather than the ratio between sampling frequency and nominal code rate. Doppler frequencies, coherent integration periods, front-end filter bandwidths and received Carrier to Noise ratios (C/N0) also influence receiver accuracy. Also provided are a sampling frequency selection guideline and new proposed estimates of the correlation output and the Delay Locked Loop (DLL) tracking error, which can be applied to precisely model GNSS receiver baseband signal processing.

A partial evaluator for the untyped lambda-calculus

This article describes theoretical and practical aspects of an implemented self-applicable partial evaluator for the untyped lambda-calculus with constants and a fixed point operator. To the best of our knowledge, it is the first partial evaluator that is simultaneously higher-order, non-trivial, and self-applicable.Partial evaluation produces aresidual programfrom a source program and some of its input data. When given the remaining input data the residual program yields the same result that the source program would when given all its input data. Our partial evaluator produces a residual lambda-expression given a source lambda-expression and the values of some of its free variables. By self-application, the partial evaluator can be used to compile and to generate stand-alone compilers from a denotational or interpretive specification of a programming language.An essential component in our self-applicable partial evaluator is the use of explicitbinding time information.We use this to annotate the source program, marking asresidualthe parts for which residual code is to be generated and marking aseliminablethe parts that can be evaluated using only the data that is known during partial evaluation. We give a simple criterion,well-annotatedness,that can be used to check that the partial evaluator can handle the annotated higher-order programs without committing errors.Our partial evaluator is simple, is implemented in a side-effect free subset of Scheme, and has been used to compile and to generate compilers and a compiler generator. In this article we examine two machine-generated compilers and find that their structures are surprisingly natural.