Searcharxiv⌕ Search

arXiv subjects

Gaojie Chen

Publications and source records attributed to Gaojie Chen.

At least 73 records · Page 4Linked to original sources

Transformer-based Joint Source Channel Coding for Textual Semantic Communication

The Space-Air-Ground-Sea integrated network calls for more robust and secure transmission techniques against jamming. In this paper, we propose a textual semantic transmission framework for robust transmission, which utilizes the advanced natural language processing techniques to model and encode sentences. Specifically, the textual sentences are firstly split into tokens using wordpiece algorithm, and are embedded to token vectors for semantic extraction by Transformer-based encoder. The encoded data are quantized to a fixed length binary sequence for transmission, where binary erasure, symmetric, and deletion channels are considered for transmission. The received binary sequences are further decoded by the transformer decoders into tokens used for sentence reconstruction. Our proposed approach leverages the power of neural networks and attention mechanism to provide reliable and efficient communication of textual data in challenging wireless environments, and simulation results on semantic similarity and bilingual evaluation understudy prove the superiority of the proposed model in semantic transmission.

cs.CL↗

On DoF of Active RIS-Assisted MIMO Interference Channel with Arbitrary Antenna Configurations: When Will RIS Help?

An active reconfigurable intelligent surface (RIS) has been shown to be able to enhance the sum-of-degrees-of-freedom (DoF) of a two-user multiple-input multiple-output (MIMO) interference channel (IC) with equal number of antennas at each transmitter and receiver. However, for any number of receive and transmit antennas, when and how an active RIS can help to improve the sum-DoF are still unclear. This paper studies the sum-DoF of an active RIS-assisted two-user MIMO IC with arbitrary antenna configurations. In particular, RIS beamforming, transmit zero-forcing, and interference decoding are integrated together to combat the interference problem. In order to maximize the achievable sum-DoF, an integer optimization problem is formulated to optimize the number of eliminating interference links by RIS beamforming. As a result, the derived achievable sum-DoF can be higher than the sum-DoF of two-user MIMO IC, leading to a RIS gain. Furthermore, a sufficient condition of the RIS gain is given as the relationship between the number of RIS elements and the antenna configuration.

cs.IT↗

DoF Upper Bound on Three-User MISO Broadcast Channel with Two Antennas and Mixed CSIT

With delayed and imperfect current channel state information at the transmitter (CSIT), namely mixed CSIT, the sum degrees-of-freedom (sum-DoF) in the two-user multiple-input multiple-output (MIMO) broadcast channel and the $K$-user multiple-input single-output (MISO) broadcast channel with not-less-than-$K$ transmit antennas have been obtained. However, the case of the three-user broadcast channel with two transmit antennas and mixed CSIT is still unexplored. In this paper, we investigate the sum-DoF upper bound of three-user MISO broadcast channel with two transmit antennas and mixed CSIT. By exploiting genie-aided signaling and extremal inequalities, we derive the sum-DoF upper bound as $(1-α)3/2 + 9α/4$, which is at most $12.5\%$ larger than the expected sum-DoF, given by $(1-α)3/2 + 2α$. This indicates that the gap may mitigate by better bounding the imperfect current CSIT counterpart.

cs.IT↗

Cooperative Hybrid Networks with Active Relays and RISs for B5G: Applications, Challenges, and Research Directions

Among the recent advances and innovations in wireless technologies, reconfigurable intelligent surfaces (RISs) have received much attention and are envisioned to be one of the enabling technologies for beyond 5G (B5G) networks. On the other hand, active (or classical) cooperative relays have played a key role in providing reliable and power-efficient communications in previous wireless generations. In this article, we focus on hybrid network architectures that amalgamate both active relays and RISs. The operation concept and protocols of each technology are first discussed. Subsequently, we present multiple use cases of cooperative hybrid networks where both active relays and RISs can coexist harmoniously for enhanced rate performance. Furthermore, a case study is provided which demonstrates the achievable rate performance of a communication network assisted by either an active relay, an RIS, or both, and with different relaying protocols. Finally, we provide the reader with the challenges and key research directions in this area.

cs.IT↗

Secure Transmission for THz-Empowered RIS-Assisted Non-Terrestrial Networks

