arXiv subjects

Min-Jian Zhao

Publications and source records attributed to Min-Jian Zhao.

At least 37 records · Page 2Linked to original sources

arXiv2022

Rethinking IoU-based Optimization for Single-stage 3D Object Detection

Since Intersection-over-Union (IoU) based optimization maintains the consistency of the final IoU prediction metric and losses, it has been widely used in both regression and classification branches of single-stage 2D object detectors. Recently, several 3D object detection methods adopt IoU-based optimization and directly replace the 2D IoU with 3D IoU. However, such a direct computation in 3D is very costly due to the complex implementation and inefficient backward operations. Moreover, 3D IoU-based optimization is sub-optimal as it is sensitive to rotation and thus can cause training instability and detection performance deterioration. In this paper, we propose a novel Rotation-Decoupled IoU (RDIoU) method that can mitigate the rotation-sensitivity issue, and produce more efficient optimization objectives compared with 3D IoU during the training stage. Specifically, our RDIoU simplifies the complex interactions of regression parameters by decoupling the rotation variable as an independent term, yet preserving the geometry of 3D IoU. By incorporating RDIoU into both the regression and classification branches, the network is encouraged to learn more precise bounding boxes and concurrently overcome the misalignment issue between classification and regression. Extensive experiments on the benchmark KITTI and Waymo Open Dataset validate that our RDIoU method can bring substantial improvement for the single-stage 3D object detection.

cs.CV↗

arXiv2022

Channel Tracking and Prediction for IRS-aided Wireless Communications

For intelligent reflecting surface (IRS)-aided wireless communications, channel estimation is essential and usually requires excessive channel training overhead when the number of IRS reflecting elements is large. The acquisition of accurate channel state information (CSI) becomes more challenging when the channel is not quasi-static due to the mobility of the transmitter and/or receiver. In this work, we study an IRS-aided wireless communication system with a time-varying channel model and propose an innovative two-stage transmission protocol. In the first stage, we send pilot symbols and track the direct/reflected channels based on the received signal, and then data signals are transmitted. In the second stage, instead of sending pilot symbols first, we directly predict the direct/reflected channels and all the time slots are used for data transmission. Based on the proposed transmission protocol, we propose a two-stage channel tracking and prediction (2SCTP) scheme to obtain the direct and reflected channels with low channel training overhead, which is achieved by exploiting the temporal correlation of the time-varying channels. Specifically, we first consider a special case where the IRS-access point (AP) channel is assumed to be static, for which a Kalman filter (KF)-based algorithm and a long short-term memory (LSTM)-based neural network are proposed for channel tracking and prediction, respectively. Then, for the more general case where the IRS-AP, user-IRS and user-AP channels are all assumed to be time-varying, we present a generalized KF (GKF)-based channel tracking algorithm, where proper approximations are employed to handle the underlying non-Gaussian random variables. Numerical simulations are provided to verify the effectiveness of our proposed transmission protocol and channel tracking/prediction algorithms as compared to existing ones.

eess.SP↗

arXiv2021

Improving 3D Object Detection with Channel-wise Transformer

Though 3D object detection from point clouds has achieved rapid progress in recent years, the lack of flexible and high-performance proposal refinement remains a great hurdle for existing state-of-the-art two-stage detectors. Previous works on refining 3D proposals have relied on human-designed components such as keypoints sampling, set abstraction and multi-scale feature fusion to produce powerful 3D object representations. Such methods, however, have limited ability to capture rich contextual dependencies among points. In this paper, we leverage the high-quality region proposal network and a Channel-wise Transformer architecture to constitute our two-stage 3D object detection framework (CT3D) with minimal hand-crafted design. The proposed CT3D simultaneously performs proposal-aware embedding and channel-wise context aggregation for the point features within each proposal. Specifically, CT3D uses proposal's keypoints for spatial contextual modelling and learns attention propagation in the encoding module, mapping the proposal to point embeddings. Next, a new channel-wise decoding module enriches the query-key interaction via channel-wise re-weighting to effectively merge multi-level contexts, which contributes to more accurate object predictions. Extensive experiments demonstrate that our CT3D method has superior performance and excellent scalability. Remarkably, CT3D achieves the AP of 81.77% in the moderate car category on the KITTI test 3D detection benchmark, outperforms state-of-the-art 3D detectors.

cs.CV↗

arXiv2021

Two-Stage Stochastic Optimization via Primal-Dual Decomposition and Deep Unrolling

