Yongce Chen

Yongce Chen

Auto-generated profile, based on publicly available information

Yongce Chen

Nvidia Corporation, Santa Clara, CA, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
22 March 2022 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
CLChengzhang Li
Chengzhang Li
QLQingyu Liu
Qingyu Liu
SLShaoran Li
Shaoran Li
YCYongce Chen
Yongce Chen
YHY. Thomas Hou
Y. Thomas Hou
SKSastry Kompella
Sastry Kompella
Age of Information (AoI) is an application layer performance metric that quantifies the freshness of information. This paper investigates scheduling problems at network edge when there is an AoI requirement for each source node, which we call Maximum AoI Threshold (MAT). Specifically, we want to determine whether or not a vector of MATs corresponding to the source nodes is schedulable, and if so, find a feasible scheduler for it. For a small network, we present an optimal procedure called Cyclic Scheduler Detection (CSD) that can determine the schedulability with absolute certainty. For a large network where CSD is not applicable, we present a novel low-complexity procedure, called Fictitious Polynomial Mapping (FPM), and prove that FPM can find a feasible scheduler for any MAT vector when the load is under $\ln 2$ . We use extensive numerical results to validate our theoretical results and show that the performance of FPM is significantly better than a state-of-the-art scheduling algorithm.

11 November 2019 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
CLChengzhang Li
Chengzhang Li
SLShaoran Li
Shaoran Li
YCYongce Chen
Yongce Chen
YHY. Thomas Hou
Y. Thomas Hou
WLWenjing Lou
Wenjing Lou
A critical component in IoT infrastructure and applications is data collection at network edge. Recently, a new metric, called age of information (AoI), has become popular to quantify the freshness of information collected at network edge. AoI research is still in infancy and most efforts assume overly simplified models in their investigation, making their results far from useful when addressing practical problems in IoT applications. In this paper, we close this gap by considering more general models for AoI research that are more relevant in the real world. Specifically, we consider general and heterogeneous sampling behaviors among source nodes, varying sample size, and a transmission model with multiple transmission units in each time slot. Based on these generalizations, we develop new theoretical results (in terms of fundamental properties and performance bounds) and a new near-optimal low-complexity scheduling algorithm to minimize AoI. Our results make a major advance to existing AoI research and help bridge the gap between theory and practice.

25 January 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CLChengzhang Li
Chengzhang Li
YHYan Huang
Yan Huang
SLShaoran Li
Shaoran Li
YCYongce Chen
Yongce Chen
BJBrian A. Jalaian
Brian A. Jalaian
SKSastry Kompella
Sastry Kompella
The Age of Information (AoI) is a key metric to measure the freshness of information for IoT applications. Most of the existing analytical models for AoI are overly idealistic and do not capture state-of-the-art transmission technologies such as 5G as well as channel dynamics in both frequency and time domains. In this article, we present Kronos, a real-time 5G-compliant scheduler that minimizes AoI for IoT data collection. Kronos is designed to cope with highly dynamic channel conditions. Its main function is to perform RB allocation and to select the modulation and coding scheme for each source node based on channel conditions, with the objective of minimizing long-term AoI. To meet the stringent real-time requirement for 5G, we develop a GPU-based implementation of Kronos on commercial off-the-shelf Nvidia GPUs. Through extensive experimentation, we show that Kronos can find near-optimal solutions under submillisecond time scale. To the best of our knowledge, this is the first real-time AoI scheduler that is 5G compliant.