The non-terrestrial networks (NTNs) are recognized as a key component to provide cost-effective and high-capacity ubiquitous connectivity in the future wireless communications. In this paper, we investigate the secure transmission in a terahertz (THz)-empowered reconfigurable intelligent surface (RIS)-assisted NTN (T-RANTN), which is composed of a low-Earth orbit satellite transmitter, an RIS-installed high-altitude platform (HAP) and two unmanned aerial vehicle (UAV) receivers, only one of which is trustworthy. An approximate ergodic secrecy rate (ESR) expression is derived when the atmosphere turbulence and pointing error due to the characteristics of THz as well as the phase errors resulting from finite precision of RIS and imperfect channel estimation are taken into account simultaneously. Furthermore, according to the statistical and perfect channel state information of the untrustworthy receiver, we optimize the phase shifts of RIS to maximize the lower bound of secrecy rate (SR) and instantaneous SR, respectively, by using semidefinite relaxation method. Simulation results show that both the approximate expression for the ESR and the optimization algorithms are serviceable, and even when the jitter standard variance of the trustworthy receiver is greater than that of the untrustworthy one, a positive SR can still be guaranteed.

cs.IT↗

Performance Analysis of IOS-Assisted NOMA System with Channel Correlation and Phase Errors

In this paper, we investigate the performance of an intelligent omni-surface (IOS) assisted downlink non-orthogonal multiple access (NOMA) network with phase quantization errors and channel estimation errors, where the channels related to the IOS are spatially correlated. First, upper bounds on the average achievable rates of the two users are derived. Then, channel hardening is shown to occur in the proposed system, based on which we derive approximations of the average achievable rates of the two users. The analytical results illustrate that the proposed upper bound and approximation on the average achievable rates are asymptotically equivalent in the number of elements. Furthermore, it is proved that the asymptotic equivalence also holds for the average achievable rates with correlated and uncorrelated channels. Additionally, we extend the analysis by evaluating the average achievable rates for IOS assisted orthogonal multiple access (OMA) and IOS assisted multi-user NOMA scenarios. Simulation results corroborate the theoretical analysis and demonstrate that: i) low-precision elements with only two-bit phase adjustment can achieve the performance close to the ideal continuous phase shifting scheme; ii) The average achievable rates with correlated channels and uncorrelated channels are asymptotically equivalent in the number of elements; iii) IOS-assisted NOMA does not always perform better than OMA due to the reconfigurability of IOS in different time slots.

cs.IT↗

A Design of Low-Projection SCMA Codebooks for Ultra-Low Decoding Complexity in Downlink IoT Networks