We consider a two-stage stochastic optimization problem, in which a long-term optimization variable is coupled with a set of short-term optimization variables in both objective and constraint functions. Despite that two-stage stochastic optimization plays a critical role in various engineering and scientific applications, there still lack efficient algorithms, especially when the long-term and short-term variables are coupled in the constraints. To overcome the challenge caused by tightly coupled stochastic constraints, we first establish a two-stage primal-dual decomposition (PDD) method to decompose the two-stage problem into a long-term problem and a family of short-term subproblems. Then we propose a PDD-based stochastic successive convex approximation (PDD-SSCA) algorithmic framework to find KKT solutions for two-stage stochastic optimization problems. At each iteration, PDD-SSCA first runs a short-term sub-algorithm to find stationary points of the short-term subproblems associated with a mini-batch of the state samples. Then it constructs a convex surrogate for the long-term problem based on the deep unrolling of the short-term sub-algorithm and the back propagation method. Finally, the optimal solution of the convex surrogate problem is solved to generate the next iterate. We establish the almost sure convergence of PDD-SSCA and customize the algorithmic framework to solve two important application problems. Simulations show that PDD-SSCA can achieve superior performance over existing solutions.

math.OC↗

arXiv2021

Exploiting Amplitude Control in Intelligent Reflecting Surface Aided Wireless Communication with Imperfect CSI

Intelligent reflecting surface (IRS) is a promising new paradigm to achieve high spectral and energy efficiency for future wireless networks by reconfiguring the wireless signal propagation via passive reflection. To reap the potential gains of IRS, channel state information (CSI) is essential, whereas channel estimation errors are inevitable in practice due to limited channel training resources. In this paper, in order to optimize the performance of IRS-aided multiuser systems with imperfect CSI, we propose to jointly design the active transmit precoding at the access point (AP) and passive reflection coefficients of IRS, each consisting of not only the conventional phase shift and also the newly exploited amplitude variation. First, the achievable rate of each user is derived assuming a practical IRS channel estimation method, which shows that the interference due to CSI errors is intricately related to the AP transmit precoders, the channel training power and the IRS reflection coefficients during both channel training and data transmission. Then, for the single-user case, by combining the benefits of the penalty method, Dinkelbach method and block successive upper-bound minimization (BSUM) method, a new penalized Dinkelbach-BSUM algorithm is proposed to optimize the IRS reflection coefficients for maximizing the achievable data transmission rate subjected to CSI errors; while for the multiuser case, a new penalty dual decomposition (PDD)-based algorithm is proposed to maximize the users' weighted sum-rate. Simulation results are presented to validate the effectiveness of our proposed algorithms as compared to benchmark schemes. In particular, useful insights are drawn to characterize the effect of IRS reflection amplitude control (with/without the conventional phase shift) on the system performance under imperfect CSI.

cs.IT↗

arXiv2021

Channel Estimation for IRS-aided Multiuser Communications with Reduced Error Propagation

Intelligent reflecting surface (IRS) has emerged as a promising paradigm to improve the capacity and reliability of a wireless communication system by smartly reconfiguring the wireless propagation environment. To achieve the promising gains of IRS, the acquisition of the channel state information (CSI) is essential, which however is practically difficult since the IRS does not employ any transmit/receive radio frequency (RF) chains in general and it has limited signal processing capability. In this paper, we study the uplink channel estimation problem for an IRS-aided multiuser single-input multi-output (SIMO) system, and propose a novel two-phase channel estimation (2PCE) strategy which can alleviate the negative effects caused by error propagation in the existing three-phase channel estimation approach, i.e., the channel estimation errors in previous phases will deteriorate the estimation performance in later phases, and enhance the channel estimation performance with the same amount of channel training overhead as in the existing approach. Moreover, the asymptotic mean squared error (MSE) of the 2PCE strategy is analyzed when the least-square (LS) channel estimation method is employed, and we show that the 2PCE strategy can outperform the existing approach. Finally, extensive simulation results are presented to validate the effectiveness of the 2PCE strategy.

eess.SP↗

arXiv2020

Intelligent Reflecting Surface Enhanced Wireless Network: Two-timescale Beamforming Optimization

