Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.
This research describes the design & implementation of frequency synthesizer using single loop Phase lock loop with the following specifications: Frequency range (1.5 – 2.75) GHz,Step size (1 MHz), Switching time 36.4 µs, & phase noise @10 kHz = -92dBc & spurious -100 dBc
The development in I.C. technology provide the simplicity in the design of frequency synthesizer because it implements the phase frequency detector(PFD) , prescalar & reference divider in single chip. Therefore our system consists of a single chip contains (low phase noise PFD, charge pump, prescalar & reference divider), voltage controlled oscillator , loop filter & reference oscillator. The single chip
... Show MoreThe present work provides to treat real oily saline wastewater released from drilling oil sites by the use of electrocoagulation technique. Aluminum tubes were utilized as electrodes in a concentric manner to minimize the concentrations of 113400 mg TDS/L, 65623 mg TSS/L, and the ions of 477 mg HCO3/L, 102000 mg Cl/L and 5600 mg Ca/L presented in real oily wastewater under the effect of the operational parameters (the applied current and reaction time) by making use of the central composite rotatable design. The final concentrations of TDS, TSS, HCO3, Cl, and Ca that obtained were 93555 ppm (17.50%), 11011 ppm (83.22%), 189ppm (60.38%), 80000ppm (22%), and 4200 ppm (25%), respectively, under the optimum values of the operational parameters
... Show MoreThe research aims to form a clear theoretical philosophy and perceptions about strategic Entrepreneurship through the relationship between high Involvement management practices, the basis in creating that leadership and high-performance work systems as a support tool in achieving them according to the proposals (Hitt et al, 2011), in an attempt to generalize theoretical philosophy and put forward how to apply it within The Iraqi environment, and on this basis the problem of the current research was launched to bridge the knowledge gap between the previous proposals and the possibility of their application, aiming to identify the practices of high Involvement management and the possibility of high-performance work systems and thei
... Show MoreIn this work, the pseudoparabolic problem of the fourth order is investigated to identify the time -dependent potential term under periodic conditions, namely, the integral condition and overdetermination condition. The existence and uniqueness of the solution to the inverse problem are provided. The proposed method involves discretizing the pseudoparabolic equation by using a finite difference scheme, and an iterative optimization algorithm to resolve the inverse problem which views as a nonlinear least-square minimization. The optimization algorithm aims to minimize the difference between the numerical computing solution and the measured data. Tikhonov’s regularization method is also applied to gain stable results. Two
... Show MoreThe prediction process of time series for some time-related phenomena, in particular, the autoregressive integrated moving average(ARIMA) models is one of the important topics in the theory of time series analysis in the applied statistics. Perhaps its importance lies in the basic stages in analyzing of the structure or modeling and the conditions that must be provided in the stochastic process. This paper deals with two methods of predicting the first was a special case of autoregressive integrated moving average which is ARIMA (0,1,1) if the value of the parameter equal to zero, then it is called Random Walk model, the second was the exponential weighted moving average (EWMA). It was implemented in the data of the monthly traff
... Show MoreIn this paper we prove the boundedness of the solutions and their derivatives of the second order ordinary differential equation x ?+f(x) x ?+g(x)=u(t), under certain conditions on f,g and u. Our results are generalization of those given in [1].
This article aims to determine the time-dependent heat coefficient together with the temperature solution for a type of semi-linear time-fractional inverse source problem by applying a method based on the finite difference scheme and Tikhonov regularization. An unconditionally stable implicit finite difference scheme is used as a direct (forward) solver. While by the MATLAB routine lsqnonlin from the optimization toolbox, the inverse problem is reformulated as nonlinear least square minimization and solved efficiently. Since the problem is generally incorrect or ill-posed that means any error inclusion in the input data will produce a large error in the output data. Therefore, the Tikhonov regularization technique is applie
... Show MoreIn this research we have been studied the 3rd order spherical aberration for an optical system consisted of obscured circular aperture with non central circular obscuration through the calculation of point spread function (P.S.F) in presence of the obscuration in the center and comparing the obtained results with that results of moving obscuration far away from the center, where the results showed significant improvement for(P.S.F) value. The study was done of different obscurities ratios in addition to the different 3rd order spherical aberration values (W40=0.25 ,0.5 ,0.75 ,1 ).
conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.