Mounir Hamood

Dr. Mounir Hamood


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2020 in TELKOMNIKA (Telecommunication Computing Electronics and Control)
Verified
Journal Article
Open access
PDF file
MHMounir Hamood
Mounir Hamood
In this paper, a novel split-radix algorithm for fast calculation the discrete Hartley transform of type-II (DHT-II) is intoduced. The algorithm is established through the decimation in time (DIT) approach, and implementedby splitting a length N of DHT-II into one DHT-II of length N/2 for even-indexed samples and two DHTs-II of length N/4 for odd-indexed samples. The proposed algorithm possesses the desired properties such as regularity, inplace calculation and it is represented by simple closed form decomposition sleading to considerable reductions in the arithmetic complexity compared to the existing DHT-II algorithms. Additionally, the validity of the proposed algorithm has been confirmed through analysing the arithmetic complexityby calculating the number of real additions and multiplications and associating it with the existing DHT-II algorithms.

1 November 2020 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
PDF file
MHMounir Hamood
Mounir Hamood
In real-time signal processing applications, the discrete version of the transform introduced by Hartley (DHT) has been proved to be an efficient substitute to the discrete Fourier transform (DFT). A new algorithm for fast calculations of the DHT (FHT) based on radix -2/4/8 method is introduced in this paper. In comparison with the split radix FHT algorithm, the proposed algorithm has a comparable arithmetic complexity, but preserves the regularity and the simple butterfly structure of the radix-2 algorithm. The development of the algorithm is motivated by firstly deriving a new radix-2/8 FHT algorithm and then cascading it with the radix-4 and radix-2 FHT algorithms. The arithmetic complexity of the developed algorithm has been implemented and analyzed by calculating the number of real additions and multiplications for different transform lengths. Comparisons with the existing FHT algorithms have shown that this algorithm can be considered as a good compromise between structural and arithmetic complexity.

1 February 2021 in IOP Conference Series: Materials Science and Engineering
Verified
Conference Paper
Open access
PDF file
MSMohanad A. Saleh
Mohanad A. Saleh
MHMounir Hamood
Mounir Hamood
MAMohammed Sh Ahmed
Mohammed Sh Ahmed
Due to its valuable features, orthogonal frequency division multiplexing (OFDM) is utilized extensively with the modern communication systems. In despite, such employment is impacted with some drawbacks that has been received a great interest in the recent studies. One of the negative ramifications owing to the supersession of transmitted signal through inverse fast Fourier transform (IFFT) is the large values of peak to average power ratio (PAPR). Consequently, reducing PAPR has received a good effort in the current studies. Owing to an efficient data rate and low computational complexity further to reduce PAPR without distortion, precoding OFDM system is employed in the recent information transmission techniques. This paper proposed the complex BIFORE transform (CBT) as a precoding scheme for OFDM systems and compared with Walsh Hadamard transform (WHT). In the sequel, the CBT achieved more PAPR reduction than WHT when employing as a precoding transform with the OFDM systems because of reducing superposition of the transmitted signals. As clearly shown in the simulation results, the CBT can be considered as an efficient precoding transform with OFDM systems for reducing PAPR.

1 April 2023 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
PDF file
SMSuha Suliman Mardan
Suha Suliman Mardan
MHMounir Hamood
Mounir Hamood
This paper presents an efficient fast Walsh–Hadamard–Hartley transform (FWHT) algorithm that incorporates the computation of the Walsh-Hadamard transform (WHT) with the discrete Hartley transform (DHT) into an orthogonal, unitary single fast transform possesses the block diagonal structure. The proposed algorithm is implemented in an integrated butterfly structure utilizing the sparse matrices factorization approach and the Kronecker (tensor) product technique, which proved a valuable and fast tool for developing and analyzing the proposed algorithm. The proposed approach was distinguished by ease of implementation and reduced computational complexity compared to previous algorithms, which were based on the concatenation of WHT and FHT by saving up to 3N-4 of real multiplication and 7.5N-10 of real addition.

1 August 2016 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
PDF file
MHMounir Hamood
Mounir Hamood
This paper presents a new algorithm for fast calculation of the discrete Hartley transform (DHT) based on decimation-in-time (DIT) approach. The proposed radix-2^2 fast Hartley transform (FHT) DIT algorithm has a regular butterfly structure that provides flexibility of different powers-of-two transform lengths, substantially reducing the arithmetic complexity with simple bit reversing for ordering the output sequence. The algorithm is developed through the three-dimensional linear index map and by integrating two stages of the signal flow graph together into a single butterfly. The algorithm is implemented and its computational complexity has been analysed and compared with the existing FHT algorithms, showing that it is significantly reduce the structural complexity with a better indexing scheme that is suitable for efficient implementation.

23 October 2023 in Signals
Verified
Journal Article
Open access
PDF file
Yousuf Abdulla Al-AaliYousuf Abdulla Al-Aali
Yousuf Abdulla Al-Aali
MHMounir Hamood
Mounir Hamood
SBSaid Boussakta
Said Boussakta
This paper introduces a new derivation of the radix-22 fast algorithm for the forward odd new Mersenne number transform (ONMNT) and the inverse odd new Mersenne number transform (IONMNT). This involves introducing new equations and functions in finite fields, bringing particular challenges unlike those in other fields. The radix-22 algorithm combines the benefits of the reduced number of operations of the radix-4 algorithm and the simple butterfly structure of the radix-2 algorithm, making it suitable for various applications such as lightweight ciphers, authenticated encryption, hash functions, signal processing, and convolution calculations. The multidimensional linear index mapping technique is the conventional method used to derive the radix-22 algorithm. However, this method does not provide clear insights into the underlying structure and flexibility of the radix-22 approach. This paper addresses this limitation and proposes a derivation based on bit-unscrambling techniques, which reverse the ordering of the output sequence, resulting in efficient calculations with fewer operations. Butterfly and signal flow diagrams are also presented to illustrate the structure of the fast algorithm for both ONMNT and IONMNT. The proposed method should pave the way for efficient and flexible implementation of ONMNT and IONMNT in applications such as lightweight ciphers and signal processing. The algorithm has been implemented in C and is validated with an example.