مواقع التدريسيينجامعة الكوفة
علي كاظم جابر الجنابي
أستاذ

علي كاظم جابر الجنابي

English Version
0بحث منشور
0محاضرة
0اهتمام بحثي

الملف الشخصي

بكالوريوس هندسة كهربائية / قسم الهندسة الكهروميكانيكية / الجامعة التكنولوجية/ 1994.
ماجستير هندسة اتصالات / قسم الهندسة الكهربائية / الجامعة التكنولوجية/ 2000.
دكتوراه هندسة اتصالات ومعلومات / كلية الرشيد للهندسة والعلوم / الجامعة التكنولوجية/ 2007.
محاضر في الكلية التقنية / نجف / قسم الأتصالات 2000-2003.
تدريسي في قسم الهندسة الكهربائية / كلية الهندسة / جامعة الكوفة 2006-2016.
مدير المكتب الاستشاري الهندسي 2013-2015.
تدريسي في قسم الهندسة الالكترونية والاتصالات/ كلية الهندسة / جامعة الكوفة 2016-2017
رئيس قسم الهندسة الالكترونية والاتصالات/ كلية الهندسة / جامعة الكوفة 2017-

الاهتمامات البحثية

4

البحوث المنشورة

11
2023

Scalable image compression algorithms with small and fixed-size memory

الباحثونAli Kadhim Al-Janabi، Yahya J. Harbi Mohammed Falih Hassan
المجلةSignal, Image and Video Processing
مختصر البحث

The SPIHT image compression algorithm is characterized by low computational complexity, good performance, and the production of a quality scalable bitstream that can be decoded at several bit-rates with image quality enhancement as more bits are received. However, it suffers from the enormous computer memory consumption due to utilizing linked lists of size of about 2–3 times the image size. In addition, it does not exploit the multi-resolution feature of the wavelet transform to produce a resolution scalable bitstream by which the image can be decoded at numerous resolutions (sizes). The Single List SPIHT (SLS) algorithm resolved the high memory problem of SPIHT by using only one list of fixed size equals to just 1/4 the image size, and state marker bits with an average of 2.25 bits/pixel. This paper introduces two new algorithms that are based on SLS. Like SLS, the first algorithm also produces a quality scalable bitstream. However, it has lower time complexity and better performance than SLS. The second algorithm, which is the major contribution of the work, upgrades the first algorithm to produce a bitstream that is both quality and resolution scalable. As such, the algorithm is very suitable for the modern heterogeneous nature of the internet users to satisfy their different capabilities and desires in terms of image quality and resolution.

2022

An efficient and Highly Scalable Listless SPIHT Image Compression Framework

الباحثونAli Kadhim Al-Janabi، Hassan K Al-Musawi, Yahya J Harbi
المجلةJOURNAL OF APPLIED RESEARCH AND TECHNOLOGY
مختصر البحث

The set partitioning in hierarchical trees is a powerful image compression algorithm. It has reasonable complexity and produces a scalable bit-stream rate. Unfortunately, SPIHT fails to explore the multi-resolution nature of the wavelet transform as the output bit-stream doesn't support resolution scalability. Moreover it requires huge memory and has complex memory management as it depends on utilizing lists with memory of about 2.5 the image size. This paper proposes three related algorithms. The first one modifies SPIHT to reduce its complexity and improve its efficiency especially at low rates. The second is the main contribution of the paper. It provides a simultaneous solution to the memory and scalability problems of SPIHT. Memory is reduced by utilizing status bits of average 2.5 bits per pixel instead of the lists. Resolution scalability is maintained by encoding the resolution levels in increasing order within each coding pass. Another important attribute of our algorithm is that it has very little increase in complexity in comparison with the original SPIHT algorithm. In contrast, the existing solutions have much more complexity, and/or more memory resources. The third has slightly lower complexity and memory than the second but at the same time, it has slightly lower performance.

2021

Iterative Interference Cancellation for Multi-Carrier Modulation in MIMO-DWT Downlink Transmission

الباحثونYahya Harbi، Ali K. Aljanabi, Hayder Almusa, Marwa Chafii, and Alister Burr
المجلةThe Journal of Telecommunications and the Digital Economy
مختصر البحث

The Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM) scheme represents the dominant radio interface for broadband multicarrier communication systems. However, with insufficient Cyclic Prefixes (CP), Inter-Symbol Interference (ISI) and Inter-Carrier Interference (ICI) occur due to the time-varying multipath channel. This means that the performance of the system will be degraded. In this paper, we investigate the interference problem for a MIMO Discrete Wavelet Transform (MIMO-DWT) system under the effect of the downlink LTE channel. A Low-Density Parity-Check (LDPC) decoder is used to estimate the decoded signal. The proposed iterative algorithm uses the estimated decoded signal to compute the components required for ICI/ISI interference reduction. In this paper, Iterative Interference Cancellation (IIC) is employed to mitigate the effects of interference that contaminates the received signal due to multiple antenna transmission and a multipath channel. An equalizer with minimum mean square error is considered. We compare the performance of our proposed algorithm with the traditional MIMO-OFDM scheme in terms of bit error probability under insufficient CP. Simulation results verify that significant improvements are achieved by using IIC and MIMO-IIC for both systems.

