<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>ORCID: ;</journal-title>
      </journal-title-group>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Approximation Properties of Generalized Hölder Classes in Context of Signal Processing</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oleg Barabash</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrii Musienko</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andriy Makarchuk</string-name>
          <email>makarchukandriy1999@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mykola Myroniuk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tetiana</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Workshop</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Kyiv</institution>
          ,
          <addr-line>03056</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>National Defense University of Ukraine</institution>
          ,
          <addr-line>28, Povitroflotskyi avenue, Kyiv, 03049</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"</institution>
          ,
          <addr-line>37, Prosp. Peremohy</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>Means of clandestine information acquisition most often intercepted or received information is transmitted over a radio channel. Therefore, obtaining information about radio signals located near objects in which confidential information circulates is a very important scientific task in many aspects of information technologies. Therefore, methods of processing radio signals require constant improvement. When processing signals, especially continuous ones, the class to which the studied signals belong plays an important role. This is one of the key aspects in solving a number of tasks, one of which is to restore the continuous appearance of the signal after its digital processing. Considering the class of the signal helps to explore more deeply both the properties of the signal itself and the methods of its further processing, digital or analog, especially in the case of a complex nature, what is very useful in context of some tasks of system analysis. This allows to choose the optimal way to solve this problem depending on the class to which the signal belongs. The quality of approximation of signals described by functions from generalized Hölder classes and Poisson-type operators is investigated in the paper. In particular, the measure of deviation, which analytically describes the quality of the specified approximation, as well as the direct influence of the parameter describing the order of the fractional derivative function describing the signal, is established and investigated. Signal processing, generalized Hölder classes, Poisson-type operator, approximation, Proceedings</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
      </p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>inequality, is quite popular</p>
      <p>The space where we operate by means of a signal plays the important role in the construction of
mathematical models of one or another real process [1], including the process of signal transformation
and restoration. It may have a big interest in different tasks of computer modeling and related fields.
Since in many cases the investigated signals are continuous and can be described using periodic
functions, we consider the space of continuous 2 -periodic functions C2 , being quite relevant in a
number of problems of digital signal theory and related fields of science and technology [2, 3].</p>
      <p>According to [4, 5], the norm in this space is given by the equality
g</p>
      <p>C
 max g t </p>
      <p>t</p>
      <p>Among various classes of signals, the class of signals, described (characterized) by the following</p>
      <p>2023 Copyright for this paper by its authors.
CEUR</p>
      <p>
        ceur-ws.org
g t  x  2g t   g t  x  2 x  , 0   2,   t, x   ,
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
and g  is the function, with the help of which the natural investigated signal is described. The class
of all such functions g  from space C2 we will call the generalized Hölder class [6] and will denote
by H . Since the signal in the most cases is an oscillatory process, the effectiveness of the constructed

mathematical model of this oscillatory process will directly depend on how harmonic (polyharmonic)
the function describing one of the types of such functions, which are solutions of polyharmonic
equations of elliptic type [7-10] with corresponding boundary conditions [11, 12].
2. Estimation of deviation measure of signals from generalized Hölder classes
from their generalized Abel-Poisson operators
Let’s have polygarmonic functions in the form of an operator
      </p>
      <p>
Ps,q n; g;t    1  g t  x Ks,q n; x dx,</p>
      <p>
