<!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>Method for Recognizing and Processing Complex Signals</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>V. N. Karazin Kharkiv National University</institution>
          ,
          <addr-line>Svobody sq., 4, Kharkiv, 61022</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Yuzhnoye State Design Office</institution>
          ,
          <addr-line>3, Krivorozhskaya St., Dnipro, 49008</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>The methods of processing digital samples of complex structure signals with unknown parameters are considered. With the use of algebraic methods, the following tasks are sequentially solved: clock synchronization, determining the range of carrier frequencies, the multiplicity of phase modulation and obtaining a stream of information bits. The methods for improving the quality of processing digital samples of signals based on solving special overdetermined systems of linear equations are proposed. The estimation of efficiency of the offered method is carried out by an imitation statistical modeling. The advantages of the proposed methods of signal processing for the telecommunications and radio monitoring systems are shown.</p>
      </abstract>
      <kwd-group>
        <kwd />
        <kwd>Orthogonal Frequency Division Multiplexing</kwd>
        <kwd>digital sampling</kwd>
        <kwd>linear algebraic equations</kwd>
        <kwd>correlation convolutions</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The construction of effective information transmission systems is inextricably linked
with the problem of intensifying the usage of the time and frequency-energy resource
of communication channels. One of the ways to solve this problem is using the
complex signals with combined types of modulation in combination with the methods of
spectrum narrowing and noise-resistant coding [1-5]. In this connection, the structure
of the signals used to transmit information is becoming complicated, and,
consequently, the algorithms of their processing are becoming complicated as well [6-11].</p>
      <p>The most promising type of signal code constructions in wireless networks is
OFDM (Orthogonal Frequency Division with Multiplexing) [2-6, 12]. The basic idea
of building such signals is arranging a set of mutually orthogonal frequency
subchannels so that, on the one hand, one subchannel does not interfere with the other, and on
the other hand, the spectra of the subchannels overlap. Due to the orthogonality of the
linear subchannels, each of them can be considered independently of the others.
Errors caused by the interference in one of the subchannels do not lead to errors in the
other. As a result, only a small part of the transmitted information is distorted.
Errorcorrecting coding being used the errors can be corrected [13-18]. The structure of
signals with multiple simultaneously operating subcarrier frequencies has well
established itself in conditions of heterogeneity of the propagation medium. In recent
years, the capabilities of systems with OFDM signals have evolved significantly.
Such signals began to be used in a wide variety of telecommunication systems
operating in different radio frequency bands.</p>
      <p>The complex structure of such signals, the a priori uncertainty of the channel
properties cause significant difficulties in solving the problems of radio control and radio
monitoring. A distinctive feature of such tasks is the absence of data on the structure
and informative parameters of the measured signals. This information should be
obtained from the results of the study, with high accuracy and as soon as possible.
Therefore, the tasks of developing mathematical methods for analyzing complex
signals based on digital measurement sequences are highly relevant.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Mathematical model of OFDM signals</title>
      <p>For correct choice of the methods for digital analysis of the primary parameters of
OFDM signals, a brief description of their basic properties is necessary. Arbitrary
OFDM signal S j t  on j -th modulation interval Tp is formed by algebraic
summation of the several harmonic oscillations of the same amplitude. Each of the
oscillations has m options of modulation phase shift. The value m determines the
multiplicity of the used phase (PM) modulation and corresponds to the base of the
numerical source code. Commonly, m  2k where k is the number of binary symbols (bits)
represented by the elementary signal on one modulation interval. When using relative
phase coding and a unit value of the amplitude of the oscillation subcarriers, the
mathematical model of the signal can be represented as the following sequence:
nf 1   i    t   </p>
      <p>
        S j t   i0 sin 2  f0  T    t  Tp Tp    j,i  ,
where t – current time; f0 – the lowest subcarrier frequency in the signal spectrum;
T  1 f – inverse of the minimum subcarrier spacing f ; n f – the number of
frequencies used ;  j,i – the value of the manipulation angle of i -th fluctuation on j -th
modulation interval. This angle can take one of m values depending on the
manipulation code used. The informative features in the signal described by model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) are
relative phase jumps in carrier frequencies. These jumps are measured for each of the
frequency subcarriers separately:  j,i  j1,i , i  0,, n f 1 . The time parameters
of the modulation interval used in model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) are tied by the relation:
      </p>
      <p>Tp  T  T 
