Abstract-Periodic nonuniform sampling has been considered in literature as an effective approach to reduce the sampling rate far below the Nyquist rate for sparse spectrum multiband signals. In the presence of non-ideality the sampling parameters play an important role on the quality of reconstructed signal. Also the average sampling ratio is directly dependent on the sampling parameters that they should be chosen for a minimum rate and complexity. In this paper we consider the effect of sampling parameters on the reconstruction error and the sampling ratio and suggest feasible approaches for achieving an optimal sampling and reconstruction.

This article uses a specific hybrid evolutionary algorithmto solve the series parallel redundancy optimization problem which is in a fuzzy framework. Reliability optimization provides a means to help the reliability engineer achieve such a goal. Most methods of reliability optimization assume that systems have redundancy components in series and /or parallel systems and that alternative designs are available. Optimization concentrates on optimal allocation of redundancy components and optimalselection of alternative designs to meet system requirements. A fuzzy simulation-based evolutionary algorithm is then employed to solve these kinds of fuzzy programming with fuzzy goal and fuzzy constraints. Finally, numerical examples are also given.

We focus on the multiple persistent faults analysis in this paper to fill existing gaps in its application in a variety of scenarios. Our major contributions are twofold. First, we propose a novel technique to apply persistent fault apply in the multiple persistent faults setting that decreases the number of survived keys and the required data. We demonstrate that by utilizing 1509 and 1448 ciphertexts, the number of survived keys after performing persistent fault analysis on AES in the presence of eight and sixteen faults can be reduced to only 29 candidates, whereas the best known attacks need 2008 and 1643 ciphertexts, respectively, with a time complexity of 250. Second, we develop generalized frameworks for retrieving the key in the ciphertext-only model. Our methods for both performing persistent fault attacks and key-recovery processes are highly flexible and provide a general trade-off between the number of required ciphertexts and the time complexity. To break AES with 16 persistent faults in the Sbox, our experiments show that the number of required ciphertexts can be decreased to 477 while the attack is still practical with respect to the time complexity. To confirm the accuracy of our methods, we performed several simulations as well as experimental validations on the ARM Cortex-M4 microcontroller with electromagnetic fault injection on AES and LED, which are two well-known block ciphers to validate the types of faults and the distribution of the number of faults in practice.