arXiv subjects

Derrick Wing Kwan Ng

Publications and source records attributed to Derrick Wing Kwan Ng.

At least 253 records · Page 14Linked to original sources

arXiv2020

Deep Transfer Learning-Assisted Signal Detection for Ambient Backscatter Communications

Existing tag signal detection algorithms inevitably suffer from a high bit error rate (BER) due to the difficulties in estimating the channel state information (CSI). To eliminate the requirement of channel estimation and to improve the system performance, in this paper, we adopt a deep transfer learning (DTL) approach to implicitly extract the features of communication channel and directly recover tag symbols. Inspired by the powerful capability of convolutional neural networks (CNN) in exploring the features of data in a matrix form, we design a novel covariance matrix aware neural network (CMNet)-based detection scheme to facilitate DTL for tag signal detection, which consists of offline learning, transfer learning, and online detection. Specifically, a CMNet-based likelihood ratio test (CMNet-LRT) is derived based on the minimum error probability (MEP) criterion. Taking advantage of the outstanding performance of DTL in transferring knowledge with only a few training data, the proposed scheme can adaptively fine-tune the detector for different channel environments to further improve the detection performance. Finally, extensive simulation results demonstrate that the BER performance of the proposed method is comparable to that of the optimal detection method with perfect CSI.

eess.SP↗

arXiv2020

Performance Analysis of Coded OTFS Systems over High-Mobility Channels

Orthogonal time frequency space (OTFS) modulation is a recently developed multi-carrier multi-slot transmission scheme for wireless communications in high-mobility environments. In this paper, the error performance of coded OTFS modulation over high-mobility channels is investigated. We start from the study of conditional pairwise-error probability (PEP) of the OTFS scheme, based on which its performance upper bound of the coded OTFS system is derived. Then, we show that the coding improvement for OTFS systems depends on the squared Euclidean distance among codeword pairs and the number of independent resolvable paths of the channel. More importantly, we show that there exists a fundamental trade-off between the coding gain and the diversity gain for OTFS systems, i.e., the diversity gain of OTFS systems improves with the number of resolvable paths, while the coding gain declines. Furthermore, based on our analysis, the impact of channel coding parameters on the performance of the coded OTFS systems is unveiled. The error performance of various coded OTFS systems over high-mobility channels is then evaluated. Simulation results demonstrate a significant performance improvement for OTFS modulation over the conventional orthogonal frequency division multiplexing (OFDM) modulation over high-mobility channels. Analytical results and the effectiveness of the proposed code design are also verified by simulations with the application of both classical and modern codes for OTFS systems.

cs.IT↗

arXiv2020

Hybrid MAP and PIC Detection for OTFS Modulation

Orthogonal time frequency space (OTFS) modulation has attracted substantial attention recently due to its great potential of providing reliable communications in high-mobility scenarios. In this paper, we propose a novel hybrid signal detection algorithm for OTFS modulation. By characterizing the input-output relationship of OTFS modulation, we derive the near-optimal symbol-wise maximum a posteriori (MAP) detection algorithm for OTFS modulation, which aims to extract the information of each transmitted symbol based on the corresponding related received symbols. Furthermore, in order to reduce the detection complexity, we propose a partitioning rule that separates the related received symbols into two subsets for detecting each transmitted symbol, according to the corresponding path gains. We then introduce a hybrid detection algorithm to exploit the power discrepancy of each subset, where the MAP detection is applied to the subset with larger channel gains, while the parallel interference cancellation (PIC) detection is applied to the subset with smaller channel gains. Simulation results show that the proposed algorithms can not only approach the performance of the near-optimal symbol-wise MAP algorithms, but also offer a substantial performance gain compared with existing algorithms.

cs.IT↗

arXiv2020

Transmitter and Receiver Window Designs for Orthogonal Time Frequency Space Modulation