Intelligent reflecting surface (IRS) has drawn a lot of attention recently as a promising new solution to achieve high spectral and energy efficiency for future wireless networks. By utilizing massive low-cost passive reflecting elements, the wireless propagation environment becomes controllable and thus can be made favorable for improving the communication performance. Prior works on IRS mainly rely on the instantaneous channel state information (I-CSI), which, however, is practically difficult to obtain for IRS-associated links due to its passive operation and large number of elements. To overcome this difficulty, we propose in this paper a new two-timescale (TTS) transmission protocol to maximize the achievable average sum-rate for an IRS-aided multiuser system under the general correlated Rician channel model. Specifically, the passive IRS phase-shifts are first optimized based on the statistical CSI (S-CSI) of all links, which varies much slowly as compared to their I-CSI, while the transmit beamforming/precoding vectors at the access point (AP) are then designed to cater to the I-CSI of the users' effective channels with the optimized IRS phase-shifts, thus significantly reducing the channel training overhead and passive beamforming complexity over the existing schemes based on the I-CSI of all channels. For the single-user case, a novel penalty dual decomposition (PDD)-based algorithm is proposed, where the IRS phase-shifts are updated in parallel to reduce the computational time. For the multiuser case, we propose a general TTS optimization algorithm by constructing a quadratic surrogate of the objective function, which cannot be explicitly expressed in closed-form. Simulation results are presented to validate the effectiveness of our proposed algorithms and evaluate the impact of S-CSI and channel correlation on the system performance.

cs.IT↗

arXiv2020

Stochastic Transceiver Optimization in Multi-Tags Symbiotic Radio Systems

Symbiotic radio (SR) is emerging as a spectrum- and energy-efficient communication paradigm for future passive Internet-of-things (IoT), where some single-antenna backscatter devices, referred to as Tags, are parasitic in an active primary transmission. The primary transceiver is designed to assist both direct-link (DL) and backscatter-link (BL) communication. In multi-tags SR systems, the transceiver designs become much more complicated due to the presence of DL and inter-Tag interference, which further poses new challenges to the availability and reliability of DL and BL transmission. To overcome these challenges, we formulate the stochastic optimization of transceiver design as the general network utility maximization problem (GUMP). The resultant problem is a stochastic multiple-ratio fractional non-convex problem, and consequently challenging to solve. By leveraging some fractional programming techniques, we tailor a surrogate function with the specific structure and subsequently develop a batch stochastic parallel decomposition (BSPD) algorithm, which is shown to converge to stationary solutions of the GNUMP. Simulation results verify the effectiveness of the proposed algorithm by numerical examples in terms of the achieved system throughput.

cs.IT↗

arXiv2020

A PDD Decoder for Binary Linear Codes With Neural Check Polytope Projection

Linear Programming (LP) is an important decoding technique for binary linear codes. However, the advantages of LP decoding, such as low error floor and strong theoretical guarantee, etc., come at the cost of high computational complexity and poor performance at the low signal-to-noise ratio (SNR) region. In this letter, we adopt the penalty dual decomposition (PDD) framework and propose a PDD algorithm to address the fundamental polytope based maximum likelihood (ML) decoding problem. Furthermore, we propose to integrate machine learning techniques into the most time-consuming part of the PDD decoding algorithm, i.e., check polytope projection (CPP). Inspired by the fact that a multi-layer perception (MLP) can theoretically approximate any nonlinear mapping function, we present a specially designed neural CPP (NCPP) algorithm to decrease the decoding latency. Simulation results demonstrate the effectiveness of the proposed algorithms.

eess.SP↗

arXiv2020

Energy Efficiency Optimization for Millimeter Wave System with Resolution-Adaptive ADCs

This letter investigates the uplink of a multi-user millimeter wave (mmWave) system, where the base station (BS) is equipped with a massive multiple-input multiple-output (MIMO) array and resolution-adaptive analog-to-digital converters (RADCs). Although employing massive MIMO at the BS can significantly improve the spectral efficiency, it also leads to high hardware complexity and huge power consumption. To overcome these challenges, we seek to jointly optimize the beamspace hybrid combiner and the ADC quantization bits allocation to maximize the system energy efficiency (EE) under some practical constraints. The formulated problem is non-convex due to the non-linear fractional objective function and the non-convex feasible set which is generally intractable. In order to handle these difficulties, we first apply some fractional programming (FP) techniques and introduce auxiliary variables to recast this problem into an equivalent form amenable to optimization. Then, we propose an efficient double-loop iterative algorithm based on the penalty dual decomposition (PDD) and the majorization-minimization (MM) methods to find local stationary solutions. Simulation results reveal significant gain over the baselines.

eess.SP↗

arXiv2020

ADMM-based Decoder for Binary Linear Codes Aided by Deep Learning

