Searcharxiv⌕ Search

arXiv subjects

Kai-Kit Wong

Publications and source records attributed to Kai-Kit Wong.

At least 235 records · Page 13Linked to original sources

STAR-RIS Assisted Covert Communications in NOMA Systems

Covert communications assisted by simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) in non-orthogonal multiple access (NOMA) systems have been explored in this paper. In particular, the access point (AP) transmitter adopts NOMA to serve a downlink covert user and a public user. The minimum detection error probability (DEP) at the warden is derived considering the uncertainty of its background noise, which is used as a covertness constraint. We aim at maximizing the covert rate of the system by jointly optimizing APs transmit power and passive beamforming of STAR-RIS, under the covertness and quality of service (QoS) constraints. An iterative algorithm is proposed to effectively solve the non-convex optimization problem. Simulation results show that the proposed scheme significantly outperforms the conventional RIS-based scheme in ensuring system covert performance.

cs.IT↗

Analytical Characterization of Coverage Regions for STAR-RIS-aided NOMA/OMA Communication Systems

We provide an analytical characterization of the coverage region of simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS)-aided two-user downlink communication systems. The cases of orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) are considered, under the energy-splitting (ES) protocol. Results confirm that the use of STAR-RISs is beneficial to extend the coverage region, and that the use of NOMA provides a better performance compared to the OMA counterpart.

cs.IT↗

Copula-based Performance Analysis for Fluid Antenna Systems under Arbitrary Fading Channels

In this letter, we study the performance of a single-user fluid antenna system (FAS) under arbitrary fading distributions, in which the fading channel coefficients over the ports are correlated. We adopt copula theory to model the structure of dependency between fading coefficients. Specifically, we first derive an exact closed-from expression for the outage probability in the most general case, i.e., for any arbitrary choice of fading distribution and copula. Afterwards, for an important specific case, we analyze the performance of the outage probability under correlated Nakagami-$m$ fading channels by exploiting popular Archimedean copulas, namely, Frank, Clayton, and Gumbel. The results demonstrate that FAS outperforms the conventional single fixed-antenna system in terms of the outage probability. We also see that the spatial correlation dependency structure for the FAS is a key factor to determine its performance, which is natively captured through the choice of copula.

cs.IT↗

Fluid Antenna System: New Insights on Outage Probability and Diversity Gain

To enable innovative applications and services, both industry and academia are exploring new technologies for sixth generation (6G) communications. One of the promising candidates is fluid antenna system (FAS). Unlike existing systems, FAS is a novel communication technology where its antenna can freely change its position and shape within a given space. Compared to the traditional systems, this unique capability has the potential of providing higher diversity and interference-free communications. Nevertheless, the performance limits of FAS remain unclear as its system properties are difficult to analyze. To address this, we approximate the outage probability and diversity gain of FAS in closed-form expressions. We then propose a suboptimal FAS with $N^{*}$ ports, where a significant gain can be obtained over FAS with $N^{*}-1$ ports whilst FAS with $N^{*}+1$ ports only yields marginal improvement over the proposed suboptimal FAS. In this paper, we also provide analytical and simulation results to unfold the key factors that affect the performance of FAS. Limited to systems with one active radio frequency (RF)-chain, we show that the proposed suboptimal FAS outperforms single-antenna (SISO) system and selection combining (SC) system in terms of outage probability. Interestingly, when the given space is $\fracλ{2}$, the outage probability of the proposed suboptimal FAS with one active RF-chain achieves near to that of the maximal ratio combining (MRC) system with multiple active RF-chains.

cs.IT↗

Distributed Information Bottleneck for a Primitive Gaussian Diamond MIMO Channel

This paper considers the distributed information bottleneck (D-IB) problem for a primitive Gaussian diamond channel with two relays and MIMO Rayleigh fading. The channel state is an independent and identically distributed (i.i.d.) process known at the relays but unknown to the destination. The relays are oblivious, i.e., they are unaware of the codebook and treat the transmitted signal as a random process with known statistics. The bottleneck constraints prevent the relays to communicate the channel state information (CSI) perfectly to the destination. To evaluate the bottleneck rate, we provide an upper bound by assuming that the destination node knows the CSI and the relays can cooperate with each other, and also two achievable schemes with simple symbol-by-symbol relay processing and compression. Numerical results show that the lower bounds obtained by the proposed achievable schemes can come close to the upper bound on a wide range of relevant system parameters.

