Che-Hao Yu

Che-Hao Yu

Auto-generated profile, based on publicly available information

Che-Hao Yu

Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
20 May 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YLYi-Jheng Lin
Yi-Jheng Lin
CYChe-Hao Yu
Che-Hao Yu
TLTzu-Hsuan Liu
Tzu-Hsuan Liu
CCCheng-Shang Chang
Cheng-Shang Chang
WCWen-Tsuen Chen
Wen-Tsuen Chen
The group testing approach, which achieves significant cost reduction over the individual testing approach, has received a lot of interest lately for massive testing of COVID-19. Many studies simply assume samples mixed in a group are independent. However, this assumption may not be reasonable for a contagious disease like COVID-19. Specifically, people within a family tend to infect each other and thus are likely to be positively correlated. By exploiting positive correlation, we make the following two main contributions. One is to provide a rigorous proof that further cost reduction can be achieved by using the Dorfman two-stage method when samples within a group are positively correlated. The other is to propose a hierarchical agglomerative algorithm for pooled testing with a social graph, where an edge in the social graph connects frequent social contacts between two persons. Such an algorithm leads to notable cost reduction (roughly 20–35%) compared to random pooling when the Dorfman two-stage algorithm is applied.

22 January 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
CYChe-Hao Yu
Che-Hao Yu
LHLin Huang
Lin Huang
CCCheng-Shang Chang
Cheng-Shang Chang
DLDuan-Shin Lee
Duan-Shin Lee
In this article, we develop a probabilistic framework for analyzing coded random access. Our framework is based on a new abstract receiver (decoder), called a Poisson receiver, that is characterized by a success probability function of a tagged packet subject to a Poisson offered load. We show that various coded slotted ALOHA (CSA) systems are Poisson receivers. Moreover, Poisson receivers have two elegant closure properties: (i) Poisson receivers with packet routing are still Poisson receivers, and (ii) Poisson receivers with packet coding are still Poisson receivers. These two closure properties enable us to use smaller Poisson receivers as building blocks for analyzing a larger Poisson receiver. As such, we can analyze complicated systems that are not possible by the classical tree evaluation method. In particular, for CSA systems with both spatial diversity and temporal diversity, we can use the framework of Poisson receivers to compute the exact (asymptotic) throughput. We demonstrate that our framework can be used to provide differentiated services between ultra-reliable low-latency communication (URLLC) traffic and enhanced mobile broadband (eMBB) traffic. By conducting extensive simulations, we also verify that our theoretical results match extremely well with the simulation results.

26 October 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YLYi-Jheng Lin
Yi-Jheng Lin
CYChe-Hao Yu
Che-Hao Yu
TLTzu-Hsuan Liu
Tzu-Hsuan Liu
CCCheng-Shang Chang
Cheng-Shang Chang
WCWen-Tsuen Chen
Wen-Tsuen Chen
In comparison with individual testing, group testing is more efficient in reducing the number of tests and potentially leading to tremendous cost reduction. There are two key elements in a group testing technique: (i) the pooling matrix that directs samples to be pooled into groups, and (ii) the decoding algorithm that uses the group test results to reconstruct the status of each sample. In this paper, we propose a new family of pooling matrices from packing the pencil of lines (PPoL) in a finite projective plane. We compare their performance with various pooling matrices proposed in the literature, including 2D-pooling, P-BEST, and Tapestry, using the two-stage definite defectives (DD) decoding algorithm. By conducting extensive simulations for a range of prevalence rates up to 5%, our numerical results show that there is no pooling matrix with the lowest relative cost in the whole range of the prevalence rates. To optimize the performance, one should choose the right pooling matrix, depending on the prevalence rate. The family of PPoL matrices can dynamically adjust their construction parameters according to the prevalence rates and could be a better alternative than using a fixed pooling matrix.

5 November 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
TLTzu-Hsuan Liu
Tzu-Hsuan Liu
CYChe-Hao Yu
Che-Hao Yu
YLYi-Jheng Lin
Yi-Jheng Lin
CCChia-Ming Chang
Chia-Ming Chang
CCCheng-Shang Chang
Cheng-Shang Chang
DLDuan-Shin Lee
Duan-Shin Lee
Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed by Yu et al. (2021) as a probabilistic framework for providing differentiated services in uplink transmissions in 5G networks. In this paper, we further propose a deterministic framework of ALOHA receivers that can be incorporated into the probabilistic framework of Poisson receivers for analyzing coded multiple access with successive interference cancellation. An ALOHA receiver is characterized by a success function of the number of packets that can be successfully received. Inspired by the theory of network calculus, we derive various algebraic properties for several operations on success functions and use them to prove various closure properties of ALOHA receivers, including (i) ALOHA receivers in tandem, (ii) cooperative ALOHA receivers, (iii) ALOHA receivers with traffic multiplexing, and (iv) ALOHA receivers with packet coding. By conducting extensive simulations, we show that our theoretical results match extremely well with the simulation results.

17 April 2021 in arXiv
Verified
Preprint
Open access
PDF file
YLYi-Jheng Lin
Yi-Jheng Lin
CYChe-Hao Yu
Che-Hao Yu
TLTzu-Hsuan Liu
Tzu-Hsuan Liu
CCCheng-Shang Chang
Cheng-Shang Chang
WCWen-Tsuen Chen
Wen-Tsuen Chen
The group testing approach that achieves significant cost reduction over the individual testing approach has received a lot of interest lately for massive testing of COVID-19. Many studies simply assume samples mixed in a group are independent. However, this assumption may not be reasonable for a contagious disease like COVID-19. Specifically, people within a family tend to infect each other and thus are likely to be positively correlated. By exploiting positive correlation, we make the following two main contributions. One is to provide a rigorous proof that further cost reduction can be achieved by using the Dorfman two-stage method when samples within a group are positively correlated. The other is to propose a hierarchical agglomerative algorithm for pooled testing with a social graph, where an edge in the social graph connects frequent social contacts between two persons. Such an algorithm leads to notable cost reduction (roughly 20%-35%) compared to random pooling when the Dorfman two-stage algorithm is applied.

15 June 2021 in arXiv
Verified
Preprint
Open access
PDF file
YLYi-Jheng Lin
Yi-Jheng Lin
CYChe-Hao Yu
Che-Hao Yu
TLTzu-Hsuan Liu
Tzu-Hsuan Liu
CCCheng-Shang Chang
Cheng-Shang Chang
WCWen-Tsuen Chen
Wen-Tsuen Chen
In comparison with individual testing, group testing (also known as pooled testing) is more efficient in reducing the number of tests and potentially leading to tremendous cost reduction. As indicated in the recent article posted on the US FDA website, the group testing approach for COVID-19 has received a lot of interest lately. There are two key elements in a group testing technique: (i) the pooling matrix that directs samples to be pooled into groups, and (ii) the decoding algorithm that uses the group test results to reconstruct the status of each sample. In this paper, we propose a new family of pooling matrices from packing the pencil of lines (PPoL) in a finite projective plane. We compare their performance with various pooling matrices proposed in the literature, including 2D-pooling, P-BEST, and Tapestry, using the two-stage definite defectives (DD) decoding algorithm. By conducting extensive simulations for a range of prevalence rates up to 5%, our numerical results show that there is no pooling matrix with the lowest relative cost in the whole range of the prevalence rates. To optimize the performance, one should choose the right pooling matrix, depending on the prevalence rate. The family of PPoL matrices can dynamically adjust their column weights according to the prevalence rates and could be a better alternative than using a fixed pooling matrix.