Theoretical Bound and Compensation for Residual Error Probability of GRAND-CRC-Based Functional Safety Communication

In modern Industrial Internet of Things (IIoT) ecosystems, functional safety protocols are increasingly utilized to transmit safety protocol data unit (SPDU). Integrating the universal guessing random additive noise decoding (GRAND) algorithm with cyclic redundancy check (CRC)-coded SPDU can minimize SPDU retransmissions. However, it introduces residual error probability (REP) degradation that requires careful consideration. Using the IEC 61784-3 Standard and CRC assumptions, we derive a closed-form REP evaluation formula specific to SPDU length and maximum error correction capability. Our analysis reveals that, under the worst industrial conditions and for an SPDU length of 128 bits, the REP performance degrades by approximately 2:2 × 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> times when the CRC signature length is 24 bits and up to one bit is guessing decoded. This degradation becomes more pronounced with increased error correction capability. To address this, we propose to compensate the REP degradation by adopting longer CRC signature. This paper provides a theoretical framework for adopting the GRAND algorithm in functional safety communication, setting a foundation for enhancing reliability in IIoT applications..

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-04-15
DOI
https://doi.org/10.1109/tcomm.2025.3560351
Citations
2
Primary Topic
Risk and Safety Analysis
Type
article
Field-Weighted Citation Impact
2.80

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Theoretical Bound and Compensation for Residual Error Probability of GRAND-CRC-Based Functional Safety Communication

Kan Yu, Ming Zhan, Qiang Zhou, Zhibo Pang et al.
2 citations
IEEE Transactions on Communications
Risk and Safety Analysis
2.80
article

Theoretical Bound and Compensation for Residual Error Probability of GRAND-CRC-Based Functional Safety Communication

Kan Yu, Ming Zhan, Qiang Zhou, Zhibo Pang, Jianwu Zhang, Shiqing Zhang, Fang Wu
article en
2 citations

Abstract

In modern Industrial Internet of Things (IIoT) ecosystems, functional safety protocols are increasingly utilized to transmit safety protocol data unit (SPDU). Integrating the universal guessing random additive noise decoding (GRAND) algorithm with cyclic redundancy check (CRC)-coded SPDU can minimize SPDU retransmissions. However, it introduces residual error probability (REP) degradation that requires careful consideration. Using the IEC 61784-3 Standard and CRC assumptions, we derive a closed-form REP evaluation formula specific to SPDU length and maximum error correction capability. Our analysis reveals that, under the worst industrial conditions and for an SPDU length of 128 bits, the REP performance degrades by approximately 2:2 × 10<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> times when the CRC signature length is 24 bits and up to one bit is guessing decoded. This degradation becomes more pronounced with increased error correction capability. To address this, we propose to compensate the REP degradation by adopting longer CRC signature. This paper provides a theoretical framework for adopting the GRAND algorithm in functional safety communication, setting a foundation for enhancing reliability in IIoT applications..

IEEE Transactions on CommunicationsVol. 73(10)
Southwest University (CN), La Trobe University (AU), ABB (Sweden) (SE), Hangzhou Dianzi University (CN), Taizhou University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 9%
Risk and Safety Analysis
2.80
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.