Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haider Ali Jasim Alshamary

dblp:136/5769 · also Haider Ali 0007 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0001-7878-5010ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.412020
Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution · IEEE Trans. Inf. Theory 2020
Physical-layer communications › channel estimation
joint channel estimation and data detection
0.412020
Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution · IEEE Trans. Inf. Theory 2020
Physical-layer communications › multiple-antenna systems
massive SIMO
0.412020
Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution · IEEE Trans. Inf. Theory 2020
Physical-layer communications
MIMO
0.412020
Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution · IEEE Trans. Inf. Theory 2020

Methods — techniques the papers use, named apart from their topics

polynomial complexity algorithm · 0.4generalized likelihood ratio test · 0.4
YearPublicationVenuePosition
2020 Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution
abstract
By exploiting large antenna arrays, massive MIMO (multiple input multiple output) systems can greatly increase spectral and energy efficiency over traditional MIMO systems. However, increasing the number of antennas at the base station (BS) makes the uplink joint channel estimation and data detection (JED) challenging in massive MIMO systems. In this paper, we consider the JED problem for massive SIMO (single input multiple output) wireless systems, which is a special case of wireless systems with large antenna arrays. We propose exact Generalized Likelihood Ratio Test (GLRT) optimal JED algorithms with low expected complexity, for both constant-modulus and nonconstant-modulus constellations. We show that, despite the large number of unknown channel coefficients, the expected computational complexity of these algorithms is polynomial in channel coherence time (T) and the number of receive antennas (N), even when the number of receive antennas grows polynomially in the channel coherence time (N=O(T11) suffices to guarantee an expected computational complexity cubic in T and linear in N). Simulation results show that the GLRT-optimal JED algorithms achieve significant performance gains (up to 5 dB improvement in energy efficiency) with low computational complexity.
Weiyu Xu, Haider Ali Jasim Alshamary, Tareq Y. Al-Naffouri, Alam Zaib
IEEE Trans. Inf. Theory2
2020 Correction to "Optimal Joint Channel Estimation and Data Detection for Massive SIMO Wireless Systems: A Polynomial Complexity Solution"
abstract
In[1], the following line was missing: “Weiyu Xu and Haider Ali Jasim Alshamary contributed equally to this article.”
Weiyu Xu, Haider Ali Jasim Alshamary, Tareq Y. Al-Naffouri, Alam Zaib
IEEE Trans. Inf. Theory2
2016 Efficient optimal joint channel estimation and data detection for massive MIMO systems
abstract
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.
Haider Ali Jasim Alshamary, Weiyu Xu
ISIT1