Deterministic Identification Over Fading Channels

Deterministic identification (DI) is addressed for Gaussian channels with fast and slow fading, where channel side information is available at the decoder. In particular, it is established that the number of messages scales as $2^{n\log(n)R}$, where $n$ is the block length and $R$ is the coding rate. Lower and upper bounds on the DI capacity are developed in this scale for fast and slow fading. Consequently, the DI capacity is infinite in the exponential scale and zero in the double-exponential scale, regardless of the channel noise.

[1]  Vincent K. N. Lau,et al.  Optimal Transmission and Limited Feedback Design for OFDM/MIMO Systems in Frequency Selective Block Fading Channels , 2007, IEEE Transactions on Wireless Communications.

[2]  R. Ahlswede Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[3]  Gérard D. Cohen,et al.  Private Interrogation of Devices via Identification Codes , 2009, INDOCRYPT.

[4]  Shlomo Shamai,et al.  Information theoretic considerations for cellular mobile radio , 1994 .

[5]  Neri Merhav,et al.  Identification in the presence of side information with application to watermarking , 2001, IEEE Trans. Inf. Theory.

[6]  Holger Boche,et al.  Robust and secure identification , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[7]  Mu Li,et al.  Impact of Correlated Fading Channels on Cognitive Relay Networks With Generalized Relay Selection , 2018, IEEE Access.

[8]  Kaoru Kurosawa,et al.  Strongly universal hashing and identification codes via channels , 1999, IEEE Trans. Inf. Theory.

[9]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[10]  Amir Salman Avestimehr,et al.  Capacity Results for Binary Fading Interference Channels With Delayed CSIT , 2013, IEEE Transactions on Information Theory.

[11]  Marat V. Burnashev,et al.  On identification capacity of infinite alphabets or continuous-time channels , 2000, IEEE Trans. Inf. Theory.

[12]  Sergio Verdú,et al.  Explicit construction of optimal constant-weight codes for identification via channels , 1993, IEEE Trans. Inf. Theory.

[13]  Christian Deppe,et al.  Performance Analysis of Identification Codes , 2020, Entropy.

[14]  Xuezhi Yang,et al.  Capacity of Fading Channels without Channel Side Information , 2019, ArXiv.

[15]  Xi Tian,et al.  Wireless body sensor networks based on metamaterial textiles , 2019, Nature Electronics.

[16]  Yang Lu,et al.  Industry 4.0: A survey on technologies, applications and open research issues , 2017, J. Ind. Inf. Integr..

[17]  Miguel R. D. Rodrigues,et al.  Secrecy Capacity of Wireless Channels , 2006, 2006 IEEE International Symposium on Information Theory.

[18]  Bo Ai,et al.  On the Influence of Scattering From Traffic Signs in Vehicle-to-X Communications , 2016, IEEE Transactions on Vehicular Technology.

[19]  Wade Trappe,et al.  Achieving Secret Communication for Fast Rayleigh Fading Channels , 2010, IEEE Transactions on Wireless Communications.

[20]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[21]  Andrew W. Eckford,et al.  A Comprehensive Survey of Recent Advancements in Molecular Communication , 2014, IEEE Communications Surveys & Tutorials.

[22]  R. Schober,et al.  Integration of Molecular Communications into Future Generation Wireless Networks , 2019 .

[23]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[24]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[25]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[26]  C. Gurau Integrated online marketing communication: implementation and management , 2008 .

[27]  Rudolf Ahlswede,et al.  Identification without randomization , 1999, IEEE Trans. Inf. Theory.

[28]  Rudolf Ahlswede,et al.  Watermarking Identification Codes with Related Topics on Common Randomness , 2006, GTIT-C.

[29]  Holger Boche,et al.  Secure Identification for Gaussian Channels , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[30]  Claude E. Shannon,et al.  The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.

[31]  Amor Nafkha,et al.  Closed-Form Expressions of Ergodic Capacity and MMSE Achievable Sum Rate for MIMO Jacobi and Rayleigh Fading Channels , 2020, IEEE Access.

[32]  Henry Cohn,et al.  Order and disorder in energy minimization , 2010, 1003.3053.

[33]  Holger Boche,et al.  Deterministic Identification Over Channels With Power Constraints , 2020, ICC 2021 - IEEE International Conference on Communications.

