Next Article in Journal
Human Gender Classification Using Transfer Learning via Pareto Frontier CNN Networks
Previous Article in Journal
i-Sustainability Plus Theory as an Innovative Path towards Sustainable World Founded on Blue-Green Ubiquitous Cities (Case Studies: Denmark and South Korea)
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Current Spectrum Formation of a Non-Periodic Signal: A Differential Approach

1
Computer Technologies and Information Security Faculty, Rostov State University of Economics, 69, Bolshaya Sadovaya, 344002 Rostov-on-Don, Russia
2
Computer Systems and Information Security Department, Don State TechFigurnical University, 1, Gagarin square, 344000 Rostov-on-Don, Russia
3
Automotive Faculty, Voronezh State University of Forestry and Technologies named after G.F. Morozov, 8, Timiryazeva, 394087 Voronezh, Russia
*
Author to whom correspondence should be addressed.
Inventions 2020, 5(2), 15; https://doi.org/10.3390/inventions5020015
Submission received: 21 December 2019 / Revised: 9 February 2020 / Accepted: 31 March 2020 / Published: 6 April 2020

Abstract

:
The paper deals with the problem of forming spectra of non-periodic signals in real-time. The disadvantage of the existing approaches is the dependence of the formed spectrum on time as a parameter and the possibility of obtaining the signal spectrum in its original definition only for a fixed time, as well as a high amount of computation. In this regard, a computationally efficient algorithm is proposed for forming a spectrum of non-periodic functions on a time interval that is constantly updated with a given sampling step, which ensures the invariance of the generated spectrum to time as a parameter. The algorithm is based on obtaining differential equations that are based on generalized differentiation with respect to a variable time interval of spectral components and their solving while using the fourth-order Runge–Kutta method. A numerical simulation of the developed algorithm was performed using the MATLAB mathematical modeling package using the example of a substantially non-linear function. Based on the practical results, a comparative evaluation of computational and time complexity has been performed in solving the problem. Based on the obtained experimental results, it is concluded that it is possible to effectively use the proposed algorithm to calculate the current spectrum of non-periodic functions with the requirement of small sampling steps, i.e., when calculating the spectrum in real-time.

1. Introduction

The analysis of the spectra of current physical processes in real time is one of the most important tasks of signal processing [1,2,3]. This problem is relevant, not only in the analysis of various control and communication systems, but it also finds wide application in navigation systems, seismology, astronomy, and others.
Presently, this problem is solved either by calculating the Fourier transform for function f(t) with a variable upper limit of integration [4,5,6], or the classical Fourier-series expansion [7,8,9] on a time interval Ti (Ti = Ti+1 + ΔT; i = 1, 2, …) constantly updated with a given sampling interval ΔT:
f ( t ) = a 0 2 + k = 1 a k c o s k 2 π T i t + b k s i n k 2 π T i t , a k = 2 T i 0 T i f ( t ) c o s k 2 π T i d t , b k = 2 T i 0 T i f ( t ) s i n k 2 π T i d t , k = 0 , 1 , 2 , .
In the first case, the spectrum that formed depends on time as a parameter, thus obtaining the signal spectrum in its classical definition (that is, independent of time) is possible only at a fixed t. In the second case, there is a large amount of computational costs [9] to reduce which methods of discrete transformation, such as Fast Fourier Transform (FFT) [2,10,11], are widely used. The amount of FFT calculations that require ~Nlog2N multiplication operations [10,12] is somewhat reduced as compared to traditional conversion. This does not radically change the situation, since, when calculating the current spectrum, this number of multiplication operations must be performed at each new time step with a constantly increasing time interval. Such shortcomings of both approaches create significant difficulties in their practical use.

2. Theoretical Assumptions

2.1. Task Definition

In this regard, there is a need to develop such an algorithm for calculating the spectrum of non-periodic functions on a time interval that was updated with a given sampling interval, which, on one hand, does not require large computational costs and, on the other hand, provides the formation of the spectrum in its original–classical, definition (1).

2.2. Task Solution

