Yang Liu

Dr. Yang Liu

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 August 2025 in Nucleic Acids Research
Verified
Journal Article
Open access
XZXuan Zhou
Xuan Zhou
RFRenxu Feng
Renxu Feng
NDNana Ding
Nana Ding
WCWenyan Cao
Wenyan Cao
YLYang Liu
Yang Liu
YDYu Deng
Yu Deng
Core promoters are essential regulatory elements that control transcription initiation, but accurately predicting and designing their strength remains challenging due to complex sequence-function relationships and the limited generalizability of existing AI-based approaches. To address this, we developed a modular platform integrating rational library design, predictive modelling, and generative optimization into a closed-loop workflow for end-to-end core promoter engineering. Conserved and spacer region of core promoters exert distinct effects on transcriptional strength, with the former driving large-scale variation and the latter enabling finer gradation. Based on this insight, Mutation-Barcoding-Reverse Sequencing approach was used and constructed a synthetic promoter library comprising 112 955 variants with minimal redundancy and a 16 226-fold expression range. A Transformer-based model trained on this dataset achieved a Pearson correlation of 0.87 with experimentally measured promoter strengths. When combined with a conditional diffusion model, the system enabled de novo generation of promoter sequences with defined strengths, achieving a design-to-measurement correlation of 0.95 and maintaining high accuracy (R = 0.93) across varied sequence contexts. The designed promoters consistently preserved their intended strength gradients, demonstrating robust plug-and-play functionality. This work establishes a scalable and extensible platform (www.yudenglab.com) for deep learning-guided programmable design of Escherichia coli core promoters, enabling precise transcriptional control.

9 June 2023 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
XZXuan Zhu
Xuan Zhu
YLYang Liu
Yang Liu
CWCheng-Xiang Wang
Cheng-Xiang Wang
Combination of millimeter wave (mmWave) and massive multiple input multiple output (MIMO) forms a promising technology for future sixth generation networks. As the number of antennas increases, propagation channel starts yielding spherical wavefronts, for which the traditional channel estimation algorithms are no longer applicable. To overcome this technical gap, a novel MIMO channel estimation scheme based on the assumption of spherical wavefront is proposed in this work. The large antenna array is first divided into several sub-arrays, and then the channel estimation is performed for each sub-array based on the orthogonal matching pursuit algorithm. In addition, the joint estimation of angle of arrivals and departures (AoAs and AoDs) of each uniform planar sub-array is transformed into separate estimation by dimensionality reduction. Next, an iterative estimation is performed using Taylor expansion to continuously approximate the real grid points to recover the AoAs/AoDs. Lastly, the superiority of the proposed algorithm is verified by numerical simulations, where the proposed algorithm exhibits the best NMSE performance, compared with the existing MIMO channel estimation methods.

21 July 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
WGWen Gu
Wen Gu
YLYang Liu
Yang Liu
CWCheng-Xiang Wang
Cheng-Xiang Wang
WXWenchao Xu
Wenchao Xu
YYYu Yu
Yu Yu
HZHongbo Zhu
Hongbo Zhu
The Industrial Internet of things (IIoT) is one of the typical application scenarios in the beyond fifth generation (B5G) wireless communication systems. Due to numerous metal obstacles and machines, the industrial channel, especially at the millimeter-wave (mmWave) bands, exhibits complex characteristics that haven’t been considered in existing literature. This paper proposes an innovative three-dimensional (3D) non-stationary geometry-based stochastic model (GBSM) for IIoT scenarios at mmWave bands. In the proposed model, device reflections (DR) caused by massive metal machines are modeled based on geometrical optics. Furthermore, the generalized extreme value (GEV) distribution and generalized Pareto (GP) distribution are used to parameterize the number of clusters and rays within a cluster, respectively. Further, the Doppler shift is modeled and analyzed using the Gaussian distribution. Some channel statistical characteristics are captured by the proposed model, such as the power delay profile, root-mean-square delay spread, root-mean-square angle spread, inter-cluster delay, and space-time-frequency correlation function. Then, these channel statistical characteristics are well fitted to the ray-tracing simulations and the channel measurements. The excellent fitting results demonstrate the high accuracy of the proposed model, which is crucial for future IIoT communication system design. What’s more, this paper shows the antenna height and propagation scenarios can significantly affect the DR ratio, which should adapt to various IIoT communication scenarios.

