The industrial factory is one of the challenging environments for future wireless communication systems, where the goal is to produce products with low cost in short time. This high level of network performance is achieved by distributing massive MIMO that provides indoor networks with joint beamforming that enhances 5G network capacity and user experience as well. Judging from the importance of this topic, this study introduces a new optimization problem concerning the investigation of multi-beam antenna (MBA) coverage possibilities in 5G network for indoor environments, named Base-station Beams Distribution Problem (BBDP). This problem has an extensive number of parameters and constrains including user’s location, required d

   Developing a new adaptive satellite images classification technique, based on a new way of merging between regression line of best fit and new empirical conditions methods. They are supervised methods to recognize different land cover types on Al habbinya region. These methods should be stand on physical ground that represents the reflection of land surface features.      The first method has separated the arid lands and plants. Empirical thresholds of different TM combination bands; TM3, TM4, and TM5 were studied in the second method, to detect and separate water regions (shallow, bottomless, and very bottomless). The Optimum Index Factor (OIF) is computed for these combination bands, which realized

Orthogonal Frequency Division Multiplexing (OFDM) is one of recent years multicarrier modulation used in order to combat the Inter Symbol Interference (ISI) introduced by frequency selective mobile radio channel. The circular extension of the data symbol, commonly referred to as cyclic prefix is one of the key elements in an OFDM transmission scheme. This paper study The influence of the cyclic prefix duration on the BER performance of an OFDM-VCPL (Orthogonal frequency division multiplexing - Variable Cyclic Prefix Length) system and the conventional OFDM system with frame 64-QAM modulation is evaluated by means of computer simulation in a multipath fading channel. The adaptation of CP is done with respect to the delay spread estimation

The robot arm is the most popular robotic form used in industry. Thus, it is crucial to make a system programming which could controlled the movement of each part in the industrial robot to make it works properly. One of the simplest models of the robot arm is EDARM ED-7100 which has a controller to control the movement of the robot arm manually. In this study, the robot controller has been redesigned in order to improve this robot's function. The new controller system used AT89S52 microcontroller which has wire connected to the robot hand. A function has been added with this controller to improve the system of controlling and becomes better than the previous system (only manually). The functions of the new system include three mo

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

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