Search

In this paper, two new families of asynchronous channel-hopping (CH) sequences—Symmetric Maximum-Length CH (SML-CH) Sequences and Relaxed Difference Set (RDS) of Maximum-Length CH (RDSML-CH) Sequences—are constructed. For the first time, the maximum-length sequences (also called as m-sequences) are used to create 2-D CH matrices with a reduced number of “jump” columns. The two new constructions carry the desirable properties of maximum rendezvous diversity (MRD) and even channel use (ECU) and, more importantly, have the shortest periods in their categories of constructions. Another contribution is on the embedment of optical orthogonal codes (OOCs) to eliminate “stay” columns in the RDSML-CH matrices, thus resulting in the first and only family of the asynchronous CH sequences that can asymptotically achieve the theoretical period lower bound. To support the RDSML-CH construction, a new shortened RDS algorithm for creating the OOCs with smaller weight-to-length ratios than the existing ones is proposed. Numerical and simulation analyses show that the two new constructions have a good balance of short period, MRD, ECU, short time-to-rendezvous (TTR) mean, small TTR variance, and short maximum-TTR, thus more suitable for practical CR wireless networks than the existing constructions. [ABSTRACT FROM AUTHOR]

Being a key technology for beyond fifth-generation wireless systems, joint communication and radar sensing (JCAS) utilizes the reflections of communication signals to detect foreign objects and deliver situational awareness. A cellular-connected unmanned aerial vehicle (UAV) is uniquely suited to form a mobile bistatic synthetic aperture radar (SAR) with its serving base station (BS) to sense over large areas with superb sensing resolutions at no additional requirement of spectrum. This paper designs this novel BS-UAV bistatic SAR platform, and optimizes the flight path of the UAV to minimize its propulsion energy and guarantee the required sensing resolutions on a series of interesting landmarks. A new trajectory planning algorithm is developed to convexify the propulsion energy and resolution requirements by using successive convex approximation and block coordinate descent. Effective trajectories are obtained with a polynomial complexity. Extensive simulations reveal that the proposed trajectory planning algorithm outperforms significantly its alternative that minimizes the flight distance of cellular-aided sensing missions in terms of energy efficiency and effective consumption fluctuation. The energy saving offered by the proposed algorithm can be as significant as 55%. [ABSTRACT FROM AUTHOR]

Light nodes in blockchains improve the scalability of the system by storing a small portion of the blockchain ledger. In certain blockchains, light nodes are vulnerable to a data availability (DA) attack where a malicious node makes the light nodes accept an invalid block by hiding the invalid portion of the block from the nodes in the system. Recently, a technique based on LDPC codes called Coded Merkle Tree (CMT) was proposed by Yu et al. that enables light nodes to detect a DA attack by randomly requesting/sampling portions of the block from the malicious node. However, light nodes fail to detect a DA attack with high probability if a malicious node hides a small stopping set of the LDPC code. To mitigate this problem, Yu et al. used random LDPC codes that achieve large minimum stopping set size with high probability. Although effective, these codes are not necessarily optimal for this application, especially at short code lengths, which are relevant for low latency systems, IoT blockchains, etc.. In this paper, we focus on short code lengths and demonstrate that a suitable co-design of specialized LDPC codes and the light node sampling strategy can improve the probability of detection of DA attacks. We consider different adversary models based on their computational capabilities of finding stopping sets in LDPC codes. For a weak adversary model, we devise a new LDPC code construction termed as the entropy-constrained PEG (EC-PEG) algorithm which concentrates stopping sets to a small group of variable nodes. We demonstrate that the EC-PEG algorithm coupled with a greedy sampling strategy improves the probability of detection of DA attacks. For stronger adversary models, we provide a co-design of a sampling strategy called linear-programming-sampling (LP-sampling) and an LDPC code construction called linear-programming-constrained PEG (LC-PEG) algorithm. The new co-design demonstrates a higher probability of detection of DA attacks compared to approaches in earlier literature. [ABSTRACT FROM AUTHOR]

In this paper, we propose a robust secrecy transmission scheme for intelligent reflecting surface (IRS) aided communication systems. Different from all the existing works where IRS has already been deployed at a fixed location, we take the location of IRS as a variable to maximize the secrecy rate (SR) under the outage probability constraint by jointly optimizing the location of IRS, transmit beamformer and IRS phase shifts with imperfect channel state information (CSI) of Eve, where we consider two cases: a) the location of Eve is known; b) only a suspicious area of Eve is available. We show a critical observation that CSI models are different before and after IRS deployment, thus the optimization problem could be decomposed and solved via a two-stage framework. For case a), in the first stage, universal upper bounds of outage probabilities only related to the location of IRS are derived which can be optimized via successive convex approximation (SCA) method. In the second stage, we develop an alternative optimization (AO) algorithm to optimize beamformer and phase shifts iteratively. For case b), we propose a Max-Min SR scheme based on two-stage framework, where the location of IRS is optimized based on the worst location of Eve. Simulation results indicate the importance of the location of IRS optimization. [ABSTRACT FROM AUTHOR]

This paper considers a cell-free massive multiple-input multiple-output network (cfm-MIMO) with a massive number of access points (APs) distributed across an area to deliver information to multiple users. Based on only local channel state information, conjugate beamforming is used under both proper and improper Gaussian signalings. To accomplish the mission of cfm-MIMO in providing fair service to all users, the problem of power allocation to maximize the geometric mean (GM) of users’ rates (GM-rate) is considered. A new scalable algorithm, which iterates linear-complex closed-form expressions and thus is practical regardless of the scale of the network, is developed for its solution. The problem of quality-of-service (QoS) aware network energy-efficiency is also addressed via maximizing the ratio of the GM-rate and the total power consumption, which is also addressed by iterating linear-complex closed-form expressions. Intensive simulations are provided to demonstrate the ability of the GM-rate based optimization to achieve multiple targets such as a uniform QoS, a good sum rate, and a fair power allocation to the APs. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surfaces (RISs) have emerged as a promising technology for millimeter wave (mmWave) networks. In this paper, we utilize tools from stochastic geometry to study the performance of a RIS-assisted mmWave cellular network. Specifically, the locations of the base stations (BSs) and the midpoints of the blockage are modeled as two independent Poisson point processes (PPPs), where the blockages are modeled by a Boolean model and a fraction of the blockages are coated with RISs. The particular characteristics of mmWave communications, i.e., directional beamforming and different path loss laws for line-of-sight (LOS) and non-line-of-sight (NLOS) propagation, are incorporated into our analysis. We derive analytical expressions for the success probability and the area spectral efficiency. The success probability under the special case where the blockage parameter is sufficiently small is also derived. Numerical results demonstrate that better coverage performance and higher energy efficiency can be achieved by a large-scale deployment of RISs. In addition, the tradeoff between the BS and RIS densities is investigated and the results show that the RISs can indeed enable the traditional networks to improve the success probability, especially for the cell-edge region, with limited power consumption. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surfaces (RISs) provide an interface between the electromagnetic world of wireless propagation environments and the digital world of information science. Simple yet sufficiently accurate path loss models for RISs are an important basis for theoretical analysis and optimization of RIS-assisted wireless communication systems. In this paper, we refine our previously proposed free-space path loss model for RISs to make it simpler, more applicable, and easier to use. The impact of the antenna’s directivity of the transmitter, receiver, and the unit cells of the RIS on the path loss is explicitly formulated as an angle-dependent loss factor. The refined model gives more accurate estimates of the path loss of RISs comprised of unit cells with a deep sub-wavelength size. Based on the proposed model, the properties of a single unit cell are evaluated in terms of scattering performance, power consumption, and area, which allows us to unveil fundamental considerations for deploying RISs in high frequency bands. Two fabricated RISs operating in the millimeter-wave (mmWave) band are utilized to carry out a measurement campaign. The measurement results are shown to be in good agreement with the proposed path loss model. In addition, the experimental results suggest an effective form to characterize the power radiation pattern of the unit cell for path loss modeling. [ABSTRACT FROM AUTHOR]

