E.V. Faure, B.A. Stupka

Èlektron. model. 2022, 44(6):21-34



This paper aims at implementing the principles of establishing frame synchronism for non-separable factorial codes, as well as applying the operation of interleaving fragments received from the communication channel to increase the efficiency of finding permutation boundaries. We apply the algorithm for establishing frame synchronism with parameters defined for the upper limit of the communication channel bit error probability P0_max = 0,495 for environments with a bit error probability P≤ 0,495. The parameters of the algorithm for establishing frame synchronism with the upper limit of the communication channel bit error probability P0_max = 0,4 are determined. The efficiency of using the interleaving operation of fragments received from the communication channel is evaluated. The efficiency of implementing algorithms for establishing frame synchronism with parameters determined for the upper limit of the communication channel bit error probability P0_max ≤ 0,495 and P0_max = 0,4 is compared, for environments with a bit error probability P≤ 0,4. We give recommendations for selecting the synchronization algorithm parameters for communication channels where the bit error probability upper limit P≤ 0,4 is known, and for channels where this value is variable. These recommendations can be used to improve the efficiency of algorithms for establishing frame synchronism when designing telecommunication systems with non-separable data factorial coding in conditions of natural or artificially created high-level communication channel noise.


factorial coding, frame synchronization, permutation, syncword, high-level noise.


  1. Faure, E.V. (2016), “Factorial coding with data recovery”, Visnyk Cherkaskoho derzhavnoho tekhnolohichnoho universytetu, Vol. 1, no. 2, pp. 33–39, DOI: 10.24025/2306–4412.2. 2016.82932.
  2. Faure, E.V. (2017), “Factorial coding with error correction”, Radio Electronics, Computer Science, Control, Vol. 3, pp. 130–138, DOI: https://doi.org/10.15588/1607-3274-2017-3-15.
  3. Faure, E.V., Shcherba, A.I. and Kharin, A.A. (2018), “Factorial code with a given number of inversions”, Radio Electronics, Computer Science, Control, Vol. 2, pp. 143–153, DOI: 10.15588/ 1607–3274–2018–2–16.
  4. Al-Aazzeh, J., Ayyoub, B., Faure, E., Shvydkyi, V., Kharin, O. and Lavdanskyi, A. (2020), “Telecommunication systems with multiple access based on data factorial coding’, International Journal on Communications Antenna and Propagation, Vol. 10, no. 2, pp. 102–113, DOI: 
  5. Ling, F. (2017), Synchronization in digital communication systems, Cambridge University Press, NY, USA.
  6. Bloessl, B. and Dressler, F. (2018), “mSync: Physical Layer Frame Synchronization without Preamble Symbols”, IEEE Transactions on Mobile Computing, October 2018, Vol. 17, no. 10, pp. 2321–2333, DOI:
  7. Nguyen, A.T.P., Guilloud, F. and Le Bidan, R. (2020), “On the optimization of resources for short frame synchronization”, Annals of Telecommunications, Vol. 75, no. 11–12, 635–640, DOI: 
  8. Faure, E., Shcherba, A. and Stupka, B. (2021), “Permutation–Based Frame Synchronisation Method for Short Packet Communication Systems”, 2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), September 2021, Krakow, Poland, pp. 1073–1077, DOI:
  9. Al-Aazzeh, J., Faure, E., Shcherba, A. and Stupka, B. (2022), “Permutation–based frame synchronization method for data transmission systems with short packets”, Egyptian Informatics Journal, Vol. 23, no. 3, pp. 529–545, DOI:
  10. Durisi, D., Liva, G. and Polyanskiy, Y. (2022), “Short-Packet Transmission”, Information Theoretic Perspectives on 5G Systems and Beyond, рр. 339–393, DOI:
  11. Nguyen, A.T.P., Le Bidan, R. and Guilloud, F. (2019), “Trade-Off Between Frame Synchronization and Channel Decoding for Short Packets”, IEEE Communications Letters, June 2019, Vol. 23, no. 6, pp. 979–982, DOI:
  12. Feng, C., Wang, H.- and Poor, H.V. (2022), “Reliable and Secure Short–Packet Communications”, IEEE Transactions on Wireless Communications, March 2022, Vol. 21, no. 3, pp. 1913–1926, DOI:
  13. Bana, A.-S., Trillingsgaard, K.F., Popovski, P. and de Carvalho, E. (2018), “Short Packet Structure for Ultra–Reliable Machine–Type Communication: Tradeoff between Detection and Decoding”, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Calgary, AB, April 2018, pp. 6608–6612, DOI: 
  14. Durisi, G., Koch, T. and Popovski, P. (2016), “Toward Massive, Ultrareliable, and Low–Latency Wireless Communication with Short Packets”, Proceedings of the IEEE, September 2016, Vol. 104, no. 9, pp. 1711–1726, DOI:
  15. Knuth, D.E. (2008), The Art of Computer Programming: Introduction to combinatorial algorithms and Boolean functions, Vol. 4A, Addison–Wesley, Upper Saddle River, NJ.
  16. Yoshinori, I. (1989), Patent JPH01296825A, “Majority circuit”, No. JP12750588A ; application date May 25, 1988; publication date November 30, 1989.
  17. Terrell, T.J. and Shark, L.- (1996), Digital Signal Processing, Macmillan Education, London, UK, DOI:
  18. Tan, L. and Jiang, J. (2019), Digital Signal Processing. Fundamentals and Applications. 3rd ed., Elsevier Science & Technology, DOI:
  19. Galati, G., Pavan, G. and Wasserzier, C. (2022), “Signal design and processing for noise radar”, EURASIP Journal on Advances in Signal Processing, Vol. 2022, no. 1, pp. 52, DOI:
  20. Ibe, O.C. (2014), Fundamentals of applied probability and random processes. 2nd edition, Elsevier/AP, Boston, Amsterdam.

Full text: PDF