Jiayi Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jiayi Chen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Xingzhao Liu
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
2 shared publications - Xue Jiang
School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China
2 shared publications - Abdelhak M. Zoubir
Signal Processing Group, Technische Universitt Darmstadt, Darmstadt, Germany
1 shared publication - Hing Cheung So
City University of Hong Kong
1 shared publication - Kaibin Huang
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
1 shared publication - Vincent Kin Nang Lau
Department of Electronic and Computer Engineering, The Hong Kong University of Science and Technology, Kowloon, Hong Kong
1 shared publication
Latest Publications
- 23 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 5664-5679
Phase-Only Robust Minimum Dispersion Beamforming
A phase-only robust minimum dispersion (PO-RMD) beamformer is devised for non-Gaussian signals. Unlike conventional beamformers that adjust the complex-valued weights, including both amplitude and phase, of each antenna to fulfill spatial filtering, the proposed PO-RMD employs a unit-modulus constraint on the weights, which is equivalent to simply phase shifting at each antenna. Instead of the widely used minimum variance criterion, the PO-RMD adopts the minimum dispersion criterion, which minimizes the $\ell_p$ -norm of the array output to utilize the non-Gaussianity of the signals. To achieve robustness against model uncertainty, the magnitude response of any steering vector within an uncertainty region is forced to exceed the threshold. A gradient projection (GP) algorithmic framework is developed to solve the resulting nonconvex optimization problem. In order to find a feasible point in the intersection of the unit-modulus and robustness constraint sets in each iteration, an alternating projection algorithm is also devised. More importantly, the closed-form expressions of the projection onto the two sets are derived, which only need a low complexity of $\mathcal{O}(M)$ with M being the number of antennas. Convergence of the alternating projection is analyzed and the local linear convergence rate is established. Simulation results demonstrate the fast convergence rate and accuracy of the GP, as well as the simplicity and robustness of the PO-RMD.- 23 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 5664-5679
Phase-Only Robust Minimum Dispersion Beamforming
A phase-only robust minimum dispersion (PO-RMD) beamformer is devised for non-Gaussian signals. Unlike conventional beamformers that adjust the complex-valued weights, including both amplitude and phase, of each antenna to fulfill spatial filtering, the proposed PO-RMD employs a unit-modulus constraint on the weights, which is equivalent to simply phase shifting at each antenna. Instead of the widely used minimum variance criterion, the PO-RMD adopts the minimum dispersion criterion, which minimizes the $\ell_p$ -norm of the array output to utilize the non-Gaussianity of the signals. To achieve robustness against model uncertainty, the magnitude response of any steering vector within an uncertainty region is forced to exceed the threshold. A gradient projection (GP) algorithmic framework is developed to solve the resulting nonconvex optimization problem. In order to find a feasible point in the intersection of the unit-modulus and robustness constraint sets in each iteration, an alternating projection algorithm is also devised. More importantly, the closed-form expressions of the projection onto the two sets are derived, which only need a low complexity of $\mathcal{O}(M)$ with M being the number of antennas. Convergence of the alternating projection is analyzed and the local linear convergence rate is established. Simulation results demonstrate the fast convergence rate and accuracy of the GP, as well as the simplicity and robustness of the PO-RMD.- 29 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 66 (14) , 3824-3837
Large-Scale Robust Beamforming via $\ell _{\infty }$ -MinimizationIn this paper, the linearly constrained and robust $\ell_{\infty}$-norm beamforming techniques are proposed for non-Gaussian signals. Conventional approach for $\ell_{\infty}$-minimization needs to solve a linear programming (LP) or second-order cone programming (SOCP). However, this strategy is computationally prohibitive for "big data" because the existing algorithms for LP or SOCP, such as simplex method or interior point method, can only solve small- or medium-scale problems. In this work, the alternating direction method of multipliers (ADMM) is devised for large-scale $\ell_{\infty}$-beamforming problems, where the core subproblems can be formulated concisely as a linearly or second-order cone constrained least squares and the proximity operator of the $\ell_{\infty}$-norm in each iteration. Remarkably, a linear-time complexity algorithm is devised which efficiently computes the $\ell_{\infty}$-norm proximity operator. Simulation results verify the high efficiency of the ADMM and the superiority of the $\ell_{\infty}$-norm beamforming techniques over several representative beamformers, indicating that its performance can approach the optimal upper bound.
- 29 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 66 (14) , 3824-3837
Large-Scale Robust Beamforming via $\ell _{\infty }$ -MinimizationIn this paper, the linearly constrained and robust $\ell_{\infty}$-norm beamforming techniques are proposed for non-Gaussian signals. Conventional approach for $\ell_{\infty}$-minimization needs to solve a linear programming (LP) or second-order cone programming (SOCP). However, this strategy is computationally prohibitive for "big data" because the existing algorithms for LP or SOCP, such as simplex method or interior point method, can only solve small- or medium-scale problems. In this work, the alternating direction method of multipliers (ADMM) is devised for large-scale $\ell_{\infty}$-beamforming problems, where the core subproblems can be formulated concisely as a linearly or second-order cone constrained least squares and the proximity operator of the $\ell_{\infty}$-norm in each iteration. Remarkably, a linear-time complexity algorithm is devised which efficiently computes the $\ell_{\infty}$-norm proximity operator. Simulation results verify the high efficiency of the ADMM and the superiority of the $\ell_{\infty}$-norm beamforming techniques over several representative beamformers, indicating that its performance can approach the optimal upper bound.
- Open Access
Communication Using a Large-Scale Array of Ubiquitous Antennas: A Geometry Approach
The recent trends of densification and centralized signal processing in radio access networks suggest that future networks may comprise ubiquitous antennas coordinated to form a network-wide gigantic array, referred to as the ubiquitous array (UA). In this paper, the UA communication techniques are designed and analyzed based on a geometric model. Specifically, the UA is modeled as a continuous circular/spherical array enclosing target users and free-space propagation is assumed. First, consider the estimation of multiuser UA channels induced by user locations. Given single pilot symbols, a novel channel estimation scheme is proposed that decomposes training signals into Fourier/Laplace series and thereby translates multiuser channel estimation into peak detection of a derive function of location. The process is shown to suppress noise. Moreover, it is proved that estimation error due to interference diminishes with the increasing minimum user-separation distance following the power law, where the exponent is 1/3 and 1 for the circular and spherical UA, respectively. If orthogonal pilot sequences are used, channel estimation is found to be perfect. Next, consider channel-conjugate data transmission that maximizes received signal power. The power of interference between two users is shown to decay with the increasing user-separation distance sub-linearly and super-linearly for the circular and spherical UA, respectively. Furthermore, a novel multiuser precoding design is proposed by exciting different phase modes of the UA and controlling the mode weight factors to null interference. The number of available degrees of freedom for interference nulling using the UA is proved to be proportional to the minimum user-separation distance.
Open AccessCommunication Using a Large-Scale Array of Ubiquitous Antennas: A Geometry Approach
The recent trends of densification and centralized signal processing in radio access networks suggest that future networks may comprise ubiquitous antennas coordinated to form a network-wide gigantic array, referred to as the ubiquitous array (UA). In this paper, the UA communication techniques are designed and analyzed based on a geometric model. Specifically, the UA is modeled as a continuous circular/spherical array enclosing target users and free-space propagation is assumed. First, consider the estimation of multiuser UA channels induced by user locations. Given single pilot symbols, a novel channel estimation scheme is proposed that decomposes training signals into Fourier/Laplace series and thereby translates multiuser channel estimation into peak detection of a derive function of location. The process is shown to suppress noise. Moreover, it is proved that estimation error due to interference diminishes with the increasing minimum user-separation distance following the power law, where the exponent is 1/3 and 1 for the circular and spherical UA, respectively. If orthogonal pilot sequences are used, channel estimation is found to be perfect. Next, consider channel-conjugate data transmission that maximizes received signal power. The power of interference between two users is shown to decay with the increasing user-separation distance sub-linearly and super-linearly for the circular and spherical UA, respectively. Furthermore, a novel multiuser precoding design is proposed by exciting different phase modes of the UA and controlling the mode weight factors to null interference. The number of available degrees of freedom for interference nulling using the UA is proved to be proportional to the minimum user-separation distance.