For the construction of this algorithm, the variations Δ a k and Δ b k of spectral coefficients ak and bk that are caused by a change in the time interval Ti by the value ΔT are preliminarily found. Using the equation of generalized differentiation by variable Ti (Leibniz formula), we have for the corresponding spectral components:
a k T i = 2 T i 2 0 T i f ( t ) cos k 2 π T i t d t + 2 T i ( 2 π k T i 2 0 T i f ( t ) t sin k 2 π T i t d t + f ( T i ) cos k 2 π T i T i ) , b k T i = 2 T i 2 0 T i f ( t ) sin k 2 π T i t d t + 2 T i ( 2 π k T i 2 0 T i f ( t ) t cos k 2 π T i t d t + f ( T i ) sin k 2 π T i T i ) .
Considering further that
a k k = 2 T i 2 π T i 0 T i f ( t ) t sin k 2 π T i t d t , b k k = 2 T i 2 π T i 0 T i f ( t ) t cos k 2 π T i t d t ,
Equation (2) is written as
a k T i = 1 T i a k k T i a k k + 2 T i f ( T i ) , b k T i = 1 T i b k k T i b k k .
Since k changes discretely in increments of one, an approximation is possible a k k = a k a k 1 , b k k = b k b k 1 , which allows us to finally write the differential equations that describe the dynamics of changes in spectral coefficients, as follows:
a k T i = 1 T i [ ( 1 + k ) a k k a k 1 ] + 2 T i f ( T i ) , b k T i = 1 T i [ ( 1 + k ) b k k b k 1 ] .
The search for the solution of differential Equation (5) under known initial conditions leads to the formulation of the Cauchy problem, where the initial conditions are: T 0 = T i 1 is the end time of the previous time interval, a 0 = a i 1 and b 0 = b i 1 are the coefficients that are calculated on the previous interval according to the Equation (1).
In practice, the most common method for solving ordinary differential equations   y ˙ = q ( x , y ) is the fourth-order Runge–Kutta method [13,14,15]. In this case, each step calculates the value of the function   q ( x , y ) of the right side four times; each value   y [ i + 1 ] is obtained based on the previous one, according to the equation:
y [ i + 1 ] = y [ i ] + Δ y [ i ] ,
where
  Δ y [ i ] = h / 6 ( K 1 + 2 K 2 + 2 K 3 + K 4 ) ; K 1 = q ( x [ i ] , y [ i ] ) ; K 2 = q ( x [ i ] + h / 2 , y [ i ] + h K 1 / 2 ) ; K 3 = q ( x [ i ] + h / 2 , y [ i ] + h K 2 / 2 ) ; K 4 = q ( x [ i ] + h , y [ i ] + h K 3 ) ;
h is the size of the grid step according to the argument x.
When calculation spectral coefficients ak and bk in Equation (5) in this scheme, the argument x[i] is the variable Ti, the argument y[i] is the coefficients ak[i], bk[i]. Consequently, the calculation procedure takes the form:
K a 1 = ( 1 + k ) a k [ i ] k a k 1 [ i ] T i + 2 T i f ( T i ) , K a 2 = ( 1 + k ) ( a k [ i ] + h K 1 a 2 ) k ( a k 1 [ i ] + h K 1 a 2 ) T i + h 2 + 2 T i + h / 2 f ( T i + h / 2 ) ,   K a 3 = ( 1 + k ) ( a k [ i ] + h K 2 a 2 ) k ( a k 1 [ i ] + h K 2 a 2 ) T i + h / 2 + 2 T i + h / 2 f ( T i + h / 2 ) ,   K a 4 = ( 1 + k ) ( a k [ i ] + h K 3 a ) k ( a k 1 [ i ] + h K 3 a ) T i + h + 2 T i + h f ( T i + h ) , Δ a k [ i ] = h / 6 ( K a 1 + 2 K a 2 + 2 K a 3 + K a 4 ) , a k [ i + 1 ] = a k [ i ] + Δ a k [ i ] ; K b 1 = ( 1 + k ) b k [ i ] k b k 1 [ i ] T i , K b 2 = ( 1 + k ) ( b k [ i ] + h K 1 b 2 ) k ( b k 1 [ i ] + h K 1 b 2 ) T i + h / 2 , K b 3 = ( 1 + k ) ( b k [ i ] + h K 2 b 2 ) k ( b k 1 [ i ] + h K 2 b 2 ) T i + h / 2 , K b 4 = ( 1 + k ) ( b k [ i ] + h K 3 b ) k ( b k 1 [ i ] + h K 3 b ) T i + h , Δ b k [ i ] = h / 6 ( K b 1 + 2 K b 2 + 2 K b 3 + K b 4 ) , b k [ i + 1 ] = b k [ i ] + Δ b k [ i ] .
The accuracy of the solution of which is largely influenced by the value of the step h of the grid, a numerical estimate of the accuracy of determining the dynamics of changes in the spectral coefficients, given below, was made to analyse the computational efficiency of the obtained equations.