1
where q  1,0  s  ,
2</p>
      <p>
        Ks,q n; x  1  e kn 1  kseqn1  e1n 1q  e1n  1  cos kx, (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
      </p>
      <p>
        2 k1      
is the kernel of this operator. In the case s  0 from the relations (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) we have
  1  k 
Po,q n; g;t   An; g;t    1  g t  x  e n cos kx dx, (
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
      </p>
      <p>
          2 k1 
the harmonic Abel-Poisson function [13, 14] or Poisson [15, 16]. If in (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) we put q  1 , and
1
s  , then we get a biharmonic function [7]
2
      </p>
      <p>  1 1  k   2   </p>
      <p>
        P12,1 n; g;t   B n; g;t    1  g t  x 2  2 k1 e n  2  k 1  e n  cos kx  dx . (
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
As we noted above, the most effective mathematical models of the process of signal transmission
and restoration are those considered in the space of generalized Hölder classes H . Therefore, if the
*
function g  from the class H* 0   2 describes the studied signal using the polyharmonic
operator Ps,q n, g,t  , then we will consider the quantity
gH* matx Ps,q n; g;t   g t     H* ; n .
      </p>
      <p>sup</p>
      <p>
        The value in the left side of the equality (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ) characterizes the deviation error for the thematic model
Ps,q n; ;t  of the signal from the real one, described using the function g  of the generalized Hölder
class H* . To study the value   H* ; n , first of all, we consider the so-called integral representation:

Ps,q n; g;t   t    1   g t  x  g  x Ks,q n, x dx 
      </p>
      <p>

  2 1   g t  x  2g t   g t  xKs,q n, x dx.</p>
      <p>
        
Further, combining the relations (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ), (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ), we obtain that
      </p>
      <p>
        
  H* ; n  2 1 sup max   g t  x   2g t   g t  x Ks,q n; x dx 
gH*  t 
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )

      </p>
      <p>
1
2</p>
      <p>1
 2  sup max   g t  x  2g t   g t  x Ks,q n, x dx.</p>
      <p>gH*  t  
Since, according to [17], the kernel Ks,q  n; x is always positive for all values of the parameters
q  1;0  s </p>
      <p>
        and   x  , specified in (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), it follows from (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) that
  H* ; n  2  sup max   g t  x  2g t   g t  x Ks,q n, x dx 
1
      </p>
      <p>gH*  t  
    k k  1 q  1   
 1  x   1   e n  kse n 1  e n  1  e n  cos kx  dx.</p>
      <p>
          2 k1       
Having made some mathematical transformations in the right-hand side of the equality (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ), we get:
1
2
      </p>
      <p>  k k  1 q  1  
  e n  kse n 1  e n  1  e n   cos kx </p>
      <p>k1      
1 q 

 1 e n   2cos
  
  x 1    2k 1  </p>
      <p>    1  e n 
2  k0 2   
1 1q</p>
      <p> 1   1 
 s 1  e n  k 1  e n   e n  . (11)
     
1  </p>
      <p>Therefore, if both parts of the equality (11) are multiplied by 2 1  x  0   2 and integrated
term by term for all x  ;  , then we have that</p>
      <p>To evaluate the integral in the right-hand side of (12), we will use the equality</p>
      <p>   1
 1  x </p>
      <p> 2
 </p>
      <p>  k k  1   
  e n  kse n 1 e n   cos kxdx </p>
      <p> 
k1     
</p>
      <p>1 q  
 1 1 e n    x  cos
 k0 0
</p>
      <p>1
  x </p>
      <p> cos
2 
  2k 1 x
2</p>
      <p>dx 
 
 1 e n 
  
1 1q</p>
      <p> 1   1  1  k
 s 1 e n  k 1 e n   e n e n</p>
      <p>    
</p>
      <p> 
 x  cos
0 </p>
      <p>1
  x </p>
      <p> cos
2 
  2k  1 x
2
dx 
Since,</p>
      <p> 
   x 1   x cos
0  
  x 1 </p>
      <p> cos
2  
  2k 1 x
2

0
dx   x 1 cos
  2k 1 x
2
dx.
 
 x 1  x  cos
0  
  x 1 
2  cos
  2k 1 x
2</p>
      <p> 2 2 
dx   O
 2k 1 ,

0
 x 1 cos
  2k 1 x
2
dx   2  1
 1</p>
      <p>
2k 1
cos
  1
2</p>
      <p>  2 2 
 O 
  2k 1 ,

then by combining the relations (14), (15), (13), (11) and (10) we obtain that
  H ; n   cos
*</p>
      <p>2 
  
1 e n  
1 q</p>
      <p>
  2  k  
  e n  1 e n 
k0  2k 1   
1 1q</p>
      <p> 1   1  1  
 s 1 e n  k 1 e n   e n   </p>
      <p>     </p>
      <p>Let’s analyze the right-hand side of the equality (16) as the deviation error of the mathematical
model Ps,q n; ;t  of the signal from the real one, described by means of the function   from the
generalized Hölder class. To begin with, let’s simplify the estimate (16). We can show that (16)
 H* ;n  2  cos 2 1 e1n q  1 e1n 1q  s 1 e1n e1n  </p>
      <p>O1 e1n 1 se1n 1 e1n 1 e1n q1 . (17)</p>
      <p>Now we can visually represent the main term of the deviation error (16) depending on  and
different values of the parameters s and q.</p>
      <p>Above we considered two cases of parameter values s and q : s  0, q  1 and s  1 , q  1. For each
2
of these two cases, we build the graph of the principal error term (17).</p>
      <p>As we can see from the above graphs, whatever parameter values s and q, we take, the smoothness
of the function that describes the signal is a key aspect affecting the description of the signal using the
Poisson-type operator in the case when the signal belongs to the generalized Lipschitz class.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Conclusions</title>
      <p>In this work, the approximation of signals belonging to the generalized Lipschitz class by
Poissontype operators, as well as the application of this process in information technologies [18-21], have been
investigated. The error measure, which is obtained with this approximation, has been derived
analytically. With its help, we showed that the quality of the approximation of the investigated signal
depends the most significantly on the parameter   2 describing the smoothness order of the function
or, what is the same, the order of its fractional derivative. According to the presented result, the quality
of signal approximation by Poisson-type operators is better, the higher the value of the parameter is,
confirmed by the graphs presented in the work. The application of the obtained results can be applied
in various areas of information technologies, in particular, in network technologies, for example, in
computer modelling [22-24], security [25], cybersecurity [26, 27], engineering [28-30], etc. We also
have found that the presented results indicate the more optimal approximation of the signal by
Poissontype operators than by the methods presented in foreign sources, for example, in. This clearly shows
that Poisson-type operators are effective mathematical tools for solving a number of information
technology problems.</p>
    </sec>
    <sec id="sec-4">
      <title>4. References</title>
      <p>
        [10] R. Hegazy, J. Kadifa, L. Milstein, P. Cosman Subcarrier Mapping for Underwater Video
Transmission over OFDM (2021) IEEE Journal of Oceanic Engineering, 46 (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ), pp. 1408 – 1423.
doi: 10.1007/s10958-023-06603-x.
[11] S. Brkic, P. Ivanis, B. Vasic Guaranteed error correction of faulty bit-flipping decoders under
datadependent gate failures (2016) IEEE International Symposium on Information Theory
Proceedings, 2016-August, art. pp. 1561 – 1565. doi: 10.1007/s10559-022-00457-y.
[12] R.D. Hegazy, Q. Song, A. Vosoughi, L.B. Milstein, P.C. Cosman Joint Source-Channel
RateDistortion Optimization for Wireless Video Transmission (2020) Conference Record - Asilomar
Conference on Signals, Systems and Computers, 2020-November, pp. 693 – 698. doi:
10.1134/S0001434618050231.
[13] S. Rezaei Aghdam, A. Nooraiepour, T.M. Duman An Overview of Physical Layer Security With
Finite-Alphabet Signaling (2019) IEEE Communications Surveys and Tutorials, 21 (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ), pp. 1829
– 1850. doi: 10.1007/s11253-022-02084-4.
[14] A. Tadayon, M. Stojanovic Iterative Sparse Channel Estimation and Spatial Correlation Learning
for Multichannel Acoustic OFDM Systems (2019) IEEE Journal of Oceanic Engineering, 44 (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ),
pp. 820 – 836. doi: 10.1007/s10559-023-00530-0
[15] R. Schafer, L. Rabiner A digital signal processing approach to interpolation. Proceedings of IEEE.
      </p>
      <p>
        1973. Vol. 6, no. 61. P. 692–702. doi: 10.15330/cmp.15.1.286-294.
[16] M. Kazemi, H. Aghaeinia, T.M. Duman Discrete-Phase Constant Envelope Precoding for Massive
MIMO Systems (2017) IEEE Transactions on Communications, 65 (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ), , pp. 2011 – 2021. doi:
10.1007/s10559-023-00579-x.
[17] I.A. Tomić, Ð. Lukić, M. Davidović, D. Drajić ,D., Ivaniš P. Statistical Analysis of CQI Reporting
and MIMO Utilization for Downlink Scheduling in Live LTE Mobile Network (2020) Telfor
Journal, 12 (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ), pp. 8 – 12. doi: 10.1007/s10559-023-00561-7.
[18] L. E. Franks Signal theory. Stroutsburg : Dowlen &amp; Culver Inc., 1981. 323 p. doi:
10.12928/telkomnika.v17i4.12168.
[19] S. V. Vaseghi Advanced digital signal processing and noise reduction. 3rd ed. Chichester : John
      </p>
      <p>Wiley &amp; Sons Ltd., 2006. 479 p. doi: 10.17762/ijcnis.v13i2.5008.
[20] C. L. Byrne Signal processing A mathematical approach. 2nd ed. Massachusetts : CRC Press, 2015.</p>
      <p>
        436 p. doi: 10.20535/SRIT.2308-8893.2021.1.03.
[21] A. B. Carlson, P. B. Crilly COMMUNICATION SYSTEMS an introduction to signals and noise
in electrical communication. 5th ed. New York : McGraw-Hill, 2010. 953 p. ISSN 16130073.
[22] N. Karakoc, T.M. Duman Rate Selection for Wireless Random Access Networks over Block
Fading Channels (2020) IEEE Transactions on Communications, 68 (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), pp. 1604 – 1616. doi:
10.30534/ijatcse/2019/26862019.
[23] M. Dabirnia, A. Korhan Tanc, S. Sharifi, T.M. Duman Code Design for Discrete Memoryless
Interference Channels (2018) IEEE Transactions on Communications, 66 (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ), pp. 3368 – 3380.
doi: 10.1109/apuavd.2017.8308787.
[24] Z. Hu, V. Mukhin, Y. Kornaga, O. Barabash, O. Herasymenko Analytical Assessment of Security
Level of Distributed and Scalable Computer Systems. International Journal of Intelligent Systems
and Applications, 2016. Vol. 8. No. 12. Hong Kong: MECS Publisher, 2016. P. 57–64. doi:
10.5815/ijisa.2016.12.07.
[25] Yu.I. Kharkevych, “Approximation Theory and Related Applications,” Axioms, 2022, vol. 11
(12): 736. doi: 10.3390/axioms11120736.
[26] R. W. Hamming Digital filters. New Jersey : Prentice-Hall, International, 1977. 224 p.
[27] J. Boiko, I. Pyatin, O. Eromenko, O. Barabash (2020) Methodology for Assessing Synchronization
Conditions in Telecommunication Devices. Advances in Science, Technology and Engineering
Systems Journal (ASTESJ), 2020, Vol. 5, No 2. ISSN: 2415-6698. P. 320–327. doi:
10.25046/aj050242.
[28] A. Dulny, P. Heinisch, A. Hotho, A. Krause GrINd: Grid Interpolation Network for Scattered
      </p>
      <p>Observations/ Würzburg. 19 p. (Preprint. University Würzburg).
[29] JI. Cen, X. Chen, M. Xu, Q. Zou Deep finite volume method for high-dimentional partial
differential equations. Guangzhou. 16 p. (Preprint)
[30] X. Zhang, J. Helwig, Y. Lin, Y. Xie, C. Fu, S. Wojtowytsch, Sh. Ji SineNet: Learning teporal
dynamics in time-dependent partial differential equations. Texas. 42 p.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Oleg</given-names>
            <surname>Barabash</surname>
          </string-name>
          , Oleksandr Laptiev, Valentyn Sobchuk, Ivanna Salanda, Yulia Melnychuk,
          <string-name>
            <given-names>Valerii</given-names>
            <surname>Lishchyna</surname>
          </string-name>
          .
          <article-title>Comprehensive Methods of Evaluation of Distance Learning System Functioning</article-title>
          .
          <source>International Journal of Computer Network and Information Security (IJCNIS)</source>
          , Vol.
          <volume>13</volume>
          , No. 3,
          <string-name>
            <surname>June</surname>
          </string-name>
          .
          <year>2021</year>
          , pp.
          <fpage>62</fpage>
          -
          <lpage>71</lpage>
          . doi:
          <volume>10</volume>
          .5815/ijcnis.
          <year>2021</year>
          .
          <volume>03</volume>
          .06.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>O.</given-names>
            <surname>Barabash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Musienko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sobchuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lukova-Chuiko</surname>
          </string-name>
          ,
          <string-name>
            <surname>O. Svynchuk.</surname>
          </string-name>
          “
          <article-title>Distribution of Values of Cantor Type Fractal Functions with Specified Restrictions“</article-title>
          .
          <source>Chapter in Book “Contemporary Approaches and Methods in Fundamental Mathematics and Mechanics”</source>
          . Editors V.A.
          <string-name>
            <surname>Sadovnichiy</surname>
            ,
            <given-names>M.Z.</given-names>
          </string-name>
          <string-name>
            <surname>Zgurovsky</surname>
            . Publisher Name: Springer, Cham,
            <given-names>Switzerland AG</given-names>
          </string-name>
          <year>2021</year>
          . P.
          <volume>433</volume>
          -
          <fpage>455</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -50302-4_
          <fpage>21</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mukhin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zavgorodnii</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Barabash</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mykolaichuk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kornaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zavgo-rodnya</surname>
          </string-name>
          , V. Statkevych, “
          <article-title>Method of Restoring Parameters of Information Objects in a Unified Information Space Based on Computer Networks</article-title>
          ,”
          <source>International Journal of Computer Network and Information Secu-rity (IJCNIS)</source>
          ,
          <year>2020</year>
          , vol.
          <volume>12</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>11</fpage>
          -
          <lpage>21</lpage>
          . doi:
          <volume>10</volume>
          .5815/ijcnis.
          <year>2020</year>
          .
          <volume>02</volume>
          .02.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Radosevic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Fertonani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.M.</given-names>
            <surname>Duman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.G.</given-names>
            <surname>Proakis</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. Stojanovic</surname>
          </string-name>
          <article-title>Bounds on the information rate for sparse channels with long memory and i</article-title>
          .u.d. inputs (
          <year>2011</year>
          ) IEEE Transactions on Communications,
          <volume>59</volume>
          (
          <issue>12</issue>
          ), pp.
          <fpage>3343</fpage>
          -
          <lpage>3352</lpage>
          . doi:
          <volume>10</volume>
          .3390/axioms11040161.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Ndinechi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Onwuchekwa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. A.</given-names>
            <surname>Chukwudebe</surname>
          </string-name>
          .
          <article-title>Algorithm for applying interpolation in digital signal processing systems</article-title>
          .
          <source>International Journal of Natural and Applied Sciences</source>
          .
          <year>2009</year>
          . P.
          <volume>114</volume>
          -
          <fpage>119</fpage>
          . doi:
          <volume>10</volume>
          .15330/cmp.14.1.
          <fpage>223</fpage>
          -
          <lpage>229</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Manolakis</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Proakis</surname>
          </string-name>
          <article-title>Digital signal processing: Principles, Algorithms and Applications</article-title>
          . 3rd ed., New Jersey : Prentice-Hall, International,
          <year>1996</year>
          . 1032 p.
          <source>doi: 10.1007/s10559-023-00598-8.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Jing</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stojanovic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Murch</surname>
          </string-name>
          <article-title>Differential orthogonal frequency division multiplexing communication in water pipeline channels (</article-title>
          <year>2020</year>
          <source>) Journal of the Acoustical Society of America</source>
          ,
          <volume>148</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>EL130</fpage>
          -
          <lpage>EL134</lpage>
          . doi:
          <volume>10</volume>
          .1007/s11253-019-01705-9.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>N.</given-names>
            <surname>Ghaddar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.B.</given-names>
            <surname>Milstein</surname>
          </string-name>
          , L. Ma,
          <string-name>
            <given-names>B.K.</given-names>
            <surname>Yi Joint</surname>
          </string-name>
          <article-title>Channel Estimation and Coding over Channels with Memory Using Polar Codes (</article-title>
          <year>2021</year>
          ) IEEE Transactions on Communications,
          <volume>69</volume>
          (
          <issue>10</issue>
          ), pp.
          <fpage>6575</fpage>
          -
          <lpage>6589</lpage>
          . doi:
          <volume>10</volume>
          .1007/s10958-022-06190-3.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>R. G.</given-names>
            <surname>Lyons</surname>
          </string-name>
          <article-title>Understanding digital signal processing</article-title>
          . 2nd ed. New Jersey : Prentice-Hall, International,
          <year>2004</year>
          . 684 p.
          <source>doi: 10.15330/cmp.13.3</source>
          .
          <fpage>805</fpage>
          -
          <lpage>817</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>