This work presents a comparison between the Convolutional Encoding CE, Parallel Turbo code and Low density Parity Check (LDPC) coding schemes with a MultiUser Single Output MUSO Multi-Carrier Code Division Multiple Access (MC-CDMA) system over multipath fading channels. The decoding technique used in the simulation was iterative decoding since it gives maximum efficiency at higher iterations. Modulation schemes used is Quadrature Amplitude Modulation QAM. An 8 pilot carrier were
used to compensate channel effect with Least Square Estimation method. The channel model used is Long Term Evolution (LTE) channel with Technical Specification TS 25.101v2.10 and 5 MHz bandwidth bandwidth including the channels of indoor to outdoor/ pedestrian channel and Vehicular channel. The results showed that the performance of the proposed system was better when the LDPC was used as a coding technique
The most popular medium that being used by people on the internet nowadays is video streaming. Nevertheless, streaming a video consumes much of the internet traffics. The massive quantity of internet usage goes for video streaming that disburses nearly 70% of the internet. Some constraints of interactive media might be detached; such as augmented bandwidth usage and lateness. The need for real-time transmission of video streaming while live leads to employing of Fog computing technologies which is an intermediary layer between the cloud and end user. The latter technology has been introduced to alleviate those problems by providing high real-time response and computational resources near to the
... Show MoreGiven a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.
Th goal of the pr s nt p p r is to obt in some differ tial sub rdin tion an sup r dination the rems for univalent functions related b differential operator Also, we discussed some sandwich-type results.
The research aims to clarify the response of the GDP to the M1 shock. It includes access to the results using standard methods, where the standard model was built according to quarterly data using the program STATA 17. According to the joint integration model ARDL, the research found a long-term equilibrium positive for the relationship between GDP and the money supply in Iraq, as the change in the money supply by a certain percentage will lead to a change in GDP by about 71% of that percentage. In the event of a shock in the Iraqi economy, the impact of the M1 will differ from what it was before the shock, as the shock will increase its effectiveness towards GDP by about 10% more than before the shock. At the same time, the relationship
... Show MoreIn this paper we obtain some statistical approximation results for a general class of maxproduct operators including the paused linear positive operators.
Every finite dimensional normed algebra is isomorphic to the finite direct product of or , it is also proved these algebras are ultrasemiprime algebras. In this paper, the ultrasemiprime proof of the finite direct product of and is generalized to the finite direct product of any ultrasemiprime algebras.
This paper aims to verify the existence of relationships between product innovation and the reputation of the organization. The study problem is that the State Organization for Marketing of Oil (SOMO) system is inflexible in terms of marketing procedures and needs innovative, unconventional methods in innovating its products and improving performance. The reputation of the organization. The importance of the study lies in that it is an attempt to raise the interest of SOMO in its approach to the research variables in order to enhance its competitive position in the future and improve the marketing business environment, which contributes to enhancing the reputation of the organization by product innovation. The study sample
... Show MoreFinding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith
... Show MoreHeuristic approaches are traditionally applied to find the optimal size and optimal location of Flexible AC Transmission Systems (FACTS) devices in power systems. Genetic Algorithm (GA) technique has been applied to solve power engineering optimization problems giving better results than classical methods. This paper shows the application of GA for optimal sizing and allocation of a Static Compensator (STATCOM) in a power system. STATCOM devices used to increase transmission systems capacity and enhance voltage stability by regulate the voltages at its terminal by controlling the amount of reactive power injected into or absorbed from the power system. IEEE 5-bus standard system is used as an example to illustrate the te
... Show MoreEnergy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit
... Show More