YSYuhui Song

Yuhui Song

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yuhui Song has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • ISAC Performance Analysis for AFDM

    by Yuhui Song, Runchen Liang, Huanhuan Gu, Peiying Zhu, Wen Tong

  • Distributed Massive MIMO With Low Resolution ADCs for Massive Random Access

    by Yuhui Song, Zijun Gong, Yuanzhu Chen, Cheng Li

    Massive machine-type communications (mMTC), an essential fifth-generation (5G) usage scenario, aims to provide services for a large number of users that intermittently transmit small data packets in smart cities, manufacturing, and agriculture. Massive random access (MRA) emerges as a promising candidate for multiple access in mMTC characterized by the sporadic data traffic. Despite the use of massive multiple-input multiple-output (mMIMO) in MRA to achieve spatial division multiple access and mitigate small-scale fading, existing research endeavors overlook the near-far effect of large-scale fading by assuming perfect power control. In this paper, we present a cost-efficient, effective, and fully distributed solution for MRA to combat large-scale fading, wherein distributed access points (APs) cooperatively detect and serve active users. Each AP is equipped with low resolution analog-to-digital converters (ADCs) for energy-efficient system implementation. Specifically, we derive a rigorous closed-form expression for the uplink achievable rate, considering the impact of non-orthogonal pilots and low resolution ADCs. We also propose a scalable distributed algorithm for user activity detection under flat fading channels, and further adapt it to handle frequency-selective fading in popular orthogonal frequency division multiplexing (OFDM) systems. The proposed solution is fully distributed, since most processing tasks, such as activity detection, channel estimation, and data detection, are localized at each AP. Simulation results demonstrate the significant advantage of distributed systems over co-located systems in accommodating more users while achieving higher activity detection accuracy, and quantify performance loss resulting from the use of low resolution ADCs.


  • Towards Inversion-Free Sparse Bayesian Learning: A Universal Approach

    by Yuhui Song, Zijun Gong, Yuanzhu Chen, Cheng Li

    Sparse Bayesian Learning (SBL) has emerged as a powerful tool for sparse signal recovery, due to its superior performance. However, the practical implementation of SBL faces a significant computational complexity associated with matrix inversion. Despite numerous efforts to alleviate this issue, existing methods are often limited to specifically structured sparse signals. This paper aims to provide a universal inversion-free approach to accelerate existing SBL algorithms. We unify the optimization of SBL variants with different priors within the expectation-maximization (EM) framework, where a lower bound of the likelihood function is maximized. Due to the linear Gaussian model foundation of SBL, updating this lower bound requires maximizing a quadratic function, which involves matrix inversion. Thus, we employ the minorization-maximization (MM) framework to derive two novel lower bounds that diagonalize the quadratic coefficient matrix, thereby eliminating the need for any matrix inversions. We further investigate their properties, including convergence guarantees under the MM framework and the slow convergence rate due to reduced curvature. The proposed approach is applicable to various types of structured sparse signals, such as row-sparse, block-sparse, and burst-sparse signals. Our simulations on synthetic and real data demonstrate remarkably shorter running time compared to state-of-the-art methods while achieving comparable recovery performance.


  • Open Access

    Channel Estimation, Interpolation and Extrapolation in Doubly-dispersive Channels

    by Zijun Gong, Fan Jiang, Yuhui Song, Cheng Li, Xiaofeng Tao

    The OTFS (Orthogonal Time Frequency Space) is widely acknowledged for its ability to combat Doppler spread in time-varying channels. In this paper, another advantage of OTFS over OFDM (Orthogonal Frequency Division Multiplexing) will be demonstrated: much reduced channel training overhead. Specifically, the sparsity of the channel in delay-Doppler (D-D) domain implies strong correlation of channel gains in time-frequency (T-F) domain, which can be harnessed to reduce channel training overhead through interpolation. An immediate question is how much training overhead is needed in doubly-dispersive channels? A conventional belief is that the overhead is only dependent on the product of delay and Doppler spreads, but we will show that it's also dependent on the T-F window size. The finite T-F window leads to infinite spreading in D-D domain, and aliasing will be inevitable after sampling in T-F domain. Two direct consequences of the aliasing are increased channel training overhead and interference. Another factor contributing to channel estimation error is the inter-symbol-carrier-interference (ISCI), resulting from the uncertainty principle. Both aliasing and ISCI are considered in channel modelling, a low-complexity algorithm is proposed for channel estimation and interpolation through FFT. A large T-F window is necessary for reduced channel training overhead and aliasing, but increases processing delay. Fortunately, we show that the proposed algorithm can be implemented in a pipeline fashion. Further more, we showed that data-aided channel tracking is possible in D-D domain to further reduce the channel estimation frequency, i.e., channel extrapolation. The impacts of aliasing and ISCI on channel interpolation error are analyzed.

  • High-Accuracy Positioning Services for High-Speed Vehicles in Wideband mmWave Communications

    by Zijun Gong, Xuemin Sherman Shen, Cheng Li, Yuhui Song, Ruoyu Su

    It is expected that the sixth-generation (6G) cellular networks will provide high-accuracy positioning services. For the millimeter wave (mmWave) frequency band in 6G, both the Doppler and the spatial wideband effects can lead to channel variation in time and space domains, respectively. However, the impact of these effects on the positioning performance is not well studied. In this paper, we will investigate this issue and show that these two effects are not only challenges, but also provide great opportunities in terms of positioning in vehicular networks. Particularly, we will conduct system modeling, algorithm design, and fundamental performance analysis of simultaneous localization and communications (SLAC) in mmWave-based vehicular networks, exclusively dependent on channel state information. The major challenge in algorithm design is the high computational complexity that comes with the huge antenna arrays and bandwidth. For high-speed vehicle positioning, timeliness is as important as accuracy. For performance evaluation, the Cramér-Rao lower bounds (CRLB) will be derived as benchmarks. We will show that it is possible to achieve CRLB-level positioning accuracy, with almost linear complexity. With the closed-form theoretical results, we will evaluate how different system parameters contribute to positioning accuracy, such as bandwidth, carrier frequency, size and orientation of antenna arrays, etc. These results will shed light on system-level design and optimization of SLAC with ultra-wide frequency band in highly dynamic environments, i.e., very strong spatial wideband and Doppler effects. Comprehensive numerical results will also be presented to verify the theoretical analyses and the effectiveness of the proposed algorithms.


  • Open Access

    Inversion-Free Sparse Bayesian Learning for Temporally Correlated Signal Recovery

    by Yuhui Song

    Compressed sensing recovers the sparse signal from far fewer samples than required by the well-known Nyquist--Shannon sampling theorem to speed up the measure- ment procedure. The sparse signal recovery performance can be significantly improved by exploiting the temporal correlation in the multiple measurement vector model within the framework of sparse Bayesian learning. However, it is inevitable to involve the matrix inversion for existing methods, making the application of these schemes to large datasets impractical. To overcome this bottleneck, in this letter, we propose an inversion-free sparse Bayesian learning algorithm for temporally correlated sparse signal recovery, which is free of any matrix inversion operation and only requires simple addition and multiplication operations. Specifically, utilizing a property for the convex quadratic func- tion, we obtain a lower bound for the likelihood distribution that enables the computationally efficient model inference based on the expectation-maximization algorithm. Simulation results show its superior performance over other state-of-the-art methods in terms of the recovery performance and the running time.


  • Tensor-Based Sparse Bayesian Learning With Intra-Dimension Correlation

    by Yuhui Song, Zijun Gong, Yuanzhu Chen, Cheng Li

    Unlike the flat-view matrix, tensor provides an elegant representation to preserve the structure of data in the multidimensional nature. The wide use of tensor-based approaches highlights the limitation of matrix-based methods and has generated increasing needs in multidimensional data analytics. Driven by such demands, tensor decomposition with automatic rank determination has recently emerged as a promising tool for image processing, wireless communications and neural network compression. However, unlike the success in matrix-based schemes of exploring the correlation for performance improvement, existing tensor-based methods fail to consider the correlation structure in the tensor. In this paper, we propose to exploit the tensor intra-dimension correlation within the framework of sparse Bayesian learning. We provide the sparsity-inducing probabilistic models under both canonical polyadic decomposition and Tucker decomposition to capture the correlation structure effectively. We derive an efficient model inference method with a fast convergence rate based on the expectation-maximization algorithm. Furthermore, a complexity reduction method is proposed to speed up the computation by exploiting several properties of the Kronecker product. We further extend the proposed framework for the incomplete tensor corrupted by sparse outliers to achieve effective tensor completion and outlier mitigation. Simulation results demonstrate the superior performance of the proposed framework over those ignoring the intra-dimension correlation in terms of accuracy and sparsity.


  • Sting Interference of Dynamic Derivatives for Flying Wing in Transonic

    by Fangjian Wang, Han Qin, Lan Chen, Jing Hu, Yuhui Song