Variable Precision Computing for Real-Time Applications: An Low-Complexity Markov Arithmetic-Level Approach

With the emerging applications of communication networks, real-time response and low-latency processing have become critical requirements for new applications under the concept of the Tactile Internet. However, the inherent increase in computational complexity of algorithms poses significant challenges to achieve low-latency computing. In this paper, we introduce a newly designed arithmetic level variable precision computing (VPC) scheme, namely AL-VPC, which dynamically allocates varying levels of computing precision to each arithmetic operation in an algorithm. This approach aims to improve computational efficiency while minimizing accuracy degradation. The proposed scheme establishes a Markov process model to optimize the computing precision allocation, incorporates low-complexity calculations to limit additional overhead. Through numerical simulations across both computing and communication applications demonstrate that the proposed new design outperforms conventional fixed-length computing (FLC) scheme while maintaining the same level of computing precision.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/iccworkshops67674.2025.11162486
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variable Precision Computing for Real-Time Applications: An Low-Complexity Markov Arithmetic-Level Approach

Jindan Xu, Kaixuan Bao, Jiehao Miao, Wei Xu
Parallel Computing and Optimization Techniques
article

Variable Precision Computing for Real-Time Applications: An Low-Complexity Markov Arithmetic-Level Approach

Jindan Xu, Kaixuan Bao, Jiehao Miao, Wei Xu
article en

Abstract

With the emerging applications of communication networks, real-time response and low-latency processing have become critical requirements for new applications under the concept of the Tactile Internet. However, the inherent increase in computational complexity of algorithms poses significant challenges to achieve low-latency computing. In this paper, we introduce a newly designed arithmetic level variable precision computing (VPC) scheme, namely AL-VPC, which dynamically allocates varying levels of computing precision to each arithmetic operation in an algorithm. This approach aims to improve computational efficiency while minimizing accuracy degradation. The proposed scheme establishes a Markov process model to optimize the computing precision allocation, incorporates low-complexity calculations to limit additional overhead. Through numerical simulations across both computing and communication applications demonstrate that the proposed new design outperforms conventional fixed-length computing (FLC) scheme while maintaining the same level of computing precision.

Nanyang Technological University (SG), Southeast University (CN)
Openalex Percentile: Top 72%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Variable Precision Computing for Real-Time Applications: An Low-Complexity Markov Arithmetic-Level Approach — Jindan Xu, Kaixuan Bao, et al. · (2025) | TGRS Research Map | TGRS