1</p>
      <p>
         T ,
f
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
where T - the duration of the prefix part of the signal. The prefix part (hereinafter –
the prefix) is a repeating (to the exact sign) initial part of the signal added at the end
of the modulation interval Tp . Prefix structure is used to facilitate synchronization in
the presence of channel irregularities. For OFDM synchronization violations the
signal can be correctly received and processed for any segment with the duration of T
within the full modulation interval .. TP ... Commonly, the choice of the prefix
duration on the modulation interval corresponds to the ratio T  0,1 0,5T . The sign
of the prefix depends on the value of the following parameter:
      </p>
      <p>
        P  f0 mod f  .
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
      </p>
      <p>
        For existing OFDM standards, parameter (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) can take two values that determine
the sign of the cyclic prefix: when P  0 the prefix is positive and when P  f 2 –
inverse. Fig. 1 gives a qualitative idea of the form of the signal envelope constructed
in accordance with model (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) on two adjacent modulation intervals with n f  16 and
Tp  1, 47 T . At the end of each of the intervals Tp the inverse cyclic continuation of
the signal with duration T is located, which repeats, up to a sign, the shape of the
initial segment of the signal on the modulation interval. For the example in question
P  f 2 therefore the prefix part is the inverse of the initial part of the signal.
A comprehensive analysis of the properties of complex signals is advisable to
implement on the basis of phased processing. At each stage, only a part of the signal
parameters is determined. Given the fact that OFDM signals contain a prefix, it is
advisable to use the correlation method for determining structural time parameters Tp and
T at the first stage. This technique is based on the principle of "sliding" time
window. This makes it possible to determine the following parameters of an OFDM
signal: the value of the orthogonality interval, the duration of the modulation interval,
and the value of the frequency spacing between the channels.
      </p>
      <p>At the second stage of the analysis, the tasks of determining the number and the
values of service and information channel frequencies, as well as, the signal phase
demodulation.</p>
      <p>The two-stage processing results in the possibility to extract an information flow
from signals of an a priori unknown structure without using traditional fast Fourier
transform algorithms (FFT – Fast Fourier Transformation).
3.1</p>
      <p>Correlation method for determining the time parameters of OFDM
signals
We propose a correlation method for determining structural time parameters Tp
and T . The basis is the "sliding time window" principle. The most probably value of
the time interval between the most correlated segments (with the "+" or "-" sign) of
the segments from the digital sample of signal measurements is determined. The
assessment of Tp – the most likely period of the emergence of "bursts" of correlation in
the process of moving the viewing window on the samples of the array of
measurements Q  q0 , q1, is determined as well. The scheme of the calculation procedure
is presented in Fig. 2. For the correlation analysis the two vectors, each containing K
elements of array Q in two non-overlapping time observation windows of the signal
are formed,</p>
      <p>Y0 = q j ,q j+1 ,…q j+K -1 ,</p>
      <p>Y1 = q jiK , q jiK 1,q ji2K 1,
removed from each other by i, i  0,, M . The position of the second time window
corresponding to the vector Y1 is determined by the successive change in the offset
index i  0,, M that ensures its "slip" along the signal sample Q at each of the
values j  0 L .</p>
      <p>For a wide range of analyzed signals, for example, for the 0.3-3.4 KHz frequency
band with minimum quality ADC, the most universal limits of the values of these
parameters, resulting in a quick and accurate assessment, are K  10  30 ,
M  200  300 and L  1000 .</p>
      <p>At each value of index j (moving the window slip area) the M 1 dimensional
vector is being formed</p>
      <p>
        Vj  v0j , v1j ,, v Mj  ,
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
the elements of which are the coefficients of mutual correlation of vectors Y0 and
Y1 . The calculations (according to the Fig. 2) are performed after centering and
normalizing the vectors by the formulas:
      </p>
      <p>
Y 0N  Y 0 j 



Y1N  Y1j 


1 K 1   1 K 1 1</p>
      <p>Y 0i    Y 0i  ;
K i0   K i0 
1 K 1   1 K 1 1</p>
      <p>Y1i    Y1i  .</p>
      <p>K i0   K i0 