[34]  Eduard A. Jorswieck,et al.  Bounds on the Ergodic Secret-Key Capacity for Dependent Fading Channels , 2020, WSA.

[35]  Sarita V. Adve,et al.  Parallel programming must be deterministic by default , 2009 .

[36]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[37]  A. Vasilakos,et al.  Molecular Communication and Networking: Opportunities and Challenges , 2012, IEEE Transactions on NanoBioscience.

[38]  Shlomo Shamai,et al.  Fading Channels: Information-Theoretic and Communication Aspects , 1998, IEEE Trans. Inf. Theory.

[39]  Deniz Gündüz,et al.  Federated Learning Over Wireless Fading Channels , 2019, IEEE Transactions on Wireless Communications.

[40]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[41]  Robert W. Heath,et al.  Millimeter-Wave Vehicular Communication to Support Massive Automotive Sensing , 2016, IEEE Communications Magazine.

[42]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[43]  Pierre Moulin,et al.  The role of information theory in watermarking and its application to image watermarking , 2001, Signal Process..

[44]  Davide Brunelli,et al.  Wireless Sensor Networks , 2012, Lecture Notes in Computer Science.

[45]  W. Marsden I and J , 2012 .

[46]  Sergio Verdú,et al.  New results in the theory of identification via channels , 1992, IEEE Trans. Inf. Theory.

[47]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.

[48]  H. Vincent Poor,et al.  On the Computability of the Secret Key Capacity under Rate Constraints , 2019, ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[49]  Harish Viswanathan,et al.  Wide-area Wireless Communication Challenges for the Internet of Things , 2015, IEEE Communications Magazine.

[50]  Joseph Ja Ja,et al.  Identification is easier than decoding , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[51]  Giuseppe Piro,et al.  Defining Communication at the Bottom , 2015, IEEE Transactions on Molecular, Biological and Multi-Scale Communications.

[52]  Andreas J. Winter Quantum and classical message identification via quantum channels , 2005, Quantum Inf. Comput..

[53]  Thomas C. Hales Sphere packings, I , 1997, Discret. Comput. Geom..

[54]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[55]  Amos Lapidoth,et al.  Identification via the broadcast channel , 2016, 2014 IEEE International Symposium on Information Theory.

[56]  Y. Koucheryavy,et al.  The internet of Bio-Nano things , 2015, IEEE Communications Magazine.

[57]  Gérard D. Cohen,et al.  Identification codes in cryptographic protocols , 2010, 2010 IEEE Information Theory Workshop.

[58]  Falko Dressler,et al.  Connecting in-body nano communication with body area networks: Challenges and opportunities of the Internet of Nano Things , 2015, Nano Commun. Networks.

[59]  Raouia Masmoudi Ergodic capacity for fading channels in cognitive radio networks , 2018, 2018 4th International Conference on Advanced Technologies for Signal and Image Processing (ATSIP).

[60]  Halim Yanikomeroglu,et al.  Space–Time Signal Design for Multilevel Polar Coding in Slow Fading Broadcast Channels , 2019, IEEE Transactions on Communications.

[61]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[62]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[63]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[64]  Alan Charlesworth,et al.  Online Marketing: A Customer-Led Approach , 2007 .

[65]  Shuguang Cui,et al.  On Ergodic Sum Capacity of Fading Cognitive Multiple-Access and Broadcast Channels , 2008, IEEE Transactions on Information Theory.

[66]  Kai Niu,et al.  Polar Codes for Fast Fading Channel: Design Based on Polar Spectrum , 2020, IEEE Transactions on Vehicular Technology.

[67]  Oliver Kosut,et al.  Capacity of Gaussian Arbitrarily-Varying Fading Channels , 2019, 2019 53rd Annual Conference on Information Sciences and Systems (CISS).

[68]  Rudolf Ahlswede,et al.  Identification in the presence of feedback-A discovery of new capacity formulas , 1989, IEEE Trans. Inf. Theory.

[69]  Holger Boche,et al.  Secure Identification for Wiretap Channels; Robustness, Super-Additivity and Continuity , 2018, IEEE Transactions on Information Forensics and Security.

[70]  Rudolf Ahlswede,et al.  Identification via channels , 1989, IEEE Trans. Inf. Theory.

[71]  R. L. Goodstein Transfinite Ordinals in Recursive Number Theory , 1947, J. Symb. Log..