Federated learning (FL) has emerged as an instance of distributed machine learning paradigm that avoids the transmission of data generated on the users' side. Although data are not transmitted, edge devices have to deal with limited communication bandwidths, data heterogeneity, and straggler effects due to the limited computational resources of users' devices. A prominent approach to overcome such difficulties is FedADMM, which is based on the classical two-operator consensus alternating direction method of multipliers (ADMM). The common assumption of FL algorithms, including FedADMM, is that they learn a global model using data only on the users' side and not on the edge server. However, in edge learning, the server is expected to be near the base station and have direct access to rich datasets. In this paper, we argue that leveraging the rich data on the edge server is much more beneficial than utilizing only user datasets. Specifically, we show that the mere application of FL with an additional virtual user node representing the data on the edge server is inefficient. We propose FedTOP-ADMM, which generalizes FedADMM and is based on a three-operator ADMM-type technique that exploits a smooth cost function on the edge server to learn a global model parallel to the edge devices. Our numerical experiments indicate that FedTOP-ADMM has substantial gain up to 33% in communication efficiency to reach a desired test accuracy with respect to FedADMM, including a virtual user on the edge server.

Although signal distortion-based peak-to-average power ratio (PAPR) reduction is a feasible candidate for orthogonal frequency division multiplexing (OFDM) to meet standard/regulatory requirements, the error vector magnitude (EVM) stemming from the PAPR reduction has a deleterious impact on the performance of high data-rate achieving multiple-input multiple-output (MIMO) systems. Moreover, these systems must constrain the adjacent channel leakage ratio (ACLR) to comply with regulatory requirements. Several recent works have investigated the mitigation of the EVM seen at the receivers by capitalizing on the excess spatial dimensions inherent in the large-scale MIMO that assume the availability of perfect channel state information (CSI) with spatially uncorrelated wireless channels. Unfortunately, practical systems operate with erroneous CSI and spatially correlated channels. Additionally, most standards support user-specific/CSI-aware beamformed and cell-specific/non-CSI-aware broadcasting channels. Hence, we formulate a robust EVM mitigation problem under channel uncertainty with nonconvex PAPR and ACLR constraints catering to beamforming/broadcasting. To solve this formidable problem, we develop an efficient scheme using our recently proposed three-operator alternating direction method of multipliers (TOP-ADMM) algorithm and benchmark it against two three-operator algorithms previously presented for machine learning purposes. Numerical results show the efficacy of the proposed algorithm under imperfect CSI and spatially correlated channels.

Although spectral precoding is a propitious technique to suppress out-of-band emissions, it has a detrimental impact on the system-wide throughput performance, notably, in high data-rate multiple-input multiple-output (MIMO) systems with orthogonal frequency division multiplexing (OFDM), because of (spatially-coloured) transmit error vector magnitude (TxEVM) emanating from spectral precoding. The first contribution of this paper is to propose two mask-compliant spectral precoding schemes, which mitigate the resulting TxEVM seen at the receiver by capitalizing on the immanent degrees-of-freedom in (massive) MIMO systems and consequently improve the system-wide throughput. Our second contribution is an introduction to a new and simple three-operator consensus alternating direction method of multipliers (ADMM) algorithm, referred to as TOP-ADMM, which decomposes a large-scale problem into easy-to-solve subproblems. We employ the proposed TOP-ADMM-based algorithm to solve the spectral precoding problems, which offer computational efficiency. Our third contribution presents substantial numerical results by using an NR release 15 compliant simulator. In case of perfect channel knowledge at the transmitter, the proposed methods render similar block error rate and throughput performance as without spectral precoding yet meeting out-of-band emission (OOBE) requirements at the transmitter. Further, no loss on the OOBE performance with a graceful degradation on the throughput is observed under channel uncertainty.

Spectral precoding is a promising technique to suppress out-of-band emissions and comply with leakage constraints over adjacent frequency channels and with mask requirements on the unwanted emissions. However, spectral precoding may distort the original data vector, which is formally expressed as the error vector magnitude (EVM) between the precoded and original data vectors. Notably, EVM has a deleterious impact on the performance of multiple-input multiple-output orthogonal frequency division multiplexing-based systems. In this paper we propose a novel spectral precoding approach which constrains the EVM while complying with the mask requirements. We first formulate and solve the EVM-unconstrained mask-compliant spectral precoding problem, which serves as a springboard to the design of two EVM-constrained spectral precoding schemes. The first scheme takes into account a wideband EVM-constraint which limits the average in-band distortion. The second scheme takes into account frequency-selective EVM-constraints, and consequently, limits the signal distortion at the subcarrier level. Numerical examples illustrate that both proposed schemes outperform previously developed schemes in terms of important performance indicators such as block error rate and system-wide throughput while complying with spectral mask and EVM constraints.

This paper deals with a distortion-based non-convex peak-to-average power ratio (PAPR) problem for large-scale multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. Our work is motivated by the observation that the distortion stemming from the PAPR reduction schemes has a deleterious impact on the data rates of MIMO-OFDM systems. Recently, some approaches have been proposed to either null or mitigate such distortion seen at the receiver(s) side by exploiting the extra degrees of freedom when the downlink channel is perfectly known at the transmitter. Unfortunately, most of these proposed methods are not robust against channel uncertainty, since perfect channel knowledge is practically infeasible at the transmitter. Although some recent works utilize semidefinite programming to cope with channel uncertainty and non-convex PAPR problem, they have formidable computational complexity. Additionally, some prior-art techniques tackle the non-convex PAPR problem by minimizing the peak power, which renders a suboptimal solution. In this work, we showcase the application of powerful first-order optimization schemes, namely the three-operator alternating direction method of multipliers (ADMM)-type techniques, notably 1) three-operator ADMM, 2) Bregman ADMM, and 3) Davis-Yin splitting, to solve the non-convex and robust PAPR problem, yielding a near-optimal solution in a computationally efficient manner.

This paper proposes a new large-scale mask compliant spectral precoder (LS-MSP) for orthogonal frequency division multiplexing systems. In this paper, we first consider a previously proposed mask-compliant spectral precoding scheme that utilizes a generic convex optimization solver which suffers from high computational complexity, notably in large-scale systems. To mitigate the complexity of computing the LS-MSP, we propose a divide-and-conquer approach that breaks the original problem into smaller rank 1 quadratic-constraint problems and each small problem yields closed-form solution. Based on these solutions, we develop three specialized first-order low-complexity algorithms, based on 1) projection on convex sets and 2) the alternating direction method of multipliers. We also develop an algorithm that capitalizes on the closed-form solutions for the rank 1 quadratic constraints, which is referred to as 3) semianalytical spectral precoding. Numerical results show that the proposed LS-MSP techniques outperform previously proposed techniques in terms of the computational burden while complying with the spectrum mask. The results also indicate that 3) typically needs 3 iterations to achieve similar results as 1) and 2) at the expense of a slightly increased computational complexity.