Search

Cell-free massive multiple-input multiple-output (mMIMO) systems are an alternative topology for mMIMO deployment, wherein a large number of access points are distributed over the coverage area to jointly serve users. Linear precoding methods such as zero-forcing are sufficient to achieve near-optimal performance in mMIMO systems. However, a key challenge in implementing these precoders can be a channel matrix inversion operation, which results in significant computational complexity in systems with large-scale antenna arrays. Hence, instead of direct matrix inversion, we examine several iterative methods to calculate the precoding matrix in a cell-free mMIMO system. We investigate their computational complexity and convergence rate in the presence of small- and large-scale fading and spatial correlation between antennas. Notably, we demonstrate that some iterative methods previously proposed for conventional (co-located) mMIMO do not always converge for cell-free mMIMO. Our main focus is the hyper-power iterative inversion method, which can be applied to both matrix inverses and pseudoinverses with guaranteed convergence; its factorized version also reduces its computational complexity. Although the hyper-power method does not reduce the complexity compared to direct matrix inversion, it converges quickly with high accuracy and strong numerical stability, and is conducive to parallel computation. These qualities make it a good candidate for matrix inversion in cell-free mMIMO system precoders. [ABSTRACT FROM AUTHOR]

In this paper, a joint design of sparse code multiple access (SCMA) codebook and peak-to-average power ratio (PAPR) reduction based on the partial transmit sequence (PTS) technique is proposed for the downlink orthogonal frequency division multiplexing (OFDM) scheme. A benchmark scheme is firstly devised based on a direct extension of the conventional PTS-based OFDM scheme. Based on the characteristics of the near-optimal SCMA codebook designs reported in our previous work, a PTS-based SCMA-OFDM design is proposed by carefully determining the rotation angles of the SCMA codebooks, according to the adopted signal sub-constellations. A receiver which does not need the side information is further devised. Considering the phase ambiguity issue of the receiver, the PTS angles have been carefully refined. When compared to both the original scheme that does not consider PAPR reduction techniques and the benchmark scheme, the proposed scheme achieves a significantly enhanced PAPR performance with approximately the same error performance. In addition, a comparable PAPR performance, an improved error performance, and a lower computational complexity can be achieved when compared to the clipping-based SCMA-OFDM scheme reported in the previous literature. [ABSTRACT FROM AUTHOR]

Dual-functional radar-communication (DFRC) has been viewed as a promising component in future networks. The considered two-cell interfering DFRC network involves two multi-antenna base stations (BSs), and each BS serves multiple single-antenna users and receives echo signals to detect the target. An optimization framework for the joint transmit beamforming and receive filters design of a coordinated two-cell network is formulated. Specifically, we minimize the transmit power at two BSs subject to the signal-to-interference-and-noise ratio constraints. To solve the formulated non-convex optimization problem, an alternating optimization-based method is invoked. For the transmit beamforming design, a locally optimal successive inner convex approximation (SICA)-based method with fast convergence is firstly proposed. To further reduce the computational complexity, we also provide three zero-forcing (ZF)-based sub-optimal methods for practical consideration. For the receive filters design, a power iterations-based method is proposed. Simulation results validate the effectiveness of our proposed SICA-based locally optimal and ZF-based sub-optimal schemes. [ABSTRACT FROM AUTHOR]

Radar-embedded communication (REC) is a new type of covert communication whereby communication signals are embedded in radar backscattered echoes. Conventional REC waveform design strategies generally involve transforming the radar sampling sequence into a square matrix that can be eigenvalue decomposed; however, it may lose some original characteristics of the radar signal during this process. In this paper, we propose two REC waveform design methods based on singular value decomposition (SVD), namely, SVD-NDP (non-dominant-processing waveform based on SVD) and SVD-SNDP (shaped-non-dominant-processing waveform based on SVD), and derive the similarities between the radar signal and the proposed waveforms. We then simulate the anti-detection performance, anti-interception performance, and communication reliability of the proposed waveforms and analyze the degrees of freedom and computational complexity of their design. The results show that, compared with conventional REC waveforms, the proposed waveforms could improve communication reliability without sacrificing low probability of intercept (LPI) performance and at least double the design degrees of freedom. SVD-NDP and SVD-SNDP algorithms can reduce computational complexity by more than 30% compared with conventional waveform design algorithms based on eigenvalue decomposition when the number of communication waveforms (symbols) is set to 4 (2 bits), and the proportion of the dominant subspace is set to 50%. [ABSTRACT FROM AUTHOR]

The next-generation wireless network is expected to be highly dense with a large number of heterogeneous Internet of Things (IoT) devices, working in co-operation with various Small Cell Access Points (SAPs) and Fog Servers (FSs) underlying cellular 5G infrastructure, altogether. The densely deployed 5G architecture is expected to fulfill the IoT's growing data demand in a feasible computational complexity. In this work, the resource provisioning mechanism in a heterogeneous 5G network is formulated to maximize the overall benefit of SAPs by selecting the most appropriate FSs for offloading the set of IoT tasks, as an NP-hard problem. Moreover, a Restricted Three-sided Matching with Size and Cyclic (R-TMSC) preference model is implemented to obtain a stable solution among IoTs, SAPs, and FSs underlying cellular 5G networks. Furthermore, the effectiveness of the proposed heuristic is shown through theoretical, experimental, and real-world data analysis. [ABSTRACT FROM AUTHOR]

A novel permuted fast successive-cancellation list decoding algorithm with fast Hadamard transform (FHT-FSCL) is presented. The proposed decoder initializes $L$ $(L\geq 1)$ active decoding paths with $L$ random codeword permutations sampled from the full symmetry group of the codes. The path extension in the permutation domain is carried out until the first constituent RM code of order 1 is visited. Conventional path extension of the successive-cancellation list decoder is then utilized in the information bit domain. The simulation results show that for a RM code of length 512 with 46 information bits, by running 20 parallel permuted FHT-FSCL decoders with $L=4$ , we reduce 72% of the computational complexity, 22% of the decoding latency, and 84% of the memory consumption of the state-of-the-art simplified successive-cancellation decoder that uses 512 permutations sampled from the full symmetry group of the code, with similar error-correction performance at the target frame error rate of $10^{-4}$. [ABSTRACT FROM AUTHOR]

This paper tackles the joint user association (UA) and power control (PC) problem for dynamic heterogeneous networks (HetNets), where the number of active users varies over time. Since the joint UA and PC problem is a mixed-integer problem, it is challenging to develop a joint UA and PC algorithm that closely achieves the optimal proportional fairness (PF) performance while satisfying the tight computation time budget of recent 3GPP standards. Although previous studies have reduced the computation time on the UA and PC by employing a fully-connected-neural network (FCN), the FCN architecture is not generally applicable to dynamic HetNets because of a varying number of users. In pursuit of scalable neural network design, we propose an unsupervised learning-based UA and PC algorithm using a recurrent neural network (RNN). Notably, in the RNN-based UA, we relax the combinatorial UA variable into a low-dimensional continuous variable, the length of which is invariant to the number of users. The optimality loss in the variable relaxation is upper-bounded by the negligibly small duality gap. Through extensive experiments, we show that the proposed scheme has a 10% higher PF performance than conventional optimization-based methods with the same number of flops and closely achieves the optimal PF performance for various numbers of users. [ABSTRACT FROM AUTHOR]