The reconfigurable intelligent surface (RIS) is a promising technology that is anticipated to enable high spectrum and energy efficiencies in future wireless communication networks. This paper investigates optimum location-based RIS selection policies in RIS-aided wireless networks to maximize the end-to-end signal-to-noise ratio for product-scaling and sum-scaling path-loss models where the received power scales with the product and sum of the transmitter-to-RIS and RIS-to-receiver distances, respectively. These scaling laws cover the important cases of end-to-end path-loss models in RIS-aided wireless systems. The random locations of all available RISs are modeled as a Poisson point process. To quantify the network performance, the outage probabilities and average rates attained by the proposed RIS selection policies are evaluated by deriving the distance distribution of the chosen RIS node as per the selection policies for both product-scaling and sum-scaling path-loss models. We also propose a limited-feedback RIS selection framework to achieve distributed network operation. The outage probabilities and average rates obtained by the limited-feedback RIS selection policies are derived for both path-loss models as well. The numerical results show notable performance gains obtained by the proposed RIS selection policies. [ABSTRACT FROM AUTHOR]

Active eavesdropper sends jamming signals to raise the transmit power of base stations and steal more information from cellular systems. Network coding resists the active eavesdroppers that cannot obtain all the data flows, but highly relies on the wiretap channel states that are rarely known in wireless networks. In this paper, we present a reinforcement learning (RL) based random linear network coding scheme for drone-aided cellular systems to address eavesdropping. In this scheme, the network coding policy, including the encoded packet number, the packet and power allocation, is chosen based on the measured jamming power, previous transmission performance and BS channel states. A virtual model generates simulated experiences to update Q-values besides real experiences for faster policy optimization. We also propose a deep RL version and design a hierarchical architecture to further accelerate the policy exploration and improve the anti-eavesdropping performance, in terms of the intercept probability, the latency, the outage probability and the energy consumption. We analyze the computational complexity, drone deployment, secure coverage area and the performance bound of the proposed schemes, which are verified via simulation results. [ABSTRACT FROM AUTHOR]

Reactive jammers, which start attacking upon sensing legitimate transmissions, are serious threats to wireless communications. Conventional anti-jamming methods such as frequency hopping-based anti-jamming schemes are not effective against reactive jammers, especially the agile ones that jam immediately after sensing transmissions. Deceiving-based anti-jamming methods have a great potential in harnessing reactive jammers and securing communication channels for legitimate users. However, in deceiving-based anti-jamming methods, reaching the optimal power and channel allocation is complicated due to the unavailability of the jammers’ channel information. In this paper, we propose deceiving-based anti-jamming schemes against reactive jammers employing reinforcement learning. Moreover, we consider both cases where a reactive jammer can jam a channel or all the channels utilized by legitimate users. In the latter case, we model the interaction between users and the jammer as a non-cooperative Stackelberg game and prove equilibrium. In addition, we study different scenarios where the interacting environment is static or dynamic in terms of channel gains. Simulation results show that in static environments, the proposed methods achieve the optimal values of the total received power and Signal-to-interference-plus-noise ratio with an accuracy of 95%. Moreover, in dynamic environments, the proposed methods provide high performance in terms of the considered evaluation metrics. [ABSTRACT FROM AUTHOR]

The components with molecular communication (MC) functionalities can bring an opportunity for emerging applications in fields from personal healthcare to modern industry. In this paper, we propose the designs of the microfluidic transmitter and receiver with quadruple concentration shift keying (QCSK) modulation and demodulation functionalities. To do so, we first present an AND gate design, and then apply it to the QCSK transmitter and receiver design. The QCSK transmitter is capable of modulating two input signals to four different concentration levels, and the QCSK receiver can demodulate a received signal to two outputs. More importantly, we also establish a mathematical framework to theoretically characterize our proposed microfluidic circuits. Based on this, we first derive the output concentration distribution of our proposed AND gate design, and provide the insight into the selection of design parameters to ensure an exhibition of desired behavior. We further derive the output concentration distributions of the QCSK transmitter and receiver. Simulation results obtained in COMSOL Multiphysics not only show the desired behavior of all the proposed microfluidic circuits, but also demonstrate the accuracy of the proposed mathematical framework. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) and device-to-device (D2D) communication are two promising technologies for improving transmission reliability between transceivers in communication systems. In this paper, we consider the design of reliable communication between the access point (AP) and actuators for a downlink multiuser multiple-input single-output (MISO) system in the industrial IoT (IIoT) scenario. We propose a two-stage protocol combining IRS with D2D communication so that all actuators can successfully receive the message from AP within a given delay. The superiority of the protocol is that the communication reliability between AP and actuators is doubly augmented by the IRS-aided first-stage transmission and the second-stage D2D transmission. A joint optimization problem of active and passive beamforming is formulated, which aims to maximize the number of actuators with successful decoding. We study the joint beamforming problem for cases where the channel state information (CSI) is perfect and imperfect. For each case, we develop efficient algorithms that include convergence and complexity analysis. Simulation results demonstrate the necessity and role of IRS with a well-optimized reflection matrix, and the D2D network in promoting reliable communication. Moreover, the proposed protocol can enable reliable communication even in the presence of stringent latency requirements and CSI estimation errors. [ABSTRACT FROM AUTHOR]

Real-time monitoring has received considerable attention recently due to its potential in automatic driving, tele-surgery, and factory automation in the 6G era. In remote estimation or reconstruction of stochastic processes, the statistical properties of stochastic processes to be monitored play a central role. Among the stochastic processes interested by real-time applications, the Brownian motion, also known as the Wiener processes is a typical one. In this paper, we are interested in how to monitor Brownian motions efficiently, timely, and reliably. To achieve this goal, we reveal that the real-time estimation error is jointly determined by the quantization error and freshness of data samples. Based on this observation, we present an optimal joint sampling and quantization scheme that efficiently balances the quantization distortion and the age-of-information (AoI). Furthermore, we find that the error accumulation will lead to infinite distortion as monitoring time increases. To overcome this, a multi-layer error correction method is presented for infinite-time monitoring, in which bounded distortion can be achieved with limited data rate. Finally, to conquer the accumulation of transmission errors in unreliable channels, we present an error correction mechanism based on periodic feedback. Diffusion approximation is then adopted to determine the optimal feedback rate and interval. [ABSTRACT FROM AUTHOR]