In this paper, we investigate the impacts of transmitter and receiver windows on the performance of orthogonal time-frequency space (OTFS) modulation and propose window designs to improve the OTFS channel estimation and data detection performance. In particular, assuming ideal pulse shaping filters at the transceiver, we derive the impacts of windowing on the effective channel and its estimation performance in the delay-Doppler (DD) domain, the total average transmit power and the effective noise covariance matrix. When the channel state information (CSI) is available at the transceiver, we analyze the minimum squared error (MSE) of data detection and propose an optimal transmitter window to minimize the detection MSE. The proposed optimal transmitter window is interpreted as a mercury/water-filling power allocation scheme, where the mercury is firstly filled before pouring water to pre-equalize the TF domain channels. When the CSI is not available at the transmitter but can be estimated at the receiver, we propose to apply a Dolph-Chebyshev (DC) window at either the transmitter or the receiver, which can effectively enhance the sparsity of the effective channel in the DD domain. Thanks to the enhanced DD domain channel sparsity, the channel spread due to the fractional Doppler is significantly reduced, which leads to a lower error floor in both channel estimation and data detection compared with that of rectangular window. Simulation results verify the accuracy of the obtained analytical results and confirm the superiority of the proposed window designs in improving the channel estimation and data detection performance over the conventional rectangular window design.

cs.IT↗

arXiv2020

Beamforming Optimization for IRS-Aided Communications with Transceiver Hardware Impairments

In this paper, we focus on intelligent reflecting surface (IRS) assisted multi-antenna communications with transceiver hardware impairments encountered in practice. In particular, we aim to maximize the received signal-to-noise ratio (SNR) taking into account the impact of hardware impairments, where the source transmit beamforming and the IRS reflect beamforming are jointly designed under the proposed optimization framework. To circumvent the non-convexity of the formulated design problem, we first derive a closed-form optimal solution to the source transmit beamforming. Then, for the optimization of IRS reflect beamforming, we obtain an upper bound to the optimal objective value via solving a single convex problem. A low-complexity minorization-maximization (MM) algorithm was developed to approach the upper bound. Simulation results demonstrate that the proposed beamforming design is more robust to the hardware impairments than that of the conventional SNR maximized scheme. Moreover, compared to the scenario without deploying an IRS, the performance gain brought by incorporating the hardware impairments is more evident for the IRS-aided communications.

cs.IT↗

arXiv2020

Sum-Rate Maximization for IRS-Assisted UAV OFDMA Communication Systems

In this paper, we consider the application of intelligent reflecting surface (IRS) in unmanned aerial vehicle (UAV)-based orthogonal frequency division multiple access (OFDMA) communication systems, which exploits both the significant beamforming gain brought by the IRS and the high mobility of UAV for improving the system sum-rate. The joint design of UAV's trajectory, IRS scheduling, and communication resource allocation for the proposed system is formulated as a non-convex optimization problem to maximize the system sum-rate while taking into account the heterogeneous quality-of-service (QoS) requirement of each user. The existence of an IRS introduces both frequency-selectivity and spatial-selectivity in the fading of the composite channel from the UAV to ground users. To facilitate the design, we first derive the expression of the composite channels and propose a parametric approximation approach to establish an upper and a lower bound for the formulated problem. An alternating optimization algorithm is devised to handle the lower bound optimization problem and its performance is compared with the benchmark performance achieved by solving the upper bound problem. Simulation results unveil the small gap between the developed bounds and the promising sum-rate gain achieved by the deployment of an IRS in UAV-based communication systems.

cs.IT↗

arXiv2020

Weighted Sum-Rate Maximization for Multi-IRS-assisted Full-Duplex Systems with Hardware Impairments

Smart and reconfigurable wireless communication environments can be established by exploiting well-designed intelligent reflecting surfaces (IRSs) to shape the communication channels. In this paper, we investigate how multiple IRSs affect the performance of multi-user full-duplex communication systems under hardware impairment at each node, wherein the base station (BS) and the uplink users are subject to maximum transmission power constraints. Firstly, the uplink-downlink system weighted sum-rate (SWSR) is derived which serves as a system performance metric. Then, we formulate the resource allocation design for the maximization of SWSR as an optimization problem which jointly optimizes the beamforming and the combining vectors at the BS, the transmit powers of the uplink users, and the phase shifts of multiple IRSs. Since the SWSR optimization problem is non-convex, an efficient iterative alternating approach is proposed to obtain a suboptimal solution for the design problem considered and its complexity is also discussed. In particular, we firstly reformulate the main problem into an equivalent weighted minimum mean-square-error form and then transform it into several convex sub-problems which can be analytically solved for given phase shifts. Then, the IRSs phases are optimized via a gradient ascent-based algorithm. Finally, numerical results are presented to clarify how multiple IRSs enhance the performance metric under hardware impairment.