The paper presents several novel residual recurrent neural network (RNN) models for digital predistortion of radio-frequency power amplifiers. Then, unstructured and structured neural network (NN) pruning algorithms are proposed to reduce the per-sample computational complexity and the required memory, without compromising their modeling performance. The mathematical equations of the complexity and the memory are derived to analyze the hardware cost and design low cost models. An experimental platform is developed to measure the modeling performance in terms of adjacent channel leakage ratio (ACLR), normalized mean square error, error vector magnitude (EVM) and bit error rate. The platform uses an envelope tracking PA excited by 80 MHz IEEE 802.11ac signals. Compared with the state-of-the-art RNN model in (Sun et al., 2019), the proposed models reduce the per-sample complexity and required memory by $94\hbox{--}99$ %, they also improve the ACLR and EVM by at least 3 dB and 1 dB at 0.45 dB and 3.15 dB gain compression, respectively. Furthermore, an observation path with time alignment is used to remove the transmit latency in the state-of-the-art approach. At 3.15 dB gain compression, the proposed models outperform the state-of-the-art feedforward and convolutional NN models by at least 1.3 dB in EVM, outperform the general memory polynomial model by at least 3.3 dB in EVM. The above evidences indicate that the proposed RNN models can be implemented with relatively low hardware cost and achieve the best EVM in high power efficiency scenario. [ABSTRACT FROM AUTHOR]

The efficiency of link adaptation in wireless communications relies greatly on the accuracy of channel knowledge and transmission mode selection. In this paper, a novel deep learning based link adaptation framework is proposed for the orthogonal frequency-division multiplexing (OFDM) systems with compressed-sensing-assisted index modulation, termed as OFDM-CSIM, communicating over millimeter-wave (mmWave) channels. To achieve link adaptation, a novel multi-layer sparse Bayesian learning (SBL) algorithm is proposed for accurately and instantaneously providing the required channel state information. Meanwhile, a deep neural networks (DNN)-assisted adaptive modulation algorithm is proposed to choose the best possible transmission mode to maximize the achievable throughput. Simulation results show that the proposed multi-layer SBL algorithm enables more accurate channel estimation than the conventional techniques. The DNN-based adaptive modulator is capable of achieving a higher throughput than the learning-assisted solution based on the $k$ nearest neighbor ($k$ -NN) algorithm, and also the classic average signal-to-noise ratio (SNR)-based solutions. Moreover, analysis shows that both the multi-layer SBL algorithm and the DNN-assisted adaptive modulator achieve better performance than their respective conventional counterparts while at a significantly lower computational complexity cost. [ABSTRACT FROM AUTHOR]

This paper studies a secure multiuser multiple-input single-output (MISO) communication system aided by an intelligent reflecting surface (IRS), where multiple colluding eavesdroppers (EVEs) coexist. We aim to maximize the sum secrecy rate (SSR) via jointly optimizing the beamforming vectors, the artificial noise (AN) and the phase shifts at the IRS subject to the maximum transmit power constraint and unit modulus constraints. To address the non-convex optimization problem, we first propose an alternating optimization (AO) algorithm based on semidefinite relaxation (SDR) and obtain a high-quality sub-optimal solution. In order to reduce the high computational complexity, a low-complexity alternating optimization (LC-AO) algorithm is developed, in which the beamforming vectors, AN and the IRS phase shifts are optimized alternately by the generalized power iteration (GPI) and the Riemannian manifold conjugate gradient (RMCG) algorithm, respectively. Simulation results show the advantages of deploying the IRS in improving the system secrecy performance. [ABSTRACT FROM AUTHOR]

Grant-free non-orthogonal multiple access (NOMA) scheme is considered as a promising candidate for the enabling of massive connectivity and reduced signalling overhead for Internet of Things (IoT) applications in massive machine-type communication (mMTC) networks. Exploiting the inherent nature of sporadic transmissions in the grant-free NOMA systems, compressed sensing based multiuser detection (CS-MUD) has been deemed as a powerful solution to user activity detection (UAD) and data detection (DD). In this paper, block coordinate descend (BCD) method is employed in CS-MUD to reduce the computational complexity. We propose two modified BCD based algorithms, called enhanced BCD (EBCD) and complexity reduction enhanced BCD (CR-EBCD), respectively. To be specific, by incorporating a novel candidate set pruning mechanism into the original BCD framework, our proposed EBCD algorithm achieves remarkable CS-MUD performance improvement. In addition, the proposed CR-EBCD algorithm further ameliorates the proposed EBCD by eliminating the redundant matrix multiplications during the iteration process. As a consequence, compared with the proposed EBCD algorithm, our proposed CR-EBCD algorithm enjoys two orders of magnitude complexity saving without any CS-MUD performance degradation, rendering it a viable solution for future mMTC scenarios. Extensive simulation results demonstrate the bound-approaching performance as well as ultra-low computational complexity. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the anti-jamming problem of a directional modulation (DM) system with the aid of intelligent reflecting surface (IRS). As an efficient tool to combat malicious jamming, receive beamforming (RBF) is usually designed by using the statistical properties of the jamming received by Bob. Thus, it is very necessary to estimate the receive jamming covariance matrix (JCM) at Bob. To achieve a precise JCM estimation, three JCM estimation methods, including eigenvalue decomposition (EVD), parametric estimation method by gradient descend (PEM-GD) and parametric estimation method by alternating optimization (PEM-AO), are proposed. Here, the proposed EVD is derived according to the rank-2 constraint of JCM. The PEM-GD method fully explores the structure features of JCM and the PEM-AO is proposed to decrease the computational complexity of the former via dimensionality reduction. The simulation results show that the proposed three methods perform better than directly using sample covariance matrix. Additionally, the proposed PEM-GD and PEM-AO outperform EVD method and the clutter and disturbance covariance estimator RCML. [ABSTRACT FROM AUTHOR]

This work investigates a random access (RA) game for a time-slotted RA system, where $N$ players choose a set of slots of a frame and each frame consists of $M$ multiple time slots. We obtain the pure strategy Nash equilibria (PNEs) of this RA game, where slots are fully utilized as in the centralized scheduling. As an algorithm to realize a PNE (Pure strategy Nash Equilibrium), we propose an Exponential-weight algorithm for Exploration and Exploitation (EXP3)-based multi-agent (MA) learning algorithm, which has the computational complexity of $O(N N_{\max }^{2} T)$. EXP3 is a bandit algorithm designed to find an optimal strategy in a multi-armed bandit (MAB) problem that users do not know the expected payoff of each strategy. Our simulation results show that the proposed algorithm can achieve PNEs. Moreover, it can adapt to time-varying environments, where the number of players varies over time. [ABSTRACT FROM AUTHOR]