In this paper, we consider Internet of Things (IoT) based mobile edge computing (MEC) system. IoT devices are controlled by access points (APs), which do not have access to any licensed spectrum. This puts limitations on IoT devices’ offloading capability and hence effectively reduces the number of computed bits. Under such scenario, we consider spectrum sharing, where IoT networks get access to licensed spectrum by helping a primary network (owns licensed spectrum) in cooperative relaying. We aim to maximize sum of the primary network’s communication rate and IoT networks’ total number of computed bits by jointly optimizing relay selection, licensed spectrum allocation, local computation, and offloading sequence selection. Moreover, we consider important constraints, e.g., the guaranteed rate for the primary network, IoT devices’ available energy, and available licensed spectrum resource blocks (RBs). We observe that the optimization problem is combinatoric in nature, which becomes more complicated when IoT devices’ scheduling order comes into the formulation. From our analysis, we devise an optimal and computationally efficient algorithm. In the result section, we compare with relevant benchmark systems and show the efficacy of our proposed model. Moreover, we also show how IoT and primary networks benefit from spectrum sharing. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the dynamic power allocation for a visible light communication (VLC) cellular system consisting of two coordinating attocells, each equipped with one access-point (AP). The coordinated multipoint (CoMP) between the two cells is introduced to assist users experiencing high inter-cell-interference (ICI). Specifically, the coordinated zero-forcing (ZF) precoding is used to cancel the ICI at the users located near the centers of the cells, whereas the joint transmission (JT) is employed to eliminate the ICI at the users located at the edge of both cells and to improve their receptions as well. Furthermore, two multiple access techniques are invoked within each cell, namely, non-orthogonal-multiple-access (NOMA) and cooperative non-orthogonal-multiple-access (C-NOMA). Hence, two multiple access techniques are proposed for the considered multi-user multi-cell system, namely, the CoMP-assisted NOMA scheme and the CoMP-assisted C-NOMA scheme. For each scheme, two power allocation frameworks are formulated each as an optimization problem, where the objective of the former is maximizing the network sum data rate while guaranteeing a certain quality-of-service (QoS) for each user, whereas the goal of the latter is to maximize the minimum data rate among all coexisting users. The formulated optimization problems are not convex, and hence, difficult to be solved directly unless using heuristic methods, which comes at the expense of high computational complexity. To overcome this issue, optimal and low complexity power allocation schemes are derived. In the simulation results, the performance of the proposed CoMP-assisted NOMA and CoMP-assisted C-NOMA schemes are compared with those of the CoMP-assisted orthogonal-multiple-access (OMA) scheme, the C-NOMA scheme and the NOMA scheme, where the superiority of the proposed schemes are demonstrated. Finally, the performance of the proposed schemes and the considered baselines is evaluated while varying various system parameters. [ABSTRACT FROM AUTHOR]

Magnetic random-access memory (MRAM) is a promising memory technology due to its high density, non-volatility, and high endurance. However, achieving high memory fidelity incurs high write-energy costs, which should be reduced for large-scale deployment of MRAMs. In this paper, we formulate a biconvex optimization problem to optimize write fidelity given energy and latency constraints. The basic idea is to allocate non-uniform write pulses depending on the importance of each bit position. The fidelity measure we consider is mean squared error (MSE), for which we optimize write pulses via alternating convex search (ACS). We derive analytic solutions and propose an alternating water-filling algorithm by casting the MRAM’s write operation as communication over parallel channels. Hence, the proposed alternating water-filling algorithm is computationally more efficient than the original ACS while their solutions are identical. Since the formulated biconvex problem is non-convex, both the original ACS and the proposed algorithm do not guarantee global optimality. However, the MSEs obtained by the proposed algorithm are comparable to the MSEs by complicated global nonlinear programming solvers. Furthermore, we prove that our algorithm can reduce the MSE exponentially with the number of bits per word. For an 8-bit accessed word, the proposed algorithm reduces the MSE by a factor of 21. We also evaluate MNIST dataset classification supposing that the model parameters of deep neural networks are stored in MRAMs. The numerical results show that the optimized write pulses can achieve 40% write-energy reduction for the same classification accuracy. [ABSTRACT FROM AUTHOR]

The roll-out of various emerging wireless services has triggered the need for the sixth-generation (6G) wireless networks to provide functions of target sensing, intelligent computing and information communication over the same radio spectrum. In this paper, we provide a unified framework integrating sensing, computing, and communication to optimize limited system resource for 6G wireless networks. In particular, two typical joint beamforming design algorithms are derived based on multi-objective optimization problems (MOOP) with the goals of the weighted overall performance maximization and the total transmit power minimization, respectively. Extensive simulation results validate the effectiveness of the proposed algorithms. Moreover, the impacts of key system parameters are revealed to provide useful insights for the design of integrated sensing, computing, and communication (ISCC). [ABSTRACT FROM AUTHOR]

Energy-efficient time synchronizations for wireless sensor networks (WSNs) have been put under the spotlight for years. A promising technique among which is the timestamp-free approach where no timestamps are required to establish the synchronization, thereby sparing the transmissions of the timing messages for conserving significant transmission energy. In this paper, we first investigate the feasibility of adopting timestamp-free time synchronization in practical resource-constrained WSNs; we then identify the issue of inaccuracy in maintaining the pre-defined response interval which affects the foundations of most existing timestamp-free schemes. Based on the investigation and our previously proposed reverse asymmetric time synchronization framework, we further propose an asymmetric timestamp-free time synchronization scheme with two estimation methods tailored for resource-constrained WSNs. We as well introduce the centralized and distributed multi-hop extension methods for the proposed scheme to cover diverse multi-hop scenarios. Experimental results on a real WSN testbed consisting of TelosB motes running TinyOS demonstrate that the proposed scheme achieves high energy efficiency while maintaining microsecond-level time synchronization accuracy compared to three other conventional schemes. [ABSTRACT FROM AUTHOR]

Physical layer security is a useful tool to prevent illegal wiretapping to confidential information. In this paper, we consider a generalized model of conventional physical layer security, referred as hierarchical information accessibility (HIA). A main feature of the HIA model is that a network has a hierarchy in information access, wherein decoding feasibility is determined by each user’s priority. Under this HIA model, we formulate a sum secrecy rate maximization problem with regard to precoding vectors. This problem is challenging since multiple non-smooth functions are involved into the secrecy rate to fulfill the HIA conditions and also the problem is non-convex. To address the challenges, we approximate the minimum function by using the LogSumExp technique, thereafter obtain the first-order optimality condition. One key observation is that the derived condition is cast as a functional eigenvalue problem, where the eigenvalue is equivalent to the approximated objective function of the formulated problem. Accordingly, we show that finding a principal eigenvector is equivalent to finding a local optimal solution. To this end, we develop a novel method called generalized power iteration for HIA (GPI-HIA). Simulations demonstrate that the GPI-HIA significantly outperforms other baseline methods in terms of the secrecy rate. [ABSTRACT FROM AUTHOR]

