Skip to content

TD-dAJC: A 100 MS/s 2 pJ/Pixel Time-Domain Weight and Integrating-MAC-Based Direct Analog to MJPEG Compression for Video Sensor Nodes

Nov 2026 · IEEE Journal of Solid-State Circuits · Vol 61, pp. 6531-6546 · 0 citations · 34 references

Abstract

Always-on, high-quality video sensors are increasingly required in wearables, surveillance, and Internet-of-Things (IoT) devices, where stringent energy constraints make efficient in-sensor compression necessary. These systems must support high-definition (HD) and 4 K video, yet conventional digital video compression pipelines consume significant power because high-speed analog-to-digital converters (ADCs) must digitize every pixel, and digital signal processing incurs large switching and memory overhead. This makes compression a major energy bottleneck in edge cameras. This work enables analog-domain MJPEG compression using a time-domain processing technique that represents discrete cosine transform (DCT) and quantization coefficients as pulsewidth–encoded time weights and performs multiply–accumulate (MAC) and division operations through current integration. The architecture employs time weights generated by a 32-phase sub-sampling PLL-based pulse generator, enabling MAC computation directly on analog pixel values before digitization, reducing the ADC workload. Fabricated in 65-nm CMOS, the proposed time-domain direct-analog-to-MJPEG compression (TD-dAJC) circuit achieves 100 MS/s throughput, the fastest reported among MJPEG implementations, and supports real-time HD and 4 K compression. The architecture consumes ~2 pJ/pixel, achieving <inline-formula> <tex-math notation="LaTeX">$13\times $ </tex-math></inline-formula> lower energy than switched-capacitor (SC) analog compressors and <inline-formula> <tex-math notation="LaTeX">$25\times $ </tex-math></inline-formula> lower energy than digital MJPEG pipelines. Compared to state-of-the-art analog in-memory compute MJPEG engines, TD-dAJC achieves <inline-formula> <tex-math notation="LaTeX">$2.8\times $ </tex-math></inline-formula> better energy efficiency and <inline-formula> <tex-math notation="LaTeX">$25\times $ </tex-math></inline-formula> higher throughput.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

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…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.