Massive multiple-input multiple-output (MIMO) is considered as a critical technique in 5 G New Radio (NR), due to its capability to significantly improve data rate and link reliability for the radio link. To make it a reality, it is essential to evaluate massive MIMO performance in realistic spatial fading channel conditions. Specifically, dynamic spatial channel emulation is crucial to evaluate the massive MIMO beam operations. Due to the high cost associated with both the traditional conduced testing method and the standardized multi-probe anechoic chamber (MPAC) based Over-the-Air (OTA) testing setup for massive MIMO performance testing, fading channel emulation for massive MIMO testing using a conductive phase matrix setup has been proposed in the literature. However, it is still a challenging problem to emulate dynamic spatial channels in a cost-effective and efficient manner for the conductive phase matrix setup, since traditional algorithms suffer from high computational complexity and system cost. This paper proposes a fast and accurate framework to emulate dynamic spatial channels in the phase matrix setup, where the basic idea is to mimic a virtual MPAC setup. By doing so, we can mimic MPAC setup with flexible probe configurations. Furthermore, a novel successive cancellation strategy and a closed-form algorithm are proposed to determine the probe locations and probe weights, respectively, which can significantly reduce the computational complexity associated with dynamic channel emulation. Simulation results show that the proposed algorithm is highly accurate and computationally efficient, compared to state-of-art solutions. Further, we apply our developed algorithm to emulate measured non-stationary channels and excellent emulation accuracy can be achieved. The proposed method can be employed for emulating dynamic spatial channels, which is of great importance for massive MIMO performance testing. [ABSTRACT FROM AUTHOR]

In massive MIMO systems, the high complexity of signal detection comes mainly from computing a Gram matrix and its inversion. In this correspondence, we propose a low-complexity MIMO detection method based on the Neumann series (NS), which does not require explicitly computing the Gram matrix and its inversion. The proposed method leverages the statistical information of the Gram matrix to compute an initialization matrix, which guarantees the convergence of NS expansion. The signal detection is conducted implicitly by transforming matrix inversion and product operations into matrix-vector multiplication operations. By doing so, it reduces the computational complexity of MIMO signal detection from $\mathcal {O}(BU^{2}+U^{3})$ to $\mathcal {O}(BUN)$ , where $B$ , $U$ , and $N$ are the numbers of antennas at the base station, at the user equipment, and NS terms, respectively. Simulation results show that, compared with existing approaches, the proposed method can significantly reduce the signal detection complexity while achieving similar performance. [ABSTRACT FROM AUTHOR]

Vehicular Ad-hoc Network (VANET) is vital for supporting intelligent transport systems, such as traffic data sharing and cooperative processing in the modern city. However, data security and privacy are the critical factors restricting the development. To address these challenges, several certificateless conditional privacy-preserving authentication (CPPA) schemes with anonymity and traceability have been proposed. These schemes avoid complicated certificate management in the PKI framework and key escrow in the ID-based protocol. However, there still exist drawbacks such as computational complexity, high communication cost or security vulnerability. Recently, Ali et al. proposed an efficient certificateless CPPA (CLCPPA) scheme for VANETs, but we have found that this scheme fails to resist a signature forgery attack. To achieve a trade-off between security and efficiency, we first demonstrate the insecurity of Ali et al.’s protocol and then introduce a security-enhanced solution. To show the feasibility and utility of our proposal, we perform a security analysis in the security model. Moreover, we evaluate the performance via comparing it with other existing schemes. From the comparison results, we can find that our scheme is more efficient than prior state-of-art solutions, in terms of signing (improving 66.75%), the verification (improving 33.19%) and bandwidth requirement (reducing 14.75%). Therefore, our proposal is more suitable to be applied in VANETs. [ABSTRACT FROM AUTHOR]

In this paper, we propose a framework of the mutual information-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes by using simple mappings and fixed-point additions. Our decoding method is generic in the sense that it can be applied to LDPC codes with arbitrary degree distributions, and can be implemented based on either the belief propagation (BP) algorithm or the min-sum (MS) algorithm. In particular, we propose the MIM density evolution (MIM-DE) to construct the lookup tables (LUTs) for the node updates. The computational complexity and memory requirements are discussed and compared to the LUT decoder variants. For applications with low-latency requirement, we consider the layered schedule to accelerate the convergence speed of decoding quasi-cyclic LDPC codes. In particular, we develop the layered MIM-DE to design the LUTs based on the MS algorithm, leading to the MIM layered quantized MS (MIM-LQMS) decoder. An optimization method is further introduced to reduce the memory requirement for storing the LUTs. Simulation results show that the MIM quantized decoders outperform the state-of-the-art LUT decoders in the waterfall region with both 3-bit and 4-bit precision over the additive white Gaussian noise channels. For small decoding iterations, the MIM quantized decoders also achieve a faster convergence speed compared to the benchmarks. Moreover, the 4-bit MIM-LQMS decoder can approach the error performance of the floating-point layered BP decoder within 0.3 dB in the moderate-to-high SNR regions, over both the AWGN channels and the fast fading channels. [ABSTRACT FROM AUTHOR]

Massive multiple-input multiple-output (mMIMO) is a promising technique to realize the ever-increasing demand for high-speed data, quality of service (QoS), and energy efficiency for 5G and beyond wireless systems. However, the increased number of users in mMIMO systems significantly affects performance of the existing approximate matrix inversion based and matrix inversion less iterative symbol detection techniques. Conventional detection algorithms cannot learn the inter-relations of input-output parameters based on available data without having specific mathematical models of communication scenarios. Moreover, existing deep learning (DL) based symbol detection models lack in-network compression, resulting in large training time and high computational load while expected to be deployed in a low latency communication system. In this article, a sparse refinement architecture is proposed for symbol detection in uplink mMIMO. The proposed DL architecture requires less trainable parameters as compared to a conventional fully connected detection network and refines the estimated symbol vector in each layer. Convergence of the proposed symbol detection technique is analytically justified. An expression for the approximate upper bound on the BER is derived which is supported by simulations. The obtained results prove viability of the proposed symbol detection model as compared to the several existing state-of-art uplink mMIMO detection techniques, in terms of superior the error performance and low computational complexity. [ABSTRACT FROM AUTHOR]