cs.IT↗

Simultaneously Transmitting and Reflecting RIS (STAR-RIS) Assisted Multi-Antenna Covert Communications: Analysis and Optimization

This paper investigates the multi-antenna covert communications assisted by a simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS). In particular, to shelter the existence of covert communications between a multi-antenna transmitter and a single-antenna receiver from a warden, a friendly full-duplex receiver with two antennas is leveraged to make contributions where one antenna is responsible for receiving the transmitted signals and the other one transmits the jamming signals with a varying power to confuse the warden. Considering the worst case, the closed-form expression of the minimum detection error probability (DEP) at the warden is derived and utilized in a covert constraint to guarantee the system performance. Then, we formulate an optimization problem maximizing the covert rate of the system under the covertness constraint and quality of service (QoS) constraint with communication outage analysis. To jointly design the active and passive beamforming of the transmitter and STAR-RIS, an iterative algorithm based on semi-definite relaxation (SDR) method and Dinkelbachs algorithm is proposed to effectively solve the non-convex optimization problem. Simulation results show that the proposed STAR-RIS-assisted scheme highly outperforms the case with conventional RIS, which validates the effectiveness of the proposed algorithm as well as the superiority of STAR-RIS in guaranteeing the covertness of wireless communications.

cs.IT↗

A Novel Channel Model for Reconfigurable Intelligent Surfaces with Consideration of Polarization and Switch Impairments

Future wireless networks require the ability to actively adjust the wireless environment to meet strict performance indicators. Reconfigurable Intelligent Surface (RIS) technology is gaining attention for its advantages of low power consumption, cost-effectiveness, and ease of deployment. However, existing channel models for RIS often ignore important properties, such as the impairment in the RIS's switch component and the polarization efficiency among antennas, limiting their practical use. In this paper, we propose a new channel model for RIS that considers these ignored properties, including the reflected field, scattered field, and antenna resonant mode. We verify the proposed model through the practical implementation of a 4 x 4 RIS array with patch antennas in the 3.5 GHz band, using a phase shifter as the switch component of a RIS element. The equivalent model of the phase shifter is also formulated and incorporated into the channel model. We propose a blind controlling algorithm to discuss the properties of our channel model and emphasize the importance of considering polarization and tracking mechanisms for the controlling algorithm. Our channel model is an improvement over existing models and can be used in the practical design of RIS technology. The proposed algorithm provides a practical approach to controlling the wireless environment, suitable for various wireless applications.

cs.IT↗

Resource Allocation for Cell-Free Massive MIMO-aided URLLC Systems Relying on Pilot Sharing

Resource allocation is conceived for cell-free (CF) massive multi-input multi-output (MIMO)-aided ultra-reliable and low latency communication (URLLC) systems. Specifically, to support multiple devices with limited pilot overhead, pilot reuse among the users is considered, where we formulate a joint pilot length and pilot allocation strategy for maximizing the number of devices admitted. Then, the pilot power and transmit power are jointly optimized while simultaneously satisfying the devices' decoding error probability, latency, and data rate requirements. Firstly, we derive the lower bounds (LBs) of ergodic data rate under finite channel blocklength (FCBL). Then, we propose a novel pilot assignment algorithm for maximizing the number of devices admitted. Based on the pilot allocation pattern advocated, the weighted sum rate (WSR) is maximized by jointly optimizing the pilot power and payload power. To tackle the resultant NP-hard problem, the original optimization problem is first simplified by sophisticated mathematical transformations, and then approximations are found for transforming the original problems into a series of subproblems in geometric programming (GP) forms that can be readily solved. Simulation results demonstrate that the proposed pilot allocation strategy is capable of significantly increasing the number of admitted devices and the proposed power allocation achieves substantial WSR performance gain.

eess.SP↗

Deep Learning Based Predictive Beamforming Design

This paper investigates deep learning techniques to predict transmit beamforming based on only historical channel data without current channel information in the multiuser multiple-input-single-output downlink. This will significantly reduce the channel estimation overhead and improve the spectrum efficiency especially in high-mobility vehicular communications. Specifically, we propose a joint learning framework that incorporates channel prediction and power optimization, and produces prediction for transmit beamforming directly. In addition, we propose to use the attention mechanism in the Long Short-Term Memory Recurrent Neural Networks to improve the accuracy of channel prediction. Simulation results using both a simple autoregressive process model and the more realistic 3GPP spatial channel model verify that our proposed predictive beamforming scheme can significantly improve the effective spectrum efficiency compared to traditional channel estimation and the method that separately predicts channel and then optimizes beamforming.