cs.IT↗

arXiv2020

Resource Allocation for Large IRS-Assisted SWIPT Systems with Non-linear Energy Harvesting Model

In this paper, we investigate resource allocation algorithm design for large intelligent reflecting surface (IRS)-assisted simultaneous wireless information and power transfer (SWIPT) systems. To this end, we adopt a physics-based IRS model that, unlike the conventional IRS model, takes into account the impact of the incident and reflection angles of the impinging electromagnetic wave on the reflected signal. To facilitate efficient resource allocation design for large IRSs, we employ a scalable optimization framework, where the IRS is partitioned into several tiles and the phase shift elements of each tile are jointly designed to realize different transmission modes. Then, the beamforming vectors at the base station (BS) and the transmission mode selection of the tiles of the IRS are jointly optimized for minimization of the BS transmit power taking into account the quality-of-service requirements of both non-linear energy harvesting receivers and information decoding receivers. For handling the resulting non-convex optimization problem, we apply a penalty-based method, successive convex approximation, and semidefinite relaxation to develop a computationally efficient algorithm which asymptotically converges to a locally optimal solution of the considered problem. Our simulation results show that the proposed scheme enables considerable power savings compared to two baseline schemes. Moreover, our results also illustrate that the advocated physics-based model and scalable optimization framework for large IRSs allows us to strike a balance between system performance and computational complexity, which is vital for realizing large IRS-assisted communication systems.

cs.IT↗

arXiv2020

Cascaded Channel Estimation for IRS-assisted Mmwave Multi-antenna with Quantized Beamforming

In this letter, we optimize the channel estimator of the cascaded channel in an intelligent reflecting surface (IRS)-assisted millimeter wave (mmWave) multi-antenna system. In this system, the receiver is equipped with a hybrid architecture adopting quantized beamforming. Different from traditional multiple-input multiple-output (MIMO) systems, the design of channel estimation is challenging since the IRS is usually a passive array with limited signal processing capability. We derive the optimized channel estimator in a closed form by reformulating the problem of cascaded channel estimation in this system, leveraging the typical mean-squared error (MSE) criterion. Considering the presence of possible channel sparsity in mmWave channels, we generalize the proposed method by exploiting the channel sparsity for further performance enhancement and computational complexity reduction. Simulation results verify that the proposed estimator significantly outperforms the existing ones.

cs.IT↗

arXiv2020

Deep Residual Learning-Assisted Channel Estimation in Ambient Backscatter Communications

Channel estimation is a challenging problem for realizing efficient ambient backscatter communication (AmBC) systems. In this letter, channel estimation in AmBC is modeled as a denoising problem and a convolutional neural network-based deep residual learning denoiser (CRLD) is developed to directly recover the channel coefficients from the received noisy pilot signals. To simultaneously exploit the spatial and temporal features of the pilot signals, a novel three-dimension (3D) denoising block is specifically designed to facilitate denoising in CRLD. In addition, we provide theoretical analysis to characterize the properties of the proposed CRLD. Simulation results demonstrate that the performance of the proposed method approaches the performance of the optimal minimum mean square error (MMSE) estimator with perfect statistical channel correlation matrix.

cs.IT↗

arXiv2020

Location-aware Predictive Beamforming for UAV Communications: A Deep Learning Approach