Recently, model-free power control approaches have been developed to achieve the near-optimal performance of cell-free (CF) massive multiple-input multiple-output (MIMO) with affordable computational complexity. In particular, deep reinforcement learning (DRL) is one of such promising techniques for realizing effective power control. In this paper, we propose a model-free method adopting the deep deterministic policy gradient algorithm (DDPG) with feedforward neural networks (NNs) to solve the downlink max-min power control problem in CF massive MIMO systems. Our result shows that compared with the conventional convex optimization algorithm, the proposed DDPG method can effectively strike a performance-complexity trade-off obtaining 1,000 times faster implementation speed and approximately the same achievable user rate as the optimal solution produced by conventional numerical convex optimization solvers, thereby offering effective power control implementations for large-scale systems. Finally, we extend the DDPG algorithm to both the max-sum and the max-product power control problems, while achieving better performance than that achieved by the conventional deep learning algorithm. [ABSTRACT FROM AUTHOR]

Full-duplex (FD) systems have been introduced to provide high data rates for beyond fifth-generation wireless networks through simultaneous transmission of information over the same frequency resources. However, the operation of FD systems is practically limited by self-interference (SI), and efficient SI cancelers are sought to make the FD systems realizable. Typically, polynomial-based cancelers are employed to mitigate the SI; nevertheless, they suffer from high complexity. This article proposes two novel hybrid-layers neural network (NN) architectures to cancel the SI with low complexity. The first architecture is referred to as hybrid-convolutional recurrent NN (HCRNN), whereas the second is termed as hybrid-convolutional recurrent dense NN (HCRDNN).In the HCRNN, a convolutional layer is employed to extract the input data features using a reduced network scale. Moreover, a recurrent layer is then applied to assist in learning the temporal behavior of the input signal from the localized feature map of the convolutional layer. In the HCRDNN, an additional dense layer is exploited to add another degree of freedom for adapting the NN settings in order to achieve the best compromise between the cancellation performance and computational complexity. The complexity analysis of the proposed NN architectures is provided, and the optimum settings for their training are selected. The simulation results demonstrate that the proposed HCRNN and HCRDNN-based cancelers attain the same cancellation of the polynomial and the state-of-the-art NN-based cancelers with an astounding computational complexity reduction. Furthermore, the proposed cancelers show high design flexibility for hardware implementation, depending on the system demands. [ABSTRACT FROM AUTHOR]

Offloading tasks to the mobile ad hoc cloud (MAHC) can improve the utility of mobile devices in scenarios without infrastructure. However, when multiple resource demanders (RDs) offload tasks to multiple resource providers (RPs) in the MAHC with task random generation, how to optimize the utility of RDs and the service quality of the MAHC is an issue worth researching. To this end, we investigate this issue from the stochastic game perspective. Firstly, we combine the obtained time, energy, and monetary revenue as the utility of each RD and construct the utility improvement of each RD as a static non-cooperative game. Secondly, according to the randomness of RD’s task generation, we transform the single-shot non-cooperative game into a stochastic game in an infinite time horizon to obtain the long-term utility. Thirdly, to reduce the computational complexity for achieving Nash equilibrium, we propose an action reduction alternate backward iteration algorithm according to the games characteristics and prove its convergence. Finally, we compare the utility obtained from the static game with the stochastic game, the numerical results indicating that the utility of each RD can be effectively improved by utilizing the stochastic game. [ABSTRACT FROM AUTHOR]

Backscatter communication is an energy-efficient communication technique for the Internet of things (IoT) devices. It enables data transmission by reflecting the incident radio signals. In this paper, we propose a communication mode selection scheme for IoT devices that can communicate using either active transmission or backscattering. In the active transmission mode, the IoT devices can transmit data over narrowband subcarriers using power-domain non-orthogonal multiple access (NOMA). In the backscattering mode, which operates over shorter distance than active transmission, nearby user equipment (UE) devices are used as relays. The UEs receive the backscattered signals from the IoT devices and forward them to the base station. We formulate a connection density maximization problem to select the communication mode used by each IoT device. We determine the IoT device pairing for active transmission mode with NOMA and UE-IoT device association for backscattering mode. The formulated problem is a binary integer programming problem. Although it can be solved optimally, the optimal algorithm incurs exponential computational complexity. Hence, we propose a low-complexity suboptimal algorithm to solve this problem. Results show that our proposed algorithm can enhance the connection density of narrowband IoT systems by up to 64% when compared with using single communication mode. [ABSTRACT FROM AUTHOR]

Interference is a detrimental factor for information decoding, but it can be a helpful resource for energy harvesting in a wireless powered network. Considering a two-way wireless powered interference channel, in this study, we present a simultaneous wireless information and power transfer (SWIPT)-then-wireless information transfer (WIT) protocol. In this protocol, transmitters perform SWIPT, and receivers receive both information and energy simultaneously in the forward link (FL). Then, the receivers perform WIT using the harvested energy in the backward link (BL). To maximize the weighted sum rate of the FL and BL, we jointly optimize the transmit power and energy harvesting (EH) ratio according to time switching and power splitting policies. To solve this non-convex optimization problem, we propose an iterative power control and energy harvesting algorithm based on dual methods that reduce computational complexity. The results show that the proposed algorithm finds the optimal transmit power and EH ratio suitably and thus maximizes the weighted sum rate. Consequently, the proposed SWIPT-then-WIT protocol expands the achievable rate region significantly compared with conventional schemes that do not adaptively control the transmit power and EH ratio. [ABSTRACT FROM AUTHOR]

Sparse code multiple access (SCMA) and multiple input multiple output (MIMO) are considered as two efficient techniques to provide both massive connectivity and high spectrum efficiency for future machine-type wireless networks. However, the computational complexity of the conventional message passing algorithm (MPA) for the downlink MIMO-SCMA detection increases exponentially with the degree of variable nodes (VNs). To address this issue, two novel fixed low complexity MPA detectors are proposed by utilizing the sparse feature of codewords, which are based on the serial schedule strategy in order to accelerate their convergence. First, a maximum distance MPA (MDMPA) detector is introduced to reduce the number of VNs involved in the message updating procedure in the first $T_0$ iterations and fix $TJ_0$ codewords at the $L_0$ iteration, which subsequently drops the redundant codeword combinations in the remaining iterations. To further improve the bit error ratio (BER) performance, an improved MDMPA (IMDMPA) is proposed, in which, the VNs associated with the target user are always allowed to participate in the iterative propagation of message. An efficient linear squares (LS) channel estimation scheme is also derived based on block pilots by stacking all the received signals at the same subcarrier together. Simulation results illustrate that the proposed MDMPA and IMDMPA detectors significantly reduce the computational complexity of the original MPA, but with comparable decoding capabilities, and the proposed LS channel estimator can closely approach the corresponding lower bound over frequency selective channels. [ABSTRACT FROM AUTHOR]

