Jiaxin Qing
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiaxin Qing has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Raymond W. Yeung
Department of Surgery, University of Washington, Seattle, Washington
4 shared publications - Philip Heng Wai Leong
School of Electrical and Computer Engineering, The University of Sydney, Sydney, NSW, Australia
2 shared publications - Hoover H. F. Yin
Department of Information Engineering, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong, China
1 shared publication Kin-Hong Lee
Department of Computer Science Engineering, The Chinese University of Hong Kong, Shatin, SAR, Hong Kong
1 shared publicationMingyang Zhu
Institute of Network Coding, The Chinese University of Hong Kong, Shatin, Hong Kong
1 shared publication- Xiaohong Cai
Department of Information Engineering, The Chinese University of Hong Kong, Shatin, SAR, Hong Kong
1 shared publication
Latest Publications
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. PP (10638210) , 1-14
Toward High-Performance Network Coding: FPGA Acceleration With Bounded-Value Generators
The network coding enhances performance in network communications and distributed storage by increasing throughput and robustness while reducing latency. Batched sparse (BATS) codes are a class of capacity-achieving network codes, but their practical applications are hindered by their structure, computational intensity, and power demands of finite field (FF) operations. Most literature focuses on algorithmic-level techniques to improve the coding efficiency. Optimization with an algorithm/hardware co-designing approach has long been neglected. Leveraging the unique structure of BATS codes, we first present cyclic-shift BATS (CS-BATS), a hardware-friendly variant. Next, we propose a simple but effective bounded-value (BV) generator, to reduce the size of a finite field multiplier by up to 70%. Finally, we report on a scalable and resource-efficient field-programmable gate array (FPGA)-based network coding accelerator that achieves a throughput of 27 Gb/s, a speedup of more than 300 over software.
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. PP (10638210) , 1-14
Toward High-Performance Network Coding: FPGA Acceleration With Bounded-Value Generators
The network coding enhances performance in network communications and distributed storage by increasing throughput and robustness while reducing latency. Batched sparse (BATS) codes are a class of capacity-achieving network codes, but their practical applications are hindered by their structure, computational intensity, and power demands of finite field (FF) operations. Most literature focuses on algorithmic-level techniques to improve the coding efficiency. Optimization with an algorithm/hardware co-designing approach has long been neglected. Leveraging the unique structure of BATS codes, we first present cyclic-shift BATS (CS-BATS), a hardware-friendly variant. Next, we propose a simple but effective bounded-value (BV) generator, to reduce the size of a finite field multiplier by up to 70%. Finally, we report on a scalable and resource-efficient field-programmable gate array (FPGA)-based network coding accelerator that achieves a throughput of 27 Gb/s, a speedup of more than 300 over software.
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (1) , 54-66
Dependence Analysis and Structured Construction for Batched Sparse Code
In coding theory, codes are usually designed with a certain level of randomness to facilitate analysis and accommodate different channel conditions. However, the resulting random code constructed can be suboptimal in practical implementations. Represented by a bipartite graph, the Batched Sparse Code (BATS Code) is a randomly constructed erasure code that utilizes network coding to achieve near-optimal performance in wireless multi-hop networks. In the performance analysis in the previous research, it is implicitly assumed that the coded batches in the BATS code are independent. This assumption holds only asymptotically when the number of input symbols is infinite, but it does not generally hold in a practical setting where the number of input symbols is finite, especially when the code is constructed randomly. We show that dependence among the batches significantly degrades the code’s performance. In order to control the batch dependence through graphical design, we propose constructing the BATS code in a structured manner. A hardware-friendly structured BATS code called the Cyclic-Shift BATS (CS-BATS) code is proposed, which constructs the code from a small base graph using light-weight cyclic-shift operations. We demonstrate that when the base graph is properly designed, a higher decoding rate and a smaller complexity can be achieved compared with the random BATS code.
- 23 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (1) , 54-66
Dependence Analysis and Structured Construction for Batched Sparse Code
In coding theory, codes are usually designed with a certain level of randomness to facilitate analysis and accommodate different channel conditions. However, the resulting random code constructed can be suboptimal in practical implementations. Represented by a bipartite graph, the Batched Sparse Code (BATS Code) is a randomly constructed erasure code that utilizes network coding to achieve near-optimal performance in wireless multi-hop networks. In the performance analysis in the previous research, it is implicitly assumed that the coded batches in the BATS code are independent. This assumption holds only asymptotically when the number of input symbols is infinite, but it does not generally hold in a practical setting where the number of input symbols is finite, especially when the code is constructed randomly. We show that dependence among the batches significantly degrades the code’s performance. In order to control the batch dependence through graphical design, we propose constructing the BATS code in a structured manner. A hardware-friendly structured BATS code called the Cyclic-Shift BATS (CS-BATS) code is proposed, which constructs the code from a small base graph using light-weight cyclic-shift operations. We demonstrate that when the base graph is properly designed, a higher decoding rate and a smaller complexity can be achieved compared with the random BATS code.
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 9733-9745
Performance Analysis and Optimal Design of BATS Code: A Hardware Perspective
Batched Sparse codes (BATS codes) are a class of linear network coding schemes that increase network throughput by converting a multi-hop problem into an end-to-end problem through network coding. It plays a crucial role in future wireless communication, where packet loss is inevitable. This is an enduring problem in many applications, including vehicular networks. While the theory of BATS codes has been developed over the past decade, little research has been done on its hardware implementation, which is important for practical adoption. This paper provides a systematic way to analyze the performance of a BATS hardware accelerator when the code varies. A roofline model which provides an upper bound of the performance considering both computational and input/output constraints is developed. Next, we build a model connecting the BATS code design space with the hardware execution time, which can be used to determine an optimal code. Finally, we propose and test a flexible and scalable BATS code design paradigm for hardware accelerators with numerical results. The same framework could easily be extended to other linear codes and different computing systems.
- 27 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (8) , 9733-9745
Performance Analysis and Optimal Design of BATS Code: A Hardware Perspective
Batched Sparse codes (BATS codes) are a class of linear network coding schemes that increase network throughput by converting a multi-hop problem into an end-to-end problem through network coding. It plays a crucial role in future wireless communication, where packet loss is inevitable. This is an enduring problem in many applications, including vehicular networks. While the theory of BATS codes has been developed over the past decade, little research has been done on its hardware implementation, which is important for practical adoption. This paper provides a systematic way to analyze the performance of a BATS hardware accelerator when the code varies. A roofline model which provides an upper bound of the performance considering both computational and input/output constraints is developed. Next, we build a model connecting the BATS code design space with the hardware execution time, which can be used to determine an optimal code. Finally, we propose and test a flexible and scalable BATS code design paradigm for hardware accelerators with numerical results. The same framework could easily be extended to other linear codes and different computing systems.
- 26 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 27, 37-42
Enhancing the Decoding Rates of BATS Codes by Learning With Guided Information
BATched Sparse codes (BATS codes) are a class of random linear network code designed for wireless multi-hop networks with packet loss. The encoder of a BATS code generates batches where each batch contains a number of coded packets. As the outer code is a matrix generalization of the fountain code, the ordinary batch construction scheme relies on a degree distribution with a random packet sampling scheme. In practical applications, we want a batch construction scheme which achieves a high decoding rate at the destination. A natural question to ask is: Is there any batch construction scheme which achieves a higher decoding rate than the ordinary one? We give an affirmative answer to this question by formulating the batch construction scheme as a multi-armed bandit problem and solving it with a deep reinforcement learning method with the degree distribution as a guiding prior. The BATS code generated by our proposed method achieves a higher decoding rate with improved efficiency compared with the ordinary batch construction scheme.
- 26 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 27, 37-42
Enhancing the Decoding Rates of BATS Codes by Learning With Guided Information
BATched Sparse codes (BATS codes) are a class of random linear network code designed for wireless multi-hop networks with packet loss. The encoder of a BATS code generates batches where each batch contains a number of coded packets. As the outer code is a matrix generalization of the fountain code, the ordinary batch construction scheme relies on a degree distribution with a random packet sampling scheme. In practical applications, we want a batch construction scheme which achieves a high decoding rate at the destination. A natural question to ask is: Is there any batch construction scheme which achieves a higher decoding rate than the ordinary one? We give an affirmative answer to this question by formulating the batch construction scheme as a multi-armed bandit problem and solving it with a deep reinforcement learning method with the degree distribution as a guiding prior. The BATS code generated by our proposed method achieves a higher decoding rate with improved efficiency compared with the ordinary batch construction scheme.