Constructive Bounds on the Capacity of Parallel Asynchronous Skew-Free Channels With Glitches

Transmission across a bus modelled as a parallel asynchronous communication channel is subject to fault injection attacks which cause glitches - pulses that are added to the transmitted signal at arbitrary times - and delays. We present self-synchronizing coding schemes with no latency at the receiv...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 66; no. 7; pp. 4026 - 4037
Main Authors Engelberg, Shlomo, Keren, Osnat
Format Journal Article
LanguageEnglish
Published New York IEEE 01.07.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Asynchronous communication
Channels
Circuit faults
Clocks
Delays
Encoding
glitches
Lower bounds
parallel asynchronous communications
Random delays
Receivers
Synchronism
Wires
Online AccessGet full text
ISSN0018-9448
1557-9654
DOI10.1109/TIT.2019.2956540

Cover

More Information
Summary:Transmission across a bus modelled as a parallel asynchronous communication channel is subject to fault injection attacks which cause glitches - pulses that are added to the transmitted signal at arbitrary times - and delays. We present self-synchronizing coding schemes with no latency at the receiver that do not require any acknowledgment to be sent and that can decode the received signal even when the signal suffers from random delays and distortion by random glitches. We make use of the codes to produce lower bounds on the information capacity of such channels when the number of parallel channels is large.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2019.2956540