2020

Plasmonic logic gates based on dielectric-metal-dielectric design with two optical communication bands

الباحثونHassan K.Al-Musawi، Ali K. Al-Janabi, Salam A.W. Al-abassi, Noor Al-Huda A.Abusiba, Noor Al-Huda Q.Al-Fatlawi
المجلةOptik, Elsevier
مختصر البحث

This paper presents a novel structure to simulate and achieve the all-optical plasmonic logic gates. We show how the use of dielectric-metal-dielectric (DMD) plasmonic waveguides with four nanorings and three slots can realize the complete family of logic gates; including NOT, OR, AND, NOT-OR, NAND, exclusive-OR, and exclusive-NOR using the constructive and destructive optical interferences between a control signal and input signal(s). We have adopted two optical wavelengths, namely 900 nm and 1330 nm, which are used for optical communication systems. Performance has been measured using the transmission level which registered more than 100 % for all of the seven gates of both wavelengths except NOT and NOT-OR logic gates. In addition, high extinction ratio of more than 20 dB in NOT and exclusive-NOR gates has been achieved using our novel structure.

2019

Efficient and simple scalable image compression algorithms

الباحثونAli Kadhim Al-Janabi
المجلة Elsevier, Ain Shams Engineering Journal
مختصر البحث

Most wavelet-based scalable image compression algorithms are optimized for performance only, i.e., they try to produce a compressed bit-stream that gives the best image quality for the selected bit-rate. Unfortunately, the optimization of the coding method may result in a bit-stream that cannot be rearranged easily to support resolution scalability. This paper proposes two algorithms. The first algorithm produces a rate scalable bit-stream that is optimized for performance and scalability. That is, it has good performance and at the same time it produces bit-stream that can be easily rearranged to become highly (rate and resolution) scalable. To this end, the algorithm combines the low complexity and rate scalability features of the set partitioning coding approach, and it exploits the resolution scalability characteristics of the block-based systems. The second algorithm upgrades the first algorithm to produce a highly scalable bit-stream by only arranging and identifying the different resolutions within the bit-stream.

2019

Design and Construction Smart Home System using RFID, FOSS and Mobile Application

الباحثونMaysoon Hashim Ismaail، Yahya Ali and Ali Kadhim Al-Janabi
المجلةInternational Journal of Signal System Control and Engineering Application
مختصر البحث

Home based system has been designed and construction using mobile phones. The platforms having Android to automate a Wi-Fi module interfaced with micro controller that controls smart devices. This study presents an integrated smart home to improve the quality of human’s life by proficiency a flexible and comfortable. There for an intelligent controlling system is design and construction for many home appliances through the smartphone Android application. Several required components installed and connected for the design such as temperature sensor, fire sensor, smoke detection sensor and relays with other devices. This means worked together via. controller to regulator the home system which programmed by using Proteus Software. All the results obtained and monitored using smart mobile phone.

2016

Efficient Scalable Image Compression Algorithms with Low Memory and Complexity

الباحثونAli Kadhim Al-Janabi، Abdulkareem Abdulrahman Kadhim, College of Information Engineering, Al-Nahrain University.
المجلةInternational Journal of Computer Applications (IJCA), Volume 136 – No.9, pp. 12-19, February 2016
مختصر البحث

The set partitioning embedded block (SPECK) image compression algorithm has excellent performance, low computational complexity, and produces a rate scalable compressed bitstream that can be decoded efficiently at multiple bit-rates. Unfortunately, it consumes a huge amount of computer memory due to employing lists that store the coordinates of the image pixels and the coordinates of the sets that are generated during the coding process. In addition, it has complex memory management due to using an array of random access linked lists to store these sets according to their sizes. In this paper, we propose two algorithms that are based on SPECK. The main contribution of the first algorithm is that, as compared to SPECK, the amount of the algorithm’s usable memory is reduced to about 75% and at the same time its processing speed is increased and its rate distortion efficiency is preserved as will be demonstrated. The second algorithm has higher processing speed but has slightly lower rate distortion performance than the first algorithm.

2015

Ultrafast and Efficient Scalable Image Compression Algorithm

الباحثونAli Kadhim Al-Janabi
المجلةElsevier, Journal of ICT Research and Applications, Vol. 9, No. 3, 2015, pp. 214-235.
مختصر البحث

