Skip to content

Ternary-Valued Finite-Difference Time-Domain Method: Equiva-lence with the Yee Scheme Through Noise-Shaped Quantisation

Aug 2026 · 0 citations · 7 references
Physics

TL;DR

It is demonstrated that finite-difference time-domain dynamics can be reproduced with field variables restricted to the ternary alphabet, and its extension to acoustics, Virieux-type elastodynamics and Schrodinger-equation solvers points to a broader class of quantised physics solvers for resource-constrained and specialised hardware.

Abstract

Motivated by the rapid development of quantised large language models, which substantially reduce computational cost and enable efficient artificial intelligence on resource-constrained and consumer hardware, I demonstrate that finite-difference time-domain (FDTD) dynamics can be reproduced with field variables restricted to the ternary alphabet ${-1,0,+1}$. The resulting update requires no run-time multiplication or floating-point arithmetic and represents each field component with just $\log_2 3\simeq1.58$ bits. A true state accumulator performs the integration, while a second-order noise-shaped encoder with an independent error register performs the quantisation. The Courant number S serves simultaneously as an exact fixed-point ratio and as the encoder's oversampling ratio. Ternary FDTD converges to the standard Yee scheme in the small-S limit while substantially reducing state storage and arithmetic complexity. Its extension to acoustics, Virieux-type elastodynamics and Schrodinger-equation solvers points to a broader class of quantised physics solvers for resource-constrained and specialised hardware.

View source

Similar papers

Book Open access Aug 2026

MITRA: Reconfigurable, Low-Latency, and Power-Efficient In-Memory Stochastic Architecture for Transcendental Functions

This work introduces MITRA, a reconfigurable magnetic tunnel junction-based in-memory architecture that leverages stochastic computing (SC) to implement a broad class of transcendental and nonlinear functions directly within memory.

Farzad Razi, M. Moghadam, M. Najafi et al. · 0 citations
Preprint Aug 2026

Memory AMP: Overflow Avoidance, Complexity Reduction, and Comparative Analysis

A general gradient-based formulation for designing MAMP algorithms is developed and it is shown that the computation of the orthogonalization parameters in this formulation can suffer from catastrophic cancellation, which explains the finite-precision instability of WS-CG-VAMP.

Shunqi Huang, Lei Liu, B. Kurkoski · 0 citations
Review Aug 2026

Transforms for LLM Quantization: The Great Inversion and Format Co-Design

This work identifies and formalizes the principle that organizes the Great Inversion, the Great Inversion: allocation-flexible coding rewards energy concentration, whereas the grouped shared-scale quantization a deployed matrix instruction performs rewards within-group flattening.

Ehsan Jokar · 0 citations
Preprint Aug 2026

AudioTQ: A Data-Oblivious 6-Bit CPU Audio Codec via Randomized Hadamard Rotation and Lloyd-Max Quantization

This paper presents the design and mathematical formulation of AudioTQ, a data-oblivious lossy audio codec that operates directly in the time domain and details the bitwise reconstruction of 24-bit studio stems, analyze the butterfly network of the FWHT, derive the mathematical failure modes under sparse inputs, and pr...

Sahil Gangurde · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

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 Oct 15, 2026

Proof-based general-purpose computing with Magnetar

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.

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