Linear prediction and entropy coding are widely used in speech, audio, video, and other coding systems. Rate-distortion optimization (RDO) is another relevant coding technique, which is especially useful when the encoder performance depends on tunable parameters from distinct coding subsystems. This work presents a RDO strategy for variable-rate encoders that use linear prediction and entropy coding. The method is suitable when the signal to be compressed is short-term stationary and the prediction order varies over signal segments. The second contribution of this paper is to customize the method to the compression of time-domain OFDM-based cellular radio signals. The method enables a 4G / 5G packet-based fronthaul to flexibly trade-off rate and distortion depending on the amount of information to be transmitted and, consequently, benefit from multiplexing gain. Simulation results with LTE signals show that the proposed method achieves improved performance with a relatively low computational cost, while operating with time-domain signals under different traffic scenarios. [ABSTRACT FROM AUTHOR]

Binary quasi-reversible BCH codes whose defining set contains consecutive elements from negative to positive integers have received considerable attention in recent years due to their efficient decoding suitable for a wide range of applications. This paper combines the concept of the weight and quasi-reversible structures to introduce two subclasses of BCH codes: odd-like/even-like quasi-reversible BCH codes. The step-by-step decoding of these codes is developed as follows: First, the weight evaluation of a received polynomial is able to judge whether the number of errors is odd or even, which helps to simplify the decoding processes. Second, based on Chiò’s pivotal condensation process which can be easily implemented in a parallel computing architecture, the determinant calculation of the band matrix instead of Peterson’s matrix in column-echelon form is faster. Third, a newly proposed non-monic error-locator polynomial is sparser than the conventional ones. As a consequence, the theoretical analysis and experimental results validate potential benefits in requiring fewer finite field additions and multiplications used in the decoding of binary odd-like/even-like quasi-reversible BCH codes up to half the minimum distance when compared with the narrow-sense BCH codes with small error-correcting capability. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the resource allocation of mobile edge computing (MEC) in cognitive capacity harvesting networks (CCHNs) when non-orthogonal multiple-access (NOMA) technique is adopted. Different from traditional studies for NOMA-MEC networks, we aim at minimizing the total cost of CCHN while satisfying the quality-of-service (QoS) of secondary users (SUs). We adopt the mechanism of time division multiple access (TDMA) when several NOMA groups use the same spectrum, and consider both the waiting delay and transmission delay during data offloading with the optimization of transmission order of NOMA groups. We formulate the considered problem as a mixed integer non-linear programming (MINLP). We show that the transmit power and the allocated computing resource for each SU can be derived when the transmission time and transmission order of the NOMA groups are given. Based on this, the considered problem can be decomposed into a transmission time and order optimization subproblem, a cellular resource block (CRB) selection subproblem and a cognitive radio (CR) router selection subproblem. To solve the transmission time and order optimization subproblem, we first simplify the delay constraint via theoretic analysis, and then propose a binary segmentation (B-Seg) algorithm and a transmission order adjustment (TOA) algorithm to find the optimal transmission time and transmission order of NOMA groups, respectively. To solve the CRB selection subproblem and the CR router selection subproblem, a bigger requirement first (BRF) algorithm and a game-based iteration (GBI) algorithm are respectively proposed. Simulation results show that the proposed algorithms can significantly improve the system performance. [ABSTRACT FROM AUTHOR]

Massive multiple-input multiple-output (MIMO) integrated with millimeter-wave (mmWave) can provide unprecedented performance improvement for realizing future wireless communications. However, acquiring accurate channel state information in wideband mmWave massive MIMO systems with hybrid transceiver architectures is even challenging, especially in high-mobility scenarios with severe Doppler effects. In this paper, we propose a tensor decomposition-based method to estimate the time-varying and frequency-selective (TVFS) mmWave MIMO channels. Specifically, by exploiting the sparse scattering nature of TVFS channels, we model the frequency-domain received signal as a third-order tensor that admits a canonical polyadic (CP) decomposition format. Then, we analyze the uniqueness condition of the proposed CP decomposition-based channel estimation problem and propose a novel estimator to acquire TVFS channel parameters including angle of departure/arrival (AoD/AoA), time delay, path gain, and the Doppler shift. To address the sophisticated coupling among unknown parameters, we further propose a joint AoD and Doppler shift estimation (JADE) algorithm that provides reliable initial and iteratively refined estimates. The derived analysis and simulation results verify that the proposed JADE algorithm achieves higher estimation accuracy and guarantees the superiority of the proposed TVFS channel estimator over existing schemes. [ABSTRACT FROM AUTHOR]

The combination of reconfigurable intelligent surface (RIS) and non-orthogonal multiple access (NOMA) has been recognized as a critical method to improve the sixth generation networks performance. In this paper, a distributed RIS-aided downlink multiple-input multiple-output (MIMO) NOMA systems with discrete phase shifts are studied, where the channel directions from base station to paired users can be manipulated with the assistance of RISs by employing the concept of signal alignment. In order to ensure base station can flexibly serve some users with NOMA and others users with spatial division multiple access, a unified precoder and decoder are provide to cancel inter-cluster interference. Subsequently, the channel statistics over Nakagami- $m$ fading channels are derived for near and far users. In particular, considering the cascade channel gain may exists two different cases, Beaulieu series is further adopted to characterize their corresponding cumulative distribution function. In what follows, the outage probability and ergodic rate for three situations within one cluster are derived by utilizing the obtained channel statistics, respectively. Based on the derived results, we also analyze the diversity order and high signal-to-noise ratio slope to provide essential insights into the considered systems. Finally, simulation results are presented to reveal that: 1) selecting the setting of 3-bits resolution can realize a near-aligned performance for our proposed systems; 2) the cascade channel statistic caused by RIS can be evaluated with any number of RIS element and any channel gain via Beaulieu series. [ABSTRACT FROM AUTHOR]

The differential chaos shift keying with code index modulation (CIM-DCSK) using Walsh codes can increase the data rate, but error rate performance degrades over practical multipath channel with high delay spread. To tackle this drawback, this paper proposes a parallel CIM-DCSK (PT-CIM-DCSK), where the first time slot is used to transmit the chaotic reference sequence, and the second slot is used to transmit the multiple sequences carrying data bits. In particular, multiple $q$ chaotic sequences are added for data transmission in parallel, and each sequence is modulated by CIM-DCSK with $m_{c}$ bits. By exploiting the quasi-orthogonal characteristics of permuted chaotic signals, the interference between $q$ sequences can be remarkably suppressed. In this way, given the data rate, PT-CIM-DCSK can achieve a larger length of Walsh segment than the CIM-DCSK, since its parallel transmission compensates the rate. In addition, the error performance of the proposed scheme over the multipath Rayleigh fading channel is theoretically analyzed. The theoretical and consistent simulation results demonstrate that the PT-CIM-DCSK can obtain significant performance gains over the conventional CIM-DCSK, and the gain can be up to 5 dB in multipath fading channel with high delay. This is because the larger Walsh segment of PT-CIM-DCSK provides the enhanced robustness against multipath effect. The performance superiority of the proposed scheme is further verified in practical ultra-wideband (UWB) wireless industrial scenarios, which suggests promising for low-cost and low-complexity wireless communication applications. [ABSTRACT FROM AUTHOR]

