| 1. |
- Bokaei, Mohammad, et al.
(författare)
-
Harmonic retrieval using weighted lifted-structure low-rank matrix completion
- 2024
-
Ingår i: Signal Processing. - : Elsevier BV. - 0165-1684 .- 1872-7557. ; 216
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper, we investigate the problem of recovering the frequency components of a mixture of K complex sinusoids from a random subset of N equally-spaced time-domain samples. Because of the random subset, the samples are effectively non-uniform. Besides, the frequency values of each of the K complex sinusoids are assumed to vary continuously within a given range. For this problem, we propose a two-step strategy: (i) we first lift the incomplete set of uniform samples (unavailable samples are treated as missing data) into a structured matrix with missing entries, which is potentially low-rank; then (ii) we complete the matrix using a weighted nuclear minimization problem. We call the method a weighted lifted-structured (WLi) low-rank matrix recovery. Our approach can be applied to a range of matrix structures such as Hankel and double-Hankel, among others, and provides improvement over the unweighted existing schemes such as EMaC and DEMaC. We provide theoretical guarantees for the proposed method, as well as numerical simulations in both noiseless and noisy settings. Both the theoretical and the numerical results confirm the superiority of the proposed approach.
|
|
| 2. |
- Daei, Sajad, et al.
(författare)
-
Blind Asynchronous Goal-Oriented Detection for Massive Connectivity
- 2023
-
Ingår i: 2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2023. - : Institute of Electrical and Electronics Engineers Inc.. ; , s. 167-174
-
Konferensbidrag (refereegranskat)abstract
- Resource allocation and multiple access schemes are instrumental for the success of communication networks, which facilitate seamless wireless connectivity among a growing population of uncoordinated and non-synchronized users. In this paper, we present a novel random access scheme that addresses one of the most severe barriers of current strategies to achieve massive connectivity and ultra reliable and low latency communications for 6G. The proposed scheme utilizes wireless channels’ angular continuous group-sparsity feature to provide low latency, high reliability, and massive access features in the face of limited time-bandwidth resources, asynchronous transmissions, and preamble errors. Specifically, a reconstruction-free goal oriented optimization problem is proposed which preserves the angular information of active devices and is then complemented by a clustering algorithm to assign active users to specific groups. This allows to identify active stationary devices according to their line of sight angles. Additionally, for mobile devices, an alternating minimization algorithm is proposed to recover their preamble, data, and channel gains simultaneously, enabling the identification of active mobile users. Simulation results show that the proposed algorithm provides excellent performance and supports a massive number of devices. Moreover, the performance of the proposed scheme is independent of the total number of devices, distinguishing it from other random access schemes. The proposed method provides a unified solution to meet the requirements of machine-type communications and ultra reliable and low latency communications, making it an important contribution to the emerging 6G networks.
|
|
| 3. |
- Hellström, Henrik, et al.
(författare)
-
Optimal Receive Filter Design for Misaligned Over-the-Air Computation
- 2023
-
Ingår i: 2023 IEEE Globecom Workshops, GC Wkshps 2023. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 1529-1535
-
Konferensbidrag (refereegranskat)abstract
- Over-the-air computation (AirComp) is a promising wireless communication method for aggregating data from many devices in dense wireless networks. The fundamental idea of AirComp is to exploit signal superposition to compute functions of multiple simultaneously transmitted signals. However, the time-and phase-alignment of these superimposed signals have a significant effect on the quality of function computation. In this study, we analyze the AirComp problem for a system with unknown random time delays and phase shifts. We show that the classical matched filter does not produce optimal results, and generates bias in the function estimates. To counteract this, we propose a new filter design and show that, under a bound on the maximum time delay, it is possible to achieve unbiased function computation. Additionally, we propose a Tikhonov regularization problem that produces an optimal filter given a tradeoff between the bias and noise-induced variance of the function estimates. When the time delays are long compared to the length of the transmitted pulses, our filter vastly outperforms the matched filter both in terms of bias and mean-squared error (MSE). For shorter time delays, our proposal yields similar MSE as the matched filter, while reducing the bias.
|
|
| 4. |
- Razavikia, Saeed, et al.
(författare)
-
Blind Asynchronous Over-the-Air Federated Edge Learning
- 2022
-
Ingår i: 2022 IEEE GLOBECOM Workshops, GC Wkshps 2022. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 1834-1839
-
Konferensbidrag (refereegranskat)abstract
- Federated Edge Learning (FEEL) is a distributed machine learning technique where each device contributes to training a global inference model by independently performing local computations with their data. More recently, FEEL has been merged with over-the-air computation (OAC), where the global model is calculated over the air by leveraging the superposition of analog signals. However, when implementing FEEL with OAC, there is the challenge on how to precode the analog signals to overcome any time misalignment at the receiver. In this work, we propose a novel synchronization-free method to recover the parameters of the global model over the air without requiring any prior information about the time misalignments. For that, we construct a convex optimization based on the norm minimization problem to directly recover the global model by solving a convex semi-definite program. The performance of the proposed method is evaluated in terms of accuracy and convergence via numerical experiments. We show that our proposed algorithm is close to the ideal synchronized scenario by 10%, and performs 4times better than the simple case where no recovering method is used.
|
|
| 5. |
- Razavikia, Saeed, et al.
(författare)
-
Blind Federated Learning via Over-the-Air q-QAM
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- In this work, we investigate federated edge learning over a fading multiple access channel. To alleviate the communication burden between the edge devices and the access point, we introduce a pioneering digital over-the-air computation strategy employing q-ary quadrature amplitude modulation, culminating in a low latency communication scheme. Indeed, we propose a new federated edge learning framework in which edge devices use digital modulation for over-the-air uplink transmission to the edge server while they have no access to the channel state information. Furthermore, we incorporate multiple antennas at the edge server to overcome the fading inherent in wireless communication. We analyze the number of antennas required to mitigate the fading impact effectively. We prove a non-asymptotic upper bound for the mean squared error for the proposed federated learning with digital over-the-air uplink transmissions under both noisy and fading conditions. Leveraging the derived upper bound, we characterize the convergence rate of the learning process of a non-convex loss function in terms of the mean square error of gradients due to the fading channel. Furthermore, we substantiate the theoretical assurances through numerical experiments concerning mean square error and the convergence efficacy of the digital federated edge learning framework. Notably, the results demonstrate that augmenting the number of antennas at the edge server and adopting higher-order modulations improve the model accuracy up to $60\%$.
|
|
| 6. |
|
|
| 7. |
- Razavikia, Saeed, et al.
(författare)
-
ChannelComp : A General Method for Computation by Communications
- 2024
-
Ingår i: IEEE Transactions on Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 0090-6778 .- 1558-0857. ; 72:2, s. 692-706
-
Tidskriftsartikel (refereegranskat)abstract
- Over-the-air computation (AirComp) is a well-known technique by which several wireless devices transmit by analog amplitude modulation to achieve a sum of their transmit signals at a common receiver. The underlying physical principle is the superposition property of the radio waves. Since such superposition is analog and in amplitude, it is natural that AirComp uses analog amplitude modulations. Unfortunately, this is impractical because most wireless devices today use digital modulations. It would be highly desirable to use digital communications because of their numerous benefits, such as error correction, synchronization, acquisition of channel state information, and widespread use. However, when we use digital modulations for AirComp, a general belief is that the superposition property of the radio waves returns a meaningless overlapping of the digital signals. In this paper, we break through such beliefs and propose an entirely new digital channel computing method named ChannelComp, which can use digital as well as analog modulations. We propose a feasibility optimization problem that ascertains the optimal modulation for computing arbitrary functions over-the-air. Additionally, we propose pre-coders to adapt existing digital modulation schemes for computing the function over the multiple access channel. The simulation results verify the superior performance of ChannelComp compared to AirComp, particularly for the product functions, with more than 10 dB improvement of the computation error.
|
|
| 8. |
- Razavikia, Saeed
(författare)
-
ChannelComp : A general framework for computing by digital communication
- 2023
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The imminent Internet of Things, fueled by 6G networks and machine learning technologies, is set to shift wireless communication to machine-centric paradigms, revolutionizing sectors such as healthcare or industrial automation through efficient data handling. However, this connectivity boom poses challenges, including straining existing communication systems due to increased data traffic and computational demands.Over-the-air computation (OAC) presents a feasible solution, allowing the summation of transmitted signals at a common receiver through analog amplitude modulation. Designed to enable concurrent data collection and computation at the network edge, OAC seeks to lessen the central system burden, reducing latency and energy usage while enabling real-time analytics. This approach is particularly beneficial for federated learning, a machine learning technique that operates across decentralized devices. However, OAC's dependence on analog communication poses notable challenges, including signal distortion during transmission and the limited availability of devices supporting analog modulations. Digital modulation is a preferable alternative, recognized for its excellent channel correction capabilities and broad acceptance in modern wireless devices. Nevertheless, its integration into OAC is perceived as a significant hurdle, with overlapping digitally modulated signals threatening the fundamental concept of simultaneous data collection and computation.The first part of the thesis provides an overview of communication systems, specifically focusing on the relevant OAC methodologies for analog and digital parts and their application in ML, particularly in training federated learning models. Subsequently, an exhaustive literature review concerning analog OAC techniques is undertaken, identifying existing limitations within this domain. The central thrust of our research is then introduced, proposing an innovative digital OAC approach along with a fresh perspective on the communication systems models designed for executing the computation. The chapter concludes with a summary of the principal contributions of each paper included within the thesis.In the second part, we introduce ChannelComp, a groundbreaking computing approach compatible with current digital communication systems, including smartphones and IoT devices. A detailed analysis of ChannelComp's functions reveals how it enables digital modulation schemes to perform computations, addressing a critical gap in previous research. Moreover, introducing pre-coders designed for function computation over the multiple access channel, combined with a feasibility optimization problem framework, allows for seamless integration with current systems. Compared to OAC, restricted to analog modulations, ChannelComp exhibits broader computational capabilities and adherence to strict computation time constraints, thus showcasing its robust potential for future massive machine-type communications. This innovative method signifies a promising direction toward sustainable and efficient future wireless communication.
|
|
| 9. |
- Razavikia, Saeed, et al.
(författare)
-
Computing Functions Over-the-Air Using Digital Modulations
- 2023
-
Ingår i: ICC 2023. - : Institute of Electrical and Electronics Engineers Inc.. ; , s. 5780-5786
-
Konferensbidrag (refereegranskat)abstract
- Over-the-air computation (AirComp) is a known technique in which wireless devices transmit values by analog amplitude modulation so that a function of these values is computed over the communication channel at a common receiver. The physical reason is the superposition properties of the electromagnetic waves, which naturally return sums of analog values. Consequently, the applications of AirComp are almost entirely restricted to analog communication systems. However, the use of digital communications for over-the-air computations would have several benefits, such as error correction, synchronization, acquisition of channel state information, and easier adoption by current digital communication systems. Nevertheless, a common belief is that digital modulations are generally unfeasible for computation tasks because the overlapping of digitally modulated signals returns signals that seem to be meaningless for these tasks. This paper breaks through such a belief and proposes a fundamentally new computing method, named ChannelComp, for performing over-the-air computations by any digital modulation. In particular, we propose digital modulation formats that allow us to compute a wider class of functions than AirComp can compute, and we propose a feasibility optimization problem that ascertains the optimal digital modulation for computing functions over-the-air. The simulation results verify the superior performance of ChannelComp in comparison to AirComp, particularly for the product functions, with around 10 dB improvement of the computation error.
|
|
| 10. |
- Razavikia, Saeed, et al.
(författare)
-
Off-the-grid Blind Deconvolution and Demixing
- 2023
-
Ingår i: GLOBECOM 2023 - 2023 IEEE Global Communications Conference. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 7604-7610
-
Konferensbidrag (refereegranskat)abstract
- We consider the problem of gridless blind deconvolution and demixing (GB2D) in scenarios where multiple users communicate messages through multiple unknown channels, and a single base station (BS) collects their contributions. This scenario arises in various communication fields, including wireless communications, the Internet of Things, over-the-air computation, and integrated sensing and communications. In this setup, each user's message is convolved with a multi-path channel formed by several scaled and delayed copies of Dirac spikes. The BS receives a linear combination of the convolved signals, and the goal is to recover the unknown amplitudes, continuous-indexed delays, and transmitted waveforms from a compressed vector of measurements at the BS. However, without prior knowledge of the transmitted messages and channels, GB2D is highly challenging and intractable in general. To address this issue, we assume that each user's message follows a distinct modulation scheme living in a known low-dimensional subspace. By exploiting these subspace assumptions and the sparsity of the multipath channels for different users, we transform the nonlinear GB2D problem into a matrix tuple recovery problem from a few linear measurements. To achieve this, we propose a semidefinite programming optimization that exploits the specific low-dimensional structure of the matrix tuple to recover the messages and continuous delays of different communication paths from a single received signal at the BS. Finally, our numerical experiments show that our proposed method effectively recovers all transmitted messages and the continuous delay parameters of the channels with sufficient samples.
|
|