17 September 2018 in IEEE Access
Verified
Journal Article
Open access
YLYang Liu
Yang Liu
WLWen-Jun Lu
Wen-Jun Lu
SSSulong Shi
Sulong Shi
QWQiong Wu
Qiong Wu
BLBaolong Li
Baolong Li
HZHong-Bo Zhu
Hong-Bo Zhu
This paper assesses the performances of a downlink cooperative non-orthogonal multiple access (C-NOMA) network over Nakagami-m fading channels. The analytical outage probability expression for each user is derived and verified by Monte Carlo simulations. Based upon the outage probability, the maximal throughputs are obtained and analyzed under different channel conditions. Furthermore, the effects of channel fading on the probability and throughput are investigated. The results indicate that the performance of the C-NOMA system is excellent over the source-relay link with less fading. This analysis can be used for designing the C-NOMA systems in the future fifth-generation wireless communication.

11 April 2019 in Information
Verified
Journal Article
Open access
PDF file
XXXiaomei Xue
Xiaomei Xue
ZLZhengquan Li
Zhengquan Li
YMYongqiang Man
Yongqiang Man
SXSong Xing
Song Xing
YLYang Liu
Yang Liu
QWQiong Wu
Qiong Wu
In order to reduce the computational complexity of the inverse matrix in the regularized zero-forcing (RZF) precoding algorithm, this paper expands and approximates the inverse matrix based on the truncated Kapteyn series expansion and the corresponding low-complexity RZF precoding algorithm is obtained. In addition, the expansion coefficients of the truncated Kapteyn series in our proposed algorithm are optimized, leading to further improvement of the convergence speed of the precoding algorithm under the premise of the same computational complexity as the traditional RZF precoding. Moreover, the computational complexity and the downlink channel performance in terms of the average achievable rate of the proposed RZF precoding algorithm and other RZF precoding algorithms with typical truncated series expansion approaches are analyzed, and further evaluated by numerical simulations in a large-scale single-cell multiple-input-multiple-output (MIMO) system. Simulation results show that the proposed improved RZF precoding algorithm based on the truncated Kapteyn series expansion performs better than other compared algorithms while keeping low computational complexity.

5 May 2019 in Information
Verified
Journal Article
Open access
PDF file
XZXiaoqing Zhao
Xiaoqing Zhao
ZLZhengquan Li
Zhengquan Li
SXSong Xing
Song Xing
YLYang Liu
Yang Liu
QWQiong Wu
Qiong Wu
BLBaolong Li
Baolong Li
Massive multiple-input-multiple-output (MIMO) is one of the key technologies in the fifth generation (5G) cellular communication systems. For uplink massive MIMO systems, the typical linear detection such as minimum mean square error (MMSE) presents a near-optimal performance. Due to the required direct matrix inverse, however, the MMSE detection algorithm becomes computationally very expensive, especially when the number of users is large. For achieving the high detection accuracy as well as reducing the computational complexity in massive MIMO systems, we propose an improved Jacobi iterative algorithm by accelerating the convergence rate in the signal detection process.Specifically, the steepest descent (SD) method is utilized to achieve an efficient searching direction. Then, the whole-correction method is applied to update the iterative process. As the result, the fast convergence and the low computationally complexity of the proposed Jacobi-based algorithm are obtained and proved. Simulation results also demonstrate that the proposed algorithm performs better than the conventional algorithms in terms of the bit error rate (BER) and achieves a near-optimal detection accuracy as the typical MMSE detector, but utilizing a small number of iterations.