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
In this paper the concepts of weakly (resp., closure, strongly) Perfect Mappings are defined and the important relationships are studied: (a) Comparison between deferent forms of perfect mappings. (b) Relationship between compositions of deferent forms of perfect mappings. (c) Investigate relationships between deferent forms of perfect mappings and their graphs mappings.
Let M be an R-module, where R is commutative ring with unity. In this paper we study the behavior of strongly hollow and quasi hollow submodule in the class of strongly comultiplication modules. Beside this we give the relationships between strongly hollow and quasi hollow submodules with V-coprime, coprime, bi-hollow submodules.
We introduce in this paper some new concepts in soft topological spaces such as soft simply separated, soft simply disjoint, soft simply division, soft simply limit point and we define soft simply connected spaces, and we presented soft simply Paracompact spaces and studying some of its properties in soft topological spaces. In addition to introduce a new types of functions known as soft simply
The study aimed to prepare quick response codes to learn some of the technical skills of the second graders in the Faculty of Physical Education and Sports Sciences. The experimental method was used in the design of the experimental and control experimental and control groups. The research sample was represented by second-graders in the College of Physical Education and Sports Sciences / University of Baghdad, and by lot, the second division (a) was chosen to represent the experimental group that applied the inverse method using the QR code, and the second division (g) to represent the control group and applied the traditional method. (10) Students per group. After the tribal tests, his main experiment was carried out for 10 weeks with one
... Show MoreThe study aimed to prepare quick response codes to learn some of the technical skills of the second graders in the Faculty of Physical Education and Sports Sciences. The experimental method was used in the design of the experimental and control experimental and control groups. The research sample was represented by second-graders in the College of Physical Education and Sports Sciences / University of Baghdad, and by lot, the second division (a) was chosen to represent the experimental group that applied the inverse method using the QR code, and the second division (g) to represent the control group and applied the traditional method. (10) Students per group. After the tribal tests, his main experiment was carried out for 10 weeks with one
... Show MoreIn this paper, we study some cases of a common fixed point theorem for classes of firmly nonexpansive and generalized nonexpansive maps. In addition, we establish that the Picard-Mann iteration is faster than Noor iteration and we used Noor iteration to find the solution of delay differential equation.
In a connected graph , the distance function between each pair of two vertices from a set vertex is the shortest distance between them and the vertex degree denoted by is the number of edges which are incident to the vertex The Schultz and modified Schultz polynomials of are have defined as:
respectively, where the summations are taken over all unordered pairs of distinct vertices in and is the distance between and in The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.