A FRAME SYNCHRONIZATION METHOD BASED ON TUPLES OF PAIRWISE DISTINCT ELEMENTS

E. Faure, M. Makhynko, A. Shcherba, D. Faure, B. Stupka

Èlektron. model. 2023, 45(6):41-64

https://doi.org/10.15407/emodel.45.06.041

ABSTRACT

The further development of the frame synchronization method is presented, which uses as a synchronization word the permutation of the elements of the set of integers of the segment [0; M - 1], was further developed. It is proposed to use a tuple of M-η pairwise distinct elements of the set of integers of the segment [0; M - 1] as a syncword. The elements of this set are encoded with a fixed-length binary code and the minimum binary Hamming distance between the syncword and all its circular shifts is the maximum. The paper established that the maximum value of the minimum Hamming distance for tuples of 15 pairwise distinct elements of the set of integers for M = 16 is equal to 30. A comparative assessment of the frame synchronization effectiveness was performed based on tuples of 15 elements, as well as on permutations of length 16 and 8. A computer simulation model of the frame synchronization system in a binary symmetric communication channel was built. Synchronization indicators were determined with parameters calculated for bit error probability 0,4 and 0,495, as well as requirements for a minimum probability of correct synchronization of 0,9997 and a maximum probability of false synchronization of 3E-4. The effectiveness of using tuples of pairwise distinct elements in frame synchronization systems has been confirmed. The efficiency indicator depends on communication channel bit error probability.

KEYWORDS

frame synchronization, frame structure, short packet, intense noise, transmission reliability.

REFERENCES

  1. (2018). IEEE Standard for Ethernet (IEEE Std 802.3-2018 Revis.). Pp. 1-5600. https://doi.org/10.1109/IEEESTD.2018.8457469
  2. Peterson, L.L. (2022). Computer Networks (6th ed.). L. L. Peterson, B. S. Davie. Morgan Kaufmann, Elsevier. https://doi.org/10.1016/C2018-0-01477-2
  3. Adamy, D. (2014). Practical Communication Theory (2nd ed.). Institution of Engineering and Technology. https://doi.org/10.1049/SBEW516E
  4. Cheng, C.-H., & Tsui, J. (2021). An Introduction to Electronic Warfare; From the First Jamming to Machine Learning Techniques. River Publishers. https://doi.org/10.1201/9781003337171
  5. Bloessl, B., & Dressler, F. (2018). mSync: Physical Layer Frame Synchronization without Preamble Symbols. IEEE Transactions on Mobile Computing, 17(10), 2321-2333. https://doi.org/10.1109/TMC.2018.2808968
  6. Faure, E.V. (2016). Factorial coding with data recovery. Bulletin of Cherkasy State Technological University, 1(2), 33-39. https://doi.org/10.24025/2306–4412.2.2016.82932
  7. Al-Aazzeh, J., Ayyoub, B., Faure, E., et al. (2020). Telecommunication systems with multiple access based on data factorial coding. International Journal on Communications Antenna and Propagation, 10(2), 102-113. https://doi.org/10.15866/irecap.v10i2.17216
  8. Mahmood, N.H., Böcker, S., Moerman, I., et al. (2021). Machine type communications: key drivers and enablers towards the 6G era. EURASIP Journal on Wireless Communications and Networking, 1, 134. https://doi.org/10.1186/s13638-021-02010-5
  9. Durisi, D., Liva, G., Polyanskiy, Y., et al. (2022). Short-Packet Transmission. In I. Marić, S. Shamai (Shitz), & O. Simeone (Eds.), Information Theoretic Perspectives on 5G Systems and Beyond. Cambridge University Press.
  10. Xie, J., Chang, Z., Guo, X., & Hamalainen, T. (2023). Energy Efficient Resource Allocation for Wireless Powered UAV Wireless Communication System with Short Packet. IEEE Transactions on Green Communications and Networking, 7(1), 101-113. https://doi.org/10.1109/TGCN.2022.3218314
  11. Yang, Y., & Hanzo, L. (2023). Permutation-Based Short-Packet Transmissions Improve Secure URLLCs in the Internet of Things. IEEE Internet of Things Journal, 10(12), 11024-11037. https://doi.org/10.1109/JIOT.2023.3243038
  12. Schneier, B. (1996). Applied cryptography: protocols, algorithms, and source code in C. Wiley.
  13. Shcherba, A., Faure, E., & Lavdanska, O. (2020). Three-Pass Cryptographic Protocol Based on Permutations. In 2020 IEEE 2nd International Conference on Advanced Trends in Information Theory (ATIT), Kyiv, Ukraine. IEEE, pp. 281-284. https://doi.org/10.1109/ATIT50783.2020.9349343
  14. Faure, E., Shcherba, A., Makhynko, M., et al. (2023). Concept for Using Permutation-Based Three-Pass Cryptographic Protocol in Noisy Channels. In Systems, Decision and Control in Energy V. Springer International Publishing. https://doi.org/10.1007/978-3-031-35088-7_7
  15. Al-Azzeh, J., Faure, E., Shcherba, A., Stupka, B. (2022). Permutation-based frame synchronization method for data transmission systems with short packets. Egyptian Informatics Journal, 23(3), 529–545. https://doi.org/10.1016/j.eij.2022.05.005
  16. Faure, E.V., Shvydkyi, V.V., Shcherba, A.I., et al. (2020). Method of Cyclic Synchronization Based on Permutations. Bulletin of Cherkasy State Technological University, 4, 67-76. https://doi.org/10.24025/2306-4412.4.2020.222439
  17. Knuth, D.E. (2008). The Art of Computer Programming: Introduction to combinatorial algorithms and Boolean functions. Addison-Wesley.
  18. Schmidt, K.-U. (2016). Sequences with small correlation. Designs, Codes and Cryptography, 78(1), 237-267. https://doi.org/10.1007/s10623-015-0154-7
  19. Faure, E., Shcherba, A., Stupka, B., et al. (2021). Permutation-Based Frame Synchronisation Method for Short Packet Communication Systems. In 2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), Cracow, Poland. IEEE, pp. 1073-1077. https://doi.org/10.1109/IDAACS53288.2021.9660996
  20. Waggener, W.N. (1995). Pulse code modulation techniques: with applications in communications and data recording. Van Nostrand Reinhold.
  21. Al-Aazzeh, J., Faure, E., Makhynko, M., et al. (2023). Efficiency Assessment of the Permutation-Based Frame Synchronization Method. International Journal on Communications Antenna and Propagation, 13(4).
  22. Heap, B.R. (1963). Permutations by Interchanges. The Computer Journal, 6(3), 293-294. https://doi.org/10.1093/comjnl/6.3.293
  23. Bodner, J. (2021). Learning Go: an idiomatic approach to real-world Go programming. O’Reilly.

Full text: PDF