28 November 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
YCYongce Chen
Yongce Chen
YHY. Thomas Hou
Y. Thomas Hou
WLWenjing Lou
Wenjing Lou
JRJeffrey H. Reed
Jeffrey H. Reed
SKSastry Kompella
Sastry Kompella
Open radio access network (O-RAN) enables cooperative signal processing among multiple cells at a centralized O-RAN distributed unit (O-DU). It is a key technology for cellular networks to increase spectrum efficiency. To achieve cooperative signal processing across multiple cells, a new scheduler is needed. Specifically, the scheduler must jointly determine RB allocation, MCS assignment, and beamforming matrices for all users from all the cells that are involved in multi-cell processing. In addition, the scheduler must obtain its scheduling solution within each TTI (i.e., at most 1 ms) to be useful for the frame structure defined by 5G NR. In this paper, we present O- $\mathbf M^{3}$ —a real-time scheduler for m ulti-cell M IMO networks under the O-RAN architecture. O- $\mathbf M^{3}$ can meet the stringent timing requirement with joint optimization of beamforming matrices, RB allocation, and MCS assignment among multiple cells. O- $\mathbf M^{3}$ is developed through a novel multi-pipeline design that exploits parallelism. Under this design, one pipeline performs a sequence of operations for cell-edge users to explore joint transmission, and in parallel, the other pipeline is performed for cell-center users to explore MU-MIMO transmission. We implement O- $\mathbf M^{3}$ on a commercial off-the-shelf (COTS) GPU. Experimental results show that O- $\mathbf M^{3}$ is capable of offering a scheduling solution within 500 $\mu \text{s}$ for an O-RAN system with 7 O-RAN radio units (O-RUs), 100 users, 100 RBs, and $2\times 8$ MIMO. O- $\mathbf M^{3}$ can also meet the 1 ms requirement for $2\times 12$ MIMO systems. Meanwhile, O- $\mathbf M^{3}$ can provide ~40% throughput gain on average through joint transmission across multiple cells.

18 February 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YCYongce Chen
Yongce Chen
YHYan Huang
Yan Huang
CLChengzhang Li
Chengzhang Li
YHY. Thomas Hou
Y. Thomas Hou
WLWenjing Lou
Wenjing Lou
Hybrid beamforming (HB) architecture has been widely considered for 5G mmWave systems. It reduces hardware complexity by allowing the number of RF chains to be far fewer than the number of antennas. A major practical challenge for HB is to obtain a beamforming solution in real-time. In 5G NR, new frame structures with short TTIs are employed to support mmWave communications. Under such frame structures, it is necessary to obtain a beamforming solution with a time resolution varying from 1 ms to 125 $\mu$ s – an extremely stringent time requirement considering the complexity involved in HB. In this paper, we present the design and implementation of Turbo-HB – a novel beamforming design under the HB architecture that is capable of offering the beamforming matrices in less than 500 $\mu$ s. The key ideas of Turbo-HB include: (i) reducing the complexity of computation-intensive SVD operations by exploiting channel sparsity at mmWave frequencies, and (ii) achieving large-scale parallel computation with minimal memory access. We implement Turbo-HB on an off-the-shelf Nvidia GPU and conduct extensive experiments. Our experimental results demonstrate that Turbo-HB can obtain a beamforming solution in 500 $\mu$ s for up to 100 RBs and 10 MU-MIMO users on each RB while offering competitive throughput performance compared to state-of-the-art (non-real-time) algorithms.

16 September 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YCYongce Chen
Yongce Chen
YWYubo Wu
Yubo Wu
YHY. Thomas Hou
Y. Thomas Hou
WLWenjing Lou
Wenjing Lou
Multi-User (MU)-MIMO technology plays a vital role in 5 G NR. Under MU-MIMO transmission, multiple users can share the same time-frequency resources simultaneously. For 5 G MU-MIMO systems, it is challenging to design a scheduler. The scheduler needs to determine resource block (RB) allocation, the number of data streams and modulation and coding scheme (MCS) for each user in each transmission time interval (TTI). In particular, multiple users can be co-scheduled on the same RB for MU-MIMO transmission. In addition, it is necessary for the scheduler to find a scheduling solution within each TTI to be useful. In this paper, we present mCore $+$ , a novel design and implementation that can achieve $\sim$ 500 $\mu$ s timing performance for 5 G MU-MIMO systems. mCore $+$ is meticulously designed with a multi-phase optimization and heavily leverages large-scale parallel computation. In each phase, mCore $+$ either decomposes the optimization problem into a number of independent sub-problems, or reduces the search space into a smaller but most promising subspace, or both. mCore $+$ is validated on a commercial-off-the-shelf GPU platform. Experimental results show that mCore $+$ can offer a scheduling solution in $\sim$ 500 $\mu$ s for up to 100 RBs, 100 users, 29 MCS levels and $4 \times 12$ MIMO systems. Also, mCore $+$ can achieve better or comparable throughput performance compared to other state-of-the-art algorithms.