3. Results

3.1. Experimental Design

The numerical simulation of the developed algorithm was carried out using the MATLAB (The MathWorks, Inc., USA) mathematical modeling package, which allows for additionally estimating the time costs for the solution. To assess the accuracy of the proposed algorithms, three essentially nonlinear functions were considered as a test function:
f ( t ) = sin ( t ) 1 + 2 cos 2 2 t e 0.015 t ;   f 2 ( t ) = sin 2 t + 2 e 0.05 t ; f 3 ( t ) = ( 0.5 t + cos ( t ) ) e 0.2 t .
The spectra of this function were constructed for time intervals T0 = 50.1 s and T0 = 51.0 s both using classical integral transformations (1) to form the reference spectra and while using the proposed algorithm for the sampling interval ΔT = 0.001 s. The grid step h for the Runge–Kutta algorithm was assumed to be equal h = 0.0001.
The evaluation of the comparative results of modeling the values of spectral coefficients ak[i] and bk[i] obtained using the integral transformation (1) and the proposed algorithm was carried out according to the following criteria:
  • By graphical representation of calculated coefficients and reconstructed signals;
  • On the Central Processing Unit (CPU) time during calculations;
  • Relative performance, defined as the percentage of the difference between the time estimates of calculations performed using the classical (see Equation 1) and the developed algorithms, and the time of calculation using the classical algorithm; and,
  • Based of the standard deviations analysis of the spectral coefficients values ak[i] and bk[i] calculated by the above algorithm from the reference values akr[i] and bkr[i] calculated by the integral transformation (1).
The estimation of the CPU operation time during the calculations was made on the personal computer Intel Core i5-2500 3.30 GHz.

3.2. Numerical Modelling

