Yu Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yu Cao has a total of 253 co-authors. Here are the top co-authors by number of shared publications:
- Gokul Krishnan
School of Electrical, Computer, and Energy Engineering, Arizona State University, Tempe, AZ, USA
12 shared publications - Jae-Sun Seo
School of Electrical and Computer Engineering, Cornell Tech, New York, NY, USA
12 shared publications - Umit Yusuf Ogras
University of Wisconsin - Madison, Madison, WI, USA
7 shared publications - Chaitali Chakrabarti
Arizona State University, Tempe, AZ, USA
6 shared publications - Sumit Kumar Mandal
Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
6 shared publications - Deliang Fan
Arizona State University
5 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 61  (11) , 6506-6516
Multi-Mode In/Near-Pixel Processing CMOS Vision Sensor With Time-Memory-Based Temporal Derivative Computing
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 61  (11) , 6506-6516
Multi-Mode In/Near-Pixel Processing CMOS Vision Sensor With Time-Memory-Based Temporal Derivative Computing
- Open Access
- 17 March 2026
- Published by IntechOpen
High-Efficiency Visual Processing through Context-Aware Selective Attention
While the increasing resolution of Complementary Metal-Oxide-Semiconductor (CMOS) image sensors offers greater detail, it imposes significant computational burdens. Drawing inspiration from the human visual system, selective attention methods mitigate this by identifying and transmitting only the most informative pixels. However, pixel-wise selection often results in irregular regions that hinder downstream tasks and limit processing efficiency. To address these limitations, we propose the patch-wise selective transformer (PST). By shifting from pixel-level to patch-level processing, PST improves both selection accuracy and structural consistency. The framework incorporates a feature pyramid to capture multi-scale objects with richer feature representations. To further optimize efficiency, we introduce Selective Batchify Attention (SBA), which utilizes a lightweight gating layer to dynamically select and regroup informative tokens into new batches. This mechanism enables flexible token counts during Graphics Processing Unit (GPU) training and inference. Experimental results demonstrate that our approach achieves superior selection accuracy, minimizes information loss, and enhances object detection performance while significantly reducing computational overhead.
- 17 March 2026
- Published by IntechOpen
Open AccessHigh-Efficiency Visual Processing through Context-Aware Selective Attention
While the increasing resolution of Complementary Metal-Oxide-Semiconductor (CMOS) image sensors offers greater detail, it imposes significant computational burdens. Drawing inspiration from the human visual system, selective attention methods mitigate this by identifying and transmitting only the most informative pixels. However, pixel-wise selection often results in irregular regions that hinder downstream tasks and limit processing efficiency. To address these limitations, we propose the patch-wise selective transformer (PST). By shifting from pixel-level to patch-level processing, PST improves both selection accuracy and structural consistency. The framework incorporates a feature pyramid to capture multi-scale objects with richer feature representations. To further optimize efficiency, we introduce Selective Batchify Attention (SBA), which utilizes a lightweight gating layer to dynamically select and regroup informative tokens into new batches. This mechanism enables flexible token counts during Graphics Processing Unit (GPU) training and inference. Experimental results demonstrate that our approach achieves superior selection accuracy, minimizes information loss, and enhances object detection performance while significantly reducing computational overhead.
- 5 March 2026
- Published by Elsevier in Solid-State Electronics
- Vol. 234
Continual graph learning for physics-constrained CMOS transistor models
- 5 March 2026
- Published by Elsevier in Solid-State Electronics
- Vol. 234
Continual graph learning for physics-constrained CMOS transistor models
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 189-200
vFPGA: Towards Sub-µs Reconfiguration via 3D FPGA and Packaging Co-Design
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 189-200
Open AccessvFPGA: Towards Sub-µs Reconfiguration via 3D FPGA and Packaging Co-Design
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
- Vol. 12, 293-301
Algorithm–Architecture Co-Design for Vertically Integrated AI and HPC Systems: Challenges, Advantages, and Future Outlook
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Exploratory Solid-State Computational Devices and Circuits
- Vol. 12, 293-301
Open AccessAlgorithm–Architecture Co-Design for Vertically Integrated AI and HPC Systems: Challenges, Advantages, and Future Outlook
- 30 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 16  (2) , 327-337
ShiftMUX: Reconfigurable 4:1 MUX-Based In-Memory Shifter for Multiplication-Less Deep Neural Network Accelerations
This paper presents ShiftMUX, a reconfigurable 4:1 multiplexer (MUX)-based in-memory computing (IMC) architecture for multiplier-less deep neural network (DNN) acceleration. The proposed design completes its operation in only three cycles, compared with at least ten cycles in prior approaches. Beyond basic logic, ShiftMUX supports complex functions such as full adder, full subtractor, and comparator, eliminating the need for separate mapping and control peripherals. When cascaded in a crossbar, multiple MUX units realize N-bit shift operations including logical, arithmetic, circular, and universal shifts enabling efficient power-of-two multiplications for quantized DNNs. Circuit-level simulations in 45nm technology show write energy of 32 pJ, read delay of 9.14 ps, and a total energy consumption of 240 pJ for a 4-bit multiplier, outperforming state-of-the-art designs. A Vision Transformer model exhibits only a +2.66% accuracy deviation with shift-based multiplication, confirming the suitability of ShiftMUX for modern AI models. Moreover, the architecture reduces computation overhead by more than 90%, requiring only N +log2(N)+2 cycles, and achieves up to 9× speedup in multiplication. ShiftMUX thus provides a scalable, reconfigurable, and energy-efficient solution for low-latency DNN acceleration in edge and high-performance computing systems.
- 30 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
- Vol. 16  (2) , 327-337
ShiftMUX: Reconfigurable 4:1 MUX-Based In-Memory Shifter for Multiplication-Less Deep Neural Network Accelerations
This paper presents ShiftMUX, a reconfigurable 4:1 multiplexer (MUX)-based in-memory computing (IMC) architecture for multiplier-less deep neural network (DNN) acceleration. The proposed design completes its operation in only three cycles, compared with at least ten cycles in prior approaches. Beyond basic logic, ShiftMUX supports complex functions such as full adder, full subtractor, and comparator, eliminating the need for separate mapping and control peripherals. When cascaded in a crossbar, multiple MUX units realize N-bit shift operations including logical, arithmetic, circular, and universal shifts enabling efficient power-of-two multiplications for quantized DNNs. Circuit-level simulations in 45nm technology show write energy of 32 pJ, read delay of 9.14 ps, and a total energy consumption of 240 pJ for a 4-bit multiplier, outperforming state-of-the-art designs. A Vision Transformer model exhibits only a +2.66% accuracy deviation with shift-based multiplication, confirming the suitability of ShiftMUX for modern AI models. Moreover, the architecture reduces computation overhead by more than 90%, requiring only N +log2(N)+2 cycles, and achieves up to 9× speedup in multiplication. ShiftMUX thus provides a scalable, reconfigurable, and energy-efficient solution for low-latency DNN acceleration in edge and high-performance computing systems.
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1838-1851
RTGS: Real-Time 3D Gaussian Splatting SLAM via Multi-Level Redundancy Reduction
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1838-1851
Open AccessRTGS: Real-Time 3D Gaussian Splatting SLAM via Multi-Level Redundancy Reduction
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44  (8) , 3208-3221
HISIM: Analytical Performance Modeling and Design Space Exploration of 2.5D/3D Integration for AI Computing
Monolithic designs face significant fabrication cost and data movement challenges, especially when executing complex and diverse AI models. Advanced 2.5D/3D packaging promises high bandwidth and connection density to overcome these challenges, yet it also introduces new electro-thermal constraints. This paper develops a suite of analytical performance models to enable efficient benchmarking of a 2.5D/3D heterogeneous system for energy-efficient AI computing. These models encompass various performance metrics related to computing units, network-on-chip, and network-on-package. The results are summarized into a new tool, HISIM, which is 104–106× faster than state-of-the-art AI benchmark tools. Furthermore, HISIM integrates rapid thermal simulation for the 2.5D/3D system, helping shed light on both the potential and limitations of 2.5D/3D heterogeneous integration on representative AI algorithms. The code of HISIM is available at https://github.com/mec-UMN/HISIM.
- 17 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 44  (8) , 3208-3221
HISIM: Analytical Performance Modeling and Design Space Exploration of 2.5D/3D Integration for AI Computing
Monolithic designs face significant fabrication cost and data movement challenges, especially when executing complex and diverse AI models. Advanced 2.5D/3D packaging promises high bandwidth and connection density to overcome these challenges, yet it also introduces new electro-thermal constraints. This paper develops a suite of analytical performance models to enable efficient benchmarking of a 2.5D/3D heterogeneous system for energy-efficient AI computing. These models encompass various performance metrics related to computing units, network-on-chip, and network-on-package. The results are summarized into a new tool, HISIM, which is 104–106× faster than state-of-the-art AI benchmark tools. Furthermore, HISIM integrates rapid thermal simulation for the 2.5D/3D system, helping shed light on both the potential and limitations of 2.5D/3D heterogeneous integration on representative AI algorithms. The code of HISIM is available at https://github.com/mec-UMN/HISIM.
- Open Access
Context-Aware Token Selection and Packing for Enhanced Vision Transformer
In recent years, the long-range attention mechanism of vision transformers has driven significant performance breakthroughs across various computer vision tasks. However, the traditional self-attention mechanism, which processes both informative and non-informative tokens, suffers from inefficiency and inaccuracies. While sparse attention mechanisms have been introduced to mitigate these issues by pruning tokens involved in attention, they often lack context-awareness and intelligence. These mechanisms frequently apply a uniform token selection strategy across different inputs for batch training or optimize efficiency only for the inference stage. To overcome these challenges, we propose a novel algorithm: Select and Pack Attention (SPA). SPA dynamically selects informative tokens using a low-cost gating layer supervised by selection labels and packs these tokens into new batches, enabling a variable number of tokens to be used in parallelized GPU batch training and inference. Extensive experiments across diverse datasets and computer vision tasks demonstrate that SPA delivers superior performance and efficiency, including a 0.6 mAP improvement in object detection and a 16.4% reduction in computational costs.
Open AccessContext-Aware Token Selection and Packing for Enhanced Vision Transformer
In recent years, the long-range attention mechanism of vision transformers has driven significant performance breakthroughs across various computer vision tasks. However, the traditional self-attention mechanism, which processes both informative and non-informative tokens, suffers from inefficiency and inaccuracies. While sparse attention mechanisms have been introduced to mitigate these issues by pruning tokens involved in attention, they often lack context-awareness and intelligence. These mechanisms frequently apply a uniform token selection strategy across different inputs for batch training or optimize efficiency only for the inference stage. To overcome these challenges, we propose a novel algorithm: Select and Pack Attention (SPA). SPA dynamically selects informative tokens using a low-cost gating layer supervised by selection labels and packs these tokens into new batches, enabling a variable number of tokens to be used in parallelized GPU batch training and inference. Extensive experiments across diverse datasets and computer vision tasks demonstrate that SPA delivers superior performance and efficiency, including a 0.6 mAP improvement in object detection and a 16.4% reduction in computational costs.
- Open Access
- 5 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Cooling the Chaos: Mitigating the Effect of Threshold Voltage Variation in Cryogenic CMOS Memories
Cryogenic CMOS is a promising technology for high performance computing due to its improvement in subthreshold slope, carrier mobilities and reduced wire resistance. The threshold voltage (Vth) increase at 77K can be mitigated by metal gate work function (PHIG) engineering to achieve matched off current (Ioff) further enhancing the device performance allowing us to operate at very low supply voltage thereby reducing the Energy Delay Product (EDP). However, the effect of variation on noise margins of static random access memories (SRAM) deploying these matched Ioff devices is very prominent especially at low supply voltages (Vdd) limiting its scaling. In this work, we propose a framework to perform Vth retargeting for cryogenic SRAM for improving noise margins in high performance cryogenic SRAM cells under variation. The proposed framework comprises of a Monte-Carlo engine which performs statistical analysis and DC characterization and a backend processing engine to analyze noise margins and tune the PHIG. To demonstrate the framework, we use calibrated 14nm FinFET models at 300K and 77K. First, we analyze the logic blocks using iso-Ioff devices, which yield up to 3x improvement in delay at iso-energy and a 4.5x reduction in energy at iso-delay. Next, we study the effect of Vth variation on the device currents. Finally, the framework is deployed to tune PHIG, and results show that it can enhance the noise margins by 23%, 31% and 19% for hold, read and write operations respectively at 77K compared to iso-Ioff devices. Further, a 1kb SRAM array has been simulated using iso-Ioff tuned peripherals and framework tuned SRAM cells, and it shows 5.4x reduction in read/write energies along with 1.2x delay reduction and better noise margins at 77K compared to 300K.
- 5 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessCooling the Chaos: Mitigating the Effect of Threshold Voltage Variation in Cryogenic CMOS Memories
Cryogenic CMOS is a promising technology for high performance computing due to its improvement in subthreshold slope, carrier mobilities and reduced wire resistance. The threshold voltage (Vth) increase at 77K can be mitigated by metal gate work function (PHIG) engineering to achieve matched off current (Ioff) further enhancing the device performance allowing us to operate at very low supply voltage thereby reducing the Energy Delay Product (EDP). However, the effect of variation on noise margins of static random access memories (SRAM) deploying these matched Ioff devices is very prominent especially at low supply voltages (Vdd) limiting its scaling. In this work, we propose a framework to perform Vth retargeting for cryogenic SRAM for improving noise margins in high performance cryogenic SRAM cells under variation. The proposed framework comprises of a Monte-Carlo engine which performs statistical analysis and DC characterization and a backend processing engine to analyze noise margins and tune the PHIG. To demonstrate the framework, we use calibrated 14nm FinFET models at 300K and 77K. First, we analyze the logic blocks using iso-Ioff devices, which yield up to 3x improvement in delay at iso-energy and a 4.5x reduction in energy at iso-delay. Next, we study the effect of Vth variation on the device currents. Finally, the framework is deployed to tune PHIG, and results show that it can enhance the noise margins by 23%, 31% and 19% for hold, read and write operations respectively at 77K compared to iso-Ioff devices. Further, a 1kb SRAM array has been simulated using iso-Ioff tuned peripherals and framework tuned SRAM cells, and it shows 5.4x reduction in read/write energies along with 1.2x delay reduction and better noise margins at 77K compared to 300K.