Inspired by the recent advances in deep learning (DL), this work presents a deep neural network aided decoding algorithm for binary linear codes. Based on the concept of deep unfolding, we design a decoding network by unfolding the alternating direction method of multipliers (ADMM)-penalized decoder. In addition, we propose two improved versions of the proposed network. The first one transforms the penalty parameter into a set of iteration-dependent ones, and the second one adopts a specially designed penalty function, which is based on a piecewise linear function with adjustable slopes. Numerical results show that the resulting DL-aided decoders outperform the original ADMM-penalized decoder for various low density parity check (LDPC) codes with similar computational complexity.

cs.IT↗

arXiv2020

Efficiency Maximization for UAV-Enabled Mobile Relaying Systems with Laser Charging

This work studies the joint problem of power and trajectory optimization in an unmanned aerial vehicle (UAV)-enabled mobile relaying system. In the considered system, in order to provide convenient and sustainable energy supply to the UAV relay, we consider the deployment of a power beacon (PB) which can wirelessly charge the UAV and it is realized by a properly designed laser charging system. To this end, we propose an efficiency (the weighted sum of the energy efficiency during information transmission and wireless power transmission efficiency) maximization problem by optimizing the source/UAV/PB transmit powers along with the UAV's trajectory. This optimization problem is also subject to practical mobility constraints, as well as the information-causality constraint and energy-causality constraint at the UAV. Different from the commonly used alternating optimization (AO) algorithm, two joint design algorithms, namely: the concave-convex procedure (CCCP) and penalty dual decomposition (PDD)-based algorithms, are presented to address the resulting non-convex problem, which features complex objective function with multiple-ratio terms and coupling constraints. These two very different algorithms are both able to achieve a stationary solution of the original efficiency maximization problem. Simulation results validate the effectiveness of the proposed algorithms.

cs.IT↗

arXiv2019

Power Control for Massive MIMO Systems with Nonorthogonal Pilots

This letter shows that optimizing the transmit powers along with optimally designed nonorthogonal pilots can significantly reduce pilot contamination and improve the overall throughput of the uplink multi-cell massive multiple-input multiple-output (MIMO) system as compared to the conventional schemes that use orthogonal pilots. Given the optimized nonorthogonal pilots, power control as a function of the large-scale path-loss can be thought of as a stochastic optimization problem due to the presence of fast fading. This paper advocates a deterministic approach to solve this problem, then further proposes a stochastic optimization method that utilizes successive convex approximation as a benchmark to quantify the performance of the proposed approach. Simulation results reveal significant advantage of using optimized nonorthogonal pilots together with power control to combat pilot contamination.

cs.IT↗

arXiv2019

Angular-Domain Selective Channel Tracking and Doppler Compensation for High-Mobility mmWave Massive MIMO

In this paper, we consider a mmWave massive multiple-input multiple-output (MIMO) communication system with one static base station (BS) serving a fast-moving user, both equipped with a very large array. The transmitted signal arrives at the user through multiple paths, each with a different angle of-arrival and hence Doppler frequency offset, thus resulting in a fast time-varying multipath fading MIMO channel. In order to mitigate the Doppler-induced channel aging for reduced pilot overhead, we propose a new angular-domain selective channel tracking and Doppler compensation scheme at the user side. We formulate the joint estimation of partial angular-domain channel and DFO parameters as a dynamic compressive sensing problem. Then we propose a Doppler-aware-dynamic variational Bayesian inference (DD-VBI) algorithm to solve this problem efficiently. Finally, we propose a practical DFO compensation scheme which selects the dominant paths of the fast time-varying channel for DFO compensation and thereby converts it into a slow time-varying effective channel. Compared with the existing methods, the proposed scheme can enjoy the huge array gain provided by the massive MIMO and also balance the tradeoff between the CSI signaling overhead and spatial multiplexing gain. Simulation results verify the advantages of the proposed scheme over various baseline schemes.

eess.SP↗

arXiv2019

Efficient Resource Allocation for Relay-Assisted Computation Offloading in Mobile Edge Computing

