Preferred Language
Articles
/
1xYFBYcBVTCNdQwCMC3d
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

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 initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.

Scopus Clarivate Crossref
View Publication
Publication Date
Tue Nov 17 2015
Journal Name
International Journal Of Computer Applications
Categorization of ‘Holy Quran-Tafseer’ using K-Nearest Neighbor Algorithm
...Show More Authors

View Publication
Crossref (1)
Crossref
Publication Date
Mon Jun 05 2023
Journal Name
Journal Of Economics And Administrative Sciences
Selection of variables Affecting Red Blood Cell by Firefly Algorithm
...Show More Authors

Some maps of the chaotic firefly algorithm were selected to select variables for data on blood diseases and blood vessels obtained from Nasiriyah General Hospital where the data were tested and tracking the distribution of Gamma and it was concluded that a Chebyshevmap method is more efficient than a Sinusoidal map method through mean square error criterion.

View Publication Preview PDF
Crossref
Publication Date
Thu Mar 01 2018
Journal Name
Journal Of Engineering
Flexible Genetic Algorithm Based Optimal Power Flow of Power Systems
...Show More Authors

Nowadays, the power plant is changing the power industry from a centralized and vertically integrated form into regional, competitive and functionally separate units. This is done with the future aims of increasing efficiency by better management and better employment of existing equipment and lower price of electricity to all types of customers while retaining a reliable system. This research is aimed to solve the optimal power flow (OPF) problem. The OPF is used to minimize the total generations fuel cost function. Optimal power flow may be single objective or multi objective function. In this thesis, an attempt is made to minimize the objective function with keeping the voltages magnitudes of all load buses, real outp

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Aug 01 2022
Journal Name
Mathematics
Face Recognition Algorithm Based on Fast Computation of Orthogonal Moments
...Show More Authors

Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima

... Show More
View Publication
Scopus (34)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Mon Mar 08 2021
Journal Name
Baghdad Science Journal
Development of six-degree of freedom strapdown terrestrial INS algorithm
...Show More Authors

Many of accurate inertial guided missilc systems need to use more complex mathematical calculations and require a high speed processing to ensure the real-time opreation. This will give rise to the need of developing an effcint

View Publication Preview PDF
Publication Date
Sun Nov 01 2020
Journal Name
Iop Conference Series
Modified PRESENT Encryption algorithm based on new 5D Chaotic system
...Show More Authors

Cryptography is a major concern in communication systems. IoE technology is a new trend of smart systems based on various constrained devices. Lightweight cryptographic algorithms are mainly solved the most security concern of constrained devices and IoE systems. On the other hand, most lightweight algorithms are suffering from the trade-off between complexity and performance. Moreover, the strength of the cryptosystems, including the speed of the algorithm and the complexity of the system against the cryptanalysis. A chaotic system is based on nonlinear dynamic equations that are sensitive to initial conditions and produce high randomness which is a good choice for cryptosystems. In this work, we proposed a new five-dimensional of a chaoti

... Show More
Scopus (13)
Crossref (8)
Scopus Crossref
Publication Date
Sun Apr 01 2018
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Information Hiding using LSB Technique based on Developed PSO Algorithm
...Show More Authors

<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi

... Show More
View Publication
Scopus (19)
Crossref (7)
Scopus Crossref
Publication Date
Sun Mar 01 2009
Journal Name
Al-khwarizmi Engineering Journal
Multidimensional Systolic Arrays of LMS Algorithm Adaptive (FIR) Digital Filters
...Show More Authors

A multidimensional systolic arrays realization of LMS algorithm by a method of mapping regular algorithm onto processor array, are designed. They are based on appropriately selected 1-D systolic array filter that depends on the inner product sum systolic implementation. Various arrays may be derived that exhibit a regular arrangement of the cells (processors) and local interconnection pattern, which are important for VLSI implementation. It reduces latency time and increases the throughput rate in comparison to classical 1-D systolic arrays. The 3-D multilayered array consists of 2-D layers, which are connected with each other only by edges. Such arrays for LMS-based adaptive (FIR) filter may be opposed the fundamental requirements of fa

... Show More
View Publication Preview PDF
Publication Date
Wed Jun 01 2022
Journal Name
Journal Of King Saud University - Computer And Information Sciences
Heuristic initialization of PSO task scheduling algorithm in cloud computing
...Show More Authors

View Publication
Scopus (179)
Crossref (131)
Scopus Clarivate Crossref
Publication Date
Wed May 01 2019
Journal Name
Iop Conference Series: Materials Science And Engineering
Effect of sustainable palm fiber on high strength concrete properties
...Show More Authors
Abstract<p>Date palm fiber is one of the common wastes available in the M. E. countries essentially Iraq. The aim of search to investigate the performance and effects of fiber date palm on the mechanical properties of high strength concrete, this fiber was used in three ratio 2, 4 and 6 % by vol. of concrete at ages of (7, 28, 90) days. Results demonstrated improvement in the compressive strength increased 19.2 %, 23.6%, 24.9 % for 2%, 4%, 6% of fiber respectively at age 28 days. Flexural strength increases 47.6%, 66.2%, 93.8% form (2,4,6) % of fiber respectively at age 28 days. Density increase about 0.41%, 0, 61 % 0.69 % for (2,4,6) % of fiber respectively at age 28. Absorption water decrease </p> ... Show More
View Publication
Crossref (6)
Crossref