Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are similar in accuracy to the past work results, which is built by using MATLAB program. Using VHDL is necessary in FPGAs for building hardware of the root finding algorithm in lower cost and time. MATLAB program is used only for displaying the input and output discrete signals of tested channels.
in this paper, we study and investigate a simple donor-acceptor model for charge transfer formation using a quantum transition theory. The transfer parameters which enhanced the charge transfer and the rate of the charge transfer have been calculated. Then, we study the net charge transfer through interface of Cu/F8 contact devices and evaluate all transfer coefficients. The charge transfer rate of transfer processes is found to be dominated in the low orientation free energy and increased a little in decreased potential at interface comparison to the high potential at interface. The increased transition energy results in increasing the orientation of Cu to F8. The transfer in the system was more active when the system has large driving for
... Show MoreThis study includes using green or biosynthesis-friendly technology, which is effective in terms of low cost and low time and energy to prepare V2O5NPs nanoparticles from vanadium sulfate VSO4.H2O using aqueous extract of Punica Granatum at a concentration of 0.1M and with a basic medium PH= 8-12. The V2O5NPs nanoparticles were diagnosed using several techniques, such as FT-IR, UV-visible with energy gap Eg = 3.734eV, and the X-Ray diffraction XRD was calculated using the Debye Scherrer equation. It was discovered to be 34.39nm, Scanning Electron Microscope (SEM), Transmission Electron Microscopy TEM. The size, structure, and composition of synthetic V2O5
... Show MoreThis study relates to synthesis of bentonite-supported iron/copper nanoparticles through the biosynthesis method using eucalyptus plant leaf extract, which were then named E-Fe/Cu@B-NPs. The synthesised E-Fe/Cu@B-NPs were examined by a set of experiments involving a heterogeneous Fenton-like process that removed direct blue 15 (DB15) dye from wastewater. The resultant E-Fe/Cu@B-NPs were characterised by scanning electron microscopy, Brunauer–Emmet–Teller analysis, zeta potential analysis, Fourier transform infrared spectroscopy and atomic force microscopy. The operating parameters in batch experiments were optimised using Box–Behnken design. These parameters were pH, hydrogen peroxide (H2O2
... Show MoreThis study investigated the detection and mineralization of organic pollutants in the Mesopotamian marshes.
Over the course of seven days of treatment, a batch bioreactor system and natural microbial communities from marsh sediments were able to break down contaminants in a remarkable way.
Water samples collected from five distinct marsh locations revea
Metasurface polarizers are essential optical components in modern integrated optics and play a vital role in many optical applications including Quantum Key Distribution systems in quantum cryptography. However, inverse design of metasurface polarizers with high efficiency depends on the proper prediction of structural dimensions based on required optical response. Deep learning neural networks can efficiently help in the inverse design process, minimizing both time and simulation resources requirements, while better results can be achieved compared to traditional optimization methods. Hereby, utilizing the COMSOL Multiphysics Surrogate model and deep neural networks to design a metasurface grating structure with high extinction rat
... Show MoreIn this research we been estimated the survival function for data suffer from the disturbances and confusion of Iraq Household Socio-Economic Survey: IHSES II 2012 , to data from a five-year age groups follow the distribution of the Generalized Gamma: GG. It had been used two methods for the purposes of estimating and fitting which is the way the Principle of Maximizing Entropy: POME, and method of booting to nonparametric smoothing function for Kernel, to overcome the mathematical problems plaguing integrals contained in this distribution in particular of the integration of the incomplete gamma function, along with the use of traditional way in which is the Maximum Likelihood: ML. Where the comparison on the basis of the method of the Cen
... Show MoreData hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image
... Show MoreIn this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .