Search arXiv⌕ Search

arXiv · 2610.36348

Thermodynamic characterization of message-passing: Framework and initial study

Abstract

We study the thermodynamic efficiency of message-passing decoders using the mismatch cost framework. This framework quantifies the excess entropy generated when a system operates away from the thermodynamically optimal initial distribution. It provides a computable lower bound on irrecoverable energy loss. The decoder is modeled as a main decoding program with local message updates implemented as subroutines. Memory is treated as an external copying subsystem whose thermodynamic cost is excluded. Studying the $[7,4]$ Hamming code transmitted over a binary erasure channel, we show how the channel-induced initialization statistics and the step-wise evolution of the algorithmic state distribution during decoding determine the total mismatch cost. We further show that different thermodynamically optimal state distributions, representing different underlying physical implementations of the decoder, can produce different thermodynamic costs for identical decoding dynamics. Conditioning the input distribution on correctable and non-correctable erasure patterns further reveals distinct thermodynamic signatures. These results demonstrate that thermodynamic cost is jointly governed by decoding dynamics, input statistics, and hardware characteristics. This points to opportunities for thermodynamically-informed decoder design to realize energy-efficient physical implementations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kalana G. Abeywardena, Stark C. Draper. 2026-10-26. Thermodynamic characterization of message-passing: Framework and initial study. https://doi.org/10.1109/jsait.2026.3722113

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Pinching Antenna and Relay Assisted Joint Indoor Outdoor NOMA Communications with SWIPT

This paper presents a unified downlink architec- ture for serving indoor and outdoor users from a shared multi-antenna rooftop base station (BS). To overcome severe building-penetration loss, the BS transfers information and radio- frequency (RF) energy to an indoor access point (AP) using simultaneous wireless information and power transfer (SWIPT). The AP harvests this energy and performs amplify-and-forward (AF) relaying, enabling self-sustained indoor communication. A movable waveguide-mounted pinching antenna (PA) further improves indoor coverage by adapting its position to the prop- agation environment. For outdoor transmission, zero-forcing (ZF) beamforming suppresses inter-group interference, while power-domain non-orthogonal multiple access (NOMA) supports multiple users within each group. We maximize the outdoor weighted sum rate (WSR) while satisfying stringent indoor and outdoor quality-of-service (QoS) requirements. The resulting nonconvex problem jointly optimizes the BS power fraction, SWIPT power-splitting ratio, PA position, and NOMA power allocation. To obtain an efficient solution, we develop a two-stage method based on alternating optimization (AO) and sequential quadratic programming (SQP). Numerical results show that the proposed architecture improves outdoor spectral efficiency while maintaining reliable, energy-sustainable indoor coverage. Increasing the BS array size further raises the indoor QoS- satisfaction probability toward unity, even under demanding rate targets.

cs.IT↗

Local Differential Privacy for Molecular Communication Networks

Molecular communication (MC) enables information exchange in nanoscale sensor networks operating in biological environments, yet privacy remains largely unaddressed. We integrate local differential privacy (LDP) into diffusion-based MC by privatizing each user's measurement at the transmitter and conveying the resulting randomized report over the MC channel. To our knowledge, this is the first systematic LDP implementation for diffusion-based MC, enabling privacy-preserving aggregate data analysis for in-body health monitoring and other population-scale sensing applications. We benchmark major LDP mechanisms under a realistic channel model. Simulation results show that Optimized Local Hashing (OLH) achieves the lowest average $\ell_1$ distribution-estimation error under the MC channel when channel resources are sufficient and the number of possible user values (alphabet size) $k$ is moderate to large, whereas k-ary Randomized Response (KRR) and, for privacy budget $ε=1$, Binary Local Hashing (BLH), which have shorter reports, are more robust as the MC transmission quality deteriorates. We further propose RLIM-LDP, which combines run-length-limited ISI-mitigation (RLIM) coding with LDP coding. Extensive simulation results demonstrate that RLIM-LDP improves end-to-end reliability and reduces the final distribution-estimation error when time and molecule resources are limited.

cs.IT↗

Hierarchical Joint Source-Channel Coding with Constrained Information Leakage

This paper studies the hierarchical joint source-channel coding with information leakage constraint in the first-phase reconstruction and distortion constraints. The receiver's access to the data varies and is evaluated by the quality of the side information. Due to the consideration of channel capacity limitation or the efficiency of the system performance, the encoder may send some additional information in Phase 1 that can only be decoded in Phase 2 with higher-quality side information. While this can optimize the overall performance, the additional information causes excessive information leakage. We provide general inner and outer bounds for the conditions such that a given distortion-leakage pair $(D_1,D_2,L)$ is achievable, together with a capacity-achieving condition.

cs.IT↗