This paper conceives a novel sparse code multiple access (SCMA) codebook design which is motivated by the strong need for providing ultra-low decoding complexity and good error performance in downlink Internet-of-things (IoT) networks, in which a massive number of low-end and low-cost IoT communication devices are served. By focusing on the typical Rician fading channels, we analyze the pair-wise probability of superimposed SCMA codewords and then deduce the design metrics for multi-dimensional constellation construction and sparse codebook optimization. For significant reduction of the decoding complexity, we advocate the key idea of projecting the multi-dimensional constellation elements to a few overlapped complex numbers in each dimension, called low projection (LP). An emerging modulation scheme, called golden angle modulation (GAM), is considered for multi-stage LP optimization, where the resultant multi-dimensional constellation is called LP-GAM. Our analysis and simulation results show the superiority of the proposed LP codebooks (LPCBs) including one-shot decoding convergence and excellent error rate performance. In particular, the proposed LPCBs lead to decoding complexity reduction by at least $97\%$ compared to that of the conventional codebooks, whilst owning large minimum Euclidean distance. Some examples of the proposed LPCBs are available at \url{https://github.com/ethanlq/SCMA-codebook}.

cs.IT↗

Performance Analysis of RIS-Assisted Large-Scale Wireless Networks Using Stochastic Geometry

In this paper, we investigate the performance of a reconfigurable intelligent surface (RIS) assisted large-scale network by characterizing the coverage probability and the average achievable rate using stochastic geometry. Considering the spatial correlation between transmitters (TXs) and RISs, their locations are jointly modelled by a Gauss-Poisson process (GPP). Two association strategies, i.e., nearest association and fixed association, are both discussed. For the RIS-aided transmission, the signal power distribution with a direct link is approximated by a gamma random variable using a moment matching method, and the Laplace transform of the aggregate interference power is derived in closed form. Based on these expressions, we analyze the channel hardening effect in the RIS-assisted transmission, the coverage probability, and the average achievable rate of the typical user. We derive the coverage probability expressions for the fixed association strategy and the nearest association strategy in an interference-limited scenario in closed form. Numerical results are provided to validate the analysis and illustrate the effectiveness of RIS-assisted transmission with passive beamforming in improving the system performance. Furthermore, it is also unveiled that the system performance is independent of the density of TXs with the nearest association strategy in the interference-limited scenario.

eess.SP↗

Intelligent Omni Surface-Assisted Self-Interference Cancellation for Full-Duplex MISO System

The full-duplex (FD) communication can achieve higher spectrum efficiency than conventional half-duplex (HD) communication; however, self-interference (SI) is the key hurdle. This paper is the first work to propose the intelligent Omni surface (IOS)-assisted FD multi-input single-output (MISO) FD communication systems to mitigate SI, which solves the frequency-selectivity issue. In particular, two types of IOS are proposed, energy splitting (ES)-IOS and mode switching (MS)-IOS. We aim to maximize data rate and minimize SI power by optimizing the beamforming vectors, amplitudes and phase shifts for the ES-IOS and the mode selection and phase shifts for the MS-IOS. However, the formulated problems are non-convex and challenging to tackle directly. Thus, we design alternative optimization algorithms to solve the problems iteratively. Specifically, the quadratic constraint quadratic programming (QCQP) is employed for the beamforming optimizations, amplitudes and phase shifts optimizations for the ES-IOS and phase shifts optimizations for the MS-IOS. Nevertheless, the binary variables of the MS-IOS render the mode selection optimization intractable, and then we resort to semidefinite relaxation (SDR) and Gaussian randomization procedure to solve it. Simulation results validate the proposed algorithms' efficacy and show the effectiveness of both the IOSs in mitigating SI compared to the case without an IOS.

cs.IT↗

A Novel K-Repetition Design for SCMA

This work presents a novel K-Repetition based HARQ scheme for LDPC coded uplink SCMA by employing a network coding (NC) principle to encode different packets, where K-Repetition is an emerging technique (recommended in 3GPP Release 15) for enhanced reliability and reduced latency in future massive machine-type communication. Such a scheme is referred to as the NC aided K-repetition SCMA (NCK-SCMA). We introduce a joint iterative detection algorithm for improved detection of the data from the proposed LDPC coded NCKSCMA systems. Simulation results demonstrate the benefits of NCK-SCMA with higher throughput and improved reliability over the conventional K-Repetition SCMA.

cs.IT↗

A Novel Multi-Task Learning Empowered Codebook Design for Downlink SCMA Networks

Sparse code multiple access (SCMA) is a promising code-domain non-orthogonal multiple access (NOMA) scheme for the enabling of massive machine-type communication. In SCMA, the design of good sparse codebooks and efficient multiuser decoding have attracted tremendous research attention in the past few years. This paper aims to leverage deep learning to jointly design the downlink SCMA encoder and decoder with the aid of autoencoder. We introduce a novel end-to-end learning based SCMA (E2E-SCMA) design framework, under which improved sparse codebooks and low-complexity decoder are obtained. Compared to conventional SCMA schemes, our numerical results show that the proposed E2E-SCMA leads to significant improvements in terms of error rate and computational complexity.

cs.IT↗

Data Privacy and Utility Trade-Off Based on Mutual Information Neural Estimator

In the era of big data and the Internet of Things (IoT), data owners need to share a large amount of data with the intended receivers in an insecure environment, posing a trade-off issue between user privacy and data utility. The privacy utility trade-off was facilitated through a privacy funnel based on mutual information. Nevertheless, it is challenging to characterize the mutual information accurately with small sample size or unknown distribution functions. In this article, we propose a privacy funnel based on mutual information neural estimator (MINE) to optimize the privacy utility trade-off by estimating mutual information. Instead of computing mutual information in traditional way, we estimate it using an MINE, which obtains the estimated mutual information in a trained way, ensuring that the estimation results are as precise as possible. We employ estimated mutual information as a measure of privacy and utility, and then form a problem to optimize data utility by training a neural network while the estimator's privacy discourse is less than a threshold. The simulation results also demonstrated that the estimated mutual information from MINE works very well to approximate the mutual information even with a limited number of samples to quantify privacy leakage and data utility retention, as well as optimize the privacy utility trade-off.

cs.IT↗

Analyzing Uplink Grant-free Sparse Code Multiple Access System in Massive IoT Networks

Grant-free sparse code multiple access (GF-SCMA) is considered to be a promising multiple access candidate for future wireless networks. In this paper, we focus on characterizing the performance of uplink GF-SCMA schemes in a network with ubiquitous connections, such as the Internet of Things (IoT) networks. To provide a tractable approach to evaluate the performance of GF-SCMA, we first develop a theoretical model taking into account the property of multi-user detection (MUD) in the SCMA system. We then analyze the error rate performance of GF-SCMA in the case of codebook collision to investigate the reliability of GF-SCMA when reusing codebook in massive IoT networks. For performance evaluation, accurate approximations for both success probability and average symbol error probability (ASEP) are derived. To elaborate further, we utilize the analytical results to discuss the impact of codeword sparse degree in GFSCMA. After that, we conduct a comparative study between SCMA and its variant, dense code multiple access (DCMA), with GF transmission to offer insights into the effectiveness of these two schemes. This facilitates the GF-SCMA system design in practical implementation. Simulation results show that denser codebooks can help to support more UEs and increase the reliability of data transmission in a GF-SCMA network. Moreover, a higher success probability can be achieved by GFSCMA with denser UE deployment at low detection thresholds since SCMA can achieve overloading gain.

cs.IT↗

Random Shifting Intelligent Reflecting Surface for OTP Encrypted Data Transmission

In this paper, we propose a novel encrypted data transmission scheme using an intelligent reflecting surface (IRS) to generate secret keys in wireless communication networks. We show that perfectly secure one-time pad (OTP) communications can be established by using a simple random phase shifting of the IRS elements. To maximize the secure transmission rate, we design an optimal time slot allocation algorithm for the IRS secret key generation and the encrypted data transmission phases. Moreover, a theoretical expression of the key generation rate is derived based on Poisson point process (PPP) for the practical scenario when eavesdroppers' channel state information (CSI) is unavailable. Simulation results show that employing our IRS-based scheme can significantly improve the encrypted data transmission performance for a wide-range of wireless channel gains and system parameters.

cs.IT↗

Secret Key Generation for Intelligent Reflecting Surface Assisted Wireless Communication Networks

We propose and analyze secret key generation using intelligent reflecting surface (IRS) assisted wireless communication networks. To this end, we first formulate the minimum achievable secret key capacity for an IRS acting as a passive beamformer in the presence of multiple eavesdroppers. Next, we develop an optimization framework for the IRS reflecting coefficients based on the secret key capacity lower bound. To derive a tractable and efficient solution, we design and analyze a semidefinite relaxation (SDR) and successive convex approximation (SCA) based algorithm for the proposed optimization. Simulation results show that employing our IRS-based algorithm can significantly improve the secret key generation capacity for a wide-range of wireless channel parameters.

eess.SP↗

Secrecy of Multi-Antenna Transmission with Full-Duplex User in the Presence of Randomly Located Eavesdroppers

This paper considers the secrecy performance of several schemes for multi-antenna transmission to single-antenna users with full-duplex (FD) capability against randomly distributed single-antenna eavesdroppers (EDs). These schemes and related scenarios include transmit antenna selection (TAS), transmit antenna beamforming (TAB), artificial noise (AN) from the transmitter, user selection based their distances to the transmitter, and colluding and non-colluding EDs. The locations of randomly distributed EDs and users are assumed to be distributed as Poisson Point Process (PPP). We derive closed form expressions for the secrecy outage probabilities (SOP) of all these schemes and scenarios. The derived expressions are useful to reveal the impacts of various environmental parameters and user's choices on the SOP, and hence useful for network design purposes. Examples of such numerical results are discussed.

cs.IT↗

Hybrid Multicast/Unicast Design in NOMA-based Vehicular Caching System with Supplementary Material

In this paper, we investigate a hybrid multicast/ unicast scheme for a multiple-input single-output cache-aided non-orthogonal multiple access (NOMA) vehicular scenario in the face of rapidly fluctuating vehicular wireless channels. Considering a more practical situation, imperfect channel state information is taking into account. In this paper, we formulate an optimization problem to maximize the unicast sum rate under the constraints of the peak power, the peak backhaul, the minimum unicast rate, and the maximum multicast outage probability. To solve the formulated non-convex problem, a lower bound relaxation method is proposed, which enables a division of the original problem into two convex sub-problems. Computer simulations show that the proposed caching-aided NOMA is superior to the orthogonal multiple access counterpart.

cs.IT↗

Delay Constrained Buffer-Aided Relay Selection in the Internet of Things with Decision-Assisted Reinforcement Learning

This paper investigates the reinforcement learning for the relay selection in the delay-constrained buffer-aided networks. The buffer-aided relay selection significantly improves the outage performance but often at the price of higher latency. On the other hand, modern communication systems such as the Internet of Things often have strict requirement on the latency. It is thus necessary to find relay selection policies to achieve good throughput performance in the buffer-aided relay network while stratifying the delay constraint. With the buffers employed at the relays and delay constraints imposed on the data transmission, obtaining the best relay selection becomes a complicated high-dimensional problem, making it hard for the reinforcement learning to converge. In this paper, we propose the novel decision-assisted deep reinforcement learning to improve the convergence. This is achieved by exploring the a-priori information from the buffer-aided relay system. The proposed approaches can achieve high throughput subject to delay constraints. Extensive simulation results are provided to verify the proposed algorithms.

eess.SP↗