In this paper, we present multiple bit error correction coding scheme based on extended Hamming product code combined with type II HARQ using shared resources for on chip interconnect. The shared resources reduce the hardware complexity of the encoder and decoder compared to the existing three stages iterative decoding method for on chip interconnects. The proposed method of decoding achieves 20% and 28% reduction in area and power consumption respectively, with only small increase in decoder delay compared to the existing three stage iterative decoding scheme for multiple bit error correction. The proposed code also achieves excellent improvement in residual flit error rate and up to 58% of total power consumption compared to the other err

Power-electronic converters are essential elements for the effective interconnection of renewable energy sources to the power grid, as well as to include energy storage units, vehicle charging stations, microgrids, etc. Converter models that provide an accurate representation of their wideband operation and interconnection with other active and passive grid components and systems are necessary for reliable steady state and transient analyses during normal or abnormal grid operating conditions. This paper introduces two Laplace domain-based approaches to model buck and boost DC-DC converters for electromagnetic transient studies. The first approach is an analytical one, where the converter is represented by a two-port admittance model via mo

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever

In the present article, we implement the new iterative method proposed by Daftardar-Gejji and Jafari (NIM) [V. Daftardar-Gejji, H. Jafari, An iterative method for solving nonlinear functional equations, J. Math. Anal. Appl. 316 (2006) 753-763] to solve two problems; the first one is the problem of spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic, and the other one is the problem of the prey and predator. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian Decomposition Method (ADM), does not require to calculate Lagrange multiplier a

Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a

This paper is attempt to study the nonlinear second order delay multi-value problems. We want to say that the properties of such kind of problems are the same as the properties of those with out delay just more technically involved. Our results discuss several known properties, introduce some notations and definitions. We also give an approximate solution to the coined problems using the Galerkin's method.

    This paper devoted to the analysis of regular singular initial value problems for ordinary differential equations with a singularity of the first kind , we propose semi - analytic technique using two point osculatory interpolation to construct polynomial solution, and discussion behavior of the solution in the neighborhood of the regular singular points and its numerical approximation, two examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.

 The aim of this paper is to find a new method for solving a system of linear initial value problems of ordinary differential equation using approximation technique by two-point osculatory  interpolation with the fit equal numbers of derivatives at the end points of an interval [0, 1] and compared the results with conventional methods and is shown to be that seems to converge faster and more accurately than the conventional methods.