The traditional technique of generating MPSK signals is basically to use IQ modulator that involves analog processing like multiplication and addition where inaccuracies may exist and would lead to imbalance problems that affects the output modulated signal and hence the overall performance of the system. In this paper, a simple method is presented for generating the MPSK using logic circuits that basically generated M-carrier signals each carrier of different equally spaced phase shift. Then these carriers are time multiplexed, according to the data symbols, into the output modulated signal.

Cognitive radios have the potential to greatly improve spectral efficiency in wireless networks. Cognitive radios are considered lower priority or secondary users of spectrum allocated to a primary user. Their fundamental requirement is to avoid interference to potential primary users in their vicinity. Spectrum sensing has been identified as a key enabling functionality to ensure that cognitive radios would not interfere with primary users, by reliably detecting primary user signals. In addition, reliable sensing creates spectrum opportunities for capacity increase of cognitive networks. One of the key challenges in spectrum sensing is the robust detection of primary signals in highly negative signal-to-noise regimes (SNR).In this paper ,

The interests toward developing accurate automatic face emotion recognition methodologies are growing vastly, and it is still one of an ever growing research field in the region of computer vision, artificial intelligent and automation. However, there is a challenge to build an automated system which equals human ability to recognize facial emotion because of the lack of an effective facial feature descriptor and the difficulty of choosing proper classification method. In this paper, a geometric based feature vector has been proposed. For the classification purpose, three different types of classification methods are tested: statistical, artificial neural network (NN) and Support Vector Machine (SVM). A modified K-Means clustering algorithm

    Text categorization refers to the process of grouping text or documents into classes or categories according to their content. Text categorization process consists of three phases which are: preprocessing, feature extraction and classification. In comparison to the English language, just few studies have been done to categorize and classify the Arabic language. For a variety of applications, such as text classification and clustering, Arabic text representation is a difficult task because Arabic language is noted for its richness, diversity, and complicated morphology. This paper presents a comprehensive analysis and a comparison for researchers in the last five years based on the dataset, year, algorithms and the accuracy th

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.

 Abstract 

The vegetative filter strips (VFS) are a useful tool used for reducing the movement of sediment and pesticide in therivers. The filter strip’s soil can help in reducing the runoff volume by infiltration. However, the characteristics of VFS (i.e., length) are not recently identified depending on the estimation of VFS modeling performance. The aim of this research is to study these characteristics and determine acorrelation between filter strip length and percent reduction (trapping efficiency) for sediment, water, and pesticide. Two proposed pesticides(one has organic carbon sorption coefficient, K_oc, of 147 L/kg which is more moveable than XXXX, and another one

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.