-
Low-complexity tuning of pinching-antenna systems for integrated sensing and communication
Authors:
Saba Asaad,
Chongjun Ouyang,
Zhiguo Ding,
Ali Bereyhi
Abstract:
Pinching antenna systems (PASSs) can dynamically adapt their transmit and receive arrays for sensing and communication in wireless systems. This work explores the potential of PASSs for integrated sensing and communication (ISAC) by proposing a novel PASS-aided ISAC design, in which pinching locations are adaptively adjusted to enable simultaneous sensing and data transmission with minimal interfe…
▽ More
Pinching antenna systems (PASSs) can dynamically adapt their transmit and receive arrays for sensing and communication in wireless systems. This work explores the potential of PASSs for integrated sensing and communication (ISAC) by proposing a novel PASS-aided ISAC design, in which pinching locations are adaptively adjusted to enable simultaneous sensing and data transmission with minimal interference. The proposed design introduces a bi-partitioning strategy that allocates sensing power and tunes pinching locations with remarkably low computational complexity, allowing dynamic PASS tuning at high update rates. Numerical results demonstrate that the proposed approach achieves a significantly larger sensing-communication rate region compared to baseline designs at no noticeable cost.
△ Less
Submitted 16 March, 2026;
originally announced March 2026.
-
Multi-objective Optimization for Over-the-Air Federated Edge Learning-enabled Collaborative Integrated Sensing and Communications
Authors:
Saba Asaad,
Hina Tabassum,
Ping Wang
Abstract:
This paper introduces a novel multi-objective integrated sensing and communications (ISAC) framework to enable collaborative wireless sensing in conjunction with over-the-air federated-edge learning (OTA-FEEL). The framework enables multi-task OTA aggregation to handle sensing and learning simultaneously, while benefiting from dual-purpose uplink signals for both communications and target sensing.…
▽ More
This paper introduces a novel multi-objective integrated sensing and communications (ISAC) framework to enable collaborative wireless sensing in conjunction with over-the-air federated-edge learning (OTA-FEEL). The framework enables multi-task OTA aggregation to handle sensing and learning simultaneously, while benefiting from dual-purpose uplink signals for both communications and target sensing. Starting from characterizing the local sufficient statistics at each edge device and establishing its stationary, we develop a tractable analytical expression for the local sufficient statistics. To suppress the interference from uplink transmissions of other devices through matched filtering, we then propose a novel orthogonal pulse shaping method. Then, we derive the optimal unbiased estimate of the target's coordinates by casting the centralized problem of joint likelihood function maximization of all devices as the distributed likelihood maximization of each device (which requires only local sufficient statistics). A lower bound on the sensing error variance is then characterized using the Cramer-Rao bound (CRB). We then formulate a multi-objective optimization (MOOP) problem to minimize the mean square error (MSE) and sensing error bound simultaneously. The considered problem is then solved using the epsilon-constrained method. Numerical results demonstrate that the proposed dual-purpose OTA-FEEL-enabled collaborative ISAC framework enhances sensing accuracy without adversely affecting the performance of the primary OTA-FEEL task. While conventional single-shot collaborative sensing schemes are limited by the average error of local estimators, the proposed algorithm achieves the CRB of the considered problem.
△ Less
Submitted 16 March, 2026;
originally announced March 2026.
-
Regime-aware financial volatility forecasting via in-context learning
Authors:
Saba Asaad,
Shayan Mohajer Hamidi,
Ali Bereyhi
Abstract:
This work introduces a regime-aware in-context learning framework that leverages large language models (LLMs) for financial volatility forecasting under nonstationary market conditions. The proposed approach deploys pretrained LLMs to reason over historical volatility patterns and adjust their predictions without parameter fine-tuning. We develop an oracle-guided refinement procedure that construc…
▽ More
This work introduces a regime-aware in-context learning framework that leverages large language models (LLMs) for financial volatility forecasting under nonstationary market conditions. The proposed approach deploys pretrained LLMs to reason over historical volatility patterns and adjust their predictions without parameter fine-tuning. We develop an oracle-guided refinement procedure that constructs regime-aware demonstrations from training data. An LLM is then deployed as an in-context learner that predicts the next-step volatility from the input sequence using demonstrations sampled conditional to the estimated market label. This conditional sampling strategy enables the LLM to adapt its predictions to regime-dependent volatility dynamics through contextual reasoning alone. Experiments with multiple financial datasets show that the proposed regime-aware in-context learning framework outperforms both classical volatility forecasting approaches and direct one-shot learning, especially during high-volatility periods.
△ Less
Submitted 10 March, 2026;
originally announced March 2026.
-
Pinching Antennas-Assisted Low-Latency Federated Learning Over Multi-User Wireless Networks
Authors:
Saba Asaad,
Hina Tabassum,
Ping Wang
Abstract:
Federated learning (FL) over wireless networks is fundamentally constrained by unreliable communication links, particularly when uplink channels suffer from blockage, fading, or weak line-of-sight (LoS) conditions. Pinching-antenna systems (PASSs) offer a new physical-layer capability to dynamically reposition radiating points along a dielectric waveguide, enabling controllable LoS connectivity an…
▽ More
Federated learning (FL) over wireless networks is fundamentally constrained by unreliable communication links, particularly when uplink channels suffer from blockage, fading, or weak line-of-sight (LoS) conditions. Pinching-antenna systems (PASSs) offer a new physical-layer capability to dynamically reposition radiating points along a dielectric waveguide, enabling controllable LoS connectivity and significantly improved channel quality. This paper develops FedPASS, a novel framework for low-latency wireless FL assisted by PASS. We formulate a multi-objective optimization problem that jointly minimizes the end-to-end round latency and an upper bound on the FL optimality gap. The resulting formulation is a mixed-integer nonlinear program subject to practical constraints on scheduling, transmit power, local CPU frequency, and PA placement. To address the resulting computational challenges, we develop a two-tier iterative algorithm: an outer loop that updates scheduling, communication time allocation, and power control via block coordinate descent, and an inner loop that optimizes PA locations using a Gauss-Seidel-based coordinate update with grid search under spacing constraints. Numerical results on MNIST and CIFAR-10 demonstrate that FedPASS achieves accuracy comparable to idealized FL baselines while drastically reducing the total training latency compared to conventional wireless FL.
△ Less
Submitted 9 March, 2026;
originally announced March 2026.
-
Energy-Efficient Over-the-Air Federated Learning via Pinching Antenna Systems
Authors:
Saba Asaad,
Ali Bereyhi
Abstract:
Pinching antennas systems (PASSs) have recently been proposed as a novel flexible-antenna technology. These systems are implemented by attaching low-cost pinching elements to dielectric waveguides. As the direct link is bypassed through waveguides, PASSs can effectively compensate large-scale effects of the wireless channel. This work explores the potential gains of employing PASSs for over-the-ai…
▽ More
Pinching antennas systems (PASSs) have recently been proposed as a novel flexible-antenna technology. These systems are implemented by attaching low-cost pinching elements to dielectric waveguides. As the direct link is bypassed through waveguides, PASSs can effectively compensate large-scale effects of the wireless channel. This work explores the potential gains of employing PASSs for over-the-air federated learning (OTA-FL). For a PASS-assisted server, we develop a low-complexity algorithmic approach, which jointly tunes the PASS parameters and schedules the mobile devices for minimal energy consumption in OTA-FL. We study the efficiency of the proposed design and compare it against the conventional OTA-FL setting with MIMO server. Numerical experiments demonstrate that using a single-waveguide PASS at the server within a moderately sized area, the required energy for model aggregation is drastically reduced as compared to the case with fully-digital MIMO server. This introduces PASS as a potential technology for energy-efficient distributed learning in next generations of wireless systems.
△ Less
Submitted 15 February, 2026;
originally announced February 2026.
-
Dynamic and Static Energy Efficient Design of Pinching Antenna Systems
Authors:
Saba Asaad,
Chongjun Ouyang,
Ali Bereyhi,
Zhiguo Ding
Abstract:
We study the energy efficiency of pinching-antenna systems (PASSs) by developing a consistent formulation for power distribution in these systems. The per-antenna power distribution in PASSs is not controlled explicitly by a power allocation policy, but rather implicitly through tuning of pinching couplings and locations. Both these factors are tunable: (i) pinching locations are tuned using movab…
▽ More
We study the energy efficiency of pinching-antenna systems (PASSs) by developing a consistent formulation for power distribution in these systems. The per-antenna power distribution in PASSs is not controlled explicitly by a power allocation policy, but rather implicitly through tuning of pinching couplings and locations. Both these factors are tunable: (i) pinching locations are tuned using movable elements, and (ii) couplings can be tuned by varying the effective coupling length of the pinching elements. While the former is feasible to be addressed dynamically in settings with low user mobility, the latter cannot be addressed at a high rate. We thus develop a class of hybrid dynamic-static algorithms, which maximize the energy efficiency by updating the system parameters at different rates. Our experimental results depict that dynamic tuning of pinching locations can significantly boost energy efficiency of PASSs.
△ Less
Submitted 15 February, 2026; v1 submitted 11 November, 2025;
originally announced November 2025.
-
A Comprehensive Part-of-Speech Tagging to Standardize Central-Kurdish Language: A Research Guide for Kurdish Natural Language Processing Tasks
Authors:
Shadan Shukr Sabr,
Nazira Sabr Mustafa,
Talar Sabah Omar,
Salah Hwayyiz Rasool,
Nawzad Anwer Omer,
Darya Sabir Hamad,
Hemin Abdulhameed Shams,
Omer Mahmood Kareem,
Rozhan Noori Abdullah,
Khabat Atar Abdullah,
Mahabad Azad Mohammad,
Haneen Al-Raghefy,
Safar M. Asaad,
Sara Jamal Mohammed,
Twana Saeed Ali,
Fazil Shawrow,
Halgurd S. Maghdid
Abstract:
- The field of natural language processing (NLP) has dramatically expanded within the last decade. Many human-being applications are conducted daily via NLP tasks, starting from machine translation, speech recognition, text generation and recommendations, Part-of-Speech tagging (POS), and Named-Entity Recognition (NER). However, low-resourced languages, such as the Central-Kurdish language (CKL),…
▽ More
- The field of natural language processing (NLP) has dramatically expanded within the last decade. Many human-being applications are conducted daily via NLP tasks, starting from machine translation, speech recognition, text generation and recommendations, Part-of-Speech tagging (POS), and Named-Entity Recognition (NER). However, low-resourced languages, such as the Central-Kurdish language (CKL), mainly remain unexamined due to shortage of necessary resources to support their development. The POS tagging task is the base of other NLP tasks; for example, the POS tag set has been used to standardized languages to provide the relationship between words among the sentences, followed by machine translation and text recommendation. Specifically, for the CKL, most of the utilized or provided POS tagsets are neither standardized nor comprehensive. To this end, this study presented an accurate and comprehensive POS tagset for the CKL to provide better performance of the Kurdish NLP tasks. The article also collected most of the POS tags from different studies as well as from Kurdish linguistic experts to standardized part-of-speech tags. The proposed POS tagset is designed to annotate a large CKL corpus and support Kurdish NLP tasks. The initial investigations of this study via comparison with the Universal Dependencies framework for standard languages, show that the proposed POS tagset can streamline or correct sentences more accurately for Kurdish NLP tasks.
△ Less
Submitted 28 April, 2025;
originally announced April 2025.
-
MIMO-PASS: Uplink and Downlink Transmission via MIMO Pinching-Antenna Systems
Authors:
Ali Bereyhi,
Chongjun Ouyang,
Saba Asaad,
Zhiguo Ding,
H. Vincent Poor
Abstract:
Pinching-antenna systems (PASSs) are a recent flexible-antenna technology that is realized by attaching simple components, referred to as pinching elements, to dielectric waveguides. This work explores the potential of deploying PASS for uplink and downlink transmission in multiuser MIMO settings. For downlink PASS-aided communication, we formulate the optimal hybrid beamforming, in which the digi…
▽ More
Pinching-antenna systems (PASSs) are a recent flexible-antenna technology that is realized by attaching simple components, referred to as pinching elements, to dielectric waveguides. This work explores the potential of deploying PASS for uplink and downlink transmission in multiuser MIMO settings. For downlink PASS-aided communication, we formulate the optimal hybrid beamforming, in which the digital precoding matrix at the access point and the location of pinching elements on the waveguides are jointly optimized to maximize the achievable weighted sum-rate. Invoking fractional programming and Gauss-Seidel approach, we propose two low-complexity algorithms to iteratively update the precoding matrix and activated locations of the pinching elements. We further study uplink transmission aided by a PASS, where an iterative scheme is designed to address the underlying hybrid multiuser detection problem. We validate the proposed schemes through extensive numerical experiments. The results demonstrate that using a PASS, the throughput in both uplink and downlink is boosted significantly as compared with baseline MIMO architectures, such as massive MIMO~and classical hybrid analog-digital designs. This highlights the great potential of PASSs, making it a promising reconfigurable antenna technology for next-generation wireless systems.
△ Less
Submitted 4 March, 2025;
originally announced March 2025.
-
Downlink Beamforming with Pinching-Antenna Assisted MIMO Systems
Authors:
Ali Bereyhi,
Saba Asaad,
Chongjun Ouyang,
Zhiguo Ding,
H. Vincent Poor
Abstract:
Pinching antennas have been recently proposed as a promising flexible-antenna technology, which can be implemented by attaching low-cost pinching elements to dielectric waveguides. This work explores the potential of employing pinching antenna systems (PASs) for downlink transmission in a multiuser MIMO setting. We consider the problem of hybrid beamforming, where the digital precoder at the acces…
▽ More
Pinching antennas have been recently proposed as a promising flexible-antenna technology, which can be implemented by attaching low-cost pinching elements to dielectric waveguides. This work explores the potential of employing pinching antenna systems (PASs) for downlink transmission in a multiuser MIMO setting. We consider the problem of hybrid beamforming, where the digital precoder at the access point and the activated locations of the pinching elements are jointly optimized to maximize the achievable weighted sum-rate. Invoking fractional programming, a novel low-complexity algorithm is developed to iteratively update the precoding matrix and the locations of the pinching antennas. We validate the proposed scheme through extensive numerical experiments. Our investigations demonstrate that using PAS the system throughput can be significantly boosted as compared with the conventional fixed-location antenna systems, enlightening the potential of PAS as an enabling candidate for next-generation wireless networks.
△ Less
Submitted 3 February, 2025;
originally announced February 2025.
-
Over-the-Air FEEL with Integrated Sensing: Joint Scheduling and Beamforming Design
Authors:
Saba Asaad,
Ping Wang,
Hina Tabassum
Abstract:
Employing wireless systems with dual sensing and communications functionalities is becoming critical in next generation of wireless networks. In this paper, we propose a robust design for over-the-air federated edge learning (OTA-FEEL) that leverages sensing capabilities at the parameter server (PS) to mitigate the impact of target echoes on the analog model aggregation. We first derive novel expr…
▽ More
Employing wireless systems with dual sensing and communications functionalities is becoming critical in next generation of wireless networks. In this paper, we propose a robust design for over-the-air federated edge learning (OTA-FEEL) that leverages sensing capabilities at the parameter server (PS) to mitigate the impact of target echoes on the analog model aggregation. We first derive novel expressions for the Cramer-Rao bound of the target response and mean squared error (MSE) of the estimated global model to measure radar sensing and model aggregation quality, respectively. Then, we develop a joint scheduling and beamforming framework that optimizes the OTA-FEEL performance while keeping the sensing and communication quality, determined respectively in terms of Cramer-Rao bound and achievable downlink rate, in a desired range. The resulting scheduling problem reduces to a combinatorial mixed-integer nonlinear programming problem (MINLP). We develop a low-complexity hierarchical method based on the matching pursuit algorithm used widely for sparse recovery in the literature of compressed sensing. The proposed algorithm uses a step-wise strategy to omit the least effective devices in each iteration based on a metric that captures both the aggregation and sensing quality of the system. It further invokes alternating optimization scheme to iteratively update the downlink beamforming and uplink post-processing by marginally optimizing them in each iteration. Convergence and complexity analysis of the proposed algorithm is presented. Numerical evaluations on MNIST and CIFAR-10 datasets demonstrate the effectiveness of our proposed algorithm. The results show that by leveraging accurate sensing, the target echoes on the uplink signal can be effectively suppressed, ensuring the quality of model aggregation to remain intact despite the interference.
△ Less
Submitted 10 January, 2025;
originally announced January 2025.
-
Over-the-Air Fair Federated Learning via Multi-Objective Optimization
Authors:
Shayan Mohajer Hamidi,
Ali Bereyhi,
Saba Asaad,
H. Vincent Poor
Abstract:
In federated learning (FL), heterogeneity among the local dataset distributions of clients can result in unsatisfactory performance for some, leading to an unfair model. To address this challenge, we propose an over-the-air fair federated learning algorithm (OTA-FFL), which leverages over-the-air computation to train fair FL models. By formulating FL as a multi-objective minimization problem, we i…
▽ More
In federated learning (FL), heterogeneity among the local dataset distributions of clients can result in unsatisfactory performance for some, leading to an unfair model. To address this challenge, we propose an over-the-air fair federated learning algorithm (OTA-FFL), which leverages over-the-air computation to train fair FL models. By formulating FL as a multi-objective minimization problem, we introduce a modified Chebyshev approach to compute adaptive weighting coefficients for gradient aggregation in each communication round. To enable efficient aggregation over the multiple access channel, we derive analytical solutions for the optimal transmit scalars at the clients and the de-noising scalar at the parameter server. Extensive experiments demonstrate the superiority of OTA-FFL in achieving fairness and robust performance compared to existing methods.
△ Less
Submitted 6 January, 2025;
originally announced January 2025.
-
GP-FL: Model-Based Hessian Estimation for Second-Order Over-the-Air Federated Learning
Authors:
Shayan Mohajer Hamidi,
Ali Bereyhi,
Saba Asaad,
H. Vincent Poor
Abstract:
Second-order methods are widely adopted to improve the convergence rate of learning algorithms. In federated learning (FL), these methods require the clients to share their local Hessian matrices with the parameter server (PS), which comes at a prohibitive communication cost. A classical solution to this issue is to approximate the global Hessian matrix from the first-order information. Unlike in…
▽ More
Second-order methods are widely adopted to improve the convergence rate of learning algorithms. In federated learning (FL), these methods require the clients to share their local Hessian matrices with the parameter server (PS), which comes at a prohibitive communication cost. A classical solution to this issue is to approximate the global Hessian matrix from the first-order information. Unlike in idealized networks, this solution does not perform effectively in over-the-air FL settings, where the PS receives noisy versions of the local gradients. This paper introduces a novel second-order FL framework tailored for wireless channels. The pivotal innovation lies in the PS's capability to directly estimate the global Hessian matrix from the received noisy local gradients via a non-parametric method: the PS models the unknown Hessian matrix as a Gaussian process, and then uses the temporal relation between the gradients and Hessian along with the channel model to find a stochastic estimator for the global Hessian matrix. We refer to this method as Gaussian process-based Hessian modeling for wireless FL (GP-FL) and show that it exhibits a linear-quadratic convergence rate. Numerical experiments on various datasets demonstrate that GP-FL outperforms all classical baseline first and second order FL approaches.
△ Less
Submitted 4 December, 2024;
originally announced December 2024.
-
RackBlox: A Software-Defined Rack-Scale Storage System with Network-Storage Co-Design
Authors:
Benjamin Reidys,
Yuqi Xue,
Daixuan Li,
Bharat Sukhwani,
Wen-mei Hwu,
Deming Chen,
Sameh Asaad,
Jian Huang
Abstract:
Software-defined networking (SDN) and software-defined flash (SDF) have been serving as the backbone of modern data centers. They are managed separately to handle I/O requests. At first glance, this is a reasonable design by following the rack-scale hierarchical design principles. However, it suffers from suboptimal end-to-end performance, due to the lack of coordination between SDN and SDF.
In…
▽ More
Software-defined networking (SDN) and software-defined flash (SDF) have been serving as the backbone of modern data centers. They are managed separately to handle I/O requests. At first glance, this is a reasonable design by following the rack-scale hierarchical design principles. However, it suffers from suboptimal end-to-end performance, due to the lack of coordination between SDN and SDF.
In this paper, we co-design the SDN and SDF stack by redefining the functions of their control plane and data plane, and splitting up them within a new architecture named RackBlox. RackBlox decouples the storage management functions of flash-based solid-state drives (SSDs), and allow the SDN to track and manage the states of SSDs in a rack. Therefore, we can enable the state sharing between SDN and SDF, and facilitate global storage resource management. RackBlox has three major components: (1) coordinated I/O scheduling, in which it dynamically adjusts the I/O scheduling in the storage stack with the measured and predicted network latency, such that it can coordinate the effort of I/O scheduling across the network and storage stack for achieving predictable end-to-end performance; (2) coordinated garbage collection (GC), in which it will coordinate the GC activities across the SSDs in a rack to minimize their impact on incoming I/O requests; (3) rack-scale wear leveling, in which it enables global wear leveling among SSDs in a rack by periodically swapping data, for achieving improved device lifetime for the entire rack. We implement RackBlox using programmable SSDs and switch. Our experiments demonstrate that RackBlox can reduce the tail latency of I/O requests by up to 5.8x over state-of-the-art rack-scale storage systems.
△ Less
Submitted 12 September, 2023;
originally announced September 2023.
-
Joint Antenna Selection and Beamforming for Massive MIMO-enabled Over-the-Air Federated Learning
Authors:
Saba Asaad,
Hina Tabassum,
Chongjun Ouyang,
Ping Wang
Abstract:
Over-the-air federated learning (OTA-FL) is an emerging technique to reduce the computation and communication overload at the PS caused by the orthogonal transmissions of the model updates in conventional federated learning (FL). This reduction is achieved at the expense of introducing aggregation error that can be efficiently suppressed by means of receive beamforming via large array-antennas. Th…
▽ More
Over-the-air federated learning (OTA-FL) is an emerging technique to reduce the computation and communication overload at the PS caused by the orthogonal transmissions of the model updates in conventional federated learning (FL). This reduction is achieved at the expense of introducing aggregation error that can be efficiently suppressed by means of receive beamforming via large array-antennas. This paper studies OTA-FL in massive multiple-input multiple-output (MIMO) systems by considering a realistic scenario in which the edge server, despite its large antenna array, is restricted in the number of radio frequency (RF)-chains. For this setting, the beamforming for over-the-air model aggregation needs to be addressed jointly with antenna selection. This leads to an NP-hard problem due to the combinatorial nature of the optimization. We tackle this problem via two different approaches. In the first approach, we use the penalty dual decomposition (PDD) technique to develop a two-tier algorithm for joint antenna selection and beamforming. The second approach interprets the antenna selection task as a sparse recovery problem and develops two iterative joint algorithms based on the Lasso and fast iterative soft-thresholding methods. Convergence and complexity analysis is presented for all the schemes. The numerical investigations depict that the algorithms based on the sparse recovery techniques outperform the PDD-based algorithm, when the number of RF-chains at the edge server is much smaller than its array size. However, as the number of RF-chains increases, the PDD approach starts to be superior. Our simulations further depict that learning performance with all the antennas being active at the PS can be closely tracked by selecting less than 20% of the antennas at the PS.
△ Less
Submitted 26 May, 2023;
originally announced May 2023.
-
A Novel Poisoned Water Detection Method Using Smartphone Embedded Wi-Fi Technology and Machine Learning Algorithms
Authors:
Halgurd S. Maghdid,
Sheerko R. Hma Salah,
Akar T. Hawre,
Hassan M. Bayram,
Azhin T. Sabir,
Kosrat N. Kaka,
Salam Ghafour Taher,
Ladeh S. Abdulrahman,
Abdulbasit K. Al-Talabani,
Safar M. Asaad,
Aras Asaad
Abstract:
Water is a necessary fluid to the human body and automatic checking of its quality and cleanness is an ongoing area of research. One such approach is to present the liquid to various types of signals and make the amount of signal attenuation an indication of the liquid category. In this article, we have utilized the Wi-Fi signal to distinguish clean water from poisoned water via training differen…
▽ More
Water is a necessary fluid to the human body and automatic checking of its quality and cleanness is an ongoing area of research. One such approach is to present the liquid to various types of signals and make the amount of signal attenuation an indication of the liquid category. In this article, we have utilized the Wi-Fi signal to distinguish clean water from poisoned water via training different machine learning algorithms. The Wi-Fi access points (WAPs) signal is acquired via equivalent smartphone-embedded Wi-Fi chipsets, and then Channel-State-Information CSI measures are extracted and converted into feature vectors to be used as input for machine learning classification algorithms. The measured amplitude and phase of the CSI data are selected as input features into four classifiers k-NN, SVM, LSTM, and Ensemble. The experimental results show that the model is adequate to differentiate poison water from clean water with a classification accuracy of 89% when LSTM is applied, while 92% classification accuracy is achieved when the AdaBoost-Ensemble classifier is applied.
△ Less
Submitted 13 February, 2023;
originally announced February 2023.
-
Statistical-CSI-Based Antenna Selection and Precoding in Uplink MIMO
Authors:
Chongjun Ouyang,
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller,
Hongwen Yang
Abstract:
Classical antenna selection schemes require instantaneous channel state information (CSI). This leads to high signaling overhead in the system. This work proposes a novel joint receive antenna selection and precoding scheme for multiuser multiple-input multiple-output uplink transmission that relies only on the long-term statistics of the CSI. The proposed scheme designs the switching network and…
▽ More
Classical antenna selection schemes require instantaneous channel state information (CSI). This leads to high signaling overhead in the system. This work proposes a novel joint receive antenna selection and precoding scheme for multiuser multiple-input multiple-output uplink transmission that relies only on the long-term statistics of the CSI. The proposed scheme designs the switching network and the uplink precoders, such that the expected throughput of the system in the long term is maximized. Invoking results from the random matrix theory, we derive a closed-form expression for the expected throughput of the system. We then develop a tractable iterative algorithm to tackle the throughput maximization problem, capitalizing on the alternating optimization and majorization-maximization (MM) techniques. Numerical results substantiate the efficiency of the proposed approach and its superior performance as compared with the baseline.
△ Less
Submitted 27 December, 2022;
originally announced December 2022.
-
How to Coordinate Edge Devices for Over-the-Air Federated Learning?
Authors:
Mohammad Ali Sedaghat,
Ali Bereyhi,
Saba Asaad,
Ralf R. Mueller
Abstract:
This work studies the task of device coordination in wireless networks for over-the-air federated learning (OTA-FL). For conventional metrics of aggregation error, the task is shown to describe the zero-forcing (ZF) and minimum mean squared error (MMSE) schemes and reduces to the NP-hard problem of subset selection. We tackle this problem by studying properties of the optimal scheme. Our analytica…
▽ More
This work studies the task of device coordination in wireless networks for over-the-air federated learning (OTA-FL). For conventional metrics of aggregation error, the task is shown to describe the zero-forcing (ZF) and minimum mean squared error (MMSE) schemes and reduces to the NP-hard problem of subset selection. We tackle this problem by studying properties of the optimal scheme. Our analytical results reveal that this scheme is found by searching among the leaves of a tree with favorable monotonic features. Invoking these features, we develop a low-complexity algorithm that approximates the optimal scheme by tracking a dominant path of the tree sequentially. Our numerical investigations show that the proposed algorithm closely tracks the optimal scheme.
△ Less
Submitted 8 November, 2022; v1 submitted 7 November, 2022;
originally announced November 2022.
-
Matching Pursuit Based Scheduling for Over-the-Air Federated Learning
Authors:
Ali Bereyhi,
Adela Vagollari,
Saba Asaad,
Ralf R. Müller,
Wolfgang Gerstacker,
H. Vincent Poor
Abstract:
This paper develops a class of low-complexity device scheduling algorithms for over-the-air federated learning via the method of matching pursuit. The proposed scheme tracks closely the close-to-optimal performance achieved by difference-of-convex programming, and outperforms significantly the well-known benchmark algorithms based on convex relaxation. Compared to the state-of-the-art, the propose…
▽ More
This paper develops a class of low-complexity device scheduling algorithms for over-the-air federated learning via the method of matching pursuit. The proposed scheme tracks closely the close-to-optimal performance achieved by difference-of-convex programming, and outperforms significantly the well-known benchmark algorithms based on convex relaxation. Compared to the state-of-the-art, the proposed scheme poses a drastically lower computational load on the system: For $K$ devices and $N$ antennas at the parameter server, the benchmark complexity scales with $\left(N^2+K\right)^3 + N^6$ while the complexity of the proposed scheme scales with $K^p N^q$ for some $0 < p,q \leq 2$. The efficiency of the proposed scheme is confirmed via numerical experiments on the CIFAR-10 dataset.
△ Less
Submitted 12 October, 2022; v1 submitted 14 June, 2022;
originally announced June 2022.
-
How Should IRSs Scale to Harden Multi-Antenna Channels?
Authors:
Ali Bereyhi,
Saba Asaad,
Chongjun Ouyang,
Ralf R. Müller,
Rafael F. Schaefer,
H. Vincent Poor
Abstract:
This work extends the concept of channel hardening to multi-antenna systems that are aided by intelligent reflecting surfaces (IRSs). For fading links between a multi-antenna transmitter and a single-antenna receiver, we derive an accurate approximation for the distribution of the input-output mutual information when the number of reflecting elements grows large. The asymptotic results demonstrate…
▽ More
This work extends the concept of channel hardening to multi-antenna systems that are aided by intelligent reflecting surfaces (IRSs). For fading links between a multi-antenna transmitter and a single-antenna receiver, we derive an accurate approximation for the distribution of the input-output mutual information when the number of reflecting elements grows large. The asymptotic results demonstrate that by increasing the number of elements on the IRS, the end-to-end channel hardens as long as the physical dimensions of the IRS grow as well. The growth rate however need not to be of a specific order and can be significantly sub-linear. The validity of the analytical result is confirmed by numerical experiments.
△ Less
Submitted 31 May, 2022;
originally announced May 2022.
-
Channel Hardening of IRS-Aided Multi-Antenna Systems: How Should IRSs Scale?
Authors:
Ali Bereyhi,
Saba Asaad,
Chongjun Ouyang,
Ralf R. Müller,
Rafael F. Schaefer,
H. Vincent Poor
Abstract:
Unlike active array antennas, intelligent reflecting surfaces (IRSs) are efficiently implemented at large dimensions. This allows for traceable realizations of large-scale IRS-aided MIMO systems in which not necessarily the array antennas, but the passive IRSs are large. It is widely believed that large IRS-aided MIMO settings maintain the fundamental features of massive MIMO systems, and hence th…
▽ More
Unlike active array antennas, intelligent reflecting surfaces (IRSs) are efficiently implemented at large dimensions. This allows for traceable realizations of large-scale IRS-aided MIMO systems in which not necessarily the array antennas, but the passive IRSs are large. It is widely believed that large IRS-aided MIMO settings maintain the fundamental features of massive MIMO systems, and hence they are the implementationally feasible technology for establishing the performance of large-scale MIMO settings. This work gives a rigorous proof to this belief. We show that using a large passive IRS, the end-to-end MIMO channel between the transmitter and the receiver always hardens, even if the IRS elements are strongly correlated.
For the fading direct and reflection links between the transmitter and the receiver, our derivations demonstrate that as the number of IRS elements grows large, the capacity of end-to-end channel converges in distribution to a real-valued Gaussian random variable whose variance goes to zero. The order of this drop depends on how the physical dimensions of the IRS grow. We derive this order explicitly. Numerical experiments depict that the analytical asymptotic distribution almost perfectly matches the histogram of the capacity, even in practical scenarios.
As a sample application of the results, we use the asymptotic characterization to study the dimensional trade-off between the transmitter and the IRS. The result is intuitive: For a given target performance, the larger the IRS is, the less transmit antennas are required to achieve the target. For an arbitrary ergodic and outage performance, we characterize this trade-off analytically. Our investigations demonstrate that using a practical IRS size, the target performance can be achieved with significantly small end-to-end MIMO dimensions.
△ Less
Submitted 22 March, 2022;
originally announced March 2022.
-
On the Ergodic Mutual Information of Keyhole MIMO Channels With Finite-Alphabet Inputs
Authors:
Chongjun Ouyang,
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller,
Julian Cheng,
Hongwen Yang
Abstract:
This letter studies the ergodic mutual information (EMI) of keyhole multiple-input multiple-output channels having finite-alphabet input signals. The EMI is first investigated for single-stream transmission considering both cases with and without the channel state information at the transmitter. Then, the derived results are extended to the scenario of multi-stream transmission. Asymptotic analyse…
▽ More
This letter studies the ergodic mutual information (EMI) of keyhole multiple-input multiple-output channels having finite-alphabet input signals. The EMI is first investigated for single-stream transmission considering both cases with and without the channel state information at the transmitter. Then, the derived results are extended to the scenario of multi-stream transmission. Asymptotic analyses are performed in the regime of high signal-to-noise ratio (SNR). The high-SNR EMI is shown to converge to a constant with its rate of convergence determined by the diversity order. On this basis, the influence of the keyhole effect on the EMI is discussed. The analytical results are validated by numerical simulations.
△ Less
Submitted 8 September, 2022; v1 submitted 8 December, 2021;
originally announced December 2021.
-
Revenue Maximization through Cell Switching and Spectrum Leasing in 5G HetNets
Authors:
Attai Ibrahim Abubakar,
Cihat Ozturk,
Metin Ozturk,
Michael S. Mollel,
Syed Muhammad Asad,
Naveed Ul Hassan,
Sajjad Hussain,
MuhammadAli Imran
Abstract:
One of the ways of achieving improved capacity in mobile cellular networks is via network densification. Even though densification increases the capacity of the network, it also leads to increased energy consumption which can be curbed by dynamically switching off some base stations (BSs) during periods of low traffic. However, dynamic cell switching has the challenge of spectrum under-utilization…
▽ More
One of the ways of achieving improved capacity in mobile cellular networks is via network densification. Even though densification increases the capacity of the network, it also leads to increased energy consumption which can be curbed by dynamically switching off some base stations (BSs) during periods of low traffic. However, dynamic cell switching has the challenge of spectrum under-utilizationas the spectrum originally occupied by the BSs that are turned off remains dormant. This dormant spectrum can be leased by the primary network (PN) operators, who hold the license, to the secondary network (SN) operators who cannot afford to purchase the spectrum license. Thus enabling the PN to gain additional revenue from spectrum leasing as well as from electricity cost savings due to reduced energy consumption. Therefore, in this work, we propose a cell switching and spectrum leasing framework based on simulated annealing (SA) algorithm to maximize the revenue of the PN while respecting the quality-of-service constraints. The performance evaluation reveals that the proposed method is very close to optimal exhaustive search method with a significant reduction in the computation complexity.
△ Less
Submitted 26 August, 2021;
originally announced August 2021.
-
Designing IRS-Aided MIMO Systems for Secrecy Enhancement
Authors:
Saba Asaad,
Yifei Wu,
Ali Bereyhi,
Ralf R. Müller,
Rafael F. Schaefer,
H. Vincent Poor
Abstract:
Intelligent reflecting surfaces (IRSs) enable multiple-input multiple-output (MIMO) transmitters to modify the communication channels between the transmitters and receivers. In the presence of eavesdropping terminals, this degree of freedom can be used to effectively suppress the information leakage towards such malicious terminals. This leads to significant potential secrecy gains in IRS-aided MI…
▽ More
Intelligent reflecting surfaces (IRSs) enable multiple-input multiple-output (MIMO) transmitters to modify the communication channels between the transmitters and receivers. In the presence of eavesdropping terminals, this degree of freedom can be used to effectively suppress the information leakage towards such malicious terminals. This leads to significant potential secrecy gains in IRS-aided MIMO systems. This work exploits these gains via a tractable joint design of downlink beamformers and IRS phase-shifts. In this respect, we consider a generic IRS-aided MIMO wiretap setting and invoke fractional programming and alternating optimization techniques to iteratively find the beamformers and phase-shifts that maximize the achievable weighted secrecy sum-rate. Our design concludes two low-complexity algorithms for joint beamforming and phase-shift tuning. Performance of the proposed algorithms are numerically evaluated and compared to the benchmark. The results reveal that integrating IRSs into MIMO systems not only boosts the secrecy performance of the system, but also improves the robustness against passive eavesdropping.
△ Less
Submitted 2 February, 2022; v1 submitted 22 April, 2021;
originally announced April 2021.
-
Oversampled Adaptive Sensing via a Predefined Codebook
Authors:
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller
Abstract:
Oversampled adaptive sensing (OAS) is a Bayesian framework recently proposed for effective sensing of structured signals in a time-limited setting. In contrast to the conventional blind oversampling, OAS uses the prior information on the signal to construct posterior beliefs sequentially. These beliefs help in constructive oversampling which iteratively evolves through a sequence of time sub-frame…
▽ More
Oversampled adaptive sensing (OAS) is a Bayesian framework recently proposed for effective sensing of structured signals in a time-limited setting. In contrast to the conventional blind oversampling, OAS uses the prior information on the signal to construct posterior beliefs sequentially. These beliefs help in constructive oversampling which iteratively evolves through a sequence of time sub-frames.
The initial studies of OAS consider the idealistic assumption of full control on sensing coefficients which is not feasible in many applications. In this work, we extend the initial investigations on OAS to more realistic settings in which the sensing coefficients are selected from a predefined set of possible choices, referred to as the codebook. We extend the OAS framework to these settings and compare its performance with classical non-adaptive approaches.
△ Less
Submitted 26 February, 2021;
originally announced February 2021.
-
Detection of Spatially Modulated Signals via RLS: Theoretical Bounds and Applications
Authors:
Ali Bereyhi,
Saba Asaad,
Bernhard Gäde,
Ralf R. Müller,
H. Vincent Poor
Abstract:
This paper characterizes the performance of massive multiuser spatial modulation MIMO systems, when a regularized form of the least-squares method is used for detection. For a generic distortion function and right unitarily invariant channel matrices, the per-antenna transmit rate and the asymptotic distortion achieved by this class of detectors is derived. Invoking an asymptotic characterization,…
▽ More
This paper characterizes the performance of massive multiuser spatial modulation MIMO systems, when a regularized form of the least-squares method is used for detection. For a generic distortion function and right unitarily invariant channel matrices, the per-antenna transmit rate and the asymptotic distortion achieved by this class of detectors is derived. Invoking an asymptotic characterization, we address two particular applications. Namely, we derive the error rate achieved by the computationally-intractable optimal Bayesian detector, and we propose an efficient approach to tune a LASSO-type detector. We further validate our derivations through various numerical experiments.
△ Less
Submitted 16 November, 2020; v1 submitted 13 November, 2020;
originally announced November 2020.
-
Secure Transmission in IRS-Assisted MIMO Systems with Active Eavesdroppers
Authors:
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller,
Rafael F. Schaefer,
H. Vincent Poor
Abstract:
This work studies secure transmission in intelligent reflecting surfaces (IRS)-assisted MIMO systems when an active eavesdropper is available in the network. We consider a scenario in which the eavesdropper performs an active pilot attack to contaminate the channel estimation at the base station. Invoking the method of secure regularized zero forcing, we develop an algorithm that designs beamformi…
▽ More
This work studies secure transmission in intelligent reflecting surfaces (IRS)-assisted MIMO systems when an active eavesdropper is available in the network. We consider a scenario in which the eavesdropper performs an active pilot attack to contaminate the channel estimation at the base station. Invoking the method of secure regularized zero forcing, we develop an algorithm that designs beamforming vectors, as well as phase-shifts at the IRS, such that the active attacker is blinded. Our numerical investigations confirm that the proposed algorithm can suppress the active eavesdropper effectively, as long as legitimate and malicious terminals are statistically distinguishable.
△ Less
Submitted 15 October, 2020;
originally announced October 2020.
-
Automatic Signboard Detection and Localization in Densely Populated Developing Cities
Authors:
Md. Sadrul Islam Toaha,
Sakib Bin Asad,
Chowdhury Rafeed Rahman,
S. M. Shahriar Haque,
Mahfuz Ara Proma,
Md. Ahsan Habib Shuvo,
Tashin Ahmed,
Md. Amimul Basher
Abstract:
Most city establishments of developing cities are digitally unlabeled because of the lack of automatic annotation systems. Hence location and trajectory services such as Google Maps, Uber etc remain underutilized in such cities. Accurate signboard detection in natural scene images is the foremost task for error-free information retrieval from such city streets. Yet, developing accurate signboard l…
▽ More
Most city establishments of developing cities are digitally unlabeled because of the lack of automatic annotation systems. Hence location and trajectory services such as Google Maps, Uber etc remain underutilized in such cities. Accurate signboard detection in natural scene images is the foremost task for error-free information retrieval from such city streets. Yet, developing accurate signboard localization system is still an unresolved challenge because of its diverse appearances that include textual images and perplexing backgrounds. We present a novel object detection approach that can detect signboards automatically and is suitable for such cities. We use Faster R-CNN based localization by incorporating two specialized pretraining methods and a run time efficient hyperparameter value selection algorithm. We have taken an incremental approach in reaching our final proposed method through detailed evaluation and comparison with baselines using our constructed SVSO (Street View Signboard Objects) signboard dataset containing signboard natural scene images of six developing countries. We demonstrate state-of-the-art performance of our proposed method on both SVSO dataset and Open Image Dataset. Our proposed method can detect signboards accurately (even if the images contain multiple signboards with diverse shapes and colours in a noisy background) achieving 0.90 mAP (mean average precision) score on SVSO independent test set. Our implementation is available at: https://github.com/sadrultoaha/Signboard-Detection
△ Less
Submitted 22 August, 2022; v1 submitted 4 March, 2020;
originally announced March 2020.
-
Robustness of Low-Complexity Massive MIMO Architectures Against Passive Eavesdropping
Authors:
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller,
Rafael F. Schaefer,
Georg Fischer,
H. Vincent Poor
Abstract:
Invoking large transmit antenna arrays, massive MIMO wiretap settings are capable of suppressing passive eavesdroppers via narrow beamforming towards legitimate terminals. This implies that secrecy is obtained almost for free in these settings. We show that this property holds not only for fully digital MIMO architectures, but also in massive MIMO settings whose transmitters employ architectures w…
▽ More
Invoking large transmit antenna arrays, massive MIMO wiretap settings are capable of suppressing passive eavesdroppers via narrow beamforming towards legitimate terminals. This implies that secrecy is obtained almost for free in these settings. We show that this property holds not only for fully digital MIMO architectures, but also in massive MIMO settings whose transmitters employ architectures with reduced complexity. The investigations consider two dominant approaches for complexity reduction, namely antenna selection and hybrid analog-digital precoding. We show that using either approach, the information leakage normalized by the achievable sum-rate vanishes as the transmit array size grows large. For both approaches, the decaying speed is determined. The results demonstrate that, as the transmit array size grows large, the normalized leakages obtained by antenna selection and hybrid analog-digital precoding converge to zero double-logarithmically and logarithmically, respectively. These analytic derivations are confirmed for various benchmark architectures through numerical investigations.
△ Less
Submitted 5 December, 2019;
originally announced December 2019.
-
Secure Regularized Zero Forcing for Multiuser MIMOME Channels
Authors:
Saba Asaad,
Ali Bereyhi,
Ralf R. Müller,
Rafael F. Schaefer
Abstract:
This paper proposes a new linear precoding scheme for downlink transmission in MIMOME channels, referred to as secure regularized zero forcing. The scheme modifies regularized zero forcing precoding, such that the beamformers further suppress the information leakage towards the eavesdroppers. The proposed scheme is characterized in the large-system limit, and a closed-form expression for the achie…
▽ More
This paper proposes a new linear precoding scheme for downlink transmission in MIMOME channels, referred to as secure regularized zero forcing. The scheme modifies regularized zero forcing precoding, such that the beamformers further suppress the information leakage towards the eavesdroppers. The proposed scheme is characterized in the large-system limit, and a closed-form expression for the achievable ergodic secrecy rate per user is derived. Numerical investigations demonstrate high robustness against the quality of eavesdroppers' channel.
△ Less
Submitted 1 December, 2019;
originally announced December 2019.
-
Joint User Selection and Precoding in Multiuser MIMO Systems via Group LASSO
Authors:
Saba Asaad,
Ali Bereyhi,
Ralf R. Muller,
Rafael F. Schaefer
Abstract:
Joint user selection and precoding in multiuser MIMO settings can be interpreted as group sparse recovery in linear models. In this problem, a signal with group sparsity is to be reconstructed from an underdetermined system of equations. This paper utilizes this equivalent interpretation and develops a computationally tractable algorithm based on the method of group LASSO. Compared to the state of…
▽ More
Joint user selection and precoding in multiuser MIMO settings can be interpreted as group sparse recovery in linear models. In this problem, a signal with group sparsity is to be reconstructed from an underdetermined system of equations. This paper utilizes this equivalent interpretation and develops a computationally tractable algorithm based on the method of group LASSO. Compared to the state of the art, the proposed scheme shows performance enhancements in two different respects: higher achievable sum-rate and lower interference at the non-selected user terminals.
△ Less
Submitted 24 October, 2019;
originally announced October 2019.
-
RLS Precoding for Massive MIMO Systems with Nonlinear Front-End
Authors:
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller,
Symeon Chatzinotas
Abstract:
To keep massive MIMO systems cost-efficient, power amplifiers with rather small output dynamic ranges are employed. They may distort the transmit signal and degrade the performance. This paper proposes a distortion aware precoding scheme for realistic scenarios in which RF chains have nonlinear characteristics. The proposed scheme utilizes the method of regularized least-squares (RLS) to jointly c…
▽ More
To keep massive MIMO systems cost-efficient, power amplifiers with rather small output dynamic ranges are employed. They may distort the transmit signal and degrade the performance. This paper proposes a distortion aware precoding scheme for realistic scenarios in which RF chains have nonlinear characteristics. The proposed scheme utilizes the method of regularized least-squares (RLS) to jointly compensate the channel impacts and the distortion imposed by the RF chains.
To construct the designed transmit waveform with low computational complexity, an iterative algorithm based on approximate message passing is developed. This algorithm is shown to track the achievable average signal distortion of the proposed scheme tightly, even for practical system dimensions. The results demonstrate considerable enhancement compared to the state of the art.
△ Less
Submitted 13 May, 2019;
originally announced May 2019.
-
RLS-Based Detection for Massive Spatial Modulation MIMO
Authors:
Ali Bereyhi,
Saba Asaad,
Bernhard Gäde,
Ralf R. Müller
Abstract:
Most detection algorithms in spatial modulation (SM) are formulated as linear regression via the regularized least-squares (RLS) method. In this method, the transmit signal is estimated by minimizing the residual sum of squares penalized with some regularization. This paper studies the asymptotic performance of a generic RLS-based detection algorithm employed for recovery of SM signals. We derive…
▽ More
Most detection algorithms in spatial modulation (SM) are formulated as linear regression via the regularized least-squares (RLS) method. In this method, the transmit signal is estimated by minimizing the residual sum of squares penalized with some regularization. This paper studies the asymptotic performance of a generic RLS-based detection algorithm employed for recovery of SM signals. We derive analytically the asymptotic average mean squared error and the error rate for the class of bi-unitarily invariant channel matrices.
The analytic results are employed to study the performance of SM detection via the box-LASSO. The analysis demonstrates that the performance characterization for i.i.d. Gaussian channel matrices is valid for matrices with non-Gaussian entries, as well. This justifies the partially approved conjecture given in [1]. The derivations further extend the former studies to scenarios with non-i.i.d. channel matrices. Numerical investigations validate the analysis, even for practical system dimensions.
△ Less
Submitted 13 May, 2019;
originally announced May 2019.
-
A Fair Comparison Between Spatial Modulation and Antenna Selection in Massive MIMO Systems
Authors:
Bernhard Gäde,
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller
Abstract:
Both antenna selection and spatial modulation allow for low-complexity MIMO transmitters when the number of RF chains is much lower than the number of transmit antennas. In this manuscript, we present a quantitative performance comparison between these two approaches by taking into account implementational restrictions, such as antenna switching. We consider a band-limitedMIMO system, for which th…
▽ More
Both antenna selection and spatial modulation allow for low-complexity MIMO transmitters when the number of RF chains is much lower than the number of transmit antennas. In this manuscript, we present a quantitative performance comparison between these two approaches by taking into account implementational restrictions, such as antenna switching. We consider a band-limitedMIMO system, for which the pulse shape is designed, such that the outband emission satisfies a desired spectral mask. The bit error rate is determined for this system, considering antenna selection and spatial modulation. The results depict that for any array size at the transmit and receive sides, antenna selection outperforms spatial modulation, as long as the power efficiency is smaller than a certain threshold level. By passing this threshold, spatial modulation starts to perform superior. Our investigations show that the threshold takes smaller values, as the number of receive antennas grows large. This indicates that spatial modulation is an effective technique for uplink transmission in massive MIMO systems.
△ Less
Submitted 3 April, 2019;
originally announced April 2019.
-
On Robustness of Massive MIMO Systems Against Passive Eavesdropping under Antenna Selection
Authors:
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller,
Rafael F. Schaefer,
Amir M. Rabiei
Abstract:
In massive MIMO wiretap settings, the base station can significantly suppress eavesdroppers by narrow beamforming toward legitimate terminals. Numerical investigations show that by this approach, secrecy is obtained at no significant cost. We call this property of massive MIMO systems `secrecy for free' and show that it not only holds when all the transmit antennas at the base station are employed…
▽ More
In massive MIMO wiretap settings, the base station can significantly suppress eavesdroppers by narrow beamforming toward legitimate terminals. Numerical investigations show that by this approach, secrecy is obtained at no significant cost. We call this property of massive MIMO systems `secrecy for free' and show that it not only holds when all the transmit antennas at the base station are employed, but also when only a single antenna is set active. Using linear precoding, the information leakage to the eavesdroppers can be sufficiently diminished, when the total number of available transmit antennas at the base station grows large, even when only a fixed number of them are selected. This result indicates that passive eavesdropping has no significant impact on massive MIMO systems, regardless of the number of active transmit antennas.
△ Less
Submitted 14 August, 2018;
originally announced August 2018.
-
Iterative Antenna Selection for Secrecy Enhancement in Massive MIMO Wiretap Channels
Authors:
Ali Bereyhi,
Saba Asaad,
Rafael F. Schaefer,
Ralf R. Müller
Abstract:
The growth of interest in massive MIMO systems is accompanied with hardware cost and computational complexity. Antenna selection is an efficient approach to overcome this cost-plus-complexity issue which also enhances the secrecy performance in wiretap settings. Optimal antenna selection requires exhaustive search which is computationally infeasible for settings with large dimensions. This paper d…
▽ More
The growth of interest in massive MIMO systems is accompanied with hardware cost and computational complexity. Antenna selection is an efficient approach to overcome this cost-plus-complexity issue which also enhances the secrecy performance in wiretap settings. Optimal antenna selection requires exhaustive search which is computationally infeasible for settings with large dimensions. This paper develops an iterative algorithm for antenna selection in massive multiuser MIMO wiretap settings. The algorithm takes a stepwise approach to find a suitable subset of transmit antennas. Numerical investigations depict a significant enhancement in the secrecy performance.
△ Less
Submitted 30 May, 2018;
originally announced May 2018.
-
Optimal Transmit Antenna Selection for Massive MIMO Wiretap Channels
Authors:
Saba Asaad,
Ali Bereyhi,
Amir M. Rabiei,
Ralf R. Müller,
Rafael F. Schaefer
Abstract:
In this paper, we study the impacts of transmit antenna selection on the secrecy performance of massive MIMO systems. We consider a wiretap setting in which a fixed number of transmit antennas are selected and then confidential messages are transmitted over them to a multi-antenna legitimate receiver while being overheard by a multi-antenna eavesdropper. For this setup, we derive an accurate appro…
▽ More
In this paper, we study the impacts of transmit antenna selection on the secrecy performance of massive MIMO systems. We consider a wiretap setting in which a fixed number of transmit antennas are selected and then confidential messages are transmitted over them to a multi-antenna legitimate receiver while being overheard by a multi-antenna eavesdropper. For this setup, we derive an accurate approximation of the instantaneous secrecy rate. Using this approximation, it is shown that in some wiretap settings under antenna selection the growth in the number of active antennas enhances the secrecy performance of the system up to some optimal number and degrades it when this optimal number is surpassed. This observation demonstrates that antenna selection in some massive MIMO settings not only reduces the RF-complexity, but also enhances the secrecy performance. We then consider various scenarios and derive the optimal number of active antennas analytically using our large-system approximation. Numerical investigations show an accurate match between simulations and the analytic results.
△ Less
Submitted 4 March, 2018;
originally announced March 2018.
-
Stepwise Transmit Antenna Selection in Downlink Massive Multiuser MIMO
Authors:
Ali Bereyhi,
Saba Asaad,
Ralf R. Müller
Abstract:
Due to the large power consumption in RF-circuitry of massive MIMO systems, practically relevant performance measures such as energy efficiency or bandwidth efficiency are neither necessarily monotonous functions of the total transmit power nor the number of active antennas. Optimal antenna selection is however computationally infeasible in these systems. In this paper, we propose an iterative alg…
▽ More
Due to the large power consumption in RF-circuitry of massive MIMO systems, practically relevant performance measures such as energy efficiency or bandwidth efficiency are neither necessarily monotonous functions of the total transmit power nor the number of active antennas. Optimal antenna selection is however computationally infeasible in these systems. In this paper, we propose an iterative algorithm to optimize the transmit power and the subset of selected antennas subject to non-monotonous performance measures in massive multiuser MIMO settings. Numerical results are given for energy efficiency and demonstrate that for several settings the optimal number of selected antennas reported by the proposed algorithm is significantly smaller than the total number of transmit antennas. This fact indicates that antenna selection in several massive MIMO scenarios not only reduces the hardware complexity and RF-costs, but also enhances the energy efficiency of the system.
△ Less
Submitted 19 February, 2018; v1 submitted 14 February, 2018;
originally announced February 2018.
-
Optimal Number of Transmit Antennas for Secrecy Enhancement in Massive MIMOME Channels
Authors:
Saba Asaad,
Ali Bereyhi,
Ralf R. Müller,
Rafael F. Schaefer,
Amir M. Rabiei
Abstract:
This paper studies the impact of transmit antenna selection on the secrecy performance of massive MIMO wiretap channels. We consider a scenario in which a multi-antenna transmitter selects a subset of transmit antennas with the strongest channel gains. Confidential messages are then transmitted to a multi-antenna legitimate receiver while the channel is being overheard by a multi-antenna eavesdrop…
▽ More
This paper studies the impact of transmit antenna selection on the secrecy performance of massive MIMO wiretap channels. We consider a scenario in which a multi-antenna transmitter selects a subset of transmit antennas with the strongest channel gains. Confidential messages are then transmitted to a multi-antenna legitimate receiver while the channel is being overheard by a multi-antenna eavesdropper. For this setup, we approximate the distribution of the instantaneous secrecy rate in the large-system limit. The approximation enables us to investigate the optimal number of selected antennas which maximizes the asymptotic secrecy throughput of the system. We show that increasing the number of selected antennas enhances the secrecy performance of the system up to some optimal value, and that further growth in the number of selected antennas has a destructive effect. Using the large-system approximation, we obtain the optimal number of selected antennas analytically for various scenarios. Our numerical investigations show an accurate match between simulations and the analytic results even for not so large dimensions.
△ Less
Submitted 6 September, 2017;
originally announced September 2017.
-
Asymptotics of Transmit Antenna Selection: Impact of Multiple Receive Antennas
Authors:
Saba Asaad,
Ali Bereyhi,
Ralf R. Müller,
Amir M. Rabiei
Abstract:
Consider a fading Gaussian MIMO channel with $N_\mathrm{t}$ transmit and $N_\mathrm{r}$ receive antennas. The transmitter selects $L_\mathrm{t}$ antennas corresponding to the strongest channels. For this setup, we study the distribution of the input-output mutual information when $N_\mathrm{t}$ grows large. We show that, for any $N_\mathrm{r}$ and $L_\mathrm{t}$, the distribution of the input-outp…
▽ More
Consider a fading Gaussian MIMO channel with $N_\mathrm{t}$ transmit and $N_\mathrm{r}$ receive antennas. The transmitter selects $L_\mathrm{t}$ antennas corresponding to the strongest channels. For this setup, we study the distribution of the input-output mutual information when $N_\mathrm{t}$ grows large. We show that, for any $N_\mathrm{r}$ and $L_\mathrm{t}$, the distribution of the input-output mutual information is accurately approximated by a Gaussian distribution whose mean grows large and whose variance converges to zero. Our analysis depicts that, in the large limit, the gap between the expectation of the mutual information and its corresponding upper bound, derived by applying Jensen's inequality, converges to a constant which only depends on $N_\mathrm{r}$ and $L_\mathrm{t}$. The result extends the scope of channel hardening to the general case of antenna selection with multiple receive and selected transmit antennas. Although the analyses are given for the large-system limit, our numerical investigations indicate the robustness of the approximated distribution even when the number of antennas is not large.
△ Less
Submitted 27 April, 2017;
originally announced April 2017.
-
Asymptotic Performance Analysis of Spatially Reconfigurable Antenna Arrays
Authors:
Saba Asaad,
Ali Bereyhi,
Mohammad Ali Sedaghat,
Ralf R. Müller,
Amir M. Rabiei
Abstract:
A spatially reconfigurable antenna arrays consists of an antenna array of finite length and fixed geometry which is displaced within a given area. Using these reconfigurable components, the performance of MIMO systems is remarkably improved by effectively positioning the array in its displacement area. This paper studies the large-system performance of MIMO setups with spatially reconfigurable ant…
▽ More
A spatially reconfigurable antenna arrays consists of an antenna array of finite length and fixed geometry which is displaced within a given area. Using these reconfigurable components, the performance of MIMO systems is remarkably improved by effectively positioning the array in its displacement area. This paper studies the large-system performance of MIMO setups with spatially reconfigurable antenna arrays when the displacement area is large. Considering fading channels, the distribution of the input-output mutual information is derived, and the asymptotic hardening property is demonstrated to hold. As the size of the displacement area grows large, the mutual information is shown to converge in distribution to a type-one Gumbel random variable whose mean grows large proportional to the displacement size, and whose variance tends to zero. Our numerical investigations depict that the type-one Gumbel approximation closely tracks the empirical distribution even for a finite displacement size.
△ Less
Submitted 21 April, 2017;
originally announced April 2017.
-
Nonlinear Precoders for Massive MIMO Systems with General Constraints
Authors:
Ali Bereyhi,
Mohammad Ali Sedaghat,
Saba Asaad,
Ralf R. Müller
Abstract:
We introduce a class of nonlinear least square error precoders with a general penalty function for multiuser massive MIMO systems. The generality of the penalty function allows us to consider several hardware limitations including transmitters with a predefined constellation and restricted number of active antennas. The large-system performance is then investigated via the replica method under the…
▽ More
We introduce a class of nonlinear least square error precoders with a general penalty function for multiuser massive MIMO systems. The generality of the penalty function allows us to consider several hardware limitations including transmitters with a predefined constellation and restricted number of active antennas. The large-system performance is then investigated via the replica method under the assumption of replica symmetry. It is shown that the least square precoders exhibit the "marginal decoupling property" meaning that the marginal distributions of all precoded symbols converge to a deterministic distribution. As a result, the asymptotic performance of the precoders is described by an equivalent single-user system. To address some applications of the results, we further study the asymptotic performance of the precoders when both the peak-to-average power ratio and number of active transmit antennas are constrained. Our numerical investigations show that for a desired distortion at the receiver side, proposed forms of the least square precoders need to employ around %35\%$ fewer number of active antennas compared to cases with random transmit antenna selection.
△ Less
Submitted 21 April, 2017;
originally announced April 2017.