This paper explores the joint secrecy and delay guarantees based on opportunistic jamming and link selection in a wireless relay system consisting of a source, a destination, multiple buffer-aided relays and a passive eavesdropper wiretapping over both hops. Based on the information of link state and buffer status, we design a novel transmission scheme based on link selection and jammer selection, which dynamically grants transmission links different priorities for packet delivery, such that the constraints on both secrecy outage probability and packet delay are jointly satisfied. To understand the performance of the new scheme, we then apply the bitmap technique and Markov chain theory to develop a complete theoretical framework for the modelling of three fundamental metrics, namely reliability outage probability, packet discarding probability and secrecy/delay constrained throughput (SDT). Finally, we provide extensive simulation and numerical results to validate our theoretical modelling, as well as to demonstrate that the proposed scheme is superior to the benchmarks in terms of SDT. [ABSTRACT FROM AUTHOR]

This paper proposes an effective and novel multi-agent deep reinforcement learning (MADRL)-based method for solving the joint virtual network function (VNF) placement and routing (P&R), where multiple service requests with differentiated demands are delivered at the same time. The differentiated demands of the service requests are reflected by their delay- and cost-sensitive factors. We first construct a VNF P&R problem to jointly minimize a weighted sum of service delay and resource consumption cost, which is NP-complete. Then, the joint VNF P&R problem is decoupled into two iterative subtasks: placement subtask and routing subtask. Each subtask consists of multiple concurrent parallel sequential decision processes. By invoking the deep deterministic policy gradient method and multi-agent technique, an MADRL-P&R framework is designed to perform the two subtasks. The new joint reward and internal rewards mechanism is proposed to match the goals and constraints of the placement and routing subtasks. We also propose the parameter migration-based model-retraining method to deal with changing network topologies. Corroborated by experiments, the proposed MADRL-P&R framework is superior to its alternatives in terms of service cost and delay, and offers higher flexibility for personalized service demands. The parameter migration-based model-retraining method can efficiently accelerate convergence under moderate network topology changes. [ABSTRACT FROM AUTHOR]

For many applications envisioned for the Internet of Things (IoT), it is expected that the sensors will have very low costs and zero power, which can be satisfied by meta-material sensor based IoT, i.e., meta-IoT. As their constituent meta-materials can reflect wireless signals with environment-sensitive reflection coefficients, meta-IoT sensors can achieve simultaneous sensing and transmission without any active modulation. However, to maximize the sensing accuracy, the structures of meta-IoT sensors need to be optimized considering their joint influence on sensing and transmission, which is challenging due to the high computational complexity in evaluating the influence, especially given a large number of sensors. In this paper, we propose a joint sensing and transmission design method for meta-IoT systems with a large number of meta-IoT sensors, which can efficiently optimize the sensing accuracy of the system. Specifically, a computationally efficient received signal model is established to evaluate the joint influence of meta-material structure on sensing and transmission. Then, a sensing algorithm based on deep unsupervised learning is designed to obtain accurate sensing results in a robust manner. Experiments with a prototype verify that the system has a higher sensitivity and a longer transmission range compared to existing designs, and can sense environmental anomalies correctly within 2 meters. [ABSTRACT FROM AUTHOR]

The current cellular systems are conventional cell-centric based architectures, and thus the inter-cell interference greatly affects the quality of service (QoS) of users located at the border of those service areas. For that reason, future wireless systems will rely on a cell-less deployment by using an alternative promising network infrastructure known as cell-free (CF) technology. Here, in contrast to the current networks, there are no concepts of cells or cell boundaries since it is a disruptive paradigm where a large number of geographically distributed access points (APs) simultaneously and jointly serve a much smaller number of user terminals (UTs) to fulfill the exponentially increasing number of users. Therefore, this paper aims to contribute on this field and considers the design of hybrid analog/digital multi-user equalizer for broadband millimeter wave (mmWave) CF massive multiple-input multiple-output (mMIMO) systems, using a distributed beamforming approach (processing is distributed by APs and central unit (CU)) to reduce the fronthaul requirements. First, only a low complexity analog precoder is applied to the transmitter, while a joint design of APs hybrid equalizer and CU combiner are considered by minimizing the average mean square error (MSE) between the transmitted and CU estimated signals. To achieve this joint design, a cyclic minimization method is used to iterate between APs hybrid equalizer and CU combiner, where the information is exchanged between APs and CU based on a set of error variances to improve detection performance. The simulation results show that the proposed precoder and the hybrid linear equalizer can achieve performance results very close to those of the fully digital system. Moreover, just two iterations of the proposed algorithm are already enough to match the full centralized approach performance. [ABSTRACT FROM AUTHOR]

In this paper, we study a quantized feedback scheme to maximize the goodput of a finite blocklength communication scenario over a quasi-static fading channel. It is assumed that the receiver has perfect channel state information (CSI) and sends back the CSI to the transmitter over a resolution-limited error-free feedback channel. With this partial CSI, the transmitter is supposed to select the optimum transmission rate, such that it maximizes the overall goodput of the communication system. This problem has been studied for the asymptotic blocklength regime, however, no solution has so far been presented for finite blocklength. Here, we study this problem in two cases: with and without constraint on reliability. We first formulate the optimization problems and analytically solve them. Iterative algorithms that successfully exploit the system parameters for both cases are presented. It is shown that although the achievable maximum goodput decreases with shorter blocklengths and higher reliability requirements, significant improvement can be achieved even with coarsely quantized feedback schemes. [ABSTRACT FROM AUTHOR]

Although 5G networks have enabled mobile users to get a better experience, task scheduling remains challenging for massive Internet of Things (IoT) devices in remote areas. This paper investigates the task scheduling problem for delay-aware IoT applications in civil aircraft-augmented space-air-ground integrated networks (CAA-SAGIN), where the normalized sky access platforms (SAPs) can collect and forward the terrestrial tasks. Specifically, we first propose an access control scheme for a non-preemptive priority queuing system and a transmission control scheme with cross-layer optimization. Secondly, considering the uncertain distribution of the transmission numbers and generated data, we formulate a robust two-stage stochastic optimization problem of delay minimization. With the proposed robust task scheduling with risk aversion (RTS-RA) algorithm, the original problem can be decomposed into two subproblems, which can be further transformed into tractable semi-definite program (SDP) problems respectively. Simulation results show that the cross-layer optimization scheme can achieve a good tradeoff between delay and throughput. Also, the RTS-RA algorithm outperforms the exiting offloading schemes in terms of end-to-end delay, transmitted data, and energy consumption with lower computational complexity. [ABSTRACT FROM AUTHOR]