Wavelet-based image compression algorithms have good performance and produce a rate scalable bit-stream that can be decoded efficiently at several bit rates. Unfortunately, the discrete wavelet transform (DWT) has relatively high computational complexity. On the other hand, the discrete cosine transform (DCT) has low complexity and excellent compaction properties. Unfortunately, it is non-local, which necessitates implementing it as a block-based transform leading to the well-known blocking artifacts at the edges of the DCT blocks. This paper proposes a very fast and rate scalable algorithm that exploits the low complexity of DCT and the low complexity of the set partitioning technique used by the wavelet-based algorithms. Like JPEG, the proposed algorithm first transforms the image using block-based DCT. Then, it rearranges the DCT coefficients into a wavelet-like structure. Finally, the rearranged image is coded using a modified version of the SPECK algorithm, which is one of the best well-known wavelet-based algorithms. The modified SPECK consumes slightly less computer memory, has slightly lower complexity and slightly better performance than the original SPECK. The experimental results demonstrated that the proposed algorithm has competitive performance and high processing speed. Consequently, it has the best performance to complexity ratio among all the current rate scalable algorithms.

2014

Highly Scalable Single List Set Partitioning in Hierarchical Trees Image Compression

الباحثونAli Kadhim Al-Janabi
المجلةJournal of Electronics and Communication Engineering (JECE), Volume 9, Issue 1, Ver. III (Jan. 2014)
مختصر البحث

A highly scalable image compression system produces a compressed image that can be easily decoded at several bit-rates (qualities) and resolutions (sizes). This is a very interesting feature in the heterogeneous environments of the Internet to satisfy the different user’s requests. This paper proposes a new algorithm termed Highly Scalable-Single List-SPIHT (HS-SLS). The proposed HS-SLS algorithm produces a highly scalable bit-stream that is both rate and resolution scalable. The flexible bit-stream of the HS-SLS encoder can easily be adapted to various resolution requirements at any bit-rate using a very simple scaling process that is performed on-the-fly and without the need to decode the bit-stream. A unique feature of the new algorithm is that it has low memory requirement and low complexity due to its simple memory management. In addition, the size of the usable memory is fixed and thus can be predefined which avoids the dynamic memory allocation problem. These features make the HS-SLS algorithm very suitable for hardware implementation. The price paid for these valuable features is very slight decrement in the algorithm's performance as compared to the original SPIHT algorithm.

2013

Low Memory Set-Partitioning in Hierarchical Trees Image Compression Algorithm

الباحثونAli Kadhim Al-Janabi
المجلةInternational Journal of Video&Image Processing and Network Security IJVIPNS, Volume 13, No.2, pp. 1
مختصر البحث

The S et Partitioning in Hierarchical Trees (S PIHT) image compression algorithm is very efficient, has low computational complexity, and generates an embedded compressed bit-stream that can be efficiently decoded at several data rates (qualities). Unfortunately it needs a huge amount of computer memory due to using three linked lists to store the coordinates of the image pixels. In addition the S PIHT has complex memory management due to the random access to these lists. This paper proposes a new algorithm termed S ingle List-S PIHT (S LS). The proposed S LS algorithm has very low memory requirements as it needs about six times less memory than the original S PIHT. This is achieved by using a single list and two state mark bitmaps instead of the three lists that are used by the original S PIHT. In addition, the proposed S LS has simpler memory management because once a pixel is added to the list, it will never be removed. This will permit to impleme nt the list as a simple ordered array that is accessed sequentially. Moreover, the size of the list can be predefined which avoids the dynamic memory allocation problem. This memory reduction and management simplification make the S LS algorithm very suitable for hardware implementation. Furthermore, S LS has better compression performance as compared to the original S PIHT. The price paid for these features is very slight increment in the algorithm's complexity as compared to the original S PIHT

2012

Low Complexity Embedded Image Compression Algorithm using Subband Coding of the DCT Coefficients

الباحثونAli Kadhim Al-Janabi
المجلةKufa Journal of Engineering, Volume 3, No.2, pp. 1-16
مختصر البحث

This paper proposes a new algorithm termed Quad-Tree-DCT (QT-DCT). QT-DCT is a low complexity algorithm that combines the good energy compaction ability and the simplicity of the Discrete Cosine Transform (DCT), and the global and embedding properties of Subband Coding (SBC) systems. The proposed QT-DCT reorders the DCT coefficients into subbands. Then these subbands are coded (bit-plane by bit-plane) using quad-tree decomposition method. The main contribution of the proposed QT-DCT algorithm is that it has better performance and lower complexity than JPEG image compression standard and some existing algorithms that have about the same complexity. In addition, QT-DCT produces an embedded compressed bit-stream which is able to achieve any compression bit-rate very easily. This is a very desirable feature for the modern requirements represented by the Internet.

المحاضرات

5
عرض التفاصيل