Cheng Chu

Cheng Chu

Auto-generated profile, based on publicly available information

Cheng Chu

Indiana University, Bloomington, IN, United States

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
23 June 2024
Verified
Conference Paper
Open access
CCCheng Chu
Cheng Chu
ZFZhenxiao Fu
Zhenxiao Fu
YXYilun Xu
Yilun Xu
GHGang Huang
Gang Huang
Hausi MullerHausi Muller
Hausi Muller
LJLei Jiang
Lei Jiang

18 July 2023 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
CCCheng Chu
Cheng Chu
CLCheng Liu
Cheng Liu
DXdawen xu
dawen xu
YWYing Wang
Ying Wang
TLTao Luo
Tao Luo
XLXiaowei Li
Xiaowei Li
Deformable convolution networks (DCNs) proposed to address image recognition with geometric or photometric variations typically involve deformable convolution that convolves on arbitrary locations of input features. The locations change with different inputs and induce considerable dynamic and irregular memory accesses that cannot be handled by classic neural network accelerators (NNAs). Moreover, bilinear interpolation (BLI) operation, which is required to obtain deformed features in DCNs, also cannot be deployed on existing NNAs directly. Although a general purposed processor (GPP) seated along with classic NNAs can process the deformable convolution, the processing on GPP can be extremely slow due to the limited parallel computing capability and massive additional data movement. To address the problem, we develop a DCN accelerator on existing NNAs to support both the standard convolution and deformable convolution. Specifically, for the dynamic and irregular accesses in DCNs, we have both the input and output features divided into tiles and build a tile dependency table (TDT) to track the irregular tile dependency at runtime. With the TDT, we further develop an on-chip tile scheduler to handle the dynamic and irregular accesses efficiently. In addition, we propose a novel mapping strategy to enable parallel BLI processing on NNAs and apply layer fusion techniques for more energy-efficient DCN processing. According to our experiments, the proposed accelerator achieves orders of magnitude higher performance and energy efficiency compared to the typical computing architectures including ARM, ARM+TPU, and GPU with 6.6% chip area penalty to a classic NNA.

5 August 2024
Verified
Conference Paper
Open access
MZMengxin Zheng
Mengxin Zheng
CCCheng Chu
Cheng Chu
QLQian Lou
Qian Lou
NYNathan Youngblood
Nathan Youngblood
MLMo Li
Mo Li
LJLei Jiang
Lei Jiang
This paper presents OFHE, an electro-optical accelerator designed to process Discretized TFHE (DTFHE) operations, which encrypt multi-bit messages and support homomorphic multiplications, lookup table operations and full-domain functional bootstrappings. While DTFHE is more efficient and versatile than other fully homomorphic encryption schemes, it requires 32-, 64-, and 128-bit polynomial multiplications, which can be time-consuming. Existing TFHE accelerators are not easily upgradable to support DTFHE operations due to limited datapaths, a lack of datapath bit-width reconfigurability, and power inefficiencies when processing FFT and inverse FFT (IFFT) kernels. Compared to prior TFHE accelerators, OFHE addresses these challenges by improving the DTFHE operation latency by 8.7%, the DTFHE operation throughput by 57%, and the DTFHE operation throughput per Watt by 94%.

27 October 2021 in arXiv
Verified
Preprint
Open access
PDF file
CLCheng Liu
Cheng Liu
CCCheng Chu
Cheng Chu
DXDawen Xu
Dawen Xu
YWYing Wang
Ying Wang
Qianlong WangQianlong Wang
Qianlong Wang
KCKwang-Ting Cheng
Kwang-Ting Cheng
Hardware faults on the regular 2-D computing array of a typical deep learning accelerator (DLA) can lead to dramatic prediction accuracy loss. Prior redundancy design approaches typically have each homogeneous redundant processing element (PE) to mitigate faulty PEs for a limited region of the 2-D computing array rather than the entire computing array to avoid the excessive hardware overhead. However, they fail to recover the computing array when the number of faulty PEs in any region exceeds the number of redundant PEs in the same region. The mismatch problem deteriorates when the fault injection rate rises and the faults are unevenly distributed. To address the problem, we propose a hybrid computing architecture (HyCA) for fault-tolerant DLAs. It has a set of dot-production processing units (DPPUs) to recompute all the operations that are mapped to the faulty PEs despite the faulty PE locations. According to our experiments, HyCA shows significantly higher reliability, scalability, and performance with less chip area penalty when compared to the conventional redundancy approaches. Moreover, by taking advantage of the flexible recomputing, HyCA can also be utilized to scan the entire 2-D computing array and detect the faulty PEs effectively at runtime.