Increasing Transmission Reliability for Telemetry Systems Using Telegram Splitting

This paper analyzes the reliability and throughput of the telegram-splitting concept in the presence of inter-system and intra-system interference. Using telegram splitting, the data of one telegram is split into multiple sub-packets, which are then transmitted with temporal spacing. As a result, collisions with other telegrams destroy only some sub-packets that can be recovered using forward error correction. Consequently, the reliability of the data transmission in case of inter- and intra-system interference - a significant problem in license-exempt bands - is highly improved. In this paper, probabilities for the resulting telegram error rate of random media access systems using telegram splitting are derived. Furthermore, the achievable throughput is analyzed. The theoretical considerations in addition to simulation results prove the significant gain of the telegram-splitting concept for telemetry systems.

[1]  R. Gallager Information Theory and Reliable Communication , 1968 .

[2]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[3]  J.Y.N. Hui Multiple accessing for the collision channel without feedback , 1984 .

[4]  James S. Lehnert,et al.  Packet throughput in slotted ALOHA DS/SSMA radio systems with random signature sequences , 1992, IEEE Trans. Commun..

[5]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[6]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[7]  Norman Abramson,et al.  The Throughput of Packet Broadcasting Channels , 1977, IEEE Trans. Commun..

[8]  George Thomas Capacity of the wireless packet collision channel without feedback , 2000, IEEE Trans. Inf. Theory.

[9]  Norman Abramson,et al.  The ALOHA System-Another Alternative for Computer Communications , 1899 .

[10]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[11]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[12]  Dariush Divsalar,et al.  Code Performance as a Function of Block Size , 1998 .

[13]  Albert Heuberger,et al.  Improved Coverage for Low-Power Telemetry Systems using Telegram Splitting , 2013 .

[14]  L. Goddard Information Theory , 1962, Nature.

[15]  Aarnout Brombacher,et al.  Probability... , 2009, Qual. Reliab. Eng. Int..

[16]  O. Collins,et al.  A comparison of known codes, random codes, and the best codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).