Sep 2026· IEEE Transactions on Very Large Scale Integration (vlsi) Systems· Vol 34, pp. 2935-2948· 0 citations· 52 references
Abstract
Video large language models (VLLMs) enable powerful multimodal reasoning but face severe efficiency challenges on edge devices due to the massive computational and memory demands caused by lengthy video-token sequences. Existing methods struggle to efficiently compress spatiotemporally redundant tokens while minimizing DRAM access overhead during inference. In this work, we propose EVA, a co-designed algorithm–hardware framework for accelerating VLLMs. At the algorithm level, we introduce an efficient training-free token compression (ETC) method that combines greedy temporal segmentation (GTS) to adaptively partition frames by content similarity, with diversity spatiotemporal compression (DSC) to retain semantically rich tokens from both static and dynamic regions. The method is plug-and-play, requires no retraining, and employs sign similarity to enable hardware-friendly computing at scale. At the hardware level, we design a heterogeneous accelerator integrating a lightweight token compression engine (TCE), a computing-in-memory (CIM) engine for in situ execution of linear layers, and a reconfigurable digital attention engine with hardware-specialized attention computation and an interleaved pipeline dataflow. Across multiple models and video benchmarks, EVA preserves accuracy under aggressive token reduction and delivers substantial efficiency gains. Notably, on LLaVA-OneVision-7B, EVA compresses 90% of video tokens while maintaining 97.8% of the original accuracy. EVA achieves up to <inline-formula> <tex-math notation="LaTeX">$10.3\times $ </tex-math></inline-formula> speedup and <inline-formula> <tex-math notation="LaTeX">$47.4\times $ </tex-math></inline-formula> energy reduction compared to GPU, and achieves up to <inline-formula> <tex-math notation="LaTeX">$3.8\times $ </tex-math></inline-formula> speedup over prior specialized accelerators, demonstrating a practical path toward scalable VLLM inference on resource-constrained devices.
EdgeXpert is proposed, a software-hardware co-designed LLM accelerator that resolves this incompatibility and achieves up to 56.3% latency reduction and 44.1% energy reduction compared to prior works, while maintaining near-baseline accuracy.
Sangwoo Ha, Hyunwoo Seo, Yurim Jo et al.· 0 citations
This study establishes a clear lower bound and optimal trade-off points for context modeling in ATEM, provides critical insights into the redundancy of context module designs in video compression and establishes a new efficiency benchmark for future lightweight framework designs.
Chun Zhang, He-Ming Sun, J. Katto· APSIPA Transactions on Signa...· 0 citations
Faster Flash Decoding (FFD) is presented, a novel hardware-algorithm co-design framework designed to break the memory wall in long-context decoding and introduces the top-delta strategy, which dynamically filters blocks to achieve distribution-adaptive sparsity without global synchronization.
Zhigeng Liu, Zhiyuan Ning, Rui-Xiao Li et al.· 4 citations
DCSR-GCN, a high-performance GCN accelerator based on dynamic compression and sparsity reordering based on dynamic compression and sparsity reordering, is presented and a two-phase reordering algorithm that combines conflict-aware row scheduling with reuse-aware column grouping is proposed, thereby mitigating RAW confl...
Jun-Sheng Chang, Yi-Min Zhao, Yu-Xin Huang et al.· ACM Transactions on Design A...· 0 citations
This paper proposes a streamable, client-server NVC architecture featuring a novel Mixed Precision (FP16/FP32) strategy, and demonstrates that this approach successfully eliminates intra-generation fragmentation and substantially broadens cross-die interoperability, achieving seamless cross-generation decodability for...
Kasidis Arunruangsirilert, He-Ming Sun, J. Katto· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 21, 2026
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026