Joint Identification and Sensing for Discrete Memoryless Channels

In the identification (ID) scheme proposed by Ahlswede and Dueck, the receiver's goal is simply to verify whether a specific message of interest was sent. Unlike Shannon's transmission codes, which aim for message decoding, ID codes for a discrete memoryless channel (DMC) are far more efficient; their size grows doubly exponentially with the blocklength when randomized encoding is used. This indicates that when the receiver's objective does not require decoding, the ID paradigm is significantly more efficient than traditional Shannon transmission in terms of both energy consumption and hardware complexity. Further benefits of ID schemes can be realized by leveraging additional resources such as feedback. In this work, we address the problem of joint ID and channel state estimation over a DMC with independent and identically distributed (i.i.d.) state sequences. State estimation functions as the sensing mechanism of the model. Specifically, the sender transmits an ID message over the DMC while simultaneously estimating the channel state through strictly causal observations of the channel output. Importantly, the random channel state is unknown to both the sender and the receiver. For this system model, we present a complete characterization of the ID capacity-distortion function.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2024-12-27
DOI
https://doi.org/10.3390/e27010012
Citations
1
Primary Topic
Wireless Communication Security Techniques
Type
article
Field-Weighted Citation Impact
0.21

Funders

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

Joint Identification and Sensing for Discrete Memoryless Channels

Holger Boche, Christian Deppe, Wafa Labidi, Yaning Zhao
1 citations
Entropy
Wireless Communication Security Techniques
0.21
article

Joint Identification and Sensing for Discrete Memoryless Channels

Holger Boche, Christian Deppe, Wafa Labidi, Yaning Zhao
article en
1 citations

Abstract

In the identification (ID) scheme proposed by Ahlswede and Dueck, the receiver's goal is simply to verify whether a specific message of interest was sent. Unlike Shannon's transmission codes, which aim for message decoding, ID codes for a discrete memoryless channel (DMC) are far more efficient; their size grows doubly exponentially with the blocklength when randomized encoding is used. This indicates that when the receiver's objective does not require decoding, the ID paradigm is significantly more efficient than traditional Shannon transmission in terms of both energy consumption and hardware complexity. Further benefits of ID schemes can be realized by leveraging additional resources such as feedback. In this work, we address the problem of joint ID and channel state estimation over a DMC with independent and identically distributed (i.i.d.) state sequences. State estimation functions as the sensing mechanism of the model. Specifically, the sender transmits an ID message over the DMC while simultaneously estimating the channel state through strictly causal observations of the channel output. Importantly, the random channel state is unknown to both the sender and the receiver. For this system model, we present a complete characterization of the ID capacity-distortion function.

EntropyVol. 27(1)
Technical University of Munich (DE), Technische Universität Braunschweig (DE)
Deutsche Forschungsgemeinschaft, Bundesministerium für Bildung und Forschung
Affordable and clean energy
Openalex Percentile: Top 44%
Wireless Communication Security Techniques
0.21
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.