Sizhao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sizhao Li has a total of 108 co-authors. Here are the top co-authors by number of shared publications:
- Lvqing Bi
Yulin Normal University
5 shared publications - Songsong Dai
School of Electronics and Information Engineering, Taizhou University, Taizhou 318000, China
5 shared publications - Wenshan Wang
Harbin Engineering University
5 shared publications Bo Hu
School of Information Science and Engineering, Xiamen University, Xiamen, China
4 shared publicationsDonghui Guo
Department of Electronic Engineering, Xiamen University, Xiamen, China
4 shared publications- Guisheng Yin
College of Computer Science and Technology, Harbin Engineering University, Harbin 150009, China
4 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45  (11) , 5332-5345
SwarmRouter: Obstacle-Avoiding Routing for Droplet Swarms on Active-Matrix Digital Microfluidic Biochips
Digital microfluidic biochips (DMFBs), renowned for their programmable and digital manipulations of droplets, have been extensively applied in the automation of bioassays. However, constrained by factors such as electrode size, quantity, and addressing methods, conventional DMFBs face challenges in deploying large-scale biochemical applications. In contrast, the next-generation active-matrix digital microfluidic biochips (AM-DMFs), leveraging their powerful capabilities in cross-addressing and parallel droplet manipulations, have emerged as a key alternative platform for high-throughput bioassays. Nevertheless, the execution of large-scale bioassays on the AM-DMF platforms poses significant challenges for droplet routing. For example, in single-cell proteomics assays, to facilitate high-throughput processing of numerous samples, hundreds and thousands of split droplets need to be transported in parallel to designated areas while avoiding on-chip obstacles. This gives rise to the large-scale obstacle-avoiding routing problem, which existing approaches prove inadequate to effectively address. In this paper, we propose the first obstacle-avoiding routing method called SwarmRouter for large-scale droplet swarms, which enables efficient path planning for droplets while ensuring conflict-free and deadlock-free operations. The proposed method includes the following key techniques: 1) A geometric-temporal coupled preprocessing strategy integrating droplet spacing optimization and priority scheduling for conflict and deadlock elimination, 2) a path preselection strategy for both path length reduction and conflict avoidance, and 3) a timing-driven parallel routing method with dynamic checkpoints for waiting time minimization. Experimental results on an ACXEL AM16K biochip system demonstrate that SwarmRouter successfully realizes conflict-free path planning for all given droplets, while achieving significant reductions of 25.13% in total path length, 19.6% in maximum arrival time, and an improvement of 12.63% in average droplet velocity compared to a baseline method.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45  (11) , 5332-5345
SwarmRouter: Obstacle-Avoiding Routing for Droplet Swarms on Active-Matrix Digital Microfluidic Biochips
Digital microfluidic biochips (DMFBs), renowned for their programmable and digital manipulations of droplets, have been extensively applied in the automation of bioassays. However, constrained by factors such as electrode size, quantity, and addressing methods, conventional DMFBs face challenges in deploying large-scale biochemical applications. In contrast, the next-generation active-matrix digital microfluidic biochips (AM-DMFs), leveraging their powerful capabilities in cross-addressing and parallel droplet manipulations, have emerged as a key alternative platform for high-throughput bioassays. Nevertheless, the execution of large-scale bioassays on the AM-DMF platforms poses significant challenges for droplet routing. For example, in single-cell proteomics assays, to facilitate high-throughput processing of numerous samples, hundreds and thousands of split droplets need to be transported in parallel to designated areas while avoiding on-chip obstacles. This gives rise to the large-scale obstacle-avoiding routing problem, which existing approaches prove inadequate to effectively address. In this paper, we propose the first obstacle-avoiding routing method called SwarmRouter for large-scale droplet swarms, which enables efficient path planning for droplets while ensuring conflict-free and deadlock-free operations. The proposed method includes the following key techniques: 1) A geometric-temporal coupled preprocessing strategy integrating droplet spacing optimization and priority scheduling for conflict and deadlock elimination, 2) a path preselection strategy for both path length reduction and conflict avoidance, and 3) a timing-driven parallel routing method with dynamic checkpoints for waiting time minimization. Experimental results on an ACXEL AM16K biochip system demonstrate that SwarmRouter successfully realizes conflict-free path planning for all given droplets, while achieving significant reductions of 25.13% in total path length, 19.6% in maximum arrival time, and an improvement of 12.63% in average droplet velocity compared to a baseline method.
- 24 August 2026
- Published by Springer Nature
- p. 34-48
Uni-Winograd: A Massively Resource-Efficient and Unified Radix-4 NTT Architecture for PQC Algorithms
- 24 August 2026
- Published by Springer Nature
- p. 34-48
Uni-Winograd: A Massively Resource-Efficient and Unified Radix-4 NTT Architecture for PQC Algorithms
- 24 August 2026
- Published by Springer Nature
- p. 572-578
S$^{2}$M: Spatiotemporal-Cooperative Symbiotic Memory for Heterogeneous PQC Acceleration- 24 August 2026
- Published by Springer Nature
- p. 572-578
S$^{2}$M: Spatiotemporal-Cooperative Symbiotic Memory for Heterogeneous PQC Acceleration- 29 June 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29  (7) , 405
IBMEIL: identity-based matchmaking encryption scheme from ideal lattices for IoT
- 29 June 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29  (7) , 405
IBMEIL: identity-based matchmaking encryption scheme from ideal lattices for IoT
- 8 April 2026
- Published by Springer Nature
- p. 154-175
PQIns: Pipeline-Driven Application-Specific Instruction-Set Architecture for Hybrid Post-quantum Cryptography Acceleration
- 8 April 2026
- Published by Springer Nature
- p. 154-175
PQIns: Pipeline-Driven Application-Specific Instruction-Set Architecture for Hybrid Post-quantum Cryptography Acceleration
- 8 April 2026
- Published by Springer Nature
- p. 190-209
SpikeEAR: Low-Power Neuromorphic Auditory System for Real-Time Scene Analysis on FPGA
- 8 April 2026
- Published by Springer Nature
- p. 190-209
SpikeEAR: Low-Power Neuromorphic Auditory System for Real-Time Scene Analysis on FPGA
- 8 April 2026
- Published by Springer Nature
- p. 210-229
KiRa: A Unified Memory Architecture for Efficient Post-quantum Cryptographic Algorithms
- 8 April 2026
- Published by Springer Nature
- p. 210-229
KiRa: A Unified Memory Architecture for Efficient Post-quantum Cryptographic Algorithms
- 13 January 2026
- Published by Springer Nature
- p. 68-82
Diffusion-Based Cross-Modal Fusion Model for Pedestrian Trajectory Prediction
- 13 January 2026
- Published by Springer Nature
- p. 68-82
Diffusion-Based Cross-Modal Fusion Model for Pedestrian Trajectory Prediction
- Open Access
- 11 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31  (1) , 1-31
Design Automation Techniques for Microfluidic Fully Programmable Valve Array Biochips: A Systematic Survey
Flow-based microfluidic biochips have attracted much attention over the past two decades. By integrating diverse micro-components, e.g., mixers and filters, on a miniaturized planar substrate, complicated bioassays such as protein crystallization and drug screening can be executed automatically without requiring human invention, thus becoming a promising alternative to traditional cumbersome laboratory equipment. As manufacturing technology advances, it has become possible to implement hundreds of thousands of microvalves within a single chip. This breakthrough has given rise to fully programmable valve array (FPVA) biochips, representing a next-generation platform in flow-based microfluidics that offers enhanced reconfigurability and operational flexibility. Nevertheless, the exponential increase in valve density has introduced significant design complexity when implementing sophisticated assay protocols. As a result, the design automation of FPVAs has emerged as a critical research frontier, attracting considerable attention from both academia and industry. This review article systematically examines recent advances in FPVA design automation, involving computer-aided design methods for architectural synthesis, volume management, sample preparation, automated testing, fault localization, error recovery, and washing optimization. These techniques enable FPVA users to concentrate on assay protocol development while delegating implementation-specific design and optimization tasks to design automation tools. Furthermore, we analyze emerging security implications in FPVAs, particularly focusing on bioassay accuracy and reliability that ensure experimental reproducibility. Finally, potential trajectories for future research are discussed in detail to further promote the integration level and widespread application of FPVAs.
- 11 November 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 31  (1) , 1-31
Open AccessDesign Automation Techniques for Microfluidic Fully Programmable Valve Array Biochips: A Systematic Survey
Flow-based microfluidic biochips have attracted much attention over the past two decades. By integrating diverse micro-components, e.g., mixers and filters, on a miniaturized planar substrate, complicated bioassays such as protein crystallization and drug screening can be executed automatically without requiring human invention, thus becoming a promising alternative to traditional cumbersome laboratory equipment. As manufacturing technology advances, it has become possible to implement hundreds of thousands of microvalves within a single chip. This breakthrough has given rise to fully programmable valve array (FPVA) biochips, representing a next-generation platform in flow-based microfluidics that offers enhanced reconfigurability and operational flexibility. Nevertheless, the exponential increase in valve density has introduced significant design complexity when implementing sophisticated assay protocols. As a result, the design automation of FPVAs has emerged as a critical research frontier, attracting considerable attention from both academia and industry. This review article systematically examines recent advances in FPVA design automation, involving computer-aided design methods for architectural synthesis, volume management, sample preparation, automated testing, fault localization, error recovery, and washing optimization. These techniques enable FPVA users to concentrate on assay protocol development while delegating implementation-specific design and optimization tasks to design automation tools. Furthermore, we analyze emerging security implications in FPVAs, particularly focusing on bioassay accuracy and reliability that ensure experimental reproducibility. Finally, potential trajectories for future research are discussed in detail to further promote the integration level and widespread application of FPVAs.
- 28 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73  (4) , 2621-2634
An Approximate Computing-Based Spiking Neural Networks Neuron Model and STDP Learning
Spiking Neural Networks (SNNs) show great potential in applications such as image processing, robotics, and communications. However, the vast number of neuron models and learning algorithms in large-scale SNNs impose significant hardware and energy overhead, with multiplication remaining the most critical operation. Thus, to address this challenge, this paper presents the hardware design of the Logarithmic Linear Multiply (LLMu) and Logarithmic Linear Segmented Multiply (LLSMu). These two components are specifically designed for neuron models and learning algorithms, achieving high accuracy with low hardware resource utilization and energy consumption. To demonstrate the capabilities of LLMu and LLSMu, we implement two mainstream SNN neuron models—Leaky Integrate-and-Fire (LIF) and Izhikevich—as well as the Spike Timing-Dependent Plasticity (STDP) learning algorithm, and compare their performance with state-of-the-art approaches on FPGA and ASIC platforms. The scope of this work is limited to these models and algorithms. The LLMu- and LLSMu-based implementations exhibit significantly improved energy efficiency over existing methods. Specifically, in the FPGA implementation, the LLSMu-based LIF neuron model achieves a $6.75\times $ improvement, the LLSMu-based Izhikevich neuron model achieves a $2.70\times $ to $3.72\times $ improvement, and the LLMu-based STDP achieves a $21.03\times $ to $48.78\times $ improvement in energy efficiency. In the ASIC implementation, the LLSMu-based Izhikevich neuron model further improves energy efficiency by $5.58\times $ to $5.69\times $ , while the LLMu-based STDP achieves $5.96\times $ and $3.69\times $ improvements compared to prior designs.
- 28 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73  (4) , 2621-2634
An Approximate Computing-Based Spiking Neural Networks Neuron Model and STDP Learning
Spiking Neural Networks (SNNs) show great potential in applications such as image processing, robotics, and communications. However, the vast number of neuron models and learning algorithms in large-scale SNNs impose significant hardware and energy overhead, with multiplication remaining the most critical operation. Thus, to address this challenge, this paper presents the hardware design of the Logarithmic Linear Multiply (LLMu) and Logarithmic Linear Segmented Multiply (LLSMu). These two components are specifically designed for neuron models and learning algorithms, achieving high accuracy with low hardware resource utilization and energy consumption. To demonstrate the capabilities of LLMu and LLSMu, we implement two mainstream SNN neuron models—Leaky Integrate-and-Fire (LIF) and Izhikevich—as well as the Spike Timing-Dependent Plasticity (STDP) learning algorithm, and compare their performance with state-of-the-art approaches on FPGA and ASIC platforms. The scope of this work is limited to these models and algorithms. The LLMu- and LLSMu-based implementations exhibit significantly improved energy efficiency over existing methods. Specifically, in the FPGA implementation, the LLSMu-based LIF neuron model achieves a $6.75\times $ improvement, the LLSMu-based Izhikevich neuron model achieves a $2.70\times $ to $3.72\times $ improvement, and the LLMu-based STDP achieves a $21.03\times $ to $48.78\times $ improvement in energy efficiency. In the ASIC implementation, the LLSMu-based Izhikevich neuron model further improves energy efficiency by $5.58\times $ to $5.69\times $ , while the LLMu-based STDP achieves $5.96\times $ and $3.69\times $ improvements compared to prior designs.