v1j  match min(Vj ), Vj 0  K ;
v2 j  match max(Vj ), Vj 0  K;
j  0 L .</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
      </p>
      <p>The resulting vectors Y0N and Y1N in normalized space have the same length,
equal to К , and the cosine of the angle between these vectors is equal to the
crosscorrelation coefficient:</p>
      <p>K 1
сos(Y0н ,Y1н )  Y 0нi Y1нi  r(Y0н ,Y1н ) .</p>
      <p>i0</p>
      <p>Since the prefix is a repetitive (up to sign) part of the OFDM signal, ideally the
correlation coefficient between these parts is ± 1.</p>
      <p>
        Fig. 3 shows the distribution of the values of the elements of the vector Vj
calculated according to a specific implementation OFDM signal (16 carrier frequencies, a
modulation rate – 75 bauds) at M  200 . The presence of pronounced extreme values
which are close in magnitude to unity is obvious. According to the results of
calculations when j  0 L the two new vector V1  v10 , v11,, v1L and
V2  v20 , v21,, v2L  are formed. Their elements are calculated according to the
rules:
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
      </p>
      <p>
        Here the function match x, X calculates the indices of the elements of the vector
X equal to x , where the index 0 in the function (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ) indicates a selection of the
element with a minimum sequence number, if there are several such elements in the
vector. The elements of the vector V1 represent the number of sampling intervals that
fit between the initial elements Y0 and Y1 with minimal (negative) correlation on
j -th step of moving the observation window. Accordingly, the elements of the vector
V2 are calculated for the maximum (positive) correlation of the vectors Y0 and Y1 .
Simultaneous determination of the maximum and minimum is necessary to reveal the
value of function (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ). It is obvious that the elements of the vectors V1 and V2
defined by expression (
        <xref ref-type="bibr" rid="ref8">8</xref>
        ), can take values only in the range K  K  M . To study the
statistical distribution of the values of the elements the histograms for the elements of
the vectors V1 and V2 are formed:
0.5
      </p>
      <p>1</p>
      <p>
        Obtaining distributions (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) gives an opportunity to estimate the most likely value
Num – the number of sampling intervals between the initial measurements of the
segments of the digital sample Q with maximal (positive or negative) correlation:
      </p>
      <p>The value Num determines the number of sampling intervals that fit on the
orthogonality interval of the signal T . It gives an opportunity to find two interrelated
OFDM signal parameters: the orthogonality interval and the minimum carrier
frequency spacing:</p>
      <p>matchmaxmHa1x maHx1H2,H10 ;
Num  </p>
      <p>matchmaxmHa1xmHax2H ,2H20 .</p>
      <p>T  Num and f  T 1 .</p>
      <p>fд</p>
      <p>
        Besides, choosing the corresponding method of detecting the Num value according
to the condition specified in (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) automatically determines the value of the function
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), and, consequently, the ratio between the frequency parameters f0 and f . If the
value Num is determined by the first line of expression (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ), then f0   k  1   f .
 2 
Otherwise the minimal carrier frequency is multiple to the spacing of the carrier
frequencies: f0  k  f where k – any positive integer.
      </p>
      <p>
        As a result of processing histograms (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) according to (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) based on the values of
function (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), only one of the vectors V1 or V2 is left for the further analysis,
hereinafter denoted V* . This is possible because the prefix repetition sign is defined. Based
on the elements of the vector V* another vector V3 is formed for the analysis:
V3  match Num, V*  .
(
        <xref ref-type="bibr" rid="ref12">12</xref>
        )
      </p>
      <p>The elements of this vector are equal to the numbers of the elements of the vector
V* in which the numbers Num are located. The feature of the vector V* provided
that the analyzed signal belongs to the OFDM class, is that it contains a sequence of
periodic series of numbers which are close or equal to Num . Therefore, the values of
the elements of V3 in order of increasing their indices will be the segments (series)
of an ordinary positive integer sequence with some gaps in the sequence. Small gaps
can be observed inside the series too. A possible approximation of the sequence of the
elements of V3 is illustrated by the following expression:</p>
      <p> 
