On the Need of Analog Signals and Systems for Digital-Twin Representations

We consider the task of converting different digital descriptions of analog bandlimited signals and systems into each other, with a rigorous application of mathematical computability theory. Albeit very fundamental, the problem ap-pears in the scope of digital twinning , an emerging concept in the field of digital processing of analog information that is regularly mentioned as one of the key enablers for next-generation cyber-physical systems and their areas of application. In this context, we prove that essential quantities such as the peak-to-average power ratio and the bounded-input/bounded-output norm, which determine the behavior of the real-world analog system, cannot generally be determined from the system’s digital twin, depending on which of the above-mentioned descriptions is chosen. As a main result, we characterize the algorithmic strength of Shannon’s sampling type representation as digital twin implementation and also introduce a new digital twin implementation of analog signals and systems. We show there exist two digital descriptions, both of which uniquely characterize a certain analog system, such that one description can be algorithmically converted into the other, but not vice versa.

[1]  Rahuman S. Malik-Sheriff,et al.  Building digital twins of the human immune system: toward a roadmap , 2022, npj Digital Medicine.

[2]  G. Fettweis,et al.  On 6G and trustworthiness , 2022, Commun. ACM.

[3]  H. Boche,et al.  On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals , 2022, IEEE Transactions on Information Theory.

[4]  Hanshu Hong,et al.  NetGraph: An Intelligent Operated Digital Twin Platform for Data Center Networks , 2021, NAI@SIGCOMM.

[5]  A. Turing On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[6]  Holger Boche,et al.  Effective Approximation of Bandlimited Signals and Their Samples , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[7]  Holger Boche,et al.  Optimal Sampling Rate and Bandwidth of Bandlimited Signals—an Algorithmic Perspective , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[8]  Holger Boche,et al.  Computability of the Peak Value of Bandlimited Signals , 2020, ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[9]  Holger Boche,et al.  Turing Computability of Fourier Transforms of Bandlimited and Discrete Signals , 2020, IEEE Transactions on Signal Processing.

[10]  Daniela Fogli,et al.  A Survey on Digital Twin: Definitions, Characteristics, Applications, and Design Implications , 2019, IEEE Access.

[11]  He Zhang,et al.  Digital Twin in Industry: State-of-the-Art , 2019, IEEE Transactions on Industrial Informatics.

[12]  Holger Boche,et al.  PAPR Problem for Walsh Systems and Related Problems , 2018, IEEE Transactions on Information Theory.

[13]  Gerd Folkers,et al.  On computable numbers , 2016 .

[14]  David Francis Walnut,et al.  Sampling and Reconstruction of Operators , 2015, IEEE Transactions on Information Theory.

[15]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[16]  Holger Boche,et al.  The PAPR Problem in OFDM Transmission: New Directions for a Long-Lasting Problem , 2012, IEEE Signal Processing Magazine.

[17]  Jeremy Avigad,et al.  Computability and analysis: the legacy of Alan Turing , 2012, Turing's Legacy.

[18]  Simon Litsyn,et al.  Discrete and continuous maxima in multicarrier communication , 2005, IEEE Transactions on Information Theory.

[19]  K. Paterson,et al.  On the existence and construction of good codes with low peak-to-average power ratios , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[20]  Yurii Lyubarskii,et al.  Lectures on entire functions , 1996 .

[21]  Gilbert G. Walter,et al.  A sampling theorem for wavelet subspaces , 1992, IEEE Trans. Inf. Theory.

[22]  R. Soare Recursively enumerable sets and degrees , 1987 .

[23]  K. E. Grue,et al.  Optimal reconstruction of bandlimited bounded signals , 1985, IEEE Trans. Inf. Theory.

[24]  Ernst Pfaffelhuber,et al.  Sampling series for band-limited generalized functions , 1971, IEEE Trans. Inf. Theory.

[25]  Ernst Specker,et al.  Nicht konstruktiv beweisbare Sätze der Analysis , 1949, Journal of Symbolic Logic.

[26]  Alan M. Turing,et al.  Computability and λ-definability , 1937, Journal of Symbolic Logic.

[27]  S. Kleene General recursive functions of natural numbers , 1936 .

[28]  Holger Boche,et al.  Computable Time Concentration of Bandlimited Signals and Systems , 2021, IEEE Transactions on Signal Processing.

[29]  Holger Boche,et al.  Turing Meets Shannon: Computable Sampling Type Reconstruction With Error Control , 2020, IEEE Transactions on Signal Processing.

[30]  Rod Downey,et al.  Turing's legacy: developments from Turing's ideas in logic , 2014, Turing's Legacy.

[31]  S. Barry Cooper,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction , 2013 .

[32]  A. J. Lee,et al.  SAMPLING THEOREMS FOR NONSTATIONARY RANDOM PROCESSES , 2010 .

[33]  E. Axelsson Computability and Logic , 2008 .

[34]  Muhammad K. Habib,et al.  Digital representations of operators on band-limited random signals , 2001, IEEE Trans. Inf. Theory.

[35]  J. R. Higgins Sampling theory in Fourier and signal analysis : foundations , 1996 .

[36]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[37]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[38]  Stamatis Cambanis,et al.  Finite sampling approximations for non-band-limited signals , 1982, IEEE Trans. Inf. Theory.