cs.IT↗

Impact of Phase-Shift Error on the Secrecy Performance of Uplink RIS Communication Systems

Reconfigurable intelligent surface (RIS) has been recognized as a promising technique for the sixth generation (6G) of mobile communication networks. The key feature of RIS is to reconfigure the propagation environment via smart signal reflections. In addition, active RIS schemes have been recently proposed to overcome the deep path loss attenuation inherent in the RIS-aided communication systems. Accordingly, this paper considers the secrecy performance of up-link RIS-aided multiple users multiple-input single-output (MU-MISO) communication systems, in the presence of multiple passive eavesdroppers. In contrast to the existing works, we investigate the impact of the RIS phase shift errors on the secrecy performance. Taking into account the complex environment, where a general Rician channel model is adopted for all the communication links, closed-form approximate expressions for the ergodic secrecy rate are derived for three RIS configurations, namely, i) passive RIS, ii) active RIS, iii) active RIS with energy harvesting (EH RIS). Then, based on the derived expressions, we optimize the phase shifts at the RIS to enhance the system performance. In addition, the best RIS configuration selection is considered for a given target secrecy rate and amount of the power available at the users. Finally, Monte-Carlo simulations are provided to verify the accuracy of the analysis, and the impact of different system parameters on the secrecy performance is investigated. The results in this paper show that, an active RIS scheme can be implemented to enhance the secrecy performance of RIS-aided communication systems with phase shift errors, especially when the users have limited transmission power.

cs.IT↗

Over-the-Air Split Machine Learning in Wireless MIMO Networks

In split machine learning (ML), different partitions of a neural network (NN) are executed by different computing nodes, requiring a large amount of communication cost. To ease communication burden, over-the-air computation (OAC) can efficiently implement all or part of the computation at the same time of communication. Based on the proposed system, the system implementation over wireless network is introduced and we provide the problem formulation. In particular, we show that the inter-layer connection in a NN of any size can be mathematically decomposed into a set of linear precoding and combining transformations over MIMO channels. Therefore, the precoding matrix at the transmitter and the combining matrix at the receiver of each MIMO link, as well as the channel matrix itself, can jointly serve as a fully connected layer of the NN. The generalization of the proposed scheme to the conventional NNs is also introduced. Finally, we extend the proposed scheme to the widely used convolutional neural networks and demonstrate its effectiveness under both the static and quasi-static memory channel conditions with comprehensive simulations. In such a split ML system, the precoding and combining matrices are regarded as trainable parameters, while MIMO channel matrix is regarded as unknown (implicit) parameters.

cs.LG↗

Pricing for Reconfigurable Intelligent Surface Aided Wireless Networks: Models and Principles

Owing to the recent advancements of meta-materials and meta-surfaces, the concept of reconfigurable intelligent surface (RIS) has been embraced to meet the spectral- and energy-efficient, and yet cost-effective solutions for the sixth-generation (6G) wireless networks. From an operational standpoint, RISs can be easily deployed on the facades of buildings and indoor walls. Albeit promising, in the actual network operation, the deployment of RISs may face challenges because of the willingness and benefits of RIS holders from the aspect of installing RISs on their properties. Accordingly, RIS-aided wireless networks are faced with a formidable mission: how to balance the wireless service providers (WSPs) and RIS holders in terms of their respective interests. To alleviate this deadlock, we focus on the application of pricing models in RIS-aided wireless networks in pursuit of a win-win solution for both sides. Specifically, we commence with a comprehensive introduction of RIS pricing with its potential applications in RIS networks, meanwhile the fundamentals of pricing models are summarized in order to benefit both RIS holders and WSPs. In addition, a Stackelberg game-based model is exemplified to illustrate the operation of utility-maximization pricing. Finally, we highlight open issues and future research directions of applying pricing models to the RIS-aided wireless networks.

eess.SY↗

SD-Based Low-Complexity Precoder Design for Gaussian MIMO Wiretap Channels