V3  11,12,14,15,16 ,105,107,108,110 ,, 620, 621, 622, 623, 624 .</p>
      <p>series №1 series №2  series№nc </p>
      <p>The length of series of consecutive numbers (position numbers) may differ due to
measurement errors, features of the signal envelope and rounding during calculations.
However, when the vector length is sufficient, averaging results converges to the true
estimation in accordance with the law of large numbers. To exclude "fragmentation"
of the series, small gaps between adjacent numbers of the series must be ignored. It
has been empirically found that in most cases the number Ni should be considered to
belong to the current series of numbers if Ni  Ni1   where   3  5 . In general,
the structure of the vector V3 can be depicted as shown in Fig. 4.
 v30, , v3k1 , v3n2, , v3k2 , , v3nnc 1, , v3knc 1 , v3nnc , , v3knc 
 series № 1 series № 2 series №  nc 1 series № nc </p>
      <p>Fig. 4. Example of the V 3 series structure</p>
      <p>In Fig. 4: v3nj , v3k j – initial and final elements of the j -th series of the
consecutive numbers in the vector V3 ; nc – the total number of the identified series. Using
the presented structure and values of the elements of the vector V3 , it is possible to
determine the number of sampling intervals that fit between adjacent pairs of
mutually correlated segments of signal measurements, i.e. a period of "bursts" of
correlation:</p>
      <p>Num1 
v3knc1  v3k2   v3n</p>
      <p>nc1
2 nc  2</p>
      <p> v3n2  .</p>
      <p>Tp </p>
      <p>Num1
fд</p>
      <p>, W  Tp1 .</p>
      <p>Using the obtained value Num1 , we can determine the average value of the
modulation interval Tp and, therefore, the average modulation rate W :</p>
      <p>For the final determination of the time-frequency structure of the signal, we must
find the number of carrier frequencies n f and the vector of their nominal values
F   f0 ,, fnf 1 . This can be done on the basis of previously obtained values
Tp , T , f when the position of the element of the array Q corresponding to the
beginning of the first full modulation interval is determined correctly. The beginning of
a reliably identified clock interval could be most correctly associated with the
beginning of the second series of maximal responses of correlators in the vector V3 , since,
due to the randomness of the beginning of the observation, the first series may be
incomplete. It should be taken into account that the beginning of a series of maximal
responses of correlation of the segments from K samples must appear before the next
modulation interval actually begins. Therefore, to fall within the interval with the
duration Tp (taking into account that demodulation can be performed on any
segment T within Tp ) it is necessary to add the number K 2 to the starting sample, at
least. Then the beginning of the modulation interval can be assumed to coincide with
the next element number in the sequence</p>
      <p>
          fд  K 
nT0  round v3n2 mod  W   2  .
(
        <xref ref-type="bibr" rid="ref15">15</xref>
        )
      </p>
      <p>
        Here round  x – the rounding function to the nearest integer. The lowest possible
frequency f0 in the group of carrier frequencies is determined by the value of
function (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) and the fulfillment of the corresponding condition in (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ):
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
(
        <xref ref-type="bibr" rid="ref14">14</xref>
        )
(
        <xref ref-type="bibr" rid="ref17">17</xref>
        )
 1
 f , max H1  max H2;
f0   2
f , max H1  max  H2.
      </p>
      <p> Fef  f0  1 .</p>
      <p>
n f max  round </p>
      <p> f </p>
      <p>The maximal number of subcarrier frequencies (or half the number of quadrature
components) that can fit in the channel band Fef is
3.2</p>
      <p>
        Determining the amount and nominal values of subcarrier frequencies of
OFDM signals
The correlation method, considered above, allows making a reliable assessment of the
main structural parameters of OFDM – T and TP . The value of f  T 1 uniquely
defines the spacing of adjacent subcarrier frequencies. The minimal value of the
subcarrier frequency and the maximal possible number of subcarriers placed within the
signal bandwidth n f max are determined from (
        <xref ref-type="bibr" rid="ref16">16</xref>
        ) and (
        <xref ref-type="bibr" rid="ref17">17</xref>
        ).
      </p>
      <p>The number of samples N taken into account when analyzing a signal on one