Cybertwin is a promising networking paradigm that supports complex wireless interconnectivity and enhances reliable communications by using edge capability in different applications. However, the computation-heavy phased-array weight vector generation is the significant barrier for the implementation of physical layer security (PLS) for millimeter-wave (MMWV) communications in cybertwin-driven scenarios, like vehicle-to-everything (V2X) applications. In this paper, we propose a low-complexity phased-array PLS scheme in MMWV wireless communications for cybertwin-driven V2X applications. The computational complexity is much reduced in a cost-effective way, where the transmitting phased-array weight vectors are updated at the symbol rate by randomly swapping the pre-calculated initial weight vector elements instead of directly calculating a new weight vector. Performance evaluation shows the proposed scheme possesses a lower computational complexity than the compared PLS schemes. The simulation demonstrates that the constellations are scrambled at undesired directions, while the constellation at target direction remains clear and constant. Thus, the communication secrecy is preserved for the receiver at the target direction in cybertwin-driven vehicular communications. Finally, we demonstrate that the proposed scheme achieves good security performances in terms of symbol error rate (SER) and secrecy outage probability. [ABSTRACT FROM AUTHOR]

The present work addresses localization problem in arbitrarily-deployed wireless networks in the presence of malicious attackers that can manipulate (spoof) their distance measurements. This problem is very important for the forthcoming applications that depend on accurate location information, since malicious attacks can potentially lead to disastrous consequences without the consideration of the security aspect. Therefore, this work proposes a new scheme for attacker detection based on generalized likelihood ratio test (GLRT) applied after a preliminary location estimate is obtained based on a simple geometric approach. The detected attacker is then removed from the localization process, which is converted into a generalized trust region sub-problem (GTRS) framework by applying the law of cosines (LC) and solved efficiently via bisectioning. The work also introduces theoretical bounds on the probability of detection in closed-form and studies the performance of the proposed algorithm from computational complexity, success in attacker detection, and localization accuracy perspectives. Our simulations corroborate the effectiveness of the proposed scheme, offering good localization accuracy and detection performance even in noisy environments [ABSTRACT FROM AUTHOR]

This letter studies the design of blind estimation technique for carrier frequency offset (CFO) in a universal filtered multicarrier (UFMC) system. We first propose a preliminary scheme, and then further devise a series of improved approaches used in the novel two-stage solution, including stages of initial and residual CFO estimation. For Stage 1, we devise two useful estimation algorithms, respectively. Especially, the latter approach using the frequency-domain received signal avoids intensive computation of the cost function. For Stage 2, we derive a closed-form formula used in the iterations to estimate the residual CFO. It can be shown that the proposed schemes not only provide a performance comparable to that of the non-blind least square-based scheme, but also enjoy much lower computational complexity compared with the conventional exhaustive search approach. The conducted computer simulation results verify the superior performance of the blind CFO estimation for UFMC. [ABSTRACT FROM AUTHOR]

Faster-than-Nyquist signaling (FTNS) has emerged as a promising technique to increase communication capacity in bandwidth-limited channels. However, the presence of FTN-induced inter-symbol interference (FTN-ISI) in the received observations, is detrimental to channel estimation (CE) and data detection in terms of computational complexity and performance. This paper copes with these problems by incorporating linear pre-equalization (LPE) and composite precoding formed by linear spectral precoding and Tomlinson-Harashima precoding (THP), into the FTNS. Specifically, LPE completely pre-equalizes the FTN-ISI, while spectral precoding resolves the LPE-caused signal spectral broadening by introducing proper artificial ISI, which is pre-equalized by THP. Channel-induced ISI, as the only ISI component in the observations, is estimated and equalized using the classical frequency-domain low-complexity schemes. We show that there are four advantages of the LPE-aided CE over the CE designed for the FTN transmissions without FTN-ISI pre-equalization, namely lower pilot overhead, simpler yet optimal pilot sequence design, lower mean-squared error of CE, and more robust against the FTN-ISI. Simulation results show that our scheme improves the performance of CE and detection, compared to existing FTN frequency-domain CE and equalization schemes. [ABSTRACT FROM AUTHOR]

Millimeter-wave (mmWave) massive antenna array has shown great potential in gaining high-accuracy localization for user equipments (UEs). Yet, mmWave signals suffer from non-line-of-sight (NLOS) propagation and fast time-scale fading in practice, which will affect UE localization performance. It is non-trivial to reveal the impact of multipath propagation and fast time-scale fading on mmWave-based localization, and gain guidelines for harnessing NLOS propagation. In this paper, we aim to provide a unified framework for performance analysis of mmWave-based UE localization and channel estimation. Firstly, closed-form Cramer-Rao lower bounds for UE localization and channel estimation, respectively, are derived to shed lights on their performance limits. Secondly, the effect of system elements (e.g., channel correlation and fast time-scale fading) on UE localization performance is quantitatively analyzed. In addition, information contribution from NLOS channel is quantified to reveal the impact of multipath propagation on UE localization. Finally, we show that the NLOS propagation-caused localization error can be alleviated by using a NLOS model folding-based localization scheme1, which strikes a balance between computational complexity and localization performance. [ABSTRACT FROM AUTHOR]

Wireless communication in vehicular networks is highly vulnerable to electromagnetic interference, which seriously undermines the communication effectiveness. Thus, interference estimation and elimination are essential in vehicular communications. To solve the multitasking problem of interference estimation and cancelation within the transformation domain of vehicular communications where they are divided into the consistency and inconsistency based on the different conditions of spectrum sensing, the present study proposes an iterative Bayesian sparse learning approach for simultaneous interference recovery and elimination which applies multiple Bayesian learning for measured signals, and the structured sparse learning method for simultaneous interference mitigation with signal recovery. Furthermore, the updating optimization based on Bayesian estimation framework is performed to facilitate the learning process and improve the performance of interference estimation and signal reconstruction. Simulation results show that the proposed algorithms achieved more rapid convergence and more accurate recovery (31.84% and 27.88% higher in spectrum sensing with consistency and inconsistency, respectively) than conventional algorithms. During all iterations, the proposed algorithms, because of updating optimization, were more robust than conventional ones, but the computational complexity remained largely the same. To explore the correlation between the parameters and the interference recovery performance, we performed experiments, which revealed linear, logarithmic, and exponential regression correlations for particular forms of interference. We also compared the demodulation performance of the proposed algorithm with existing methods, and it turned out the proposed algorithm also obtained higher gains on average in the bit error rate. [ABSTRACT FROM AUTHOR]

In this paper, an aerial heterogeneous wireless network consists of a high altitude platform (HAP) and low altitude platforms (LAPs) as aerial base stations (ABSs) in a downlink orthogonal division multiple access (OFDMA) transmission is investigated. Two types of spectrum sharing, including spectrum underlay access (SUA) and spectrum overlay access (SOA) are employed to evaluate the inter-tier interference. Distributed problem formulation and solving method are used to reduce the computational complexity, communication overhead and system latency. Subcarrier assignment and power allocation in spectral efficiency (SE), energy efficiency (EE) and transmission power optimization problems are accomplished by the proposed two-layer algorithm. In the proposed algorithm, first, subcarrier assignment based on constraints of the optimization problems is carried out to cover both SUA and SOA with low computational complexity. Second, the proposed algorithm performs power allocation. The simulation results show the relation between spectrum reuse and inter-tier interference, such that system SE, EE and the number of served users are maximized when both spectrum reuse and inter-tier interference management are performed together. [ABSTRACT FROM AUTHOR]

