METHODS OF FACTORIAL CODING OF SPEECH SIGNALS
DOI:
https://doi.org/10.15588/1607-3274-2019-4-18Keywords:
Factorial code, permutation, speech sample, samples recovery, decoding noise.Abstract
Context. The paper outlines the methods of factorial coding of speech signals using a factorial code to provide integrated information security and to maintain a receiver and transmitter clock phase. By integrated information security, for the methods proposed in this article, we mean data protection from effects of noise in communication channel and attempts of data unauthorized access in open multiple access telecommunication networks.Objective. The goal of the research is to provide integrated protection of real-time speech signals based on factorial coding. For
this, the methods for factorial coding of speech signals and building speech codecs have been developed. These methods are based on the properties of factorial codes to keep synchronism with the working signal, to detect a significant part of errors caused by the action of noise, natural or created intentionally, to provide the ability to correct all detected errors with a finite accuracy, as well as to provide cryptographic protection against voice message unauthorized listening by hiding the law of converting speech signal samples into a permutation.
Method. The main idea of the proposed methods is to choose permutations for information transferring with a specific set of
properties and features that provide the ability to correct errors detected by code and to recover speech signal samples with a finite
degree of accuracy (with a nonzero aperture).
Results. The procedures for information coding/decoding have been determined. The results of the experimental evaluation of
the model of such systems when working on a communication channel with both independent and multiple bit errors are presented.
The magnitude of decoding noise due to the finite accuracy of speech signal samples recovery is determined as a function of bit error probability in a communication channel.
Conclusions. The proposed methods of factorial coding of a speech signal provide integrated information security and recovery
with finite accuracy of speech signal samples deformed by noise in communication channel. The requirements to the quality of communication channel (to the value of bit error probability) for comfortable speech perception are determined.
References
Gnatyuk S. Critical Aviation Information Systems Cybersecurity, Meeting Security Challenges Through Data Analytics
and Decision Support, NATO Science for Peace and Security Series, D: Information and Communication Security,
, Vol. 47, No. 3, pp. 308–316. DOI: 10.3233/978-1-61499-716-0-308
Gnatyuk S., Kinzeryavyy V., Kyrychenko K. et al. Secure Hash Function Constructing for Future Communication Systems
and Networks, Advances in Intelligent Systems and Computing, 2019, Vol. 902, pp. 561–569. DOI:10.1007/978-3-030-12082-5_51
McEliece R. J. A Public-Key Cryptosystem Based On Algebraic Theory, The Deep Space Network Progress Report,
DSN PR 42–44, 1978, pp. 114–116.
Osmolovskij S. A. Stoxasticheskaya informatika: innovacii v informacionnyx sistemax. Moscow, Goryachaya liniya-
Telekom, 2012, 321 p.
Stakhov A. P., Massingue V., Sluchenkova A. Introduction into Fibonacci Coding and Cryptography. Kharkov, Osnova,
, 234 p.
Stakhov A. P. Fibonacci Matrices, a Generalization of the ‘Cassini Formula’, and a New Coding Theory, Chaos, Solitons
& Fractals, 2006, Vol. 30, No. 1, pp. 56–66. DOI: 10.1016/j.chaos.2005.12.054
Stakhov A. P. .: The ‘Golden’ Matrices and a New Kind of Cryptography, Chaos, Solitons & Fractals, 2007, Vol. 32,
No. 3, pp. 1138–1146. DOI: 10.1016/j.chaos.2006.03.069
Mazurkov M. I., Chechel’nitskii V. Ya., Murr P. Information security method based on perfect binary arrays, Radioelectronics
and Communications Systems, 2008, Vol. 51, No. 11, pp. 612–614. DOI: 10.3103/S0735272708110095
Mazurkov M. I., Chechelnytskyi V. Ya., Meleshkevich A. N. et al. Methods of improving information security
by integrating multiplexing, ciphering and channel encoding operations, Radioelectronics and Communications Systems,
, Vol. 54, No. 5, pp. 227–240. DOI: 10.3103/S0735272711050013
Mazurkov M. I. Composite matrix cipher based on perfect binary arrays, Radioelectronics and Communications Systems,
, Vol. 56, No. 3, pp. 133–140. DOI:10.3103/S0735272713030047
Borisenko A. A., Gorjachev A. E., Lopatchenko B. K. et al. Perestanovki v telekommunikacionnyx setyax, Vіsnik
Sums’kogo derzhavnogo unіversitetu, 2013, No. 2, pp. 15–22.
Faure E. V., Shvydkyi V. V., Shcherba A. I. Information integrity control based on the factorial number system,
Journal of Baku engineering university – Mathematics and computer science, 2017, Vol. 1, No. 1, pp. 3–13.
Faure E. V., Shvydkyi V. V., Shcherba V. O. Combined factorial coding and its properties, Radio Electronics, Computer
Science, Control, 2016, No. 3, pp. 80–86. DOI:10.15588/1607-3274-2016-3-10
Faure E. V. Faktorial’noe kodirovanie s vosstanovleniem dannyx, Visnyk Cherkas’kogo derzhavnogo tehnologichnogo
universytetu, 2016, No. 2, pp. 33–39. DOI:10.24025/bulletinchstu.v1i2.82932
Faure E. V. Factorial coding with error correction, Radio Electronics, Computer Science, Control, 2017, No. 3,
pp. 130–138. DOI: 10.15588/1607-3274-2017-3-15
Faure E. V., Shcherba A. I., Kharin A. A. Factorial Code with a Given Number of Inversions, Radio Electronics,
Computer Science, Control, 2018, No. 2, pp. 143–153. DOI:10.15588/1607-3274-2018-2-16
Marsaglia G. DIEHARD battery of tests of randomness [Electronic resource]. Access mode:
http://www.stat.fsu.edu/pub/diehard
Rukhin A., Soto J., Nechvatal J. et al. A Statistical Test Suite for Random and Pseudorandom Number Generators
for Cryptographic Applications: Spec. Pub. 800–22 rev. 1a, National Institute of Standards and Technology. Gaithersburg,
MD, 2010, 153 p.
L’ecuyer P., Simard R. TestU01: A C Library for Empirical Testing of Random Number Generators, ACM Transactions
on Mathematical Software, 2007, Vol. 33, No. 4, 40 p. DOI:10.1145/1268776.1268777
Faure E. V., Shcherba A. I., Rudnytskyi V. M. The Method and Criterion for Quality Assessment of Random Number
Sequences, Cybernetics and Systems Analysis, 2016, Vol. 52, pp. 277–284. DOI: 10.1007/s10559-016-9824-3
Наgеlbаrgеr D. W. Recurrent codes: Easily Mechanized, Burst-Correcting, Binary Codes, The Bell System Technical
Journal, 1959, Vol. 38, Issue 4, pp. 969–984. DOI:10.1002/j.1538-7305.1959.tb01584.x
Hagelbarger D. W. Error Detection Using Recurrent Codes, AIEE Winter General Meeting. New York, 31 January–5
February 1960. : Proceedings. – New York, IEEE, 1960.
Pereira F., Guardia G., Assis F. Classical and Quantum Convolutional Codes De-rived from Algebraic Geometry
Codes, IEEE Transactions on Communications, 2019, Vol. 67, No. 1, pp. 73–82. DOI:10.1109/TCOMM.2018.2875754
Yang Q., Liew C. Asynchronous Convolutional-Coded Physical-Layer Network Coding, IEEE Transactions on
Wireless Communications, 2015, Vol. 14, No. 3, pp. 1380–1395. DOI: 10.1109/TWC.2014.2365822
Nooraiepour A., Duman T. M. Randomized Convolutional Codes for the Wiretap Channel, IEEE Transactions on
Communications, 2017, Vol. 65, No. 8, pp. 3442–3452. DOI: 10.1109/TCOMM.2017.2704586
Lavdanskyi A. O. Time assessment of formation of number sequences under increase of calculation unit performance,
The scientific potential of the present: International Scientific Conference, St Andrews, Scotland, United Kingdom, 1
December 2016 : proceedings. St Andrews, Scotland, United Kingdom, 2016, pp. 123–126.
Rabiner L. R., Schafer R. W. Introduction to Digital Speech Processing. Delft, now Publishers Inc., 2007, 200 p. DOI:
1561/2000000001
Wang L., Doclo S. Correlation Maximization-Based Sampling RateOffset Estimation for Distributed Microphone Arrays,
IEEE/ACM Transactions on Audio, Speech, and Language Processing, 2016, Vol. 24, No. 3, pp. 571–582. DOI:
1109/TASLP.2016.2517326
Gilbert E. N. Capacity of a Burst-Noise Channel / E.N. Gilbert // Bell System Technical Journal, 1960, Vol. 39, Issue 5,
pp. 1253–1265. DOI: 10.1002/j.1538-7305.1960.tb03959.x
Elliott E.O. Estimates of Error Rates for Codes on Burst-Noise Channels, Bell System Technical Journal, 1963,
Vol. 42, Issue 5, pp. 1977–1997. DOI: 10.1002/j.1538-7305.1963.tb00955.x
Hasslinger G., Hohlfeld O. The Gilbert-Elliott Model for Packet Loss in Real Time Services on the Internet, Measurement,
Modelling and Evalutation of Computer and Communication Systems: 14th GI/ITG Conference, Dortmund,
Germany, 31 March – 2 April 2008 : proceedings, VDE VERLAG, 2008.
Ellis M., Pezaros D. P., Kypraios T. et al. Modeling of packet loss and delay and their effect on real-time multimedia
service quality, Computer Networks, 2014, Vol. 70, pp. 384–399. DOI: 10.1016/j.comnet.2014.05.013
Heegard C. Turbo Coding / C. Heegard, S.B. Wicker. – Norwell: Kluwer Academic Publishers, 1999. – 476 p. DOI:
1007/978-1-4757-2999-3
Weithoffer S., Nour C. A., When N. et al. 25 Years of Turbo Codes: From Mb/s to beyond 100 Gb/s, Turbo Codes and Iterative
Information Processing: 10th IEEE International Symposium, Hong Kong, China, 3–7 December 2018 : proceedings.
IEEE Computer Society, 2018. DOI:10.1109/ISTC.2018.8625377
Babar Z., Chandra D., Nguyen H. V. et al.] Duality of quantum and classical error correction codes: Design principles
and examples, IEEE Communications Surveys and Tutorials, 2019, Vol. 21, Issue 1, pp. 970–1010. DOI:
1109/COMST.2018.2861361
Panayiotis D. P., Thomas A. S., Prabodh V. et al. Turbo Coded Modulation over GSM Channels, Third Generation
Wireless and Beyond: International Conference, San Francisco, California, 6–8 June 2001, Proceedings. San Francisco,
IEEE, 2001.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 E. V. Faure, V. V. Shvydkyi, A. O. Lavdanskyi, O. O. Kharin
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