modulation interval, as well as, the harmonic quadrature 2  n f max  define the
dimensions of the matrix of the linear algebraic equations system (SLAE) which can be
compiled and solved to estimate the frequency range. Depending on the ratio of the
vertical and horizontal dimensions of the matrix of coefficients, the system of
equations can be overdetermined  N  2  n f max  , determined  N  2  n f max  or
underdetermined</p>
      <p>
         N  2  n f max  . The simplest one is the  N  2  n f max  case because
then the SLAE is a joint one almost every time. The number of equations that
matches the number of used elements of the digital sample Q equals to the number
of unknowns 2  n f max  determining the amplitudes of quadrature components in the
spectrum of carrier frequencies OFDM. For the correct solution of SLAU
2  n f max  uniformly spaced sample counts Q starting from the point of beginning
of the observation of the first complete clock interval of signal nT0 should be selected
on i -m modulation interval. For this the following rule is used:
nTi  nT0  round i   where   TP tд .
(
        <xref ref-type="bibr" rid="ref18">18</xref>
        )
      </p>
      <p>Square matrix of coefficients for unknown SLAE with size 2  n f max   2  n f max 
composed for quadrature components of subcarrier frequencies is formed according to
the rule:</p>
      <p>A1  ai, j , i, j  0, , 2  n f max 1;</p>
      <p> 2  f0  j  f  , j  0, , n f max , ti  nTi  i  tд .</p>
      <p>The column-matrix of free members is formed as a vector of signal measurements
on the duration of one orthogonality interval:</p>
      <p>B1  b0 ,, b2nf max 1 ; bi  qi , i  tд  TPi .</p>
      <p>Normal solution of normally defined SLAE</p>
      <p>A1  X1  B1
</p>
      <p>X1  A11  B1
gives an estimation of the amplitude vector of quadrature components
X1  x10 ,, x12nf max 1  which corresponds to the permissible values of carrier
frequencies.</p>
      <p>On the basis of this solution, it is possible to determine the power distribution
vector of the signal between the harmonic oscillations of the carrier frequencies:
Y  y0 ,, ynf max 1 , yi   xi1 2   xinf max  </p>
      <p> 1 2 , i  0, , n f max 1 .</p>
      <p>The case of insufficiently defined SLAE  N  2  n f max  is interesting for
analyzing small samples of the signal. To solve such a SLAE, the pseudo inverse matrix
method Moore-Penrose can be used. It is known that there is the normal solution of an
underdetermined SLAE and is the only one. It is found by: X1  A1  B1 where A1
– Moore-Penrose pseudo inverse matrix of size 2  n f max  2  n f max which is
determined by the ratio: A1  A1  A1  A1 . In practice A1 can be found by the formula:
A1  C  D  C  (C  C )1  (D  D )1  D .</p>
      <p>
        The representation of the matrix A1 in the form of a product of two matrices with
the size of N  r and r  N is used:
(
        <xref ref-type="bibr" rid="ref19">19</xref>
        )
(
        <xref ref-type="bibr" rid="ref20">20</xref>
        )
(
        <xref ref-type="bibr" rid="ref21">21</xref>
        )
(
        <xref ref-type="bibr" rid="ref22">22</xref>
        )
 d1,1
A1  D  C   
 dN ,1



d1,r   c1,1
      </p>
      <p>    
aN ,r   cr,1



c1,N 
  .</p>
      <p>
cr,N </p>
      <p>With various skeletal decompositions of the matrix A the same solution for A
which can be written in the form: X1  A1  B1 is derived. It is a pseudo solution
giving a zero residual: X  A1  B1  0 .</p>
      <p>1</p>
      <p>The case of  N  2  n f max  is the most advantageous for the maximal recording of
signal information on the modulation interval. Due to using additional signal
measurements from the sample Q the system which contains more equations with the
same number of unknowns is formed. To form the matrix A2 and the vector B2 the
maximal number of signal measurements determined by Num  TP tд on the
duration TP is used:</p>
      <p>A2  ai, j , i  0, , (Num 1), j  0... 2  n f max 1;</p>
      <p>B2  b0 , , bNum1, bk  qk , k  0, ,  Num 1.</p>
      <p>SLAE has the form:</p>
      <p>A2  X2  B2 ,
X*  (A2T  A2 )1 A2T  B2 .</p>
      <p>2