Figure 1 shows the graphical results of modeling the spectral coefficients akr[i] and bkr[i] (solid line), ak[i] and bk[i] (dotted line) that were obtained using the traditional and the proposed algorithms for the function f1(t) in the time interval T0 = 50.1 s, respectively.
The CPU operating time in the calculation using the integral transformation (1) was 1.7188 s, in the calculation according to the proposed algorithm −0.0625 s. The relative performance of the proposed algorithm in this case amounted to 96.4%. The mean square deviations of the spectral coefficients were: for the coefficients ak[i] s1 = 0.0020; and, for the coefficients bk[i] s2 = 0.0018.
The time signals for the f1(t) function that was reconstructed from the received spectra are shown in Figure 2. Here, a solid line shows the restored signal for 50.1 s, as calculated from the spectrum that was obtained using the integral transformation (1), and dotted line from the spectrum obtained using the proposed algorithm.
At this time interval (for 102 time samples of the current spectrum formation), the coincidence of the spectral coefficients ak[i] and bk[i] calculated by the proposed algorithm with the reference values akr[i] and bkr[i] calculated by the integral transformation (1), as well as the restored signals, is almost complete, as can be seen from the simulation results. At the same time, the time spent on the process of calculating the current spectrum in the proposed algorithm decreased by more than 96% when compared to the classical one.
Figure 3 shows the graphical results of modeling the spectral coefficients akr[i] and bkr[i] (solid line), ak[i] and bk[i] (dotted line) that were obtained using the traditional and the proposed algorithms for the function f1(t) in the time interval T0 = 51.0 s, respectively.
The CPU operating time in the calculation using the integral transformation (1) was 1.8750 s, in the calculation according to the proposed algorithm −0.3594 s. The relative performance of the proposed algorithm in this case amounted to 80.8%. The mean square deviations of the spectral coefficients were: for the coefficients ak[i] s1 = 0.0147; and, for the coefficients bk[i] s2 = 0.0089.
The time signals for the f1(t) function reconstructed from the obtained spectra are shown in Figure 4. Here, a solid line shows the recovered signal for 51.0 s, calculated from the spectrum obtained using the integral transformation (1), and dotted line from the spectrum that was obtained using the proposed algorithm.
At this time interval T0 = 51.0 s (for 103 time samples of the current spectrum formation), the coincidence of the spectral coefficients that were calculated by the given algorithm with the reference ones, as well as the reconstructed signals, has somewhat deteriorated when compared to the previous time interval, which is due to the accumulation of step-by-step calculation errors in the proposed recurrent algorithm. However, nevertheless, the time spent on the process of calculating the current spectrum in the proposed algorithm was still more than 80% less as compared to the classical one.
Since the proposed algorithm shows fairly stable results for small time intervals, the results of numerical simulation for the f2(t) and f3(t) functions are immediately presented for the time interval T0 = 51.0 s, after which a generalized evaluation of the results for all three functions for the time intervals T0 = 50.1 s and T0 = 51.0 s.
Figure 5 shows the graphical results of modeling the spectral coefficients akr[i] and bkr[i] (solid line), ak[i] and bk[i] (dotted line) that were obtained using the traditional and the proposed algorithms for the function f2(t) in the time interval T0 = 51.0 s, respectively.
The CPU operating time in the calculation using the integral transformation (1) was 1.5938 s, in the calculation according to the proposed algorithm −0.3281 s. The relative performance of the proposed algorithm in this case amounted to 79.4%. The mean square deviations of the spectral coefficients were: for the coefficients ak[i] s1 = 0.0006512; and, for the coefficients bk[i] s2 = 0.00082342.
Figure 6 shows the time signals for the f2(t) function that was reconstructed from the obtained spectra. Here, a solid line shows the recovered signal for 51.0 s, which was calculated from the spectrum obtained using the integral transformation (1), and the dotted line from the spectrum that was obtained using the proposed algorithm.
Figure 7 shows the graphical results of modeling the spectral coefficients akr[i] and bkr[i] (solid line), ak[i] and bk[i] (dotted line) obtained while using the traditional and the proposed algorithms for the function f3(t) in the time interval T0 = 51.0 s, respectively.
The CPU operating time in the calculation using the integral transformation (1) was 1.6250 s, in the calculation according to the proposed algorithm 0.3281 s. The relative performance of the proposed algorithm in this case amounted to 79.8%. The mean square deviations of the spectral coefficients were: for the coefficients ak[i] s1 = 0.0172; and, for the coefficients bk[i] s2 = 0.0342.
Figure 8 shows the time signals for the f3(t) function that was reconstructed from the obtained spectra. Here, a solid line shows the recovered signal for 51.0 s, as calculated from the spectrum that was obtained using the integral transformation (1), and dotted line from the spectrum obtained using the proposed algorithm.

3.3. Evaluation of Numerical Modelling

Table 1 provides a generalized estimate of the results of numerical simulation for functions f1(t), f2(t), and f3(t) at time intervals T0 = 50.1 s and T0 = 51.0 s.
As follows from the results, for all three functions, the performance estimates have approximately the same values—the relative performance of the process of calculating the current spectrum for the time interval T0 = 50.1 s is more than 96%, for T0 = 51.0 s about 80%.
In order to assess the effect of the value of the time interval on the growth of errors that were caused by the accumulation of incremental error calculation in the proposed algorithm, for the considered nonlinear functions are constructed based on changes (Figure 9) in the values of standard deviation values of the spectral coefficients ak[i] (dashed line) and bk[i] (solid line) recovered signals in the interval from 50.1 to 60.0 s.
From the analysis of these dependencies, we can conclude that the temporal nature of the mismatch of spectral coefficients depends on the type of function being modeled and the nature of its nonlinearity. Accordingly, for the function f1(t) deviation of the recovered spectrum above the value of 0.005 is observed at 52 s, for the function f2(t) at 59 s, for the function f3(t) at 51 s. In this case, for 51 s (Figure 8), the recovered signal generally shows a slight deviation, but fluctuations that occur at the spectrum boundaries lead to an increase in the standard deviations of the spectral coefficients.

4. Conclusions

