<!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 />
    <article-meta>
      <title-group>
        <article-title>Spectral Analysis Based on a Discrete Binary Model for Signal Stochastic Quantization and Calculating a Weighted Correlation Function Estimate</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>imir Y</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>kimov[</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>liy B</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Samara State Technical University</institution>
          ,
          <addr-line>244, Molodogvardeyskaya str., Samara, 443100</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The paper considers the high-performance digital algorithm for estimating the power spectral density (PSD) by the correlogram method. This algorithm is developed on the binary analog-stochastic quantization basis of the investigated continuous signal. The mathematical model for the discrete representation of binary analog-stochastic quantization made it possible to analytically calculate the cosine Fourier transform of weighted window functions in the algorithm development. As a result of this, the developed algorithm does not require numerical integration operations. The main computational operations of the algorithm are the operations of summation and subtraction. The algorithm also does not require the calculation of correlation function estimates. All this increases the computational efficiency of the PSD estimation by the correlogram method. The experimental studies results of the algorithm are given. These results show that the proposed algorithm gives accurate PSD estimates in the presence of additive noise. The computational efficiency of the algorithm provides the ability to use it for estimating the PSD of complex signals.</p>
      </abstract>
      <kwd-group>
        <kwd>power spectral density</kwd>
        <kwd>time-weighting function</kwd>
        <kwd>binary analog stochastic quantization</kwd>
        <kwd>sign signal</kwd>
        <kwd>digital time readout</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Spectral analysis methods of signals are used in various fields of science and
technology. In particular, this applies to acoustics, location, vibration diagnostics, radio
frequency identification, etc. Under conditions of a priori statistical uncertainty, the
regularity of changing signal parameters over time is determined by probabilistic laws.
The spectral analysis of such signals involves estimating the power spectral density
(PSD) over a finite time interval. PSD characterizes the distribution of the average
signal power over frequencies within the analyzed frequency range.</p>
      <p>One of the most common classical methods for assessing PSD is the correlogram
method. This spectral analysis method can be used to study the frequency
composition of complex multicomponent signals that meet the conditions of stationarity and
ergodicity in time.</p>
      <p>At present, the correlogram method for estimating PSD is carried out primarily in
digital form. First, modern computing and software engineering allow you to create
high-tech problem-oriented systems. Secondly, digital signal processing guarantees
the accuracy of calculations. Moreover, traditionally, researchers use digital
algorithms that are developed on the basis of an approximate implementation of the
analog integration operation in discrete form by digital summation operations with a
uniform sampling interval in time [1–4]. All digital algorithms developed in this way
require a significant amount of calculated operations. Among these operations, a large
number of digital multiplication operations have to be performed. As you know,
digital multiplication operations are the most time-consuming computing operations.
Using algorithms that require a large number of digital multiplication operations can
lead to significant time costs. The consequence of this is a decrease in the efficiency
of calculating PSD estimates.</p>
      <p>A feature of classical algorithms for calculating the PSD estimate by the
correlogram method is the need for preliminary calculation of the correlation function
estimates sequence for the analyzed signal. It also reduces the computational efficiency
of obtaining PSD estimates.</p>
      <p>The correlogram method involves the use of weighted window functions (the
socalled correlation windows) to attenuate the blurring effect of spectral components
estimates. The use of weighted window functions involves the operation of weighing
the correlation function estimates with the correlation window function samples. This
procedure leads to the need for additional digital multiplication operations. As a
result, the use of correlation windows reduces the computational efficiency of digital
algorithms for estimating the PSD using the correlogram method.</p>
      <p>Typically, the computational efficiency of digital signal processing is enhanced in
three main ways [5–9]. Firstly, an increase in the speed of data processing programs is
ensured by an increase in the overall performance of computing systems. Secondly,
the developers of the algorithms carry out special preparation of the initial data in the
form of ordered algebraic structures. Thirdly, the computational process is accelerated
by refactoring and using various methods of optimizing program code. However,
none of these methods can solve the problem of increasing the computational
efficiency of digital signal processing in full. This is explained by the fact that the time
characteristics of the execution of application programs are determined largely by the
mathematical model of preparing data in digital form and by performing
computational operations on this data. The use of binary quantization as the primary
conversion of the analyzed continuous signal into a digital code can improve the
computational efficiency of digital signal processing [10, 11]. The application of binary
quantization has been investigated extensively in the past years [12–15]. In [16, 17], fast
digital algorithms were developed for estimating the PSD based on the correlogram
method using binary analog-stochastic quantization. The discrete-time mathematical
model for this quantization type provided analytical calculation of analog integration
operations in the development of these algorithms [18]. As a result, the need to
perform a large number of digital multiplication operations is eliminated. The main
operations of the algorithms are logical operations and arithmetic operations of summing
and subtracting discrete values of the cosine function. Algorithms also do not require
preliminary calculation of estimates of the correlation function. All this simplifies the
digital procedures for calculating the PSD estimate by the correlogram method and
reduces the overall complexity of the spectral analysis. However, the algorithms in
[16, 17] were developed without taking into account the use of weight functions
(correlation windows), which limits their application in practice.</p>
      <p>Thus, the task of developing a computationally efficient algorithm for estimating
the PSD based on the correlogram method is relevant. To solve this problem, it is
fundamentally important to obtain simple computational procedures using the
weighted window functions and reduce the number of digital multiplication
operations. Moreover, such an algorithm should allow obtaining the PSD estimates with the
necessary accuracy and frequency resolution.
2</p>
      <p>Algorithm for estimating the PSD by the correlogram method
based on binary analog-stochastic quantization of the
analyzed signal
It was noted above that in [16, 17] fast algorithms for estimating the PSD based on the
correlogram method were developed using a technique that allows analytical
calculation of integration operations. Let us summarize this technique for developing a
digital algorithm for calculating the PSD estimates by the correlogram method using
weighted window functions.</p>
      <p>The correlation function and weighted window functions are even functions. With
this in mind, the PSD estimate using correlogram method is calculated as follows:
0</p>
      <p>T
ˆ</p>
      <p>S XX ( f ) = 2 w()Rˆ XX () cos 2fd ,
ˆ
where RXX () is the correlation function estimate of the analyzed signal X (t) ;
w() is the weighted window function; T is the length of time the spectral analysis.</p>
      <p>
        Let within the time intervals t [0;T ] and t [0;2T ] , the results of two
independent operations of binary analog-stochastic quantization are sign signals:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
o o
z1(t) = sgn{ x(t) + 1(t)} and z2 (t) = sgn{ x(t) + 2 (t)},
o
where sgn{...} is the operator of the sign function; x(t) is a centered
implementation of the analyzed signal X (t) ; 1 (t) and 2 (t ) are auxiliary random signals.
      </p>
      <p>Auxiliary signals 1(t) and 2 (t) have a uniform distribution ranging from
− max to + max , where the value of max must exceed the highest possible value of
o
the implementation x(t) with a probability close to unity [10,11,18].</p>
      <p>As an estimate of Rˆ XX () , we take an unbiased estimate [19–21]:</p>
      <p>T
ˆ
RXX () = 2maxT −1  z1(t)z2 (t + )dt .</p>
      <p>0
We introduce the notation:</p>
      <p>g (, f ) = w() cos 2f .</p>
      <p>
        Then, taking into account (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ), estimate (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) is:
In (
        <xref ref-type="bibr" rid="ref5">5</xref>
        ), we change the order of integration over the variables t and τ:
      </p>
      <p>T T
ˆ
SXX ( f ) = 22maxT −1 g(, f ) z1(t)z2 (t + )dtd .</p>
      <p>T T +t
ˆ
SXX ( f ) = 22maxT −1 z1(t)  z2 ()g( − t, f )ddt .</p>
      <p>0
0
t</p>
      <p>0</p>
      <p>Further development of the digital algorithm for estimating the PSD was reduced
to the practical implementation of analog integration operations in a discrete form. An
effective calculation of these operations can be achieved using a discrete-time
mathematical model for changing the values of the sign signals z1(t) and z2 (t) in time.
These signals are continuous functions and their values are limited in level by the
values “–1” and “+1”. Therefore, we can unambiguously represent the signals z1(t)
and z2 (t) at the time intervals of their formation t [0;T ] and t [0;2T ] using the
values of z1(t0 ) and z2 (t0 ) at the initial moment of quantization time t0 = 0 and
the time samples { tiz1 } and { t zj2 } , at which they change their value, where
1  i  I and 1  j  J . t0z1 = t0z2 = t0 = 0 , tIz1 = T and tJz2 = 2T [14].</p>
      <p>
        Taking into account the discrete-time representation of the sign signals z1(t) and
z2 (t) , we write the estimate (
        <xref ref-type="bibr" rid="ref6">6</xref>
        ) as a sum:
      </p>
      <p>I −1 tiz+11 T +t
ˆ
S XX ( f ) = 22maxT −1z1(t0 ) (−1)i   z2 ()g ( − t, f ) ddt .</p>
      <p>
        i=0
tiz1 t
From (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) it follows that for a continuous and differentiable weighted window function
w() in the time interval  [0;2T ] , the function g (, f ) is also a continuous and
differentiable function in this time interval. Then there exists a continuous function
G(, f ) for which the condition is satisfied [22]:
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
g (, f )dt = dG(, f ) .
      </p>
      <p>
        In (
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), we change the order of integration. Then, taking into account (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ), the integral
over the variable t can be calculated analytically. After calculating this integral, we
obtain:
      </p>
      <p>I
ˆ
S XX ( f ) = DXX (T , f ) + 22maxT −1z1(t0 ) (−1)ii B(tiz1 , f ) ;</p>
      <p>i=0
 i = 1 , if i = 0 and i = I ; i = 2 , if 2  i  I −1 ;
DXX (T , f ) = 2(G(T , f )Rˆ XX (T ) + G(0, f )Rˆ XX (0)) ;</p>
      <p>tiz1 +T
B(tiz1 , f ) =  z2 ()G( − tiz1 , f )d .</p>
      <p>tiz1
B(tiz1 , f ) = z2 (tiz1 )
where  j = t zj+21 − t zj2 and t ji = t zj2 − tiz1 .</p>
      <p>
        Relations (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) and (13) can be directly used to calculate the SDM estimates in
discrete form. Moreover, we take into account that for a given duration of the spectral
analysis time T, the maximum possible frequency resolution is f = 1/ T . Then for
fk = kf we finally get:
I
ˆ
S XX ( fk ) = DXX (T , fk ) + A(max ,T )z1(t0 ) (−1)ii B(tiz1 , fk ) ,
i=0
B(tiz1 , fk ) = z2 (tiz1 )
m(i)+r(i)
 (−1) j−m(l) jG(t ji , fk ) ,
j=m(i)
A(max ,T ) = 22maxT −1 = 22maxf = Const .
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
(10)
(11)
(12)
(13)
(14)
(15)
As follows from (14) and (15), the calculation of the PSD estimate was reduced to the
discrete processing of the function G(, f ) . Relations (14) and (15) became the basis
for the development of a digital algorithm for calculating PSD estimates. The main
operations of this algorithm are the operations of summing and subtracting the
samples of function G(, f ) , where  = t ji and f = kf .
      </p>
      <p>The function G(, f ) is primitive for the function g (, f ) = w() cos 2f in the
time interval  [0;2T ] , where the weighted window function w() is known.
Therefore, the function G(, f ) is also known, since its form is determined only by
the type of the applied weighted window function w() . As an example, some of the
main weighted window functions w() used in calculating the PSD estimates and the
corresponding functions G(, f ) are presented in Table 1 [1, 23–25].
Experimental studies of the developed algorithm were carried out using simulation
methods. In accordance with this, a logical-mathematical model was developed for
conducting computer experiments. The purpose of the experimental studies was to
evaluate the metrological capabilities of the algorithm for calculating the PSD
estimate. On the basis of discrete-event modeling, special software was developed to
simulate the binary analog-stochastic quantization of a continuous signal. The
discrete-event model of binary analog-stochastic quantization made it possible to
abstract from the continuous quantization result and consider only the main events
determined by time instants at which it changes its values. The model of centered signal
implementation was the sum of the statistical-independent harmonic components in
additive noise e(t) :
o M
x(t) =  Am cos(2fmt + m ) + e(t) ,</p>
      <p>m=1
where fm are the normalized frequencies, Am are the normalized amplitudes, m
are the initial phases.</p>
      <p>A model of this type reflects the dynamics of a real signal characterizing a wide
class of physical processes. We can set a specific superposition for the arrangement of
spectral components within a given frequency range and consider a complex signal as
a combination of narrow-band signals. We also note that this model makes it possible
to study the operability of the algorithm in the presence of noise interference and to
examine its stability in calculating the PSD estimates in the presence of random
background noise.</p>
      <p>Normalized frequencies f m were set in the range from zero to 0.5. This ensured
the constancy of the frequency range of the presentation of the results of the PSD
estimation for complex signals models that a priori occupy different frequency ranges
in width. The amplitudes Am were also interpreted as normalized. They were set in
the range from zero to unity. Initial phases k were set within the interval
−   k   using a generator of randomly uniformly distributed quantities.
Additive noise e(t) was white noise with zero expectation and dispersion e2 = 1 . In
particular, the model contained five harmonic components. The parameters of these
components are shown in Table 2.
0.35</p>
      <p>f m</p>
      <p>Using simulation, experiments were carried out in the course of which the
possibility of frequency resolution and the accuracy of determining harmonic components
were checked. Figures 1-4 show the normalized PSD estimates obtained for the
Rectangular (Box Car) window, the Triangular (Bartlett) window, the Cos(x) window and
the Hann (Raised-Cosine). PSD estimates were calculated with a resolution of 0.0001
units of normalized frequency. The results of determining the harmonic components
are presented in Table 2.
On all graphs, we see a steady identification of all five harmonic components. The
position of the harmonic components estimates in the spectrum corresponds to the
initial values. False spectral lines are not present. Spectral line splitting is not
observed. Spectral lines are clearly distinguishable. Strong harmonics do not mask weak
ones. The spectral noise estimate remains at a fairly low level in relation to the
harmonic component estimates. It practically does not exceed -40 dB. This indicates a
good resolution and high stability of the algorithm to external additive noise.</p>
      <p>Conclusion
Based on binary analog-stochastic quantization, we developed a digital algorithm for
estimating the PSD by the correlogram method. During the development of the
algorithm, the integration operations are calculated analytically. This eliminates the
methodological error, which is the result of numerical integration operations. The main
computational operations of the algorithm are the operations of summation and
subtraction. Unlike the classical digital algorithms for estimating the PSD by the
correlogram method, this algorithm requires calculating only two estimates of the correlation
ˆ ˆ ˆ
function RXX (0) and RXX (T ) . If T  kx , then RXX (T ) → 0 , where kx is the
correlation interval of the analyzed signal. Then G(T , f )Rˆ XX (T ) → 0 , and for (10)
we will have DXX (T , f )  2G(0, f )Rˆ XX (0) . All this increases the computational
efficiency of the estimation of the PSD by the correlogram method.</p>
      <p>The considered algorithm can be implemented as a functionally complete software
module. This module can find application in the composition of the metrologically
significant software of multifunctional systems for operational frequency-time
analysis of signals [26]. The practical use of such a module in integrated software should
increase the efficiency of solving problems requiring the processing of complex
multicomponent signals.</p>
      <p>Acknowledgments. The authors are grateful to the Russian Foundation for Basic
Research (RFBR). This work was supported by the RFBR under initiative research
project No. 19-08-00228-A.
10. Mirskii, G.Ya.: Characteristics of Stochastic Interconnections and Their Measurement (in</p>
      <p>
        Russian). Energoizdat, Moscow (1982)
11. Max, J.: Methodes et techniques de traitement du signal et applications aux mesures
physiques. Tome 1. Principes generaux et methodes classiques. Masson, Paris (1996)
12. Isla, J., Celga, F.: The use of binary quantization for the acquisition of low SNR ultrasonic
signals: a study of the input dynamic range. IEEE Transactions on Ultrasonics,
Ferroelectrics, and Frequency Control 63(
        <xref ref-type="bibr" rid="ref9">9</xref>
        ), pp. 1474–1482 (2016).
doi:10.1109/TUFFC.2016.2571843
13. Qiqing Zhai, Youguo Wang.: Noise effect on signal quantization in an array of binary
quantizers. Signal Processing 152, pp. 265–272 (2018).
https://doi.org/10.1016/j.sigpro.2018.06.010
14. Jing-Dong Diao, Jin Guo, Chang-Yin Sun.: Event-triggered identification of FIR systems
with binary-valued output observations. Automatica 98, pp. 95–102 (2018).
https://doi.org/10.1016/j.automatica.2018.09.024
15. Auber, R., Pouliquen, M., Pigeon, E., M’Saad, M., Gehan, O. Chapon, P.A. Moussay,S.:
Estimation of auto-regressive models for time series using binary or quantized data.
IFACPapersOnLine 51(15), pp. 581–586 (2018). https://doi.org/10.1016/j.ifacol.2018.09.221
16. Yakimov, V.N.: Numerical estimation of a spectral power density (SPD) on the basis of
the signed stochastic quantization of continuous processes (in Russian). Pribory i Sistemy
Upravleniya 12, pp. 60–64 (2001)
17. Yakimov, V.N.: Digital spectral analysis based on sign two-level transformation of
continuous random processes and asymptotically unbiased estimation of the correlation function.
Measurement Techniques 48, pp. 1171–1178 (2005). doi:
https://doi.org/10.1007/s11018006-0040-9
18. Yakimov, V.N.: Digital complex statistical analysis based on sign-function representation
of random processes (in Russian). Izvestia of Samara Scientific Center of the Russian
Academy of Sciences 18, no. 4(
        <xref ref-type="bibr" rid="ref7">7</xref>
        ), pp. 1346–1353 (2016)
19. Yakimov, V.N.: Correlation analysis based on interval representation result of sign-function
for random processes (in Russian). Pribory i Sistemy Upravleniya 11, pp. 61–66 (2001)
20. Yakimov, V.N., Mashkov, A.V.: Digital estimation of correlation function moments using
analog-stochastic sign quantization of a random process. Measurement Techniques 59, pp.
12–15 (2016). doi: https://doi.org/10.1007/s11018-016-0908-2
21. Yakimov, V.N., Susarev, S.V., Mashkov, A.V., Gubanov, N.G. Philimonov, A.B.:
Acoustic diagnostics of pipeline networks based on correlation analysis using binary
analogstochastic quantization. In: XX IEEE International Conference on Soft Computing and
Measurements (SCM), pp. 4–7. IEEE Press, Saint Petersburg (2017). doi:
10.1109/SCM.2017.7970478
22. Fichtenholz, G.M.: A Course of Differential and Integral Calculus (in Russian). Vol. II, 8th
ed., Fizmatlit, Moscow (2003)
23. Prabhu, K. M. M.: Window Functions and Their Applications in Signal Processing. CRC
      </p>
      <p>Press, Taylor &amp; Francis Group, Boca Raton (2014)
24. Poularikas A. D.: The Handbook of Formulas and Tables for Signal Processing. CRC</p>
      <p>Press, IEEE Press, Boca Raton (1999)
25. Allen, Ronald L., Mills, Duncan W.: Signal Analysis: Time, Frequency, Scale, and
Structure. IEEE Press, Wiley-Interscience, Piscataway, New Jersey (2004).
26. Yakimov, V.N., Zaberzhinskij, B.E., Mashkov A.V., Bukanova, Yu.V.: Multi-threaded
Approach to Software High-speed Algorithms for Spectral Analysis of Multi-component
Signals. XXI International Conference Complex Systems: Control and Modeling
Problems, pp. 698–701. IEEE Press, Samara (2019). doi: 10.1109/CSCMP45713.2019.8976669</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Marpl</given-names>
            <surname>Jr.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.L.</given-names>
            :
            <surname>Digital Spectral Analysis: Second Edition. Dover Publications</surname>
          </string-name>
          , Mineola, New York (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Oppenheim</surname>
          </string-name>
          ,
          <string-name>
            <surname>Alan</surname>
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schafer</surname>
          </string-name>
          , Ronald W.:
          <source>Discrete-Time Signal Processing: 3rd Edition</source>
          . Prentice Hall, Upper Saddle River (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Alessio</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          :
          <source>Digital Signal Processing and Spectral Analysis for Scientists: Concepts and Applications</source>
          . Springer, Cham (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Stoica</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moses</surname>
            ,
            <given-names>R.L.</given-names>
          </string-name>
          :
          <article-title>Spectral Analysis of Signals</article-title>
          . Pearson Prentice Hall, Upper Saddle River, New Jersey (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Blahut</surname>
          </string-name>
          , R.E.:
          <article-title>Fast Algorithms for Signal Processing</article-title>
          . Cambridge University Press, New York (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Bi</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeng</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Transforms and Fast Algorithms for Signal Analysis and Representations</article-title>
          . Birkhauser, Boston (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Britanak</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yip</surname>
            ,
            <given-names>P.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rao</surname>
            ,
            <given-names>K.R.</given-names>
          </string-name>
          : Discrete Cosine and Sine Transforms:
          <article-title>General Properties, Fast Algorithms</article-title>
          and Integer Approximations. Academic, Elsevier, Amsterdam, (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Chu</surname>
          </string-name>
          , Ellen W.:
          <article-title>Discrete and Continuous Fourier Transforms: Analysis, Applications and fast Algorithms</article-title>
          . CRC Press, Boca Raton, London, New York (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Madisetti</surname>
            ,
            <given-names>V.K.</given-names>
          </string-name>
          (editor-in-chief):
          <source>The Digital Signal Processing Handbook</source>
          , Second Edition: Digital Signal Processing Fundamentals. Boca Raton, FL: CRC Press (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>