and as a rule, has many solutions. To select the only one we need to use some criteria.
In practice, the maximum likelihood criterion is used more often. In the case of a
normal distribution of the vector B2 it is equivalent of the least square’s criterion:</p>
      <p>
        An approximate solution of system (26) gives a more accurate result than a strict
solution of (25). The noise immunity of the solution is achieved by averaging the
disturbing effect of interference when the number of signal measurements exceeds the
required minimum. The obtained vector of amplitudes of the quadrature components
X*2 , as well as X*1 gives a possibility to calculate the power distribution signal in
carrier frequencies using expression (
        <xref ref-type="bibr" rid="ref22">22</xref>
        ), wherein xi2 is used instead of xi1 .
      </p>
      <p>
        For any type of SLAE determining the actual list of carrier frequencies in the
OFDM spectrum is performed by comparing the elements of power distribution
histograms with a threshold value. The obtained nominal values of frequencies determine
(
        <xref ref-type="bibr" rid="ref23">23</xref>
        )
(24)
(25)
(26)
the last structural time-frequency parameter of the analyzed signal – the vector of
working subcarrier frequencies F .
      </p>
      <p>Thus, the previously obtained signal parameters Tp , T , f , W and the obtained in
this subsection vector F identifies completely its structural properties and makes
signal demodulation possible.
4</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusions</title>
      <p>The considered statistical method for analyzing the structure and demodulation of
OFDM signals under conditions of a priori uncertainty of solving radio monitoring
tasks has been practically tested. It has demonstrated the high accuracy of parameter
identification. The relatively low computational complexity of correlation and
algebraic analysis makes it possible to identify the structure and the parameters of signals
practically in seconds.</p>
      <p>The noise immunity of the analysis is achieved by solving a SLAE with
rectangular overdetermined matrixes of coefficients. To eliminate phase errors generated by
asynchronous, with respect to the clock intervals of modulation, sampling the method
for calculating phase corrections which takes into account the time-frequency
parameters of the signal structure is proposed. The application of the phase correction
method provides ideal conditions for identifying the modulation type of subcarrier
oscillations. Mathematical formalization of solving the problem of determining the
modulation multiplicity, based on generating the multimodal reference functions and
sequential calculating the degree of mutual correlation, allows us completely
automate the process of identifying the secondary parameters which are necessary for
demodulating the signals of subcarrier frequencies.</p>
      <p>The further researches can be focused on the generalization of the method for any