Vehicle-to-vehicle (V2V) communications is an important technology in vehicular ad hoc network (VANET) to support autonomous data exchange among vehicles. Multiple V2V communications modes have been investigated for VANET, including dedicated short-range communications (DSRC) based on IEEE 802.11p and LTE-V2X, which are suitable for different packet transmission cases. In order to fully exploit the strengths of various modes, hybrid V2V communications strategies are designed in this paper, where each vehicle is allowed to choose different modes for different kinds of transmissions in separate frequency bands for transmission throughput improvement. Furthermore, since it is usually impractical to decide all the vehicles’ communications strategies globally due to high computational complexity and heavy overhead to broadcast the decisions, we model the selection of hybrid V2V communications strategies for vehicles as an evolutionary game. A strategy selection algorithm is then proposed, where each vehicle can select its hybrid V2V communications strategy locally based on its evaluation of the payoffs for different strategies and limited signalling from the base station. Simulation results demonstrate that the proposed algorithm can converge to an asymptotic stable state, which can improve the transmission throughput of vehicles, and is robust to the slight evaluation errors of payoffs and the strategy mutations of a few vehicles. [ABSTRACT FROM AUTHOR]

Considering the computational complexity and fronthaul capacity requirements of network-wide centralized optimization for Cell-free (CF) massive multiple input multiple output (MIMO) networks, we focus on user-centric (UC) networks wherein each user is served by a subset of access points (APs) rather than all the APs. We study a proportional-fair resource allocation (RA) problem, including slot resource allocation and precoding design in UC networks over consecutive time-slots. We formulate the proportional-fair (PF) resource allocation problem as a series of weighted sum-rate maximization problems and develop a two-stage heuristic RA scheme to solve the problem. The scheme adopts a user grouping process to decompose resource allocation problem into intra-group orthogonal resource allocation sub-problems. A modularity-based user grouping algorithm upon a constructed weighted digraph is proposed. Then, relying on the grouping results, a parallel distributed PFRA algorithm consisting of user selection process and a Signal to Leakage plus Noise Ratio (SLNR)-based precoding design is proposed to fulfil intra-group resource allocation. Rather than global channel state information (CSI) collected from the whole network, local CSI obtained cooperatively within each AP subset is utilized in the proposed resource allocation scheme. Numerical results confirm that the proposed RA scheme outperforms in throughput while maintaining comparable fairness among users. [ABSTRACT FROM AUTHOR]

In this paper, collaborative task offloading in edge computing is studied, where computation requesters can offload tasks to not only the edge server, but also nearby smartphone users. By considering the fact that smartphone users may not always be willing to provide such computation service because of the consumption of their own energy and resources, a truthful mechanism is designed to provide incentive to smartphone users. The design aims to maximize the net revenue of the service provider and addresses more practical, but more complicated, scenarios of unknown a prior distribution information on smartphone users’ private information. To tackle this high computational complexity, which makes the traditional mechanism design methods infeasible, a new approach, called truthful deep mechanism, is proposed by leveraging a multi-task machine learning model, where inherently inter-connected collaborator selection and pricing policy determination are decided by designing two deep neural networks. The numerical results show that the proposed deep truthful mechanism can ensure a convergence to a stable state and can satisfy all required economical properties, including individual rationality, incentive compatibility, and budget balance. [ABSTRACT FROM AUTHOR]

To meet stringent service requirements in 5G at reasonable CapEx/OpEx, multi radio unit (RU) joint transmission has gained great attention. Optimal precoding design is a main concern in multi-RU joint transmission. In this paper, a new multi-RU joint precoding scheme is newly designed for sum-r ate-maximization with a minimum rate guarantee constraint under imperfect channel estimation. Owing to non-convexity of minimum rate guarantee constraints which causes huge computational complexity, we decouple the non-convex rate guarantee constraint into two convex constraints; desired signal constraint and interference constraint. And then, we propose a computationally efficient algorithm to find the suboptimal solution by iteratively solving two convex suboptimization problems. Through intensive simulations, the performance of the proposed scheme is evaluated and found to be superior compared with two previous schemes as well as the small-cell base station (SBS) transmission scheme. [ABSTRACT FROM AUTHOR]

Multiple-input multiple-output (MIMO) technology with high order signal modulation method has been proposed recently as a scheme to achieve high throughput requirements of next-generation communication applications. However, the use of high-order modulation signals degrades the error rate performance. Generalized frequency division multiplexing (GFDM) has attracted enormous consideration for deploying in new communication scenarios due to its advantages in terms of out-of-band (OOB) emission, spectral efficiency (SE), and latency. Index modulation (IM) methods convey digital information by utilizing transmission entities with adjustable index parameters to provide flexible system design and offer attractive advantages such as energy and SE without increasing the computational complexity. The Multiple-Mode (MM) method permits multiple subcarriers to transmit multiple modes and employs the whole permutation of these modes to convey additional information bits. The proposed MIMO MM-GFDM-IM scheme improves the bit error rate and the spectral efficiency compared to the existing schemes. The proposed method can select the modulation order and the number of modes to achieve the design goals. Furthermore, a system with high modulation order can improve the spectral efficiency when the constellation point is fixed. This paper also proposes a practical and effective MM selection strategy and two low-complexity detectors. [ABSTRACT FROM AUTHOR]

Considering suspicious finite blocklength transmissions, we propose a proactive monitoring via jamming system. Our aim is to maximize the average monitoring rate, whose expression involves the integral of $Q$ function. Although the formulated optimization problem is non-convex, we theoretically prove that the problem has a unique optimal solution, which can be found by the bisection search. Due to high complexity of integral in each step of bisection search, we propose a proactive monitoring scheme based on a linear approximation, which does not involve integral. Furthermore, by using the Riemann integral approximation, we also propose a closed-form near optimal solution to the average monitoring rate maximization problem. Numerical results demonstrate that our proposed schemes outperform the passive monitoring without jamming and proactive monitoring with constant jamming power schemes. [ABSTRACT FROM AUTHOR]

This paper proposes a novel bit loading algorithm to multicarrier non-orthogonal multiple access (NOMA) systems to maximize the system total throughput while satisfying the users’ individual quality of service (QoS) constraints. Although bit loading is generally a non-deterministic polynomial-time (NP)-hard problem, even for orthogonal multiple access (OMA), the mutual interference between the users, and the dependence of power coefficients and modulation orders are additional challenges that add substantial complexity to the optimization problem. Therefore, in this paper, we propose an efficient bit loading algorithm for multicarrier NOMA systems and compare the complexity and throughput with a corresponding OMA system. The obtained results show that for the case of NOMA, bit loading provides an additional degree of freedom that allows non-uniform spectrum sharing among the users. In particular scenarios, the system may experience hybrid modes of operation, where the system switches between NOMA and OMA. The obtained numerical results show that NOMA can outperform OMA by 100% in terms of spectral efficiency, for a two-user scenario. The complexity of the loading process for NOMA is noticeably higher than OMA, which is due to the high complexity associated with the bit error rate (BER) computation in the case of NOMA. [ABSTRACT FROM AUTHOR]

