A novel fault-tolerant control strategy based on inverse bicausal bond graph model in linear fractional transformation

This article presents the development of a novel fault-tolerant control strategy. For this task, a bicausal bond graph model-based scheme is designed to generate online information to the inverse controller about the faults estimation. Secondly, a new approach is proposed for the fault-tolerant control based on the inverse bicausal bond graph in linear fractional transformation form. However, because of the time delay for fault estimation, the PI controller is used to reduce the error before the fault is estimated. Hence, the required input that compensates the fault is the sum of the control signal delivered by the PI controller and the control signal resulting from the inverse bicausal bond graph for fast fault compensation and for maintaining the control objectives. The novelties of the proposed approach are: (1) to exploit the power concept of the bond graph by feeding the power generated by the fault in the inverse model (2) to suitably combining the inverse bicausal bond graph with the PI feedback controller so that the proposed strategy can compensate for the fault with a very short time delay and stabilize the desired output. Finally, the experimental results illustrate the efficiency of the proposed strategy.

Optimized fault detection using bond graph in linear fractional transformation form

This article deals with the optimal robust fault detection problem using the bond graph in its linear fractional transformation form. Generally, this form of the bond graph allows the generation of two perfectly separate analytical redundancy relations, that are used as residual and threshold. However, the uncertainty calculation method gives overestimated thresholds. This may, for instance, lead to undetectable faults. Therefore, enhancing the robustness of fault detection and isolation algorithms is of utmost importance in designing a bond graph–based fault detection system. The main idea of this article is to develop optimized thresholds to ensure an optimal detection, otherwise this article proposes a method to detect tiny magnitude faults concerning parameter’s uncertainties. This work considers the issue of optimal fault detection as an optimization problem of the gap between the residuals and its threshold. New uncertainty values will be calculated in a way that these estimated parameters ensure the desired optimized gap between residuals and thresholds. These estimated uncertainty values will be used to generate optimized adaptive thresholds. Through these thresholds, we increase the sensitivity of the residuals to tiny magnitude faults, and we ensure an optimal and early detection.

S-box Construction Based on Linear Fractional Transformation and Permutation Function

Substitution boxes (S-box) with strong and secure cryptographic properties are widely used for providing the key property of nonlinearity in block ciphers. This is critical to be resistant to a standard attack including linear and differential cryptanalysis. The ability to create a cryptographically strong S-box depends on its construction technique. This work aims to design and develop a cryptographically strong 8 × 8 S-box for block ciphers. In this work, the construction of the S-box is based on the linear fractional transformation and permutation function. Three steps involved in producing the S-box. In step one, an irreducible polynomial of degree eight is chosen, and all roots of the primitive irreducible polynomial are calculated. In step two, algebraic properties of linear fractional transformation are applied in Galois Field GF (28). Finally, the produced matrix is permuted to add randomness to the S-box. The strength of the S-box is measured by calculating its potency to create confusion. To analyze the security properties of the S-box, some well-known and commonly used algebraic attacks are used. The proposed S-box is analyzed by nonlinearity test, algebraic degree, differential uniformity, and strict avalanche criterion which are the avalanche effect test, completeness test, and strong S-box test. S-box analysis is done before and after the application of the permutation function and the analysis result shows that the S-box with permutation function has reached the optimal properties as a secure S-box.

The depth of continued fraction expansion for some classes of rational functions

For nonzero polynomials [Formula: see text] and [Formula: see text] over a field [Formula: see text], let [Formula: see text] be the depth (length) of the continued fraction expansion for [Formula: see text]. An upper bound on [Formula: see text], for nonzero polynomial [Formula: see text] and rational function [Formula: see text] is obtained. Applying this result, an upper bound on the depth of a linear fractional transformation is also established.