In this paper, the role of feedback in two-way full-duplex Gaussian channel (TW-FD-GC) is revisited. First, we propose a practical coding scheme for the TW-FD-GC, which is based on the noisy type of the well-known Schalkwijk-Kailath (SK) feedback scheme. We show that though this scheme cannot achieve the capacity of the TW-FD-GC, the codeword length that achieves desired decoding error probability is extremely short. Then, we further prove that the proposed scheme is secure by itself, i.e., the achievable rate region of the proposed scheme is also an achievable secrecy rate region of the two-way full-duplex Gaussian wiretap channel (TW-FD-GWTC). In addition, for the TW-FD-GWTC, numerical result shows that the secrecy sum rate of our proposed scheme can be as large as those achieved by existing schemes in the literature for some cases. Next, we extend the proposed scheme to the TW-FD-GC with Gaussian state interference non-causally known by the corresponding transmitter. We show that the interference can be perfectly canceled by this extended scheme. Finally, we prove that this extended scheme is also secure by itself, and numerical result shows that this extended scheme may perform better than the existing ones in the literature. [ABSTRACT FROM AUTHOR]

Wireless powered multi-access edge computing (MEC) has emerged as a promising paradigm to enable high-performance computation of energy-constrained wireless devices (WDs) in internet of things (IoT) systems. However, to overcome the severe path loss of both energy transfer and data communications, wireless powered MEC suffers from high operating power consumption. To achieve sustainable and economic system operation, this paper focuses on developing energy-efficient online data processing strategy for wireless powered MEC systems under stochastic fading channels. In particular, we consider a hybrid access point (HAP) transmitting RF energy to and processing the sensing data offloaded from multiple WDs. Under an average power constraint of the HAP, we target at maximizing the long-term average data sensing rate of the WDs while maintaining task data queue stability. To this end, we formulate a multi-stage stochastic optimization problem to control the energy transfer and task data processing in sequential time slots. Without the knowledge of future channel fading, it is very challenging to determine the sequential control actions that are tightly coupled by the battery and data buffer dynamics. To solve the problem, we propose a Lyapunov optimization-based online algorithm named LEESE, which decomposes the multi-stage stochastic problem into per-slot deterministic optimization problems. We show that each per-slot problem can be equivalently transformed into a convex optimization problem. To facilitate online implementation in large-scale MEC systems, instead of solving the per-slot problem with off-the-shelf convex algorithms, we propose a block coordinate descent (BCD)-based method that produces a close-to-optimal solution in less than 0.04% of the computation delay. Simulation results demonstrate that the proposed LEESE algorithm can provide 18% higher data sensing rate than the representative benchmark methods considered, while incurring sub-millisecond computation delay suitable for real-time control under fading channel. [ABSTRACT FROM AUTHOR]

Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices, where the quantum approximation optimization algorithm (QAOA) constitutes a promising candidate for demonstrating tangible quantum advantages based on NISQ devices. In this paper, we consider the maximum likelihood (ML) detection problem of binary symbols transmitted over a multiple-input and multiple-output (MIMO) channel, where finding the optimal solution is exponentially hard using classical computers. Here, we apply the QAOA for the ML detection by encoding the problem of interest into a level- $p$ QAOA circuit having $2p$ variational parameters, which can be optimized by classical optimizers. This level- $p$ QAOA circuit is constructed by applying the prepared Hamiltonian to our problem and the initial Hamiltonian alternately in $p$ consecutive rounds. More explicitly, we first encode the optimal solution of the ML detection problem into the ground state of a problem Hamiltonian. Using the quantum adiabatic evolution technique, we provide both analytical and numerical results for characterizing the evolution of the eigenvalues of the quantum system used for ML detection. Then, for level-1 QAOA circuits, we derive the analytical expressions of the expectation values of the QAOA and discuss the complexity of the QAOA based ML detector. Explicitly, we evaluate the computational complexity of the classical optimizer used and the storage requirement of simulating the QAOA. Finally, we evaluate the bit error rate (BER) of the QAOA based ML detector and compare it both to the classical ML detector and to the classical minimum mean squared error (MMSE) detector, demonstrating that the QAOA based ML detector is capable of approaching the performance of the classical ML detector. [ABSTRACT FROM AUTHOR]

Faster-than-Nyquist signaling (FTNS) has already been shown to increase the communication capacity on certain channels such as additive white Gaussian noise and block flat multiple-input multiple-output (MIMO) Rayleigh fading channels. The following issues, however, remain unresolved: 1) whether FTNS enables a capacity increase in generalized MIMO Rayleigh fading channels that are selective in time, frequency, and space; and 2) how channel selectivities affect the capacity and if present, the FTN capacity gain. To address the issues, this paper firstly investigates the ergodic capacity of MIMO-FTN transmission over triply-selective fading channels. We derive a low-complexity approximate capacity formula and also show how it degenerates in other channel models, such as doubly-selective single-input single-output fading channels, which can be considered as the special cases of triply-selective fading channels. The capacity evaluation results obtained under different channel conditions show that: 1) MIMO-FTN outperforms MIMO-Nyquist in terms of capacity; 2) the FTN gains are nearly consistent, while the FTN gains obtained in the frequency-selective fading channels are slightly higher than those obtained in the flat fading channels. [ABSTRACT FROM AUTHOR]

This paper presents a novel antenna configuration to measure directions of multiple signal sources at the receiver in a THz mobile network via a single channel measurement. Directional communication is an intrinsic attribute of THz wireless networks and the knowledge of direction should be harvested continuously to maintain link quality. Direction discovery can potentially impose an immense burden on the network that limits its communication capacity exceedingly. To utterly mitigate direction discovery overhead, we propose a novel technique called spectrum shaping capable of measuring direction, power, and relative distance of propagation paths via a single measurement. We demonstrate that the proposed technique is also able to measure the transmitter antenna orientation. We evaluate the performance of the proposed design in several scenarios and show that the introduced technique performs similar to a large array of antennas while attaining a much simpler hardware architecture. Results show that the spectrum shaping with only two antennas placed 0.5 mm, 5 mm, and 1 cm apart performs direction of arrival estimation similar to a much more complex uniform linear array equipped with 7, 60, and 120 antennas, respectively. [ABSTRACT FROM AUTHOR]

In this paper, the performance of a wireless system, which is beneficial from utilization of multiple reconfigurable intelligent surfaces (RISs) and the direct link between the source node and the mobile user, is analyzed. Especially, the effect of transceiver hardware impairments (HIs) are taken into consideration. We successfully derive the outage probability (OP), throughput, achievable data rate (ADR), and symbol error probability (SEP) expressions of this multiple-RIS assisted wireless systems with and without HIs (referred as RIS-HI and RIS-ID system, respectively) over Nakagami- $m$ fading channels. The above performance factors are also benchmarked with the case that only a point-to-point (P2P) link without RIS is considered (denotes as as P2P-HI and P2P-ID systems for HI and ideal hardware conditions, respectively). All obtained formulas are verified by Monte-Carlo simulations. It is observed that the RIS-HI system significantly outperforms the P2P-HI system at low transmit power regime, while the performance of the RIS-ID system is always better than that of P2P-ID system. On the other hand, HIs show more severe effect for higher data transmission rates or high modulation orders. [ABSTRACT FROM AUTHOR]

Multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM), a fundamental transmission scheme, promises high throughput and robustness against multipath fading. However, these benefits rely on the efficient detection strategy at the receiver and come at the expense of the extra bandwidth consumed by the cyclic prefix (CP). We use the iterative orthogonal approximate message passing (OAMP) algorithm in this paper as the prototype of the detector because of its remarkable potential for interference suppression. However, OAMP is computationally expensive for the matrix inversion per iteration. We replace the matrix inversion with the conjugate gradient (CG) method to reduce the complexity of OAMP. We further unfold the CG-based OAMP algorithm into a network and tune the critical parameters through deep learning (DL) to enhance detection performance. Simulation results and complexity analysis show that the proposed scheme has significant gain over other iterative detection methods and exhibits comparable performance to the state-of-the-art DL-based detector at a reduced computational cost. Furthermore, we design a highly efficient CP-free MIMO-OFDM receiver architecture to remove the CP overhead. This architecture first eliminates the intersymbol interference by buffering the previously recovered data and then detects the signal using the proposed detector. Numerical experiments demonstrate that the designed receiver offers a higher spectral efficiency than traditional receivers. Finally, over-the-air tests verify the effectiveness and robustness of the proposed scheme in realistic environments. [ABSTRACT FROM AUTHOR]

Over the past few years, the use of wireless sensor networks in a range of Internet of Things (IoT) scenarios has grown in popularity. Since IoT sensor devices have restricted battery power, a proper IoT data aggregation approach is crucial to prolong the network lifetime. To this end, current approaches typically form a virtual aggregation backbone based on a connected dominating set or maximal independent set to utilize independent transmissions of dominators. However, they usually have a fairly long aggregation delay because the dominators become bottlenecks for receiving data from all dominatees. The problem of time-efficient data aggregation in multichannel duty-cycled IoT sensor networks is analyzed in this paper. We propose a novel aggregation approach, named LInk-delay-aware REinforcement (LIRE), leveraging active slots of sensors to explore a routing structure with pipeline links, then scheduling all transmissions in a bottom-up manner. The reinforcement schedule accelerates the aggregation by exploiting unused channels and time slots left off at every scheduling round. LIRE is evaluated in a variety of simulation scenarios through theoretical analysis and performance comparisons with a state-of-the-art scheme. The simulation results show that LIRE reduces more than 80% aggregation delay compared to the existing scheme. [ABSTRACT FROM AUTHOR]

In this paper, a multi-vehicle multi-task non-orthogonal multiple access (NOMA) assisted mobile edge computing (MEC) system with passive eavesdropping vehicles is investigated. To heighten the performances of edge vehicles, we propose a vehicle grouping pairing method, which utilizes vehicles near the MEC to assist edge vehicles as full-duplex relays. For promoting transmission security, we employ artificial noise to interrupt eavesdropping vehicles. Furthermore, we derive the approximate expression of the secrecy outage probability of the system. The combined optimization of vehicle task division, power allocation, and transmit beamforming is formulated to minimize the total delay of task completion for edge vehicles. Then, we design a power allocation and task scheduling algorithm based on the genetic algorithm to solve the mixed-integer non-linear programming problem. Numerical results demonstrate the superiority of our proposed scheme in terms of system security and transmission delay. [ABSTRACT FROM AUTHOR]

Reconfigurable intelligent surface (RIS) is a revolutionary technology and can be used to assist communication systems by adaptively manipulating the wireless environment. In this paper, we propose a novel cascaded channel estimation algorithm for the RIS-assisted multiple-input multiple-output orthogonal frequency division multiplexing systems. Inspired by the channel compression idea, we can obtain a sub-sampled channel by turning off a fraction of RIS elements and then extrapolate it to the complete one, by which the pilot overhead is greatly reduced. The problem of channel extrapolation is transformed into recovering the physical parameters of the cascaded channel from the partial channel observations and is then formulated by the sparse Bayesian learning (SBL) framework. In order to circumvent the curse of high dimensional matrices inversion in the vector-matrix system, we further introduce the tensor structure into the SBL framework. Specially, by leveraging of the channel sparsity over the angle domain and delay domain, we derive the virtual channel expression in tensor form and model a Kronecker-structured prior distribution for the virtual channels. The multi-domain sparse properties of the virtual channel tensor can be effectively captured by a group of low-dimensional hyper-parameters, and thus reduce the computational complexity. In addition, the Cramer-Rao lower bound is derived for the proposed channel extrapolation. Simulation results show the superior performance of the proposed scheme. [ABSTRACT FROM AUTHOR]

In this paper, we propose a modified adaptive belief propagation (ABP) algorithm, which is referred to as the random ABP (R-ABP) algorithm, for decoding short channel codes adopted in the fifth generation (5G) New Radio (NR) wireless systems. Based on the cyclic redundancy check (CRC) concatenation structure of 5G channel codes, we can take partial or even all CRC bits into iterative R-ABP decoding to improve the error correction performance, while the error detection capability can still be guaranteed by the remaining CRC bits and a proposed threshold-based acceptance criterion. We call this improved R-ABP decoding the threshold-and-CRC-aided R-ABP (TCA-R-ABP) decoding. The simulation results show that our proposed TCA-R-ABP algorithm outperforms the state-of-the-art decoding algorithms for many 5G low-density parity-check (LDPC) and polar codes. Moreover, the proposed TCA-R-ABP algorithm leads to a unified decoder for LDPC and polar codes, which has the potential to be a lower-complexity decoder over the combination of the belief propagation (BP) and CRC-aided successive cancellation list (CA-SCL) decoders. [ABSTRACT FROM AUTHOR]

Tiled diagonal zipper codes (TDZCs) are shown to be a class of competitive forward error correction codes in modern optical fiber communication systems. This paper introduces the multichain tiled diagonal zipper codes (MC-TDZCs) in which multiple TDZC chains are coupled together in a cyclic manner. Firstly, we present the encoding and decoding algorithms of the proposed MC-TDZCs. Secondly, we analyze the graphical structures of the minimum stall patterns of the MC-TDZCs using directed graphs. Thirdly, we derive the multiplicities of these minimum stall patterns. The analytical results show that the size of the minimum-sized stall patterns of the proposed MC-TDZCs is larger than that of the underlying TDZC counterpart. Finally, we present simulation results to show the performance advantages of the proposed MC-TDZCs under the constraint of equal storage size for decoding. Particularly, a rate 0.94 MC-TDZC with four chains shows more than four orders of magnitude improvement in bit error rates compared to its underlying TDZC counterpart. [ABSTRACT FROM AUTHOR]

In millimeter-wave (MMW) multiple-input multiple-output (MIMO) communications, users and their corresponding base station (BS) have to align their beam during both initial access and data transmissions to compensate for the high propagation loss. The beam alignment (BA) procedure specified for 5th Generation (5G) New Radio (NR) has been designed to be fast and precise in the presence of non-malicious interference and noise. A smart jammer might exploit this weakness and may launch an attack during the BA phase in order to degrade the accuracy of beam selection and, thus, adversely impacting the end-to-end performance and quality-of-service experienced by the users. In this paper, we study the effects of a jamming attack at MMW frequencies during the BA procedure used to perform initial access for idle users and adaptation/recovery for connected users. We show that the BA procedure adopted in 5G NR is extremely vulnerable to a smart jamming attack and, consequently, we propose a countermeasure based on the idea of randomized probing, which consists of randomly corrupting the probing sequence transmitted by the BS in order to reject the jamming signal at the UE via a subspace-based technique based on orthogonal projections and jamming cancellation. Numerical results corroborate our theoretical findings and show the very satisfactory accuracy of the proposed anti-jamming approach. [ABSTRACT FROM AUTHOR]