In this article, we consider the problem of relay assisted computation offloading (RACO), in which user A aims to share the results of computational tasks with another user B through wireless exchange over a relay platform equipped with mobile edge computing capabilities, referred to as a mobile edge relay server (MERS). To support the computation offloading, we propose a hybrid relaying (HR) approach employing two orthogonal frequency bands, where the amplify-and-forward scheme is used in one band to exchange computational results, while the decode-and-forward scheme is used in the other band to transfer the unprocessed tasks. The motivation behind the proposed HR scheme for RACO is to adapt the allocation of computing and communication resources both to dynamic user requirements and to diverse computational tasks. Within this framework, we seek to minimize the weighted sum of the execution delay and the energy consumption in the RACO system by jointly optimizing the computation offloading ratio, the bandwidth allocation, the processor speeds, as well as the transmit power levels of both user $A$ and the MERS, under practical constraints on the available computing and communication resources. The resultant problem is formulated as a non-differentiable and nonconvex optimization program with highly coupled constraints. By adopting a series of transformations and introducing auxiliary variables, we first convert this problem into a more tractable yet equivalent form. We then develop an efficient iterative algorithm for its solution based on the concave-convex procedure. By exploiting the special structure of this problem, we also propose a simplified algorithm based on the inexact block coordinate descent method, with reduced computational complexity. Finally, we present numerical results that illustrate the advantages of the proposed algorithms over state-of-the-art benchmark schemes.

cs.IT↗

arXiv2019

Mixed-Timescale Beamforming and Power Splitting for Massive MIMO Aided SWIPT IoT Network

Traditional simultaneous wireless information and power transfer (SWIPT) with power splitting assumes perfect channel state information (CSI), which is difficult to obtain especially in the massive multiple-input-multiple-output (MIMO) regime. In this letter, we consider a mixed-timescale joint beamforming and power splitting (MJBP) scheme to maximize general utility functions under a power constraint in the downlink of a massive MIMO SWIPT IoT network. In this scheme, the transmit digital beamformer is adapted to the imperfect CSI, while the receive power splitters are adapted to the long-term channel statistics only due to the consideration of hardware limit and signaling overhead. The formulated optimization problem is solved using a mixed-timescale online stochastic successive convex approximation (MO-SSCA) algorithm. Simulation results reveal significant gain over the baselines.

cs.IT↗

arXiv2019

Two-Timescale Hybrid Compression and Forward for Massive MIMO Aided C-RAN

We consider the uplink of a cloud radio access network (C-RAN), where massive MIMO remote radio heads (RRHs) serve as relays between users and a centralized baseband unit (BBU). Although employing massive MIMO at RRHs can improve the spectral efficiency, it also significantly increases the amount of data transported over the fronthaul links between RRHs and BBU, which becomes a performance bottleneck. Existing fronthaul compression methods for conventional C-RAN are not suitable for the massive MIMO regime because they require fully-digital processing and/or real-time full channel state information (CSI), incurring high implementation cost for massive MIMO RRHs. To overcome this challenge, we propose to perform a two-timescale hybrid analog-and-digital spatial filtering at each RRH to reduce the fronthaul consumption. Specifically, the analog filter is adaptive to the channel statistics to achieve massive MIMO array gain, and the digital filter is adaptive to the instantaneous effective CSI to achieve spatial multiplexing gain. Such a design can alleviate the performance bottleneck of limited fronthaul with reduced hardware cost and power consumption, and is more robust to the CSI delay. We propose an online algorithm for the two-timescale non-convex optimization of analog and digital filters, and establish its convergence to stationary solutions. Finally, simulations verify the advantages of the proposed scheme.

cs.IT↗

arXiv2018

Stochastic Successive Convex Optimization for Two-timescale Hybrid Precoding in Massive MIMO

Hybrid precoding, which consists of an RF precoder and a baseband precoder, is a popular precoding architecture for massive MIMO due to its low hardware cost and power consumption. In conventional hybrid precoding, both RF and baseband precoders are adaptive to the real-time channel state information (CSI). As a result, an individual RF precoder is required for each subcarrier in wideband systems, leading to high implementation cost. To overcome this issue, two-timescale hybrid precoding (THP), which adapts the RF precoder to the channel statistics, has been proposed. Since the channel statistics are approximately the same over different subcarriers, only a single RF precoder is required in THP. Despite the advantages of THP, there lacks a unified and efficient algorithm for its optimization due to the non-convex and stochastic nature of the problem. Based on stochastic successive convex approximation (SSCA), we propose an online algorithmic framework called SSCA-THP for general THP optimization problems, in which the hybrid precoder is updated by solving a quadratic surrogate optimization problem whenever a new channel sample is obtained. Then we prove the convergence of SSCA-THP to stationary points. Finally, we apply SSCA-THP to solve three important THP optimization problems and verify its advantages over existing solutions.

cs.IT↗