The results of numerical modeling allow for drawing a conclusion regarding the possibility of effective practical use of the proposed approach to the calculation of the current spectrum of non-periodic functions under the requirement of small sampling steps (i.e., when calculating the spectrum in real time). In comparison with the most effective method of spectral characteristics formation—FFT, the developed algorithms have the following advantages. Firstly, their number of multiplication and addition operations at each step is constant and it does not depend on the increasing number N of time samples of the signal, being determined by the step of its sampling and the current value T of the increasing time interval and, secondly, this number of operations is incommensurably small when compared to the constantly increasing number of FFT operations Nlog2N at the current interval.
The implementation of the developed algorithm is particularly relevant in systems of measurement and the spectral processing of broadband signals in real time–telecommunications, navigation, and others.

Author Contributions

Conceptualization, S.S.; methodology, S.S. and D.M.; formal analysis, S.S. and A.N.; investigation, S.S., A.N.; writing—original draft preparation S.S., D.M. and A.N.; writing—review and editing S.S., D.M. and A.N.; supervision, S.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by RFBR, grant number 18-07-00126.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Dyakonov, V. Modern digital spectrum analyzers. Components Technol. 2010, 5, 185–195. [Google Scholar]
  2. Isermann, R.; Münchhof, M. Identification of Dynamic Systems: An Introduction with Applications; Springer: Berlin/Heidelberg, Germany, 2011; ISBN 978-3-540-78878-2. [Google Scholar]
  3. Iglesias, V.; Grajal, J.; Sanchez, M.A.; Lopez-Vallejo, M. Implementation of a Real-Time Spectrum Analyzer on FPGA Platforms. IEEE Trans. Instrum. Meas. 2015, 64, 338–355. [Google Scholar] [CrossRef]
  4. Sergienko, A.B. Digital Signal Processing, 3rd ed.; BHV-Petersburg: St. Petersburg, Russia, 2011; ISBN 5977506066. [Google Scholar]
  5. Oppenheim, A.V.; Schafer, R.W. Discrete-Time Signal Processing, 3rd ed.; Pearson: London, UK, 2010. [Google Scholar]
  6. Lyons, R.G. Understanding Digital Signal Processing, 3rd ed.; Prentice Hall PTR: Upper Saddle River, NJ, USA, 2004; ISBN 8131764362. [Google Scholar]
  7. Marks, R.J., II. The Joy of Fourier: Analysis, Sampling Theory, Systems, Multidimensions, Sto-Chastic Processes, Random Variables, Signal Recovery, POCS, Time Scales, & Applications; Baylor University: Waco, TX, USA, 2006. [Google Scholar]
  8. Blahut, R.E. Fast Algorithms for Signal Processing; Cambridge University Press: New York, NY, USA, 2010; ISBN 1139487957. [Google Scholar]
  9. Bracewell, R.N. The Fourier Transform and Applications; McGraw Hill: Singapore, 2000. [Google Scholar]
  10. Averchenko, A.P.; Zhenatov, B.D. Estimation of the gain of computational costs of Hartley transform before Fourier transform. Omsk Sci. Bull. 2015, 2, 190–194. [Google Scholar]
  11. Avramchuk, V.S.; Yakovleva, E.M. Application of lattice periodic functions in spectral analysis of narrowband periodic signals. Bull. Tomsk Politech. Univ. 2006, 309, 40–44. [Google Scholar]
  12. Bogner, R.E.; Constantinides, A.G. Introduction to Digital Filtering; Wiley: New York, NY, USA, 1975; ISBN 0471085901. [Google Scholar]
  13. Chakraverty, S.; Mahato, N.R.; Karunakar, P.; Rao, T.D. Advanced Numerical and Semi-Analytical Methods for Differential Equations; Wiley: Hoboken, NJ, USA, 2019; ISBN 9781119423423. [Google Scholar]
  14. Korolova, O.; Popp, M.; Mathis, W.; Ponick, B. Performance of Runge-Kutta family numerical solvers for calculation of transient processes in AC machines. In Proceedings of the 2017 20th International Conference on Electrical Machines and Systems (ICEMS), Sydney, NSW, Australia, 11–14 August 2017; pp. 1–6. [Google Scholar]
  15. Radzi, H.M.; Majid, Z.A.; Ismail, F.; Suleiman, M. Four step implicit block method of Runge-Kutta type for solving first order ordinary differential equations. In Proceedings of the 2011 Fourth International Conference on Modeling, Simulation and Applied Optimization, Kuala Lumpur, Malaysia, 19–21 April 2011; pp. 1–5. [Google Scholar]