Video transmission over the backhaul link in cloud-edge collaborative networks usually suffers security risks, which is ignored in most of the existing studies. The characteristics that video service can flexibly adjust the encoding rates and provide acceptable encoding qualities, make the security requirements more possible to be satisfied but tightly coupled with video encoding by introducing more restrictions on edge caching. In this paper, by considering the interaction between video encoding and edge caching, we investigate the quality of experience (QoE)-driven cross-layer optimization of secure video transmission over the wireless backhaul link in cloud-edge collaborative networks. First, we develop a secure transmission model based on video encoding and edge caching. By employing this model as the security constraint, then we formulate a QoE-driven joint optimization problem subject to limited available caching capacity. To solve the optimization problem, we propose two algorithms: a near-optimal iterative algorithm (EC-VE) and a greedy algorithm with low computational complexity (Greedy EC-VE). Simulation results show that our proposed EC-VE can greatly improve user QoE within security constraints, and the proposed Greedy EC-VE can obtain the tradeoff between QoE and computational complexity. [ABSTRACT FROM AUTHOR]

Satellite high-mobility communications can provide global communication services for mobile terminals, which plays a vital role in today's world of wireless communications. Different from traditional terrestrial-satellite communications, high-mobility terminals impose more challenges on the direct sequence spread spectrum (DSSS) signal acquisition in satellite communications. On the one hand, the spread spectrum sequence used in satellite communication systems is relatively long, which inevitably increases the computational complexity. On the other hand, high Doppler frequency offsets and time-varying Doppler rates caused by high-mobility terminals make satellite DSSS signal acquisition become the bottleneck. To solve such a problem in high-mobility satellite communications, we propose a new acquisition algorithm based on the new factor graph where time-varying Doppler rate is modeled by the random walk model, named the turbo iterative acquisition algorithm. It consists of the constraint-detection loop and the Doppler-estimation loop. By means of soft messages passed between these loops, the negative influence of time-varying Doppler frequency offsets can be eliminated effectively. Simulation results show that, compared with traditional algorithms, the proposed algorithm improves acquisition performance more than 1.3 dB with low computational complexity, which demonstrates the superiority of the proposed algorithm in terms of acquisition performance and complexity. [ABSTRACT FROM AUTHOR]

In the achievable rate region maximization for intelligent reflecting surfaces (IRSs)-assisted interference channel (IFC), where more than one pair of transceivers communicates and interferes with each other simultaneously. Specifically, we optimize the transmit power and passive beamforming vectors at all the IRSs to obtain the Pareto boundary of the achievable rate region in IFC, subject to the unit-modulus constraints for the passive beamforming vectors at the IRSs and transmit power budgets at the transmitters. To solve the formulated non-convex optimization problem efficiently, we resort to optimize each variable alternatively until convergence. The optimization of transmit power is based on a locally optimal fixed-point iteration method. Instead of using the conventional high-complexity and sub-optimal Gaussian randomization-aided semi-definite relaxation (SDR) technique for the passive beamforming design, we first propose a novel locally optimal homotopy optimization based majorization-minimization method. To further reduce the computational complexity, a locally optimal log-sum-exp approximation based manifold optimization method is also proposed. Simulation results validate that our proposed methods can significantly decrease the computational complexity and outperform the conventional SDR-based algorithm. [ABSTRACT FROM AUTHOR]

IEEE 802.11p standard defines wireless technology protocols that enable vehicular transportation and manage traffic efficiency. A major challenge in the development of this technology is ensuring communication reliability in highly dynamic vehicular environments, where the wireless communication channels are doubly selective, thus making channel estimation and tracking a relevant problem to investigate. In this paper, a novel deep learning (DL)-based weighted interpolation estimator is proposed to accurately estimate vehicular channels especially in high mobility scenarios. The proposed estimator is based on modifying the pilot allocation of the IEEE 802.11p standard so that more transmission data rates are achieved. Extensive numerical experiments demonstrate that the developed estimator significantly outperforms the recently proposed DL-based frame-by-frame estimators in different vehicular scenarios, while substantially reducing the overall computational complexity. [ABSTRACT FROM AUTHOR]

It is known that interference alignment (IA) plays an important role in improving the degree of freedom (DoF) of multi-input and multi-output (MIMO) systems. However, most of the traditional IA schemes suffer from the high computational complexity and require the global and instantaneous channel state information (CSI), both of which make them difficult to be extended to cellular MIMO systems. To handle these issues, two new IA schemes, i.e., the retrospective interference regeneration (RIR) scheme and the beamforming based distributed retrospective interference alignment (B-DRIA) scheme, are proposed for cellular $K$ -user MIMO downlink networks. For the RIR scheme, it adopts interference elimination algorithm to erase redundant symbols in inter-cell interference (ICI) signals, and then uses interference regeneration algorithm to avoid secondary interference. The RIR scheme obtains greater DoF gain than the retrospective interference alignment (RIA) scheme, but incurs performance degradation when the transceiver antennas ratio (TAR) approaches 1. Therefore, the B-DRIA scheme is further proposed. For the B-DRIA scheme, the cellular beamforming matrix is introduced to eliminate the ICI, and meanwhile distributed RIA algorithm is adopted to align inter-user interference (IUI). The simulation results show that the B-DRIA scheme obtains larger DoF than the RIR scheme locally. Specifically, when TAR approaches 1, two schemes obtain the same DoF. While TAR approaches 2, the DoF of the B-DRIA scheme is superior than the RIR scheme. [ABSTRACT FROM AUTHOR]