Unmanned aerial vehicle (UAV)-assisted communication becomes a promising technique to realize the beyond fifth generation (5G) wireless networks, due to the high mobility and maneuverability of UAVs which can adapt to heterogeneous requirements of different applications. However, the movement of UAVs impose challenge for accurate beam alignment between the UAV and the ground user equipment (UE). In this letter, we propose a deep learning-based location-aware predictive beamforming scheme to track the beam for UAV communications in a dynamic scenario. Specifically, a long short-term memory (LSTM)-based recurrent neural network (LRNet) is designed for UAV location prediction. Based on the predicted location, a predicted angle between the UAV and the UE can be determined for effective and fast beam alignment in the next time slot, which enables reliable communications between the UAV and the UE. Simulation results demonstrate that the proposed scheme can achieve a satisfactory UAV-to-UE communication rate, which is close to the upper bound of communication rate obtained by the perfect genie-aided alignment scheme.

eess.SP↗

arXiv2020

Distributed IRS with Statistical Passive Beamforming for MISO Communications

Intelligent reflecting surface (IRS) has recently been identified as a prominent technology with the ability of enhancing wireless communication by dynamically manipulating the propagation environment. This paper investigates a multiple-input single-output (MISO) system deploying distributed IRSs. For practical considerations, we propose an efficient design of passive reflecting beamforming for the IRSs to exploit statistical channel state information (CSI) and analyze the achievable rate of the network taking into account the impact of CSI estimation error. The ergodic achievable rate is derived in a closed form, which provides insightful system design guidelines. Numerical results confirm the accuracy of the derived results and unveil the performance superiority of the proposed distributed IRS deployment over the conventional centralized deployment.

cs.IT↗

arXiv2020

Covariance-Based Cooperative Activity Detection for Massive Grant-Free Random Access

This paper designs a cooperative activity detection framework for massive grant-free random access in the sixth-generation (6G) cell-free wireless networks based on the covariance of the received signals at the access points (APs). In particular, multiple APs cooperatively detect the device activity by only exchanging the low-dimensional intermediate local information with their neighbors. The cooperative activity detection problem is non-smooth and the unknown variables are coupled with each other for which conventional approaches are inapplicable. Therefore, this paper proposes a covariance-based algorithm by exploiting the sparsity-promoting and similarity-promoting terms of the device state vectors among neighboring APs. An approximate splitting approach is proposed based on the proximal gradient method for solving the formulated problem. Simulation results show that the proposed algorithm is efficient for large-scale activity detection problems while requires shorter pilot sequences compared with the state-of-art algorithms in achieving the same system performance.

cs.IT↗

arXiv2020

On the Power Leakage Problem in Millimeter-Wave Massive MIMO with Lens Antenna Arrays

The emerging millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) with lens antenna arrays, which is also known as "beamspace MIMO", can effectively reduce the required number of power-hungry radio frequency (RF) chains. Therefore, it has been considered as a promising technique for the upcoming 5G communications and beyond. However, most current studies on beamspace MIMO have not taken into account the important power leakage problem in beamspace channels, which possibly leads to a significant degradation in the signal-to-noise ratio (SNR) and the system sum-rate. To this end, we propose a beam aligning precoding method to handle the power leakage problem in this paper. Firstly, a phase shifter network (PSN) structure is proposed, which enables each RF chain in beamspace MIMO to select multiple beams to collect the leakage power. Then, a rotation-based precoding algorithm is designed based on the proposed PSN structure, which aligns the channel gains of the selected beams towards the same direction for maximizing the received SNR at each user. Furthermore, we reveal some system design insights by analyzing the sum-rate and energy efficiency (EE) of the proposed beam aligning precoding method. In simulations, the proposed approach is found to achieve the near-optimal sum-rate performance compared with the ideal case of no power leakage, and obtains a higher EE than the existing schemes with either a linear or planar array.

cs.IT↗

arXiv2020

Massive Access for 5G and Beyond