In this paper, we present the computation-efficient resource allocation (RA) schemes for millimeter-wave mobile edge computing (mmWave-MEC) system with the aid of reconfigurable intelligent surface (RIS), which is used to assist the uplink communication from the users to the base station (BS). By means of the theoretical analysis, the achievable rate and computation efficiency (CE) are derived. Then, the optimization problem for the CE maximization under the constraints of the minimum rate, maximum power consumption and local CPU frequency is formulated, where the joint design of the hybrid beamforming at the BS and the passive beamforming at the RIS as well as the local resource allocation of each user is carried out. An effective iterative algorithm based on the penalized inexact block coordinate descent (BCD) method is proposed to obtain the computation-efficient RA scheme. Next, a low-complexity suboptimal RA scheme based on the BCD method is proposed, and corresponding algorithm is presented. Simulation results show that the proposed schemes are effective, and high CE can be attained. Moreover, the second scheme can achieve the CE performance close to the first scheme but with lower complexity. Besides, it is effective to deploy the RIS scheme in mmWave-MEC system, which can strike a balance between the CE and energy consumption when compared to the conventional relay schemes. [ABSTRACT FROM AUTHOR]

Orthogonal time frequency space (OTFS) has emerged as the most sought-after modulation technique in a high mobility scenario. Sparse code multiple access (SCMA) is an attractive code-domain non-orthogonal multiple access (NOMA) technique. Recently a code-domain NOMA approach for OTFS, named OTFS-SCMA, is proposed. OTFS-SCMA is a promising framework that meets the demands of high mobility and massive connectivity. This paper presents a channel estimation technique based on the convolutional sparse coding (CSC) approach for OTFS-SCMA in the uplink. The channel estimation task is formulated as a CSC problem following a careful rearrangement of the OTFS input-output relation. We use an embedded pilot-aided sparse-pilot structure that enjoys the features of both OTFS and SCMA. The existing channel estimation techniques for OTFS in multi-user scenarios for uplink demand extremely high overhead for pilot and guard symbols, proportional to the number of users. The proposed method maintains a minimal overhead equivalent to a single user without compromising on the estimation error. The results show that the proposed channel estimation algorithm is very efficient in bit error rate (BER), normalized mean square error (NMSE), and spectral efficiency (SE). [ABSTRACT FROM AUTHOR]

Channel estimation is one of the main challenges for implementing reconfigurable intelligent surface (RIS)-aided communication system with a large number of antennas at the base station (BS) because RIS is equipped with many passive reflective elements without active transmitting/receiving and signal processing abilities. In this paper, we focus on the channel estimation in a general RIS-aided multi-user mmWave communication system. Specifically, a novel two-phase channel estimation scheme consisting of on-line and off-line phases is proposed to estimate the BS-RIS channel, RIS-user channel, and BS-user channel, respectively. Inspired by the characteristics of few scatterers in mmWave communication systems, the antenna domain channels are converted into the virtual angular domain channels by using the discrete Fourier transform (DFT) matrix. Thus, the estimation problem can be formulated as a compressed sensing (CS) problem, and solved by using efficient vector approximate message passing (VAMP) algorithm with expectation-maximization (EM) to learn unknown parameters and obtain the estimates simultaneously. Simulation results show that, the above algorithm with two choices of prior distributions in the proposed mmWave RIS-aided multi-user system has fast convergence speed and desirable estimation performance. [ABSTRACT FROM AUTHOR]

Plane spiral orbital angular momentum (PSOAM) mode-groups (MGs) and multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) serve as two emerging techniques for achieving high spectral efficiency (SE) in the next-generation networks. In this paper, a PSOAM MGs based multi-user MIMO-NOMA system is studied, where the base station transmits data to users by utilizing the generated PSOAM beams. For such scenario, the interference between users in different PSOAM mode groups can be avoided, which leads to a significant performance enhancement. We aim to maximize the energy efficiency (EE) of the system subject to the constraints of the total transmission power and the minimum data rate. This designed optimization problem is non-convex owing to the interference among users, and hence is quite difficult to tackle directly. To solve this issue, we develop a dual layer resource allocation algorithm where the bisection method is exploited in the outer layer to obtain the optimal EE and a resource distributed iterative algorithm is exploited in the inner layer to optimize the transmit power. Besides, an alternative resource allocation algorithm with Deep Belief Networks (DBN) is proposed to cope with the requirement for low computational complexity. Simulation results verify the theoretical findings and demonstrate the proposed algorithms on the PSOAM MGs based MIMO-NOMA system can obtain a better performance comparing to the conventional MIMO-NOMA system in terms of EE. [ABSTRACT FROM AUTHOR]

Due to the considerable fading arising from the long-distance transmission between satellites and terrestrial terminals as well as the complex geographic environments on the earth, aerial relays have been designed to facilitate the information delivery between the satellites and terrestrial terminals when reliable direct data transmissions cannot be achieved. In this paper, a cooperative satellite-aerial-terrestrial network (CSATN) system including a satellite (S), an aerial relay (R), and a terrestrial receiver (D) is considered, while decode-and-forward relay scheme is adopted. Specifically, inspired by the beam shape of the transmission signal from S, we model the operation space of R as a circular truncated cone to accurately reflect the practical large-scale transmission scenarios, the height of which is decided by the upper and lower limitations of the operation height of R. Thus, considering the randomness of R and D and employing geometric probability theory, the exact and asymptotic outage probability (OP) of S-R, S-D, and R-D links is studied, and then the end-to-end outage performance of CSATN is investigated accordingly by using approximation method. Finally, numerical results are presented to validate our proposed analysis. [ABSTRACT FROM AUTHOR]

The autoencoder empowered by artificial intelligence has shown considerable potential in solving channel state information (CSI) feedback problems in frequency-division duplexing systems. However, this method needs to completely change the existing feedback schemes, which is difficult to deploy in the next few years. This paper proposes an environment knowledge-aided codebook-based CSI feedback framework, which retains the existent codebook-based scheme while introducing environment knowledge to feedback process through neural networks (NNs) at the base station. Only an NN-based refining operation is added after the common standardized feedback approach. The NNs learn to automatically extract environment features and utilize the channel statistics through large volumes of recorded data. The NNs also use the partial correlation between bidirectional channels to further improve feedback performance. In addition, to deal with downlink channel estimation errors, we propose two strategies to reduce their effects using an NN-based denoise module. The proposed framework can be easily embedded in most existing codebook-based feedback methods, such as random vector quantization. Two channel datasets generated by QuaDRiGa and measured in practical systems are adopted to evaluate the proposed methods. Results show that the proposed method offers over 100% increase in the throughput compared with the baseline codebook because of more accurate feedback. [ABSTRACT FROM AUTHOR]