Haider Ali Jasim Alshamary
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Haider Ali Jasim Alshamary has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Weiyu Xu
Department of ECE, University of Iowa, USA
4 shared publications- Ahmad Sulaiman Abdullah
University of Diyala
2 shared publications - Sadeq Adnan Hbeeb
University of Diyala
2 shared publications Alam Zaib
King Abdullah University of Science and Technology, Saudi Arabia
1 shared publication- Alam Zaib
King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
1 shared publication Alexandros G. Dimakis
Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA
1 shared publication
Latest Publications
- Open Access
- 1 April 2023
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 12 (2) , 843-850
Nearest-neighbor field algorithm based on patchMatch for myocardial perfusion motion estimation/correction
Deformation correction and recovery of dynamic magnetic resonance images (DMRI) with low complexity algorithms without compromising image quality is a challenging problem. We proposed a motion estimation deformation-correction compressive sensing (DC-CS) scheme to recover dynamic images from its undersampled measurements. We simplify the complex optimization problem into three sub-problems. The contributions of this research are: introducing a global search strategy instead of the DC registration step, guaranteeing a non-explicit motion estimation that avoids any spatial alignment or registration of the images, and lowering the computational cost to the minimum by using PatchMatch (PM). The simulation result shows that the PM algorithm accelerates the recovery time without losing the quality in comparison with the DC algorithm.
- 1 April 2023
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 12 (2) , 843-850
Open AccessNearest-neighbor field algorithm based on patchMatch for myocardial perfusion motion estimation/correction
Deformation correction and recovery of dynamic magnetic resonance images (DMRI) with low complexity algorithms without compromising image quality is a challenging problem. We proposed a motion estimation deformation-correction compressive sensing (DC-CS) scheme to recover dynamic images from its undersampled measurements. We simplify the complex optimization problem into three sub-problems. The contributions of this research are: introducing a global search strategy instead of the DC registration step, guaranteeing a non-explicit motion estimation that avoids any spatial alignment or registration of the images, and lowering the computational cost to the minimum by using PatchMatch (PM). The simulation result shows that the PM algorithm accelerates the recovery time without losing the quality in comparison with the DC algorithm.
- Open Access
- 1 April 2023
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 12 (2) , 782-791
Symmetric longitudinal Mach-Zehnder modulator using lithium niobate
There are many problems that restrict the work of the Mach-Zehnder modulator (MZM), including the lack of using various windows of wavelengths, the large half-wave voltage, and the small optical confinement factor. In this paper, a mathematical model for MZM based on lithium niobate (LN) is designed to solve these problems. In this model, a wide window of optical wavelength from visible-to-infrared (632.8-to-1560 nm) was utilized. Moreover, it achieved a better modulation with lower attenuation and a lower dispersion by the window (1550-1560) nm. The other window of optical wavelength is about (632.8-to-634 nm), and (646-to-647 nm) which can be used for short-haul applications to reduce attenuation and dispersion. Furthermore, a small length of the arm, about 2-3 mm, was utilized to accomplish a large change of the refractive index and lower applied voltage of up to 250 V. The small operation half-wave voltage achieved about 1.2 V leading to better switching of the MZM. In addition, a large optical confinement factor of ≤1 unitless was obtained. Even better performance of MZM was attained by using a suitable length arm of MZM of about 2 mm, along with an electric field of about 175 V/mm and 233 V/mm using poling at 100 V.
- 1 April 2023
- Published by Institute of Advanced Engineering and Science in Bulletin of Electrical Engineering and Informatics
- Vol. 12 (2) , 782-791
Open AccessSymmetric longitudinal Mach-Zehnder modulator using lithium niobate
There are many problems that restrict the work of the Mach-Zehnder modulator (MZM), including the lack of using various windows of wavelengths, the large half-wave voltage, and the small optical confinement factor. In this paper, a mathematical model for MZM based on lithium niobate (LN) is designed to solve these problems. In this model, a wide window of optical wavelength from visible-to-infrared (632.8-to-1560 nm) was utilized. Moreover, it achieved a better modulation with lower attenuation and a lower dispersion by the window (1550-1560) nm. The other window of optical wavelength is about (632.8-to-634 nm), and (646-to-647 nm) which can be used for short-haul applications to reduce attenuation and dispersion. Furthermore, a small length of the arm, about 2-3 mm, was utilized to accomplish a large change of the refractive index and lower applied voltage of up to 250 V. The small operation half-wave voltage achieved about 1.2 V leading to better switching of the MZM. In addition, a large optical confinement factor of ≤1 unitless was obtained. Even better performance of MZM was attained by using a suitable length arm of MZM of about 2 mm, along with an electric field of about 175 V/mm and 233 V/mm using poling at 100 V.
- Open Access
- 1 February 2021
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 1076 (1) , 012062
Data Disseminated Energy-Efficient Clustering Algorithm For Avoid Load and Bandwidth Consumption In WSN Integrated IoT Platform
In the current scenario, wireless sensor networks (WSNs) are embedded in the “Internet of Things (IoT) ” platform where sensor nodes automatically link and use the Internet to communicate and execute their activities. WSNs are well suited for the collection of long-term IoT representation environmental data. The WSNs includes wireless communication capabilities, computation process, and nodes with sensing capabilities. Data dissemination methods, power management, and many routing procedures have been mainly designed for WSNs integrated IoT platform. Also, we consider load and bandwidth consumption as an essential issue in our design. Hence, this paper introduces a data disseminated energy-efficient clustering algorithm using multiple parameter decision-making for selecting an optimal clustering algorithm. For the cluster head selection process, we consider different kinds of parameters such as Initial Energy, Average Energy of the Network, Energy Consumption Rate, and Residual Energy. By considering these factors, nodes are continually monitored, and the cluster header is selected according to the maximum energy value. The respective cluster members are chosen in the cluster coverage area using the swarming techniques. In other words, we used swarm techniques as a cluster head selection process to avoid load and bandwidth consumption. The excellence of the system is evaluated using simulation results which show that this introduced method is more effective in terms of preventing bandwidth and load consumption. In this context, we use network simulator 2 (NS2) to simulate different kinds of metrics such as a packet delivery ratio, network lifetime, and energy consumption.
- 1 February 2021
- Published by IOP Publishing in IOP Conference Series: Materials Science and Engineering
- Vol. 1076 (1) , 012062
Open AccessData Disseminated Energy-Efficient Clustering Algorithm For Avoid Load and Bandwidth Consumption In WSN Integrated IoT Platform
In the current scenario, wireless sensor networks (WSNs) are embedded in the “Internet of Things (IoT) ” platform where sensor nodes automatically link and use the Internet to communicate and execute their activities. WSNs are well suited for the collection of long-term IoT representation environmental data. The WSNs includes wireless communication capabilities, computation process, and nodes with sensing capabilities. Data dissemination methods, power management, and many routing procedures have been mainly designed for WSNs integrated IoT platform. Also, we consider load and bandwidth consumption as an essential issue in our design. Hence, this paper introduces a data disseminated energy-efficient clustering algorithm using multiple parameter decision-making for selecting an optimal clustering algorithm. For the cluster head selection process, we consider different kinds of parameters such as Initial Energy, Average Energy of the Network, Energy Consumption Rate, and Residual Energy. By considering these factors, nodes are continually monitored, and the cluster header is selected according to the maximum energy value. The respective cluster members are chosen in the cluster coverage area using the swarming techniques. In other words, we used swarm techniques as a cluster head selection process to avoid load and bandwidth consumption. The excellence of the system is evaluated using simulation results which show that this introduced method is more effective in terms of preventing bandwidth and load consumption. In this context, we use network simulator 2 (NS2) to simulate different kinds of metrics such as a packet delivery ratio, network lifetime, and energy consumption.
- Open Access
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 66 (8) , 5316
Correction to “Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution” [Mar 20 1822-1844]
In [1] , the following line was missing: “Weiyu Xu and Haider Ali Jasim Alshamary contributed equally to this article.”
- 15 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 66 (8) , 5316
Open AccessCorrection to “Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution” [Mar 20 1822-1844]
In [1] , the following line was missing: “Weiyu Xu and Haider Ali Jasim Alshamary contributed equally to this article.”
- 11 August 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 875-879
Efficient optimal joint channel estimation and data detection for massive MIMO systems
In this paper, we propose an efficient optimal joint channel estimation and data detection algorithm for massive MIMO wireless systems. Our algorithm is optimal in terms of the generalized likelihood ratio test (GLRT). For massive MIMO systems, we show that the expected complexity of our algorithm grows polynomially in the channel coherence time. Simulation results demonstrate significant performance gains of our algorithm compared with suboptimal non-coherent detection algorithms. To the best of our knowledge, this is the first algorithm which efficiently achieves GLRT-optimal non-coherent detections for massive MIMO systems with general constellations.
- 11 August 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 875-879
Efficient optimal joint channel estimation and data detection for massive MIMO systems
In this paper, we propose an efficient optimal joint channel estimation and data detection algorithm for massive MIMO wireless systems. Our algorithm is optimal in terms of the generalized likelihood ratio test (GLRT). For massive MIMO systems, we show that the expected complexity of our algorithm grows polynomially in the channel coherence time. Simulation results demonstrate significant performance gains of our algorithm compared with suboptimal non-coherent detection algorithms. To the best of our knowledge, this is the first algorithm which efficiently achieves GLRT-optimal non-coherent detections for massive MIMO systems with general constellations.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 172-177
Optimal non-coherent data detection for massive SIMO wireless systems: A polynomial complexity solution
This paper considers the joint maximum likelihood (ML) channel estimation and data detection problem for massive SIMO (single input multiple output) wireless systems. We propose efficient algorithms achieving the exact ML non-coherent data detection, for both constant-modulus constellations and nonconstant-modulus constellations. Despite a large number of unknown channel coefficients in massive SIMO systems, we show that the expected computational complexity is linear in the number of receive antennas and polynomial in channel coherence time. To the best of our knowledge, our algorithms are the first efficient algorithms to achieve the exact joint ML channel estimation and data detection performance for massive SIMO systems with general constellations. Simulation results show our algorithms achieve considerable performance gains at a low computational complexity.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 172-177
Optimal non-coherent data detection for massive SIMO wireless systems: A polynomial complexity solution
This paper considers the joint maximum likelihood (ML) channel estimation and data detection problem for massive SIMO (single input multiple output) wireless systems. We propose efficient algorithms achieving the exact ML non-coherent data detection, for both constant-modulus constellations and nonconstant-modulus constellations. Despite a large number of unknown channel coefficients in massive SIMO systems, we show that the expected computational complexity is linear in the number of receive antennas and polynomial in channel coherence time. To the best of our knowledge, our algorithms are the first efficient algorithms to achieve the exact joint ML channel estimation and data detection performance for massive SIMO systems with general constellations. Simulation results show our algorithms achieve considerable performance gains at a low computational complexity.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 962-965
Maximum-likelihood joint channel estimation and data detection for space time block coded MIMO systems
This paper considers an exact maximum likelihood (ML) joint channel estimation and data detection problem for orthogonal space time block coded (OSTBC) multiple input multiple output (MIMO) systems. We propose an efficient algorithm which achieves exact ML blind data detection even for non-constant-modulus constellations. To the best of our knowledge, this is the first algorithm which efficiently achieves exact ML blind detection for OSTBC MIMO systems with non-constant-modulus constellations. Simulation results validate the performance and the complexity improvements our scheme compare with that of LS channel estimation and data detection scheme.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 962-965
Maximum-likelihood joint channel estimation and data detection for space time block coded MIMO systems
This paper considers an exact maximum likelihood (ML) joint channel estimation and data detection problem for orthogonal space time block coded (OSTBC) multiple input multiple output (MIMO) systems. We propose an efficient algorithm which achieves exact ML blind data detection even for non-constant-modulus constellations. To the best of our knowledge, this is the first algorithm which efficiently achieves exact ML blind detection for OSTBC MIMO systems with non-constant-modulus constellations. Simulation results validate the performance and the complexity improvements our scheme compare with that of LS channel estimation and data detection scheme.
- 1 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 62 (17) , 4436-4450
Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems: An Analysis of the Stationary Distribution and Mixing Time
We introduce an optimized Markov chain Monte Carlo (MCMC) technique for solving integer least-squares (ILS) problems, which include maximum likelihood (ML) detection in multiple-input multiple-output (MIMO) systems. Two factors contribute to its speed of finding the optimal solution: the probability of encountering the optimal solution when the Markov chain has converged to the stationary distribution, and the mixing time of the MCMC detector. First, we compute the optimal “temperature” parameter value, so that once the Markov chain has mixed to its stationary distribution, there is a polynomially small probability ( 1/poly(N), instead of exponentially small) of encountering the optimal solution, where N is the system dimension. This temperature is shown to be O(√{SNR}/ln(N)), where SNR > 2ln(N) is the SNR. Second, we study the mixing time of the underlying Markov chain of the MCMC detector. We find that, the mixing time is closely related to whether there is a local minimum in the ILS problem's lattice structure. For some lattices without local minima, the mixing time is independent of SNR, and grows polynomially in N. Conventional wisdom proposed to set temperature as the noise standard deviation, but our results show that, under such a temperature, the mixing time grows unbounded with SNR if the lattice has local minima. Our results suggest that, very often the temperature should instead be scaling at least as Ω(√{SNR}). Simulation results show that the optimized MCMC detector efficiently achieves approximately ML detection in MIMO systems having a huge number of transmit and receive dimensions.
- 1 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 62 (17) , 4436-4450
Optimized Markov Chain Monte Carlo for Signal Detection in MIMO Systems: An Analysis of the Stationary Distribution and Mixing Time
We introduce an optimized Markov chain Monte Carlo (MCMC) technique for solving integer least-squares (ILS) problems, which include maximum likelihood (ML) detection in multiple-input multiple-output (MIMO) systems. Two factors contribute to its speed of finding the optimal solution: the probability of encountering the optimal solution when the Markov chain has converged to the stationary distribution, and the mixing time of the MCMC detector. First, we compute the optimal “temperature” parameter value, so that once the Markov chain has mixed to its stationary distribution, there is a polynomially small probability ( 1/poly(N), instead of exponentially small) of encountering the optimal solution, where N is the system dimension. This temperature is shown to be O(√{SNR}/ln(N)), where SNR > 2ln(N) is the SNR. Second, we study the mixing time of the underlying Markov chain of the MCMC detector. We find that, the mixing time is closely related to whether there is a local minimum in the ILS problem's lattice structure. For some lattices without local minima, the mixing time is independent of SNR, and grows polynomially in N. Conventional wisdom proposed to set temperature as the noise standard deviation, but our results show that, under such a temperature, the mixing time grows unbounded with SNR if the lattice has local minima. Our results suggest that, very often the temperature should instead be scaling at least as Ω(√{SNR}). Simulation results show that the optimized MCMC detector efficiently achieves approximately ML detection in MIMO systems having a huge number of transmit and receive dimensions.