This paper describes a number of new interleaving strategies based on the golden section. The new interleavers are called golden relative prime interleavers, golden interleavers, and dithered golden interleavers. The latter two approaches involve sorting a real-valued vector derived from the golden section. Random and so-called “spread” interleavers are also considered. Turbo-code performance results are presented and compared for the various interleaving strategies. Of the interleavers considered, the dithered golden interleaver typically provides the best performance, especially for low code rates and large block sizes. The golden relative prime interleaver is shown to work surprisingly well for high puncture rates. These interleavers have excellent spreading properties in general and are thus useful for many applications other than Turbo-codes.
This study seeks to identify the possibility of achieving the property of faithful representation of accounting information and measure it by using the standard approach based on mathematical and statistical equations by comparing two financial periods before and after the application of (IFRS-15) Revenue from contracts with customers, during the period. (2014-2018), for the financial statements of the mixed joint stock companies listed on the Iraq Stock Exchange, which is one of the main pillars of the economic structure of the country, as a joint investment between the state and the private sector, and has importance in many aspects, including support for projects of public companies, S Absorption and employment of labor, as well as ra
... Show Morein this work many amide polymers were prepared according to the modification reaction of polyacryloyl chloride or poluacrulic acid with different primary amines to mesuringninizing hormone were investgaited prior tq surgery in 10 postmenopaisal women with benign and 10 postmenopausal women with maliganant healthy
This dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermor
... Show MoreIn this paper, some commonly used hierarchical cluster techniques have been compared. A comparison was made between the agglomerative hierarchical clustering technique and the k-means technique, which includes the k-mean technique, the variant K-means technique, and the bisecting K-means, although the hierarchical cluster technique is considered to be one of the best clustering methods. It has a limited usage due to the time complexity. The results, which are calculated based on the analysis of the characteristics of the cluster algorithms and the nature of the data, showed that the bisecting K-means technique is the best compared to the rest of the other methods used.
Suppose R has been an identity-preserving commutative ring, and suppose V has been a legitimate submodule of R-module W. A submodule V has been J-Prime Occasionally as well as occasionally based on what’s needed, it has been acceptable: x ∈ V + J(W) according to some of that r ∈ R, x ∈ W and J(W) an interpretation of the Jacobson radical of W, which x ∈ V or r ∈ [V: W] = {s ∈ R; sW ⊆ V}. To that end, we investigate the notion of J-Prime submodules and characterize some of the attributes of has been classification of submodules.
In this research, a new application has been developed for games by using the generalization of the separation axioms in topology, in particular regular, Sg-regular and SSg- regular spaces. The games under study consist of two players and the victory of the second player depends on the strategy and choice of the first player. Many regularity, Sg, SSg regularity theorems have been proven using this type of game, and many results and illustrative examples have been presented
The current study aims to develop a proposed educational program based on augmented reality (AR) technology, in addition to assessing its effectiveness in developing research and historical imagination skills of the Humanities Track's female students at the secondary stage, as well as assessing the correlative and predictive relationships between the amount of growth for the two dependent variables. To achieve this, a secondary school in the city of Makkah Al-Mukarramah was chosen, and an available random sample of (30) female students from the study population was selected. The quasi-experimental approach was followed by this study, particularly one group design. In addition, two tools were used to collect study data, namely: a test of
... Show Moremajor goal of the next-generation wireless communication systems is the development of a reliable high-speed wireless communication system that supports high user mobility. They must focus on increasing the link throughput and the network capacity. In this paper a novel, spectral efficient system is proposed for generating and transmitting twodimensional (2-D) orthogonal frequency division multiplexing (OFDM) symbols through 2- D inter-symbol interference (ISI) channel. Instead of conventional data mapping techniques, discrete finite Radon transform (FRAT) is used as a data mapping technique due to the increased orthogonality offered. As a result, the proposed structure gives a significant improvement in bit error rate (BER) performance. Th
... Show MoreIn digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th
... Show More