Massive access, also known as massive connectivity or massive machine-type communication (mMTC), is one of the main use cases of the fifth-generation (5G) and beyond 5G (B5G) wireless networks. A typical application of massive access is the cellular Internet of Things (IoT). Different from conventional human-type communication, massive access aims at realizing efficient and reliable communications for a massive number of IoT devices. Hence, the main characteristics of massive access include low power, massive connectivity, and broad coverage, which require new concepts, theories, and paradigms for the design of next-generation cellular networks. This paper presents a comprehensive survey of aspects of massive access design for B5G wireless networks. Specifically, we provide a detailed review of massive access from the perspectives of theory, protocols, techniques, coverage, energy, and security. Furthermore, several future research directions and challenges are identified.

cs.IT↗

arXiv2020

Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets

In this paper, we propose a novel joint resource allocation and cooperative caching scheme for power-domain non-orthogonal multiple access (PD-NOMA)-based heterogeneous networks (HetNets). In our scheme, the requested content is fetched directly from the edge if it is cached in the storage of one of the base stations (BSs), and otherwise is fetched via the backhaul. Our scheme consists of two phases: 1. Caching phase where the contents are saved in the storage of the BSs, and 2. Delivery phase where the requested contents are delivered to users. We formulate a novel optimization problem over radio resources and content placement variables. We aim to minimize the network cost subject to quality-of-service (QoS), caching, subcarrier assignment, and power allocation constraints. By exploiting advanced optimization methods, such as alternative search method (ASM), Hungarian algorithm, successive convex approximation (SCA), we obtain an efficient sub-optimal solution of the optimization problem. Numerical results illustrate that our ergodic caching policy via the proposed resource management algorithm can achieve a considerable reduction on the total cost on average compared to the most popular caching and random caching policy. Moreover, our cooperative NOMA scheme outperforms orthogonal multiple access (OMA) in terms of the delivery cost in general with an acceptable complexity increase.

eess.SP↗

arXiv2020

Secrecy Performance for Finite-Alphabet Inputs Over Fluctuating Two-Ray Channels in FDA Communications

To provide system design insights for practical communication systems equipped with the frequency diverse array (FDA), this paper investigates the secrecy performance of FDA systems exploiting finite-alphabet inputs over fluctuating two-ray (FTR) fading channels. More specifically, closed-form expressions for the average secrecy rate (ASR) and the secrecy outage probability (SOP) are derived, while their correctness is confirmed by numerical simulations. In addition, we perform asymptotic analysis to quantify the secrecy performance gap between Gaussian and finite-alphabet inputs, for a sufficiently large average signal-to-noise ratio (SNR) of the main channel. Compared with Gaussian inputs-based research, this letter focuses on practical scenarios which sheds lights on properties of FDA systems.

eess.SP↗

arXiv2020

Hybrid Beamforming for Massive MIMO Over-the-Air Computation

Over-the-air computation (AirComp) has been recognized as a promising technique in Internet-of-Things (IoT) networks for fast data aggregation from a large number of wireless devices. However, as the number of devices becomes large, the computational accuracy of AirComp would seriously degrade due to the vanishing signal-to-noise ratio (SNR). To address this issue, we exploit the massive multiple-input multiple-output (MIMO) with hybrid beamforming, in order to enhance the computational accuracy of AirComp in a cost-effective manner. In particular, we consider the scenario with a large number of multi-antenna devices simultaneously sending data to an access point (AP) equipped with massive antennas for functional computation over the air. Under this setup, we jointly optimize the transmit digital beamforming at the wireless devices and the receive hybrid beamforming at the AP, with the objective of minimizing the computational mean-squared error (MSE) subject to the individual transmit power constraints at the wireless devices. To solve the non-convex hybrid beamforming design optimization problem, we propose an alternating-optimization-based approach. In particular, we propose two computationally efficient algorithms to handle the challenging receive analog beamforming problem, by exploiting the techniques of successive convex approximation (SCA) and block coordinate descent (BCD), respectively. It is shown that for the special case with a fully-digital receiver at the AP, the achieved MSE of the massive MIMO AirComp system is inversely proportional to the number of receive antennas. Furthermore, numerical results show that the proposed hybrid beamforming design substantially enhances the computation MSE performance as compared to other benchmark schemes, while the SCA-based algorithm performs closely to the performance upper bound achieved by the fully-digital beamforming.

eess.SP↗