Skip to content
#edge computing Open access

Ultra-low-power probabilistic graphical computing based on memristors enabling communications signal processing

Sep 2026 · Nature Communications · Vol 17 · 0 citations · 70 references
Medicine

TL;DR

A probabilistic graphical computing paradigm based on memristors is reported, which not only unifies the framework of Bayesian inference-based baseband signal processing algorithms, but also achieves a substantial improvement in energy efficiency via memristor-based in-memory computing.

Abstract

Improving the energy efficiency of baseband processors has become a critical challenge in mobile communications, especially for energy-constrained edge devices. Applications in conventional baseband signal processors usually adopt independently optimized algorithmic architectures and primarily rely on digital systems, whose energy efficiency is fundamentally limited by frequent data movement and computationally intensive dynamic operations. To overcome the fundamental energy-scaling bottleneck in modern signal processing, here we report a probabilistic graphical computing paradigm based on memristors, which not only unifies the framework of Bayesian inference-based baseband signal processing algorithms, but also achieves a substantial improvement in energy efficiency via memristor-based in-memory computing. Results demonstrate that the proposed approach achieves energy consumption below 10 pJ per bit and up to an 11.4-fold improvement in energy efficiency over conventional implementations, while maintaining error rates below 1×10−4 in the representative application. These results provide a flexible, noise-resilient route to ultra-low-power signal processing in edge devices. To address the energy bottleneck in modern mobile communications, Jiang et al. introduce a memristor-based framework unifying key wireless signal-processing tasks. It achieves sub-10 pJ/bit consumption and an 11.4-fold efficiency gain while maintaining low error rates for edge communications.

Read PDF

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.