Suppose that
This work presents the simulation of a Low density Parity Check (LDPC) coding scheme with
multiuserMulti-Carrier Code Division Multiple Access (MC-CDMA) system over Additive White
Gaussian Noise (AWGN) channel and multipath fading channels. The decoding technique used in
the simulation was iterative decoding since it gives maximum efficiency with ten iterations.
Modulation schemes that used are Phase Shift Keying (BPSK, QPSK and 16 PSK), along with the
Orthogonal Frequency Division Multiplexing (OFDM). A 12 pilot carrier were used in the estimator
to compensate channel effect. The channel model used is Long Term Evolution (LTE) channel with
Technical Specification TS 25.101v2.10 and 5 MHz bandwidth including the chan
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
A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.
The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
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 More