Network Function Virtualization (NFV)-based 5G networks deliver specific services to a end-users through the creation of Service Function Chains (SFCs), which are composed of a number of Virtualized Network Functions (VNFs) interconnected via a set of virtual links (vLinks). VNFs consume computational resources of the network's servers, while vLinks utilize the communicational resources of the network. The efficient utilization of network resources remains a challenge in NFV-based networks. To this end, in this paper, we propose an analytical framework for the Admission Ratio (AR) calculation in NFV-based converged optical-wireless 5G networks. The proposed methodology employs a network slicing architecture in which different network slices form end-to-end logically isolated networks and each slice delivers a specific service type to the users through its SFC(s). In the proposed analysis, we not only take into account the occupancy distribution in both the network's computational and communicational domains (servers and fiber links), but we also consider the SFC establishment AR by taking into account different sub-service-classes belonging to different slices. The accuracy of the model is evaluated through the comparison of analytical and simulation results and was found satisfactory. Furthermore, the proposed model is employed for the determination of the optimal (minimum) capacity for all SFCs elements (VNFs and vLinks), in a way that users belonging to a specific slice experience a predefined value of AR as minimum. Additionally, our calculations deploy recursive formulas, which have a low computational complexity, as opposed to time-consuming simulations, without requiring the application of complex optimization algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we consider single carrier system with transmit diversity and a new multi-antenna transmission waveform is carefully designed to enable low-complexity anti-interference adaptive equalization. We propose a new space-frequency adaptive equalization method which makes use of the mutual interferences among different antennas from the desired user rather than attempts to completely remove them. We further propose two different ways to significantly reduce the computational complexity based on the idea of subband-wise processing with little sacrifice of equalization performance. Simulation results show that the proposed method exhibits a significant gain over conventional anti-interference schemes. [ABSTRACT FROM AUTHOR]

Standard cell-free (CF) massive multiple-input-multiple-output (mMIMO) systems is a promising technology to cover the demands for higher data rates in fifth-generation (5G) networks and beyond. These systems assume a large number of distributed access points (APs) using joint coherent transmission to communicate with the users. However, CF mMIMO systems present an increasing computational complexity as the number of users increases. Scalable cell-free CF (SCF) systems have been proposed to face this challenge. Given that the cost-efficient deployment of such large networks requires low-cost transceivers, which are prone to unavoidable hardware imperfections, realistic evaluations of SCF mMIMO systems should take them into account before implementation. Hence, in this work, we focus on the impact of hardware impairments (HWIs) on the SCF mMIMO systems through a general model accounting for both additive and multiplicative impairments. Notably, there is no other work in the literature studying the impact of phase noise (PN) in the local oscillators (LOs) of CF mMIMO systems or in general the impact of any HWIs in SCF mMIMO systems. In particular, we derive upper and lower bounds on the uplink capacity accounting for HWIs. Moreover, we obtain the optimal hardware-aware (HA) partial minimum mean-squared error (PMMSE) combiner. Especially, the lower bound is derived in closed-form using the theory of deterministic equivalents (DEs). Among the interesting findings, we observe that separate LOs (SLOs) outperform a common LO (CLO), and the additive transmit distortion degrades more the performance than the additive receive distortion. [ABSTRACT FROM AUTHOR]

The millimeter-wave (mmWave) massive multi-user multiple-input multiple-output (MU-MIMO) can significantly improve the throughput and spectral efficiency by equipping multi-antenna at both the base station (BS) and the users, which is greatly promising technologies for wireless communication systems. However, the large hardware requirement and high energy consumption are great hindrances. To effectively reduce the hardware and computational complexity and achieve a better trade-off between system complexity and performance, we propose an energy-efficient split sub-connected architecture based multi-user hybrid block diagonalization (BD) precoding and combining (Sub MU-HBD) scheme. The proposed Sub MU-HBD scheme employs the split sub-connected architecture to reduce the hardware complexity and improve spectral efficiency. Additionally, to significantly reduce the inter-user interference and further lessen the computational complexity, a low-dimensional digital precoding and combining scheme based on the BD is proposed. Furthermore, we propose a proportional water-filling power allocation algorithm to ensure optimal power distribution to users and improve energy efficiency. The simulation results demonstrate that the proposed Sub MU-HBD scheme can achieve near-optimal, and at times even better performance than some existing schemes. [ABSTRACT FROM AUTHOR]

Device-to-device (D2D) communication affords the benefits of improved network spectral efficiency, throughput, energy efficiency, and delay performance. However, D2D communication underlaid cellular uplinks are degraded by interference between D2D user equipment (DUE) and cellular user equipment (CUE) that use the same frequency band. In this context, researchers have proposed the optimization of the transmit power of the devices to mitigate interference. This power allocation problem is generally modeled as a NP-hard combinatorial optimization problem with linear constraints; therefore, traditional optimization methods are ineffective in addressing the problem. In this paper, we apply a deep reinforcement learning (DRL) algorithm to optimize the transmit power for both DUEs and CUEs in the context of D2D communication underlaid uplink cellular networks, which can solve the optimization problem via optimal decision-making together with efficient deep network training. Our simulation results show that the proposed algorithm affords a near-global-optimum solution with lower computation complexity than exhaustive search, and outperforms the fixed-power, weighted minimum mean square error (WMMSE), gradient descent method, and Newton-Raphson approaches. [ABSTRACT FROM AUTHOR]

In this work, we leverage the clustered $\beta$ -Ginibre point process (GPP) and the queueing theory to analyse the delay performance in a large-scale repulsive fog radio access network (F-RAN) with computation offloading, which plays a key role on the delay performance. In particular, the average delay defined as the mean value of delay for executing the computing tasks and the task completion probability (TCP) defined as the probability of the delay for executing the computing task being smaller than a target delay, are derived in analytical forms and validated by Monte Carlo simulations. Based on these results, the optimal rate threshold, which affects the task offloading probability and the transmission delay, and the optimal cloud offloading probability to minimize the average delay and maximize the TCP are jointly analysed numerically. Moreover, an approximated result of the average delay is provided to reduce its computational complexity. The results show that the repulsion in the F-RAN significantly decreases the average delay and increases the TCP, but equipped with the optimal rate threshold and the cloud offloading probability, the effects of repulsion on the average delay and the TCP become trivial. Furthermore, with the optimal cloud offloading probability and rate threshold, the average delay and the TCP can be significantly reduced and improved in the hybrid processing mode compared with those in the local processing mode, respectively. The optimal rate thresholds lie in the range of 3 to 13 Mbps under our simulation environment, which can reduce a maximum of 60% of the average delay and increase a minimum of 0.17 of the TCP. [ABSTRACT FROM AUTHOR]

Practical data detectors must achieve low error-rate at low-complexity for massive multiple-input multiple-output (MIMO) wireless systems. Since near-optimal minimum mean square error (MMSE) detection exhibits high computational complexity for such wireless systems, various iterative methods as well as their enhanced variants have been proposed. The efficiency of iterative approaches, however, is not satisfying due to slow convergence rate and reduced accuracy. This paper proposes a novel semi-iterative data detection algorithm for massive MIMO systems that simultaneously achieves a large improvement in convergence and accuracy with respect to the corresponding iterative method. We provide a general three-term recurrence expression for semi-iterative detection and incorporate it with Richardson method as a show case. To further improve the convergence rate of the proposed technique, a new trace-diagonal based low-complexity initial method is developed. A sufficient condition for convergence of the proposed method is also provided. We analyze the associated complexity of semi-iterative detector, and provide numerical results which demonstrate that the proposed detector is superior to recently introduced iterative detectors in terms of both the error-rate performance and computational complexity. [ABSTRACT FROM AUTHOR]