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.
<span lang="EN-US">The fundamental of a downlink massive multiple-input multiple-output (MIMO) energy- issue efficiency strategy is known as minimum mean squared error (MMSE) implementation degrades the performance of a downlink massive MIMO energy-efficiency scheme, so some improvements are adding for this precoding scheme to improve its workthat is called our proposal solution as a proposed improved MMSE precoder (PIMP). The energy efficiency (EE) study has also taken into mind drastically lowering radiated power while maintaining high throughput and minimizing interference issues. We further find the tradeoff between spectral efficiency (SE) and EE although they coincide at the beginning but later their interests become con
... Show MoreThe present study explores numerically the energy storage and energy regeneration during Melting and Solidification processes in Phase Change Materials (PCM) used in Latent Heat Thermal Energy Storage (LHTES) systems. Transient two-dimensional (2-D) conduction heat transfer equations with phase change have been solved utilizing the Explicit Finite Difference Method (FDM) and Grid Generation technique. A Fortran computer program was built to solve the problem. The study included four different Paraffin's. The effects of container geometrical shape, which included cylindrical and square sections of the same volume and heat transfer area, the container volume or mass of PCM, variation of mass flow rate of heat transfer fluid (HTF), and temp
... Show MoreCredit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show MoreRA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2
Optimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol
Recently, detecting dynamic patterns for growing communities in social networks have attracted significant attention. The objective of dynamic community detection is to analyze and identify clusters in complex networks that change over time. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of dynamic community detection. Although current evolutionary algorithms for identifying community structure can traverse extensive areas of partition space, they often become stuck in local minima. In addition, limited studies have addressed this issue by integrating local search strategies with evolutionary algorithms for community identification. This paper in
... Show MoreIn this paper, a microcontroller-based electronic circuit have been designed and implemented for dental curing system using 8-bit MCS-51 microcontroller. Also a new control card is designed while considering advantages of microcontroller systems the time of curing was controlled automatically by preset values which were input from a push-button switch. An ignition based on PWM technique was used to reduce the high starting current needed for the halogen lamp. This paper and through the test result will show a good performance of the proposed system.