structures of mono and poly frequency signals including those with a linear frequency
modulation and also proposed author’s method can be used in some different other
areas [19-23].</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Golomb</surname>
            ,
            <given-names>B.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gong</surname>
          </string-name>
          , G.:
          <article-title>Signal Design for Good Correlation for Wireless Communication, Cryptography and Radar</article-title>
          . University of Southern California, University of Waterloo, Ontario (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Shulze</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luders</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Theory and Applications of OFDM and CDMA</article-title>
          , John Wiley &amp; Sons, Ltd. (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Mignone</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morello</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>CD3-OFDM: A Novel Demodulation Scheme for Fixed and Personal Receivers</article-title>
          .
          <source>IEEE Transactions on Communications</source>
          ,
          <year>1996</year>
          , vol.
          <volume>44</volume>
          , pp.
          <fpage>1144</fpage>
          -
          <lpage>1150</lpage>
          . (
          <year>1996</year>
          ) doi:10.1109/26.536920
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cimini</surname>
            ,
            <given-names>L.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sollenberger</surname>
            ,
            <given-names>N.R.</given-names>
          </string-name>
          :
          <article-title>Robust Channel Estimation for OFDM Systems with Rapid Dis persive Fading Channels</article-title>
          .
          <source>IEEE Transactions on Communications</source>
          ,
          <year>1998</year>
          , vol.
          <volume>46</volume>
          (
          <issue>7</issue>
          ), pp.
          <fpage>902</fpage>
          -
          <lpage>915</lpage>
          . (
          <year>1998</year>
          ) doi:10.1109/26.701317
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A novel channel estimation method for OFDM mobile communication systems based on pilot signals end transform - domain processing</article-title>
          .
          <source>In: Proc. VTC</source>
          vol
          <volume>33</volume>
          IEEE 47th,
          <year>1997</year>
          , pp.
          <fpage>2089</fpage>
          -
          <lpage>2093</lpage>
          . (
          <year>1997</year>
          ) doi:10.1109/VETEC.
          <year>1997</year>
          .605966
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giridhar</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Enhancement in Spectral Efficiency using Transmit-side Channel Shortener for MISO-OFDM Systems</article-title>
          .
          <source>IEEE Signal Processing Letters</source>
          ,
          <year>2014</year>
          , vol.
          <volume>21</volume>
          (
          <issue>6</issue>
          ), pp.
          <fpage>712</fpage>
          -
          <lpage>716</lpage>
          . (
          <year>2014</year>
          ) doi:10.1109/LSP.
          <year>2014</year>
          .2313885
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Karpenko</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sai</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stasev</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Discrete Signals with Multi-Level Correlation Function</article-title>
          .
          <source>Telecommunications and Radio Engineering</source>
          ,
          <year>2012</year>
          , vol.
          <volume>71</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>91</fpage>
          -
          <lpage>98</lpage>
          . (
          <year>2012</year>
          ) doi:10.1615/TelecomRadEng.v71.
          <year>i1</year>
          .
          <fpage>100</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Beaulieu</surname>
            ,
            <given-names>N.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Young</surname>
            ,
            <given-names>D.J.</given-names>
          </string-name>
          :
          <article-title>Statistical and intuitive nonlinear signal processing designs for multiuser interference mitigation in UWB systems</article-title>
          .
          <source>In: 2012 11th International Conference on Information Science, Signal Processing and their Applications (ISSPA)</source>
          , Montreal, QC,
          <year>2012</year>
          , pp.
          <fpage>243</fpage>
          -
          <lpage>252</lpage>
          . (
          <year>2012</year>
          ) doi:10.1109/ISSPA.
          <year>2012</year>
          .6310554
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Naumenko</surname>
            ,
            <given-names>N.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stasev</surname>
            ,
            <given-names>Y.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          :
          <article-title>Methods of synthesis of signals with prescribed properties</article-title>
          .
          <source>Cybernetics and Systems Analysis</source>
          ,
          <year>2007</year>
          , vol.
          <volume>43</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>321</fpage>
          -
          <lpage>326</lpage>
          . (
          <year>2007</year>
          ) doi:10.1007/s10559-007-0052-8
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Mallik</surname>
            ,
            <given-names>R.K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murch</surname>
            ,
            <given-names>R.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehra</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Signal Design for Multiple Antenna Systems with Spatial Multiplexing and Noncoherent Reception</article-title>
          .
          <source>IEEE Transactions on Communications</source>
          ,
          <year>2015</year>
          , vol.
          <volume>63</volume>
          (
          <issue>4</issue>
          ), pp.
          <fpage>1245</fpage>
          -
          <lpage>1258</lpage>
          . (
          <year>2015</year>
          ) doi:0.1109/TCOMM.
          <year>2015</year>
          .2403831
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Stasev</surname>
            ,
            <given-names>Y.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nosik</surname>
            ,
            <given-names>A.M.:</given-names>
          </string-name>
          <article-title>Formation of pseudorandom sequences with improved autocorrelation properties</article-title>
          .
          <source>Cybernetics and Systems Analysis</source>
          ,
          <year>2007</year>
          , vol.
          <volume>43</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          . (
          <year>2007</year>
          ) doi:10.1007/s10559-007-0021-2
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Jang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Choi</surname>
          </string-name>
          , H.:
          <article-title>Enhanced channel estimation for OFDM systems with multiple transmit antennas</article-title>
          .
          <source>In: 2009 15th Asia-Pacific Conference on Communications, Shanghai</source>
          ,
          <year>2009</year>
          , pp.
          <fpage>402</fpage>
          -
          <lpage>405</lpage>
          . (
          <year>2009</year>
          ) doi:10.1109/APCC.
          <year>2009</year>
          .5375606
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>MacWilliams</surname>
            ,
            <given-names>F.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sloane</surname>
            ,
            <given-names>N.J.A.</given-names>
          </string-name>
          :
          <article-title>The Theory of Error-Correcting Codes</article-title>
          . North Holland Publishing Co.
          <article-title>(</article-title>
          <year>1977</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Clark</surname>
            ,
            <given-names>G.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cain</surname>
            ,
            <given-names>J.B.</given-names>
          </string-name>
          :
          <article-title>Error-Correction Coding for Digital Communications</article-title>
          . Springer US (
          <year>1981</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Brejza</surname>
            ,
            <given-names>M.F.</given-names>
          </string-name>
          et al.:
          <article-title>Exponential Golomb and Rice Error Correction Codes for Generalized Near-Capacity Joint Source and Channel Coding</article-title>
          .
          <source>IEEE Access</source>
          ,
          <year>2016</year>
          , vol.
          <volume>4</volume>
          , pp.
          <fpage>7154</fpage>
          -
          <lpage>7175</lpage>
          . (
          <year>2016</year>
          ) doi:10.1109/ACCESS.
          <year>2016</year>
          .2584982
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Serhiienko</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Prokopovych-Tkachenko</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Construction of cascade codes in the frequency domain</article-title>
          . In: 2017 4th
          <string-name>
            <given-names>International</given-names>
            <surname>Scientific-Practical Conference</surname>
          </string-name>
          Problems of Infocommunications. Science and
          <string-name>
            <surname>Technology (PIC S&amp;T)</surname>
          </string-name>
          ,
          <year>Kharkov</year>
          ,
          <year>2017</year>
          , pp.
          <fpage>131</fpage>
          -
          <lpage>136</lpage>
          . (
          <year>2017</year>
          ) doi:10.1109/INFOCOMMST.
          <year>2017</year>
          .8246366
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Stepanov</surname>
            ,
            <given-names>A.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matveev</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          :
          <article-title>Methods of computer signal processing</article-title>
          . Moscow: SOLON-Press (in Russian) (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Tikhonov</surname>
            ,
            <given-names>A.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arsenin</surname>
            ,
            <given-names>V.A.</given-names>
          </string-name>
          :
          <article-title>Methods for solving ill-posed problems</article-title>
          , Moscow: Science (in Russian) (
          <year>1979</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Kavun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Conceptual fundamentals of a theory of mathematical interpretation</article-title>
          .
          <source>Int. J. Computing Science and Mathematics</source>
          ,
          <year>2015</year>
          , vol.
          <volume>6</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>107</fpage>
          -
          <lpage>121</lpage>
          . (
          <year>2015</year>
          ) doi:10.1504/IJCSM.
          <year>2015</year>
          .069459
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Kavun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Indicative-geometric method for estimation of any business entity</article-title>
          .
          <source>Int. J. Data Analysis Techniques and Strategies</source>
          ,
          <year>2016</year>
          , vol.
          <volume>8</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>87</fpage>
          -
          <lpage>107</lpage>
          . (
          <year>2016</year>
          ) doi: 10.1504/IJDATS.
          <year>2016</year>
          .077486
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Kovtun</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kavun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zyma</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Co-Z Divisor Addition</surname>
          </string-name>
          <article-title>Formulae in Homogeneous Representation in Jacobian of Genus 2 Hyperelliptic Curves over Binary Fields</article-title>
          .
          <source>International Journal Biomedical Soft Computing and Human Sciences</source>
          ,
          <year>2012</year>
          , vol.
          <volume>17</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>37</fpage>
          -
          <lpage>43</lpage>
          . (
          <year>2012</year>
          ) doi:10.24466/ijbschs.17.2_
          <fpage>37</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Zamula</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kavun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Complex systems modeling with intelligent control elements</article-title>
          .
          <source>Int. J. Model. Simul. Sci. Comput</source>
          .,
          <year>2017</year>
          , vol.
          <volume>08</volume>
          (
          <issue>01</issue>
          ). (
          <year>2017</year>
          ) doi:10.1142/S179396231750009X
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Kavun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zamula</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikheev</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Calculation of expense for local computer networks</article-title>
          .
          <source>In: Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&amp;T)</source>
          ,
          <year>2017</year>
          4th International, Kharkiv, Ukraine,
          <year>2017</year>
          , pp.
          <fpage>146</fpage>
          -
          <lpage>151</lpage>
          . (
          <year>2017</year>
          ) doi:10.1109/INFOCOMMST.
          <year>2017</year>
          .8246369
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>