This paper considers a Gaussian multi-input multi-output (MIMO) multiple access wiretap (MAC-WT) channel, where an eavesdropper (Eve) wants to extract the confidential information of all users. Assuming that both the legitimate receiver and Eve jointly decode their interested messages, we aim to maximize the sum secrecy rate of the system by precoder design. Although this problem could be solved by first using the iterative majorization minimization (MM) based algorithm to get a sequence of convex log-determinant optimization subproblems and then using some general tools, e.g., the interior point method, to deal with each subproblem, this strategy involves quite high computational complexity. Therefore, we propose a simultaneous diagonalization based low-complexity (SDLC) method to maximize the secrecy rate of a simple one-user wiretap channel, and then use this method to iteratively optimize the covariance matrix of each user. Simulation results show that in contrast to the existing approaches, the SDLC scheme achieves similar secrecy performance but requires much lower complexity.

cs.IT↗

Beamforming Design for the Performance Optimization of Intelligent Reflecting Surface Assisted Multicast MIMO Networks

In this paper, the problem of maximizing the sum of data rates of all users in an intelligent reflecting surface (IRS)-assisted millimeter wave multicast multiple-input multiple-output communication system is studied. In the considered model, one IRS is deployed to assist the communication from a multiantenna base station (BS) to the multi-antenna users that are clustered into several groups. Our goal is to maximize the sum rate of all users by jointly optimizing the transmit beamforming matrices of the BS, the receive beamforming matrices of the users, and the phase shifts of the IRS. To solve this non-convex problem, we first use a block diagonalization method to represent the beamforming matrices of the BS and the users by the phase shifts of the IRS. Then, substituting the expressions of the beamforming matrices of the BS and the users, the original sum-rate maximization problem can be transformed into a problem that only needs to optimize the phase shifts of the IRS. To solve the transformed problem, a manifold method is used. Simulation results show that the proposed scheme can achieve up to 28.6% gain in terms of the sum rate of all users compared to the algorithm that optimizes the hybrid beamforming matrices of the BS and the users using our proposed scheme and randomly determines the phase shifts of the IRS.

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 Note on Fourier-Motzkin Elimination with Three Eliminating Variables

In this note, we show how difficult the brute-force Fourier-Motzkin elimination is, even in a simple case with three eliminating variables. Specifically, we first give a theorem, which plays quite an important role in the study of information-theoretic security for a multiple access wiretap (MAC-WT) channel, and then prove it for the case with three users by directly using the Fourier-Motzkin procedure. It is shown that large amounts of inequalities are generated in the elimination procedure while most of them are redundant. Actually, the number of generated inequalities grows doubly exponentially with the number of users or eliminating variables. It thus becomes unmanageable to directly prove the theorem in this brute-force way. Besides the great complexity, another disadvantage of the direct strategy is that it works only if the number of users is given. Obviously, this makes the strategy inappropriate for the proof of the theorem since it is a general result for any number of users. It is thus urgent and challenging to generally prove the theorem.

cs.IT↗

Environment Sensing Considering the Occlusion Effect: A Multi-View Approach

In this paper, we consider the problem of sensing the environment within a wireless cellular framework. Specifically, multiple user equipments (UEs) send sounding signals to one or multiple base stations (BSs) and then a centralized processor retrieves the environmental information from all the channel information obtained at the BS(s). Taking into account the occlusion effect that is common in the wireless context, we make full use of the different views of the environment from different users and/or BS(s), and propose an effective sensing algorithm called GAMP-MVSVR (generalized-approximate-message-passing-based multi-view sparse vector reconstruction). In the proposed algorithm, a multi-layer factor graph is constructed to iteratively estimate the scattering coefficients of the cloud points and their occlusion relationship. In each iteration, the occlusion relationship between the cloud points of the sparse environment is recalculated according to a simple occlusion detection rule, and in turn, used to estimate the scattering coefficients of the cloud points. Our proposed algorithm can achieve improved sensing performance with multi-BS collaboration in addition to the multi-views from the UEs. The simulation results verify its convergence and effectiveness.

eess.SP↗

Distributed Information Bottleneck for a Primitive Gaussian Diamond Channel with Rayleigh Fading

This paper considers the distributed information bottleneck (D-IB) problem for a primitive Gaussian diamond channel with two relays and Rayleigh fading. Due to the bottleneck constraint, it is impossible for the relays to inform the destination node of the perfect channel state information (CSI) in each realization. To evaluate the bottleneck rate, we provide an upper bound by assuming that the destination node knows the CSI and the relays can cooperate with each other, and also three achievable schemes with simple symbol-by-symbol relay processing and compression. Numerical results show that the lower bounds obtained by the proposed achievable schemes can come close to the upper bound on a wide range of relevant system parameters.

cs.IT↗