Low-Density-Parity-Check (LDPC) codes are a cornerstone for achieving robust error correction capabilities in 5G New Radio applications, significantly improving the reliability of data transmission across noisy and unpredictable wireless channels. Since an evaluation and discussion of the performance with channel coding is significantly absent in two-dimensional Index Modulation (IM)-Differential Chaos Shift Keying (DCSK) schemes. Therefore, in this study, the 5G new radio LDPC codes based generalized joint subcarrier-time index modulation DCSK system (5G NR-LDPC-GJSTIM-DCSK) is proposed, where 5G NR-LDPC codes are used as channel coding. The aim is to improve the system’s performance specifically across AWGN (additive white gauss

Loud noise can be extremely harmful to the auditory system as well as to human health. Noise pollution is primarily caused by traffic noise. The study's goal was to determine how various vehicle types and speeds affected the amount of noise generated by traffic. The two factors were investigated at seven different arterial streets throughout Kirkuk city to measure the noise levels. The measurements were performed during peak hours to compare the result with WHO standards for noise specification. Traffic volume and vehicle speed are shown to be the key elements that determine an increase in noise level. 

The paper present design of a control structure that enables integration of a Kinematic neural controller for trajectory tracking of a nonholonomic differential two wheeled mobile robot, then  proposes a Kinematic neural controller to direct a National Instrument mobile robot (NI Mobile Robot). The controller is to make the actual velocity of the wheeled mobile robot close the required velocity by guarantees that the trajectory tracking mean squire error converges at minimum tracking error. The proposed tracking control system consists of two layers; The first layer is a multi-layer perceptron neural network system that controls the mobile robot to track the required path , The second layer is an optimization layer ,which is impleme

Optimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received s

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

RA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over