Figure 1. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f1(t) function in time interval T0 = 50.1 s and sampling interval ΔT = 0.001 s.
Figure 1. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f1(t) function in time interval T0 = 50.1 s and sampling interval ΔT = 0.001 s.
Inventions 05 00015 g001
Figure 2. Recovered f1(t) function signals for the time interval T0 = 50.1 s.
Figure 2. Recovered f1(t) function signals for the time interval T0 = 50.1 s.
Inventions 05 00015 g002
Figure 3. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f1(t) function in time interval T0 = 51.0 s and sampling interval ΔT = 0.001 s.
Figure 3. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f1(t) function in time interval T0 = 51.0 s and sampling interval ΔT = 0.001 s.
Inventions 05 00015 g003
Figure 4. Recovered f1(t) function signals for the time interval T0 = 51.0 s.
Figure 4. Recovered f1(t) function signals for the time interval T0 = 51.0 s.
Inventions 05 00015 g004
Figure 5. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f1(t) function in time interval T0 = 51.0 s and sampling interval ΔT = 0.001 s.
Figure 5. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f1(t) function in time interval T0 = 51.0 s and sampling interval ΔT = 0.001 s.
Inventions 05 00015 g005
Figure 6. Recovered f2(t) function signals for the time interval T0 = 51.0 s.
Figure 6. Recovered f2(t) function signals for the time interval T0 = 51.0 s.
Inventions 05 00015 g006
Figure 7. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f2(t) function in time interval T0 = 51.0 s and sampling interval ΔT = 0.001 s.
Figure 7. Graphic representation of the spectral coefficients ak (a) and bk (b) for the f2(t) function in time interval T0 = 51.0 s and sampling interval ΔT = 0.001 s.
Inventions 05 00015 g007
Figure 8. Recovered f3(t) function signals for the time interval T0 = 51.0 s.
Figure 8. Recovered f3(t) function signals for the time interval T0 = 51.0 s.
Inventions 05 00015 g008
Figure 9. Dependences of changes in the mean square deviations of spectral coefficients ak[i] and bk[i] for f1(t) (a), f2(t) (b), and f3(t) (c) functions in the range from 50.1 s to 60 s.
Figure 9. Dependences of changes in the mean square deviations of spectral coefficients ak[i] and bk[i] for f1(t) (a), f2(t) (b), and f3(t) (c) functions in the range from 50.1 s to 60 s.
Inventions 05 00015 g009
Table 1. Generalized evaluation of the results of numerical modeling.
Table 1. Generalized evaluation of the results of numerical modeling.
Time IntervalT0 = 50.1 sT0 = 51.0 s
Evaluation CriterionStandard Deviation for ak[i]Standard Deviation for bk[i]Performance, %Standard Deviation for ak[i]Standard Deviation for bk[i]Performance, %
f1(t)0.00200.001896.40.01470.008980.8
f2(t)0.0000662530.000480697.00.00065120.0008234279.4
f3(t)0.00200.010798.80.01720.034279.8

Share and Cite

MDPI and ACS Style

Sokolov, S.; Marshakov, D.; Novikov, A. The Current Spectrum Formation of a Non-Periodic Signal: A Differential Approach. Inventions 2020, 5, 15. https://doi.org/10.3390/inventions5020015

AMA Style

Sokolov S, Marshakov D, Novikov A. The Current Spectrum Formation of a Non-Periodic Signal: A Differential Approach. Inventions. 2020; 5(2):15. https://doi.org/10.3390/inventions5020015

Chicago/Turabian Style

Sokolov, Sergey, Daniil Marshakov, and Arthur Novikov. 2020. "The Current Spectrum Formation of a Non-Periodic Signal: A Differential Approach" Inventions 5, no. 2: 15. https://doi.org/10.3390/inventions5020015

APA Style

Sokolov, S., Marshakov, D., & Novikov, A. (2020). The Current Spectrum Formation of a Non-Periodic Signal: A Differential Approach. Inventions, 5(2), 15. https://doi.org/10.3390/inventions5020015

Article Metrics

Back to TopTop