PGPan Gong

Pan Gong

*This is an algorithmically generated author record based on publicly available information.

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


Pan Gong has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Improved Unfolded Coprime Linear Array Design for DOA Estimation with No Phase Ambiguity

    by Pan Gong, Xiaofei Zhang

    In this paper, the direction of arrival (DOA) estimation problem for the unfolded coprime linear array (UCLA) is researched. Existing common stacking subarray-based methods for the coprime array are invalid in the case of its subarrays, which have the same steering vectors of source angles. To solve the phase ambiguity problem, we reconstruct an improved unfolded coprime linear array (IUCLA) by rearranging the reference element of the prototype UCLA. Specifically, we design the multiple coprime inter pairs by introducing the third coprime integer, which can be pairwise with the other two integers. Then, the phase ambiguity problem can be solved via the multiple coprime property. Furthermore, we employ a spectral peak searching method that can exploit the whole aperture and full DOFs of the IUCLA to detect targets and achieve angle estimation. Meanwhile, the proposed method avoids extra processing in eliminating ambiguous angles, and reduces the computational complexity. Finally, the Cramer–Rao bound (CRB) and numerical simulations are provided to demonstrate the effectiveness and superiority of the proposed method.

  • Open Access

    An Improved Ambiguity-free Unfolded Co-prime Linear Array Design for DOA Estimation

    by Pan Gong, Xiaofei Zhang

    This paper considers the direction of arrival (DOA) estimation problem of phase ambiguity for unfolded coprime linear array (UCLA). The existing most common stacking subarray-based method can tackle the phase ambiguity problem. However, the method is not always true. For a given DOA, it has its corresponding steering vector, but if there are two DOAs which have the same steering vectors with the given DOA for different subarrays, the phase ambiguity problem still arises. A modified method, which defines a decision variable and uses the classic beamforming technique to estimate the DOAs is proposed. However, this method needs additional algorithm to distinguish the true DOAs besides multiple signal classification (MUSIC) spectrum. And sometimes this method is not reliable if the decision variable is not chosen appropriately. Therefore, based on the UCLA, we reconstruct the array to design an improved UCLA called IUCLA. With moving the reference element, the linear relationship among the directional vectors can be broken. In this way, we can directly utilize the MUSIC algorithm to estimate with no additional algorithm. The proposed method can solve the phase ambiguity problem and it does not demand other technique to decrease the complexity. Moreover, the Cramer-Rao Bound (CRB), as the lower bound of the unbiased estimation, is provided and numerical simulations are given to demonstrate the effectiveness and superiority of the proposed method.

  • Open Access

    A scale to measure the worry level in Gastrointestinal Endoscopy with sedation: Development, reliability, and validity

    by Xiaoyu Yu, Haijun Deng, Ziyi Xiong, Pan Gong, Mingmei Ye, Tao Liu, Xiuyan Long, Li Tian


  • Open Access

    A Computationally Efficient Algorithm for DOA Estimation with Unfolded Coprime Linear Array

    by Gong Pan, Yin Huafei

    In this paper, we investigate the direction of arrival (DOA) estimation problem with unfolded coprime linear array (UCLA) and propose a low computational complexity signal-subspace fitting (SF) algorithm. SF algorithm is able to achieve excellent DOA estimation performance while it requires global angular search (GAS). Especially in the several source signals situation, expensive complexity cost causes. To decrease computational complexity, we propose an initialized based SF (ISF) algorithm, which involves the several one dimensional (1D) partial angular search (PAS) instead of the multidimensional GAS. Consequently, the complexity is significantly decreased. Due to the full utilization of the array aperture, the proposed method in UCLA can attain better performance than general CLA (GCLA). In addition, as the SF is attractive in practical application, the proposed ISF algorithm lowers the computational cost, while achieving almost approximate estimation performance as traditional SF and noise subspace fitting (NF). Moreover, numerical simulations are provided and verify the effectiveness and the superiority of the proposed algorithm for the UCLA.


  • Open Access

    Computationally Efficient Direction-of-Arrival Estimation Algorithms for a Cubic Coprime Array

    by Pan Gong, Xixin Chen

    In this paper, we investigate the problem of direction-of-arrival (DOA) estimation for massive multi-input multi-output (MIMO) radar, and propose a total array-based multiple signals classification (TA-MUSIC) algorithm for two-dimensional direction-of-arrival (DOA) estimation with a coprime cubic array (CCA). Unlike the conventional multiple signal classification (MUSIC) algorithm, the TA-MUSIC algorithm employs not only the auto-covariance matrix but also the mutual covariance matrix by stacking the received signals of two sub cubic arrays so that full degrees of freedom (DOFs) can be utilized. We verified that the phase ambiguity problem can be eliminated by employing the coprime property. Moreover, to achieve lower complexity, we explored the estimation of signal parameters via the rotational invariance technique (ESPRIT)-based multiple signal classification (E-MUSIC) algorithm, which uses a successive scheme to be computationally efficient. The Cramer–Rao bound (CRB) was taken as a theoretical benchmark for the lower boundary of the unbiased estimate. Finally, numerical simulations were conducted in order to demonstrate the effectiveness and superiority of the proposed algorithms.


  • Open Access

    Widened nested array: configuration design, optimal array and DOA estimation algorithm

    by Xinping Lin, Pan Gong, Lang He, Jianfeng Li

    A generalised nested array (GNA) configuration with large minimum inter‐element spacing is attractive to alleviate mutual coupling. In this study, by decomposing and rearranging the sub‐arrays of GNA, the authors propose a new nested array configuration named as widened nested array (WNA). The WNA enables to provide the reduced mutual coupling, enhanced degrees of freedom (DOFs), extended array aperture and improved direction of arrival (DOA) estimation performance compared to GNA. The closed‐form expressions for sensor positions of WNA are given and the optimal array configuration for largest DOFs is derived. Meanwhile, the authors propose a partial angular compressed sensing(CS) based DOA estimation algorithm for WNA. Specifically, discrete Fourier transform method is first derived for consecutive DOFs of WNA to obtain initial DOA estimates. Subsequently, the initial estimates are utilised to compress the angular range of overcomplete dictionary of the CS algorithm, which is exploited to obtain the fine DOA estimates. Extensive simulation results testify that the proposed algorithm has the same estimation accuracy as CS algorithm with lower complexity.


  • Open Access

    Three-Dimensional Coprime Array for Massive MIMO: Array Configuration Design and 2D DOA Estimation

    by Pan Gong, Tanveer Ahmed, Jianfeng Li

    In massive multiple-input multiple-output (MIMO) systems, it is critical to obtain the accurate direction of arrival (DOA) estimation. Conventional three-dimensional array mainly focuses on the uniform array. Due to the dense arrangement of the sensors, the array aperture is limited and severe mutual coupling effects arise. In this paper, a coprime cubic array (CCA) configuration design is presented, which is composed of two uniform cubic subarrays and can extend the interelement spacing with a selection of three pairs of coprime integers. Compared with uniform cubic array (UCA), CCA achieves the larger array aperture and less MC effects. And the analytical expression of Cramer–Rao Bound (CRB) for CCA is derived which verifies that the proposed CCA geometry outperforms the conventional UCA in two-dimensional (2D) DOA estimation performance in massive MIMO systems. Meanwhile, we propose a computationally efficient 2D DOA estimation algorithm with high accuracy for CCA. Specifically, we utilize array mapping to extract two uniform arrays from the nonuniform array by exploiting the relation derived from the signal subspace and the two directional matrices. Then, we operate a reduced dimension process on the uniform arrays and convert the 2D spectrum peak searching (SPS) problem into one-dimensional (1D) one, which significantly reduces the computational complexity. In addition, we employ the polynomial root finding technique with a lower complexity instead of 1D SPS to further relieve the computational complexity. Simultaneously, with coprime property, the phase ambiguity problem is solved, which results from the large interelement spacing. Numerical simulation results demonstrate that the proposed algorithm is very computationally efficient without degradation of DOA estimation performance.