Kareem M. Attiah
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
Research Subjects
Kareem M. Attiah has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Wei Yu
University of Toronto
8 shared publications - Karim G. Seddik
The American University in Cairo
5 shared publications - Foad Sohrabi
Radio Systems Research, Nokia Bell Labs, Murray Hill, NJ, USA
3 shared publications Ramy H. Gohary
Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
3 shared publications- Ramy H. Gohary
Carleton University
2 shared publications - Ammar Alhosainy
Systems and Computer Engineering, Carleton University, Ottawa, Canada
1 shared publication
Latest Publications
- 15 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Information Theory
- Vol. PP, 1
Uplink-Downlink Duality for Beamforming in Integrated Sensing and Communications
This paper considers the beamforming and power optimization problem for a class of integrated sensing and communications (ISAC) problems that utilize the communication signals simultaneously for sensing. We formulate the problem of minimizing the Bayesian Cramér-Rao bound (BCRB) on the mean-squared error of estimating a vector of parameters, while satisfying downlink signal-to-interference-and-noise-ratio constraints for a set of communication users at the same time. The proposed optimization framework comprises two key new ingredients. First, we show that the BCRB minimization problem corresponds to maximizing beamforming power along certain sensing directions of interest. Second, the classical uplink-downlink duality for multiple-input multiple-output communications can be extended to the ISAC setting, but unlike the classical communication problem, the dual uplink problem for ISAC may entail negative noise power and needs to include an extra condition on the uplink beamformers. This new duality theory opens doors for efficient iterative algorithm for optimizing power and beamformers for ISAC.
- 15 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Information Theory
- Vol. PP, 1
Uplink-Downlink Duality for Beamforming in Integrated Sensing and Communications
This paper considers the beamforming and power optimization problem for a class of integrated sensing and communications (ISAC) problems that utilize the communication signals simultaneously for sensing. We formulate the problem of minimizing the Bayesian Cramér-Rao bound (BCRB) on the mean-squared error of estimating a vector of parameters, while satisfying downlink signal-to-interference-and-noise-ratio constraints for a set of communication users at the same time. The proposed optimization framework comprises two key new ingredients. First, we show that the BCRB minimization problem corresponds to maximizing beamforming power along certain sensing directions of interest. Second, the classical uplink-downlink duality for multiple-input multiple-output communications can be extended to the ISAC setting, but unlike the classical communication problem, the dual uplink problem for ISAC may entail negative noise power and needs to include an extra condition on the uplink beamformers. This new duality theory opens doors for efficient iterative algorithm for optimizing power and beamformers for ISAC.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (10) , 1
How Many Simultaneous Beamformers are Needed for Integrated Sensing and Communications?
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (10) , 1
How Many Simultaneous Beamformers are Needed for Integrated Sensing and Communications?
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 1674-1689
RIS-Assisted Joint Sensing and Communications via Fractionally Constrained Fractional Programming
This paper studies an uplink dual-functional sensing and communication system aided by a reconfigurable intelligent surface (RIS), whose reflection pattern is optimally configured to trade-off sensing and communication functionalities. Specifically, the Bayesian Cramér-Rao lower bound (BCRLB) for estimating the azimuth angle of a sensing user is minimized while ensuring the signal-to-interference-plus-noise ratio constraints for communication users. We show that this problem can be formulated as a novel fractionally constrained fractional programming (FCFP) problem. To deal with this highly nontrivial problem, we extend a quadratic transform technique, originally proposed to handle optimization problems containing fractional structures only in objectives, to the scenario where the constraints also include ratios. First, we consider the case where the fading coefficient is known. Using the quadratic transform, the FCFP problem can be turned into a sequence of subproblems that are convex except for the constant-modulus constraints which can be tackled using a penalty-based approach. To further reduce the computational complexity, we leverage the constant-modulus conditions and propose a novel linear transform. This new transform enables the FCFP problem to be turned into a sequence of linear programming (LP) subproblems, which can be solved with linear complexity in the dimension of reflecting elements. Then, we consider the case where the fading coefficient is unknown. A modified BCRLB is used to make the problem more tractable, and the proposed quadratic transform-based algorithm is used to solve the problem. Numerical results unveil nontrivial and effective reflection patterns that can be synthesized by the RIS to facilitate both communication and sensing functionalities.
- 5 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 1674-1689
RIS-Assisted Joint Sensing and Communications via Fractionally Constrained Fractional Programming
This paper studies an uplink dual-functional sensing and communication system aided by a reconfigurable intelligent surface (RIS), whose reflection pattern is optimally configured to trade-off sensing and communication functionalities. Specifically, the Bayesian Cramér-Rao lower bound (BCRLB) for estimating the azimuth angle of a sensing user is minimized while ensuring the signal-to-interference-plus-noise ratio constraints for communication users. We show that this problem can be formulated as a novel fractionally constrained fractional programming (FCFP) problem. To deal with this highly nontrivial problem, we extend a quadratic transform technique, originally proposed to handle optimization problems containing fractional structures only in objectives, to the scenario where the constraints also include ratios. First, we consider the case where the fading coefficient is known. Using the quadratic transform, the FCFP problem can be turned into a sequence of subproblems that are convex except for the constant-modulus constraints which can be tackled using a penalty-based approach. To further reduce the computational complexity, we leverage the constant-modulus conditions and propose a novel linear transform. This new transform enables the FCFP problem to be turned into a sequence of linear programming (LP) subproblems, which can be solved with linear complexity in the dimension of reflecting elements. Then, we consider the case where the fading coefficient is unknown. A modified BCRLB is used to make the problem more tractable, and the proposed quadratic transform-based algorithm is used to solve the problem. Numerical results unveil nontrivial and effective reflection patterns that can be synthesized by the RIS to facilitate both communication and sensing functionalities.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (9) , 6932-6949
Coded Downlink Massive Random Access and a Finite de Finetti Theorem
This paper considers a massive connectivity setting in which a base-station (BS) aims to communicate sources $(X_{1},\cdots ,X_{k})$ to a randomly activated subset of k users, among a large pool of n users, via a common message in the downlink. Although the identities of the k active users are assumed to be known at the BS, each active user only knows whether itself is active and does not know the identities of the other active users. A naive coding strategy is to transmit the sources alongside the identities of the users for which the source information is intended. This requires $H(X_{1},\cdots ,X_{k}) + k\log (n)$ bits, because the cost of specifying the identity of one out of n users is $\log (n)$ bits. For large n, this overhead can be significant. This paper shows that it is possible to develop coding techniques that eliminate the dependency of the overhead on n, if the source distribution follows certain symmetry. Specifically, if the source distribution is independently and identically distributed (i.i.d.) then the overhead can be reduced to at most $O(\log (k))$ bits, and in case of uniform i.i.d. sources, the overhead can be further reduced to $O(1)$ bits. For sources that follow a more general exchangeable distribution, the overhead is at most $O(k)$ bits, and in case of finite-alphabet exchangeable sources, the overhead can be further reduced to $O(\log (k))$ bits. The downlink massive random access problem is closely connected to the study of finite exchangeable sequences. The proposed coding strategy allows bounds on the Kullback-Leibler (KL) divergence between finite exchangeable distributions and i.i.d. mixture distributions to be developed and gives a new KL divergence version of the finite de Finetti theorem, which is scaling optimal.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (9) , 6932-6949
Coded Downlink Massive Random Access and a Finite de Finetti Theorem
This paper considers a massive connectivity setting in which a base-station (BS) aims to communicate sources $(X_{1},\cdots ,X_{k})$ to a randomly activated subset of k users, among a large pool of n users, via a common message in the downlink. Although the identities of the k active users are assumed to be known at the BS, each active user only knows whether itself is active and does not know the identities of the other active users. A naive coding strategy is to transmit the sources alongside the identities of the users for which the source information is intended. This requires $H(X_{1},\cdots ,X_{k}) + k\log (n)$ bits, because the cost of specifying the identity of one out of n users is $\log (n)$ bits. For large n, this overhead can be significant. This paper shows that it is possible to develop coding techniques that eliminate the dependency of the overhead on n, if the source distribution follows certain symmetry. Specifically, if the source distribution is independently and identically distributed (i.i.d.) then the overhead can be reduced to at most $O(\log (k))$ bits, and in case of uniform i.i.d. sources, the overhead can be further reduced to $O(1)$ bits. For sources that follow a more general exchangeable distribution, the overhead is at most $O(k)$ bits, and in case of finite-alphabet exchangeable sources, the overhead can be further reduced to $O(\log (k))$ bits. The downlink massive random access problem is closely connected to the study of finite exchangeable sequences. The proposed coding strategy allows bounds on the Kullback-Leibler (KL) divergence between finite exchangeable distributions and i.i.d. mixture distributions to be developed and gives a new KL divergence version of the finite de Finetti theorem, which is scaling optimal.
- Open Access
Beamforming Design for Integrated Sensing and Communications Using Uplink-Downlink Duality
This paper presents a novel optimization framework for beamforming design in integrated sensing and communication systems where a base station seeks to minimize the Bayesian Cramér-Rao bound of a sensing problem while satisfying quality of service constraints for the communication users. Prior approaches formulate the design problem as a semidefinite program for which acquiring a beamforming solution is computationally expensive. In this work, we show that the computational burden can be considerably alleviated. To achieve this, we transform the design problem to a tractable form that not only provides a new understanding of Cramér-Rao bound optimization, but also allows for an uplink-downlink duality relation to be developed. Such a duality result gives rise to an efficient algorithm that enables the beamforming design problem to be solved at a much lower complexity as compared to the-state-of-the-art methods.
Open AccessBeamforming Design for Integrated Sensing and Communications Using Uplink-Downlink Duality
This paper presents a novel optimization framework for beamforming design in integrated sensing and communication systems where a base station seeks to minimize the Bayesian Cramér-Rao bound of a sensing problem while satisfying quality of service constraints for the communication users. Prior approaches formulate the design problem as a semidefinite program for which acquiring a beamforming solution is computationally expensive. In this work, we show that the computational burden can be considerably alleviated. To achieve this, we transform the design problem to a tractable form that not only provides a new understanding of Cramér-Rao bound optimization, but also allows for an uplink-downlink duality relation to be developed. Such a duality result gives rise to an efficient algorithm that enables the beamforming design problem to be solved at a much lower complexity as compared to the-state-of-the-art methods.
- 11 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 10839-10853
Deep Learning for Channel Sensing and Hybrid Precoding in TDD Massive MIMO OFDM Systems
This paper proposes a deep learning approach to channel sensing and downlink hybrid beamforming for massive multiple-input multiple-output systems operating in the time division duplex mode and employing either single-carrier or multicarrier transmission. The conventional precoding design involves a two-step process of first estimating the high-dimensional channel, then designing the precoders based on such estimate. This two-step process is, however, not necessarily optimal. This paper shows that by using a learning approach to design the analog sensing and the hybrid downlink precoders directly from the received pilots without the intermediate high-dimensional channel estimation, the overall system performance can be significantly improved. Training a neural network to design the analog and digital precoders simultaneously is, however, difficult. Further, such an approach is not generalizable to systems with different number of users. In this paper, we develop a simplified and generalizable approach that learns the uplink sensing matrix and downlink analog precoder using a deep neural network that decomposes on a per-user basis, then designs the digital precoder based on the estimated low-dimensional equivalent channel. Numerical comparisons show that the proposed methodology results in significantly less training overhead and leads to an architecture that generalizes to various system settings.
- 11 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 10839-10853
Deep Learning for Channel Sensing and Hybrid Precoding in TDD Massive MIMO OFDM Systems
This paper proposes a deep learning approach to channel sensing and downlink hybrid beamforming for massive multiple-input multiple-output systems operating in the time division duplex mode and employing either single-carrier or multicarrier transmission. The conventional precoding design involves a two-step process of first estimating the high-dimensional channel, then designing the precoders based on such estimate. This two-step process is, however, not necessarily optimal. This paper shows that by using a learning approach to design the analog sensing and the hybrid downlink precoders directly from the received pilots without the intermediate high-dimensional channel estimation, the overall system performance can be significantly improved. Training a neural network to design the analog and digital precoders simultaneously is, however, difficult. Further, such an approach is not generalizable to systems with different number of users. In this paper, we develop a simplified and generalizable approach that learns the uplink sensing matrix and downlink analog precoder using a deep neural network that decomposes on a per-user basis, then designs the digital precoder based on the estimated low-dimensional equivalent channel. Numerical comparisons show that the proposed methodology results in significantly less training overhead and leads to an architecture that generalizes to various system settings.
- Open Access
Deep Learning for Channel Sensing and Hybrid Precoding in TDD Massive MIMO OFDM Systems
This paper proposes a deep learning approach to channel sensing and downlink hybrid beamforming for massive multiple-input multiple-output systems operating in the time division duplex mode and employing either single-carrier or multicarrier transmission. The conventional precoding design involves a two-step process of first estimating the high-dimensional channel, then designing the precoders based on such estimate. This two-step process is, however, not necessarily optimal. This paper shows that by using a learning approach to design the analog sensing and the hybrid downlink precoders directly from the received pilots without the intermediate high-dimensional channel estimation, the overall system performance can be significantly improved. Training a neural network to design the analog and digital precoders simultaneously is, however, difficult. Further, such an approach is not generalizable to systems with different number of users. In this paper, we develop a simplified and generalizable approach that learns the uplink sensing matrix and downlink analog precoder using a deep neural network that decomposes on a per-user basis, then designs the digital precoder based on the estimated low-dimensional equivalent channel. Numerical comparisons show that the proposed methodology results in significantly less training overhead and leads to an architecture that generalizes to various system settings.
Open AccessDeep Learning for Channel Sensing and Hybrid Precoding in TDD Massive MIMO OFDM Systems
This paper proposes a deep learning approach to channel sensing and downlink hybrid beamforming for massive multiple-input multiple-output systems operating in the time division duplex mode and employing either single-carrier or multicarrier transmission. The conventional precoding design involves a two-step process of first estimating the high-dimensional channel, then designing the precoders based on such estimate. This two-step process is, however, not necessarily optimal. This paper shows that by using a learning approach to design the analog sensing and the hybrid downlink precoders directly from the received pilots without the intermediate high-dimensional channel estimation, the overall system performance can be significantly improved. Training a neural network to design the analog and digital precoders simultaneously is, however, difficult. Further, such an approach is not generalizable to systems with different number of users. In this paper, we develop a simplified and generalizable approach that learns the uplink sensing matrix and downlink analog precoder using a deep neural network that decomposes on a per-user basis, then designs the digital precoder based on the estimated low-dimensional equivalent channel. Numerical comparisons show that the proposed methodology results in significantly less training overhead and leads to an architecture that generalizes to various system settings.
- 30 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1
Mobility Load Management in Cellular Networks: A Deep Reinforcement Learning Approach
Balancing traffic among cellular networks is very challenging due to many factors. Nevertheless, the explosive growth of mobile data traffic necessitates addressing this problem. Due to the problem complexity, data-driven self-optimized load balancing techniques are leading contenders. In this work, we propose a comprehensive deep reinforcement learning (RL) framework for steering the cell individual offset (CIO) as a means for mobility load management. The state of the LTE network is represented via a subset of key performance indicators (KPIs), all of which are readily available to network operators. We provide a diverse set of reward functions to satisfy the operators' needs. For a small number of cells, we propose using a deep Q-learning technique. We then introduce various enhancements to the vanilla deep Q-learning to reduce bias and generalization errors. Next, we propose the use of actor-critic RL methods, including Deep Deterministic Policy Gradient (DDPG) and twin delayed deep deterministic policy gradient (TD3) schemes, for optimizing CIOs for a large number of cells. We provide extensive simulation results to assess the efficacy of our methods. Our results show substantial improvements in terms of downlink throughput and non-blocked users at the expense of negligible channel quality degradation.
- 30 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. PP (15361233) , 1
Mobility Load Management in Cellular Networks: A Deep Reinforcement Learning Approach
Balancing traffic among cellular networks is very challenging due to many factors. Nevertheless, the explosive growth of mobile data traffic necessitates addressing this problem. Due to the problem complexity, data-driven self-optimized load balancing techniques are leading contenders. In this work, we propose a comprehensive deep reinforcement learning (RL) framework for steering the cell individual offset (CIO) as a means for mobility load management. The state of the LTE network is represented via a subset of key performance indicators (KPIs), all of which are readily available to network operators. We provide a diverse set of reward functions to satisfy the operators' needs. For a small number of cells, we propose using a deep Q-learning technique. We then introduce various enhancements to the vanilla deep Q-learning to reduce bias and generalization errors. Next, we propose the use of actor-critic RL methods, including Deep Deterministic Policy Gradient (DDPG) and twin delayed deep deterministic policy gradient (TD3) schemes, for optimizing CIOs for a large number of cells. We provide extensive simulation results to assess the efficacy of our methods. Our results show substantial improvements in terms of downlink throughput and non-blocked users at the expense of negligible channel quality degradation.
- Top Cited Papers
- 4 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (7) , 4044-4057
Deep Learning for Distributed Channel Feedback and Multiuser Precoding in FDD Massive MIMO
This paper shows that deep neural network (DNN) can be used for efficient and distributed channel estimation, quantization, feedback, and downlink multiuser precoding for a frequency-division duplex massive multiple-input multiple-output system in which a base station (BS) serves multiple mobile users, but with rate-limited feedback from the users to the BS. A key observation is that the multiuser channel estimation and feedback problem can be thought of as a distributed source coding problem. In contrast to the traditional approach where the channel state information (CSI) is estimated and quantized at each user independently, this paper shows that a joint design of pilots and a new DNN architecture, which maps the received pilots directly into feedback bits at the user side then maps the feedback bits from all the users directly into the precoding matrix at the BS, can significantly improve the overall performance. This paper further proposes robust design strategies with respect to channel parameters and also a generalizable DNN architecture for varying number of users and number of feedback bits. Numerical results show that the DNN-based approach with short pilot sequences and very limited feedback overhead can already approach the performance of conventional linear precoding schemes with full CSI.
- 4 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (7) , 4044-4057
Top Cited PapersDeep Learning for Distributed Channel Feedback and Multiuser Precoding in FDD Massive MIMO
This paper shows that deep neural network (DNN) can be used for efficient and distributed channel estimation, quantization, feedback, and downlink multiuser precoding for a frequency-division duplex massive multiple-input multiple-output system in which a base station (BS) serves multiple mobile users, but with rate-limited feedback from the users to the BS. A key observation is that the multiuser channel estimation and feedback problem can be thought of as a distributed source coding problem. In contrast to the traditional approach where the channel state information (CSI) is estimated and quantized at each user independently, this paper shows that a joint design of pilots and a new DNN architecture, which maps the received pilots directly into feedback bits at the user side then maps the feedback bits from all the users directly into the precoding matrix at the BS, can significantly improve the overall performance. This paper further proposes robust design strategies with respect to channel parameters and also a generalizable DNN architecture for varying number of users and number of feedback bits. Numerical results show that the DNN-based approach with short pilot sequences and very limited feedback overhead can already approach the performance of conventional linear precoding schemes with full CSI.
- 8 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (11) , 1909-1913
Differential Unitary Space-Time Constellations From Spherical Codes
We construct a new class of unitary space-time constellations that is suitable for multi-antenna differential signaling. This class of constellations follows a certain structure that is inspired by the so-called biorthogonal spherical codes. As a consequence of this, we show that the proposed class achieves optimal diversity sum in some cases and close-to-optimal diversity sum in the remaining cases. Furthermore, we demonstrate how such constellations are tuned in order to improve the diversity product while maintaining the same diversity sum, thereby yielding constellations with favorable diversity sum and product. Numerical evaluations reveal that the proposed construction achieves close or better performance than the best-known constellations over a wide range of signal-to-noise ratios of typical operation, with the added advantage that it can be generated for any number of transmit antennas.
- 8 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (11) , 1909-1913
Differential Unitary Space-Time Constellations From Spherical Codes
We construct a new class of unitary space-time constellations that is suitable for multi-antenna differential signaling. This class of constellations follows a certain structure that is inspired by the so-called biorthogonal spherical codes. As a consequence of this, we show that the proposed class achieves optimal diversity sum in some cases and close-to-optimal diversity sum in the remaining cases. Furthermore, we demonstrate how such constellations are tuned in order to improve the diversity product while maintaining the same diversity sum, thereby yielding constellations with favorable diversity sum and product. Numerical evaluations reveal that the proposed construction achieves close or better performance than the best-known constellations over a wide range of signal-to-noise ratios of typical operation, with the added advantage that it can be generated for any number of transmit antennas.