<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    ijcns
   </journal-id>
   <journal-title-group>
    <journal-title>
     International Journal of Communications, Network and System Sciences
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    1913-3715
   </issn>
   <issn publication-format="print">
    1913-3723
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/ijcns.2025.184004
   </article-id>
   <article-id pub-id-type="publisher-id">
    ijcns-143467
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Computer Science 
     </subject>
     <subject>
       Communications
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Comparison of Two Approaches to Modeling Additive White Gaussian Noise as It Acts on Arbitrary Signals
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Serhii
      </surname>
      <given-names>
       Rassomakhin
      </given-names>
     </name>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Joseph
      </surname>
      <given-names>
       Brifman
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aAdvanced Development Department, Universal Research&amp;Development Enterprise, Palm Coast, FL, USA
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     30
    </day> 
    <month>
     04
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    18
   </volume> 
   <issue>
    04
   </issue>
   <fpage>
    39
   </fpage>
   <lpage>
    50
   </lpage>
   <history>
    <date date-type="received">
     <day>
      15,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      27,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      27,
     </day>
     <month>
      April
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    The purpose of this paper is to substantiate the correct method for modeling additive white Gaussian noise under conditions of using analog filtering when processing a signal-noise mixture. To achieve the result, two methods of noise modeling used in signal processing theory for Gaussian channels are considered: the first is a traditional simplified discrete method, and the second is a more complex, but functionally correct analog-discrete method. As a result of the comparison, the undeniable advantages of the analog-discrete method are proven. A conclusion was made about the preference of using the proposed new method, which ensures the complete adequacy of the noise model. 
   </abstract>
   <kwd-group> 
    <kwd>
     Additive White Gaussian Noise (AWGN)
    </kwd> 
    <kwd>
      Normal Distribution
    </kwd> 
    <kwd>
      Sampling
    </kwd> 
    <kwd>
      Signal-to-Noise Ratio
    </kwd> 
    <kwd>
      Fourier Transformation
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>The task of analytically describing the impact of the AWGN on the process of obtaining noisy measurements at the output of a Gaussian channel is the most important for carrying out correct modeling of digital signal processing. Currently, the most widely used is the traditional discrete method (T-method) <xref ref-type="bibr" rid="scirp.143467-1">
     [1]
    </xref> <xref ref-type="bibr" rid="scirp.143467-2">
     [2]
    </xref>. According to this method, a noisy sample of discrete measurements of the channel output is formed by simply summing two vectors: a vector of signal measurements obtained in the absence of noise, and a vector of independent Gaussian random variables with zero mathematical expectation and variance determined by a given signal-to-noise ratio (SNR). The main advantage of this method is its simplicity and high technological efficiency for Matlab modeling. Mutual independence of noise measurements means that the model corresponds to the so-called full-band noise. Such noise is present at the receiver input when there is no preliminary filtering (spectrum limitation) of the additive signal-noise mixture. If the operation of the receiver is based on the calculation of correlation integrals (or, in the case of digital implementation, discrete convolutions) of the received mixture with standards of possible signal implementations, then with ideal synchronization, a method of reception is implemented that is called Optimal Coherent Reception (OCR) <xref ref-type="bibr" rid="scirp.143467-3">
     [3]
    </xref>-<xref ref-type="bibr" rid="scirp.143467-5">
     [5]
    </xref>. Since the correlation integral itself has a frequency-selective property, the OCR method does not require any preliminary filtering. Therefore, the modeling of full-band noise using the considered T-method is initially oriented only for the further application of the OCR. The best potentially achievable result of the OCR method actually became the basis for proving the existence of a physical Capacity limit for Gaussian channels <xref ref-type="bibr" rid="scirp.143467-6">
     [6]
    </xref>-<xref ref-type="bibr" rid="scirp.143467-8">
     [8]
    </xref>. This value limits the achievable indicators of the specific efficiency of all existing systems <xref ref-type="bibr" rid="scirp.143467-6">
     [6]
    </xref>.</p>
   <p>However, there are methods for receiving noisy signals that, under certain conditions, can produce results much better than OCR. These methods are not the subject of this work, but it should be noted that they are based on the use of preliminary frequency-selective filtering. This preprocessing results in the measurements of the signal-noise mixture acquiring some mutual dependence, i.e., they are correlated. Therefore, the use of the T-method of AWGS modeling becomes unacceptable.</p>
   <p>Below we will consider a new analog-discrete method for modeling the impact of AWGN—the so-called N-method, which, due to its greater functionality, works correctly, including when performing preliminary filtering. The purpose of this analysis is to prove the complete adequacy and preference of the N-method over the traditional approach. If necessary, the proposed N-method can be generalized to other noise models. For this, it is sufficient to use the required type of distribution of the vector of random amplitude coefficients of the Fourier representation of the noise realizations. For example, to model colored noise, it is necessary to introduce the dependence of the standard deviation of the elements of the vector of amplitude coefficients of noise harmonics on the value of the harmonic frequency in the noise spectrum.</p>
   <p>At the same time, we will keep in mind that it is impossible to build a completely adequate AWGN model. You cannot simulate a phenomenon that does not exist in nature. We think that you will agree that we can only talk about mathematical methods that, under certain conditions and under certain restrictions, with an acceptable error, are similar to the effect of AWGN.</p>
  </sec><sec id="s2">
   <title>2. Traditional Approach (T-Method)</title>
   <p>The traditional approach to modeling noise exposure, is as follows. Let there be an arbitrary signal (harmonic or pulse) on a modulation interval with a duration 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math>: 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        X 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        , 
      </mo> 
      <mtext>
          
      </mtext> 
      <mi>
        t 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mi>
        T 
      </mi> 
     </mrow> 
    </math>. This signal is digitized at the sampling rate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         S 
       </mi> 
      </msub> 
     </mrow> 
    </math>:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        x 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             S 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            T 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. (1)</p>
   <p>A noise vector of similar dimension is generated:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mrow> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             S 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            T 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. (2)</p>
   <p>Elements of the vector (2) are real, independent, and normally distributed random variables with zero mathematical expectation and standard deviation</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             N 
           </mi> 
           <mn>
             0 
           </mn> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            F 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           / 
         </mo> 
         <mn>
           2 
         </mn> 
        </mrow> 
       </mrow> 
      </msup> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             N 
           </mi> 
           <mn>
             0 
           </mn> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            K 
          </mi> 
          <mo>
            ⋅ 
          </mo> 
          <mrow> 
           <mrow> 
            <msub> 
             <mi>
               f 
             </mi> 
             <mi>
               S 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             / 
           </mo> 
           <mn>
             2 
           </mn> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           / 
         </mo> 
         <mn>
           2 
         </mn> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>. (3)</p>
   <p>
    <xref ref-type="bibr" rid="scirp.143467-"></xref>Here 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         N 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
     </mrow> 
    </math> is a noise spectral power density, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         N 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mrow> 
        <msub> 
         <mi>
           E 
         </mi> 
         <mi>
           b 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         / 
       </mo> 
       <mrow> 
        <mi>
          S 
        </mi> 
        <mi>
          N 
        </mi> 
        <mi>
          R 
        </mi> 
       </mrow> 
      </mrow> 
     </mrow> 
    </math>; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mi>
         b 
       </mi> 
      </msub> 
     </mrow> 
    </math> is a signal energy consumed to transmit one bit; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mi>
        N 
      </mi> 
      <mi>
        R 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mrow> 
        <msub> 
         <mi>
           E 
         </mi> 
         <mi>
           b 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         / 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           N 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
       </mrow> 
      </mrow> 
     </mrow> 
    </math>—Signal-to-Noise Ratio, specified by modeling conditions; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        F 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        K 
      </mi> 
      <mo>
        ⋅ 
      </mo> 
      <mrow> 
       <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           S 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         / 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </mrow> 
    </math>—the noise frequency band; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       K 
     </mi> 
    </math>—coefficient of expansion (narrowing) of the noise frequency band, which is absent in classically used traditional applications, when we assume 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. You will not find precedents in the literature when any other value would be used in this model. We introduce this coefficient for the generality of examples when we vary the input noise bandwidth at a fixed sampling frequency. In the Equation (3) we are taking into account that when using a sampling frequency 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         S 
       </mi> 
      </msub> 
     </mrow> 
    </math> the standard deviation of noise measurements 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
     </mrow> 
    </math> increases by a factor of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          K 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             S 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mn>
           2 
         </mn> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. This is done because when implementing OCR, the mixture measurements are averaged over the interval 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math> in which the signal power per measurement increases by a such factor, while the power of random noise increases only by a factor of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            K 
          </mi> 
          <mo>
            ⋅ 
          </mo> 
          <mrow> 
           <mrow> 
            <msub> 
             <mi>
               f 
             </mi> 
             <mi>
               S 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             / 
           </mo> 
           <mn>
             2 
           </mn> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           / 
         </mo> 
         <mn>
           2 
         </mn> 
        </mrow> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>. Those scaling the noise power spectral density in (3) prevents false increase in SNR when implementing OCR. Due to the fixed value 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, this model takes into account only the noise components in the band 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          0 
        </mn> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             S 
           </mi> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mn>
           2 
         </mn> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> Hz. It means that the noise bandwidth in the T-model is uniquely related to the sampling frequency.</p>
   <p>We assume that 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       a 
     </mi> 
    </math> is an informative signal parameter unknown to the receiver, then the result of noise exposure is represented by a vector of channel output measurements:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        y 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        a 
      </mi> 
      <mo>
        ⋅ 
      </mo> 
      <mi>
        x 
      </mi> 
      <mo>
        + 
      </mo> 
      <mi>
        n 
      </mi> 
      <mo>
        , 
      </mo> 
      <mtext>
          
      </mtext> 
      <mi>
        y 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           y 
         </mi> 
         <mrow> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             S 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            T 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. (4)</p>
   <p>Is the considered model an adequate description of the impact of AWGN? The answer is of course not, because the frequency band taken into account by the model is fixed and limited by 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           S 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         / 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </mrow> 
    </math>. Exposure to real white noise would require, instead of definition (3), the value 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mi>
        ∞ 
      </mi> 
     </mrow> 
    </math>, what is not feasible. Although such a model is not correct for the properties of AWGN, it is widely used in all known applications, where it is called the discrete full-band model. The only advantage of the model is its simplicity and manufacturability for implementation, for example, in the Matlab environment, as well as its absolute protection against degeneracy. However, the fatal flaws of this model dominate.</p>
   <p>
    <xref ref-type="bibr" rid="scirp.143467-"></xref><u>The first major drawback</u> is that the structure of the model is focused exclusively on the use of the OCR method, and the properties of this model are clearly aimed at proving the fact that there cannot be any reception methods better than OCR. This follows from the formula describing the implementation of OCR for this discrete case. The best estimate of the informative parameter of the signal on the interval is made by OCR according to the rule of scalar convolution:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         a 
       </mi> 
       <mo>
         * 
       </mo> 
      </msup> 
      <mo>
        = 
      </mo> 
      <mi>
        y 
      </mi> 
      <mo>
        × 
      </mo> 
      <mi>
        x 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          a 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          x 
        </mi> 
        <mo>
          + 
        </mo> 
        <mi>
          n 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        × 
      </mo> 
      <mi>
        x 
      </mi> 
     </mrow> 
    </math>, (5)</p>
   <p>
    <xref ref-type="bibr" rid="scirp.143467-"></xref>where sign 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mo>
       × 
     </mo> 
    </math> denotes the dot product operation. Let, e.g., the signal 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        X 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is a rectangular pulse with two possible equally probable amplitude values 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        a 
      </mi> 
      <mo>
        = 
      </mo> 
      <mo>
        ± 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. Equation (5) is equivalent to calculating the mathematical expectation of the process 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       y 
     </mi> 
    </math> on the modulation interval 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math>. If the calculated value 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         a 
       </mi> 
       <mo>
         * 
       </mo> 
      </msup> 
      <mo>
        ≤ 
      </mo> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math> it is assumed that the value 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        a 
      </mi> 
      <mo>
        = 
      </mo> 
      <mo>
        − 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math> is received, if 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         a 
       </mi> 
       <mo>
         * 
       </mo> 
      </msup> 
      <mo>
        &gt; 
      </mo> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math>, then 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        a 
      </mi> 
      <mo>
        = 
      </mo> 
      <mo>
        + 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. Under the described conditions, could there be a better method for finding the mathematical expectation than simple averaging over a sample 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       y 
     </mi> 
    </math> which is done by OCR calculation (5)? Of course not, otherwise there will be a contradiction with the axioms of probability theory. Thus, the first main drawback of the AWGN quasi-model under consideration leads to a conclusion that does not even allow the thought of finding something better than OCR. We have become accustomed and resigned to this, which has led to stagnation in the development of the theory and practice of signal processing.</p>
   <p><u>The second drawback</u> of the model is its inadequate behavior for values of the noise frequency band expansion (narrowing) coefficient 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       K 
     </mi> 
    </math> we introduced that are different from unity, when we want to simulate the effect of noise with a frequency band greater or less than 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mrow> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           S 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         / 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </mrow> 
    </math>. This inadequacy is especially fatal when 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        &lt; 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, since it is impossible to correctly take into account the narrowing of the band of the present signal-noise mixture after preliminary filtering, which our separation procedure provides. Below we will demonstrate this fatal inadequacy using examples. Using Equations (2) and (3) and assuming that the value 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         S 
       </mi> 
      </msub> 
     </mrow> 
    </math> is a multiple of the target power of 2, we can construct an equivalent analogue representation of the implementation of random noise on the interval 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math>. To do this we use a couple Fast Fourier Transforms (FFT):</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        G 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        F 
      </mi> 
      <mi>
        F 
      </mi> 
      <mi>
        T 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         n 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>; (6)</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
      <mtr> 
       <mtd> 
        <mi>
          N 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           t 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          = 
        </mo> 
        <mi>
          I 
        </mi> 
        <mi>
          F 
        </mi> 
        <mi>
          F 
        </mi> 
        <mi>
          T 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mi>
           G 
         </mi> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           G 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
        <mo>
          + 
        </mo> 
        <mn>
          2 
        </mn> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            Re 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               G 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            cos 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mn>
              2 
            </mn> 
            <mi>
              π 
            </mi> 
            <mo>
              ⋅ 
            </mo> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mo>
                 / 
               </mo> 
               <mi>
                 T 
               </mi> 
              </mrow> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              ⋅ 
            </mo> 
            <mi>
              t 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            − 
          </mo> 
          <mi>
            Im 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               G 
             </mi> 
             <mi>
               i 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            sin 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mn>
              2 
            </mn> 
            <mi>
              π 
            </mi> 
            <mo>
              ⋅ 
            </mo> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mrow> 
               <mi>
                 i 
               </mi> 
               <mo>
                 / 
               </mo> 
               <mi>
                 T 
               </mi> 
              </mrow> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              ⋅ 
            </mo> 
            <mi>
              t 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mi>
          i 
        </mi> 
        <mo>
          ∈ 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <mrow> 
           <mrow> 
            <msub> 
             <mi>
               f 
             </mi> 
             <mi>
               S 
             </mi> 
            </msub> 
           </mrow> 
           <mo>
             / 
           </mo> 
           <mn>
             2 
           </mn> 
          </mrow> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          . 
        </mo> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math> (7)</p>
   <p>In this case, naturally, the analog implementation is periodic with a period equal to 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math>. We will make transformations (6), (7) below in examples of the work of this T-method when comparing it with the developed by us a new N-method. Note that the block diagram of the sequence of actions of traditional T-method is presented in the form shown in <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>.</p>
  </sec><sec id="s3">
   <title>3. New Approach (N-Method)</title>
   <p>The fundamental difference of our AWGN-like noise modeling approach is the reverse order of the stages of implementation, shown in <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. Stages of implementation of the T-method.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId102.jpeg?20250623045315" />
   </fig>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. Stages of implementation of the N-method.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId103.jpeg?20250623045315" />
   </fig>
   <p>The prototype of the N-method is the mathematical model of Gaussian noise with a flat spectrum, described in <xref ref-type="bibr" rid="scirp.143467-3">
     [3]
    </xref>. We first correctly generate a non-periodic on the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math> an analog implementation of Gaussian noise with the right parameters, and then digitize it with frequency 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         S 
       </mi> 
      </msub> 
     </mrow> 
    </math> to obtain a vector of discrete noise measurements. Our method is completely identical to that discussed earlier when using both methods under the same conditions with values of the band expansion (narrowing) coefficient 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        ≥ 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. However, if preliminary filtering of noise in its mixture by a signal is applied ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        &lt; 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>), then N-method continues to work correctly, while the T-method becomes inadequate.</p>
   <p>The analog implementation of a non-periodic noise segment on the modulation interval 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math> is determined based on the following Fourier expansion:</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <mo>
         ∑ 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           m 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          cos 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            2 
          </mn> 
          <mtext>
            π 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mo>
               / 
             </mo> 
             <mrow> 
              <mi>
                T 
              </mi> 
              <mi>
                N 
              </mi> 
             </mrow> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mi>
            t 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           m 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mo>
            + 
          </mo> 
          <mi>
            T 
          </mi> 
          <mi>
            N 
          </mi> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            F 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          sin 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            2 
          </mn> 
          <mtext>
            π 
          </mtext> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mo>
               / 
             </mo> 
             <mrow> 
              <mi>
                T 
              </mi> 
              <mi>
                N 
              </mi> 
             </mrow> 
            </mrow> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mi>
            t 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </mstyle> 
      <mo>
        , 
      </mo> 
      <mtext>
          
      </mtext> 
      <mtext>
          
      </mtext> 
      <mi>
        i 
      </mi> 
      <mo>
        ∈ 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          0 
        </mn> 
        <mo>
          , 
        </mo> 
        <mi>
          T 
        </mi> 
        <mi>
          N 
        </mi> 
        <mo>
          ⋅ 
        </mo> 
        <mi>
          F 
        </mi> 
        <mi>
          H 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, (8)</p>
   <p>
    <xref ref-type="bibr" rid="scirp.143467-"></xref>here 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        F 
      </mi> 
      <mi>
        H 
      </mi> 
      <mo>
        = 
      </mo> 
      <mi>
        K 
      </mi> 
      <mrow> 
       <mrow> 
        <mo>
          ⋅ 
        </mo> 
        <msub> 
         <mi>
           f 
         </mi> 
         <mi>
           S 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         / 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </mrow> 
    </math>—frequency band in which noise operates at the input of the pre-filter; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        T 
      </mi> 
      <mi>
        N 
      </mi> 
     </mrow> 
    </math>—period of the analogue implementation of noise, for the model to be non-degenerate (not periodic 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> on the interval 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       T 
     </mi> 
    </math>) it is necessary to fulfill the requirement 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        T 
      </mi> 
      <mi>
        N 
      </mi> 
      <mo>
        &gt; 
      </mo> 
      <mi>
        T 
      </mi> 
     </mrow> 
    </math>, the order of this excess is not of particular importance; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        m 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           m 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           m 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           m 
         </mi> 
         <mrow> 
          <mn>
            2 
          </mn> 
          <mi>
            F 
          </mi> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            T 
          </mi> 
          <mi>
            N 
          </mi> 
          <mo>
            + 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math>—initial vector of independent Gaussian random variables with zero mathematical expectation and standard deviation</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         m 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msqrt> 
       <mrow> 
        <mrow> 
         <mrow> 
          <msub> 
           <mi>
             N 
           </mi> 
           <mn>
             0 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <mi>
            T 
          </mi> 
          <mi>
            N 
          </mi> 
         </mrow> 
        </mrow> 
       </mrow> 
      </msqrt> 
     </mrow> 
    </math>. (9)</p>
   <p>Based on Equation (8) calculated form 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> with sampling frequency 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         S 
       </mi> 
      </msub> 
     </mrow> 
    </math> the final vector of discrete noise measurements is formed:</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mn>
           0 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <mo>
          … 
        </mo> 
        <mo>
          , 
        </mo> 
        <mtext>
            
        </mtext> 
        <msub> 
         <mi>
           n 
         </mi> 
         <mrow> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             S 
           </mi> 
          </msub> 
          <mo>
            ⋅ 
          </mo> 
          <mi>
            T 
          </mi> 
          <mo>
            − 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         n 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mi>
        N 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           / 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             f 
           </mi> 
           <mi>
             s 
           </mi> 
          </msub> 
         </mrow> 
        </mrow> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        , 
      </mo> 
      <mtext>
          
      </mtext> 
      <mtext>
          
      </mtext> 
      <mi>
        i 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0 
      </mn> 
      <mo>
        , 
      </mo> 
      <mtext>
          
      </mtext> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        , 
      </mo> 
      <mtext>
          
      </mtext> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         s 
       </mi> 
      </msub> 
      <mo>
        − 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. (10)</p>
   <p>If Equation (9) is met, the resulting vector of random measurements 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       n 
     </mi> 
    </math> in its statistical characteristics and the value of the standard deviation 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
     </mrow> 
    </math> is completely identical to the similar vector of T-method. This is observed at the nominal value for T-method 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, as well as with an extended noise spectrum at 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        &gt; 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. In the case when using 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        &lt; 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, we simulate preliminary noise filtering, then with the same final values 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
     </mrow> 
    </math>, the N-method correctly reduces the noise bandwidth, while the traditional T-method does not work correctly, i.e., noise bandwidth is not reduced. This is clearly observed by the visual difference in the final analog representations of noise 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         t 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> obtained for both methods, as well as by the type of their autocorrelation functions.</p>
  </sec><sec id="s4">
   <title>4. Comparison of T-Method and N-Method</title>
   <p>Suppose you want to obtain discrete measurements of noise acting on the modulation interval 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        T 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
      <mtext>
          
      </mtext> 
      <mtext>
        s 
      </mtext> 
     </mrow> 
    </math> at sampling rate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         S 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        128 
      </mn> 
      <mtext>
          
      </mtext> 
      <mtext>
        Hz 
      </mtext> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         E 
       </mi> 
       <mi>
         b 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        S 
      </mi> 
      <mi>
        N 
      </mi> 
      <mi>
        R 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         N 
       </mi> 
       <mn>
         0 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. Let’s consider three situations of using the models of T-method and N-method. To generate independent Gaussian quantities, we use the built-in Mathcad function 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        r 
      </mi> 
      <mi>
        n 
      </mi> 
      <mi>
        o 
      </mi> 
      <mi>
        r 
      </mi> 
      <mi>
        m 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          Q 
        </mi> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           m 
         </mi> 
         <mi>
           n 
         </mi> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           σ 
         </mi> 
         <mi>
           n 
         </mi> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       Q 
     </mi> 
    </math>—number of generated values; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         m 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math>—mathematical expectation; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         σ 
       </mi> 
       <mi>
         n 
       </mi> 
      </msub> 
     </mrow> 
    </math>—standard deviation. To implement the N-method in Equation (8), we use the value 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        T 
      </mi> 
      <mi>
        N 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        5 
      </mn> 
     </mrow> 
    </math>. The values 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         σ 
       </mi> 
       <mi>
         n 
       </mi> 
       <mo>
         ∗ 
       </mo> 
      </msubsup> 
     </mrow> 
    </math> presented in the examples below obtained by averaging over 100 independent implementations of discrete noise samples. Let’s consider examples illustrating the results of generating AWGN models using two compared methods.</p>
   <sec id="s4_1">
    <title>
     <xref ref-type="bibr" rid="scirp.143467-"></xref>4.1. Full Band Noise When K = 1</title>
    <p>
     <xref ref-type="bibr" rid="scirp.143467-"></xref>This is the normal nominal application mode of the T-method. The actual received frequency band, represented by the vector 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        n 
      </mi> 
     </math>, for both methods are 64 Hz.</p>
    <p><u>T-method</u>.</p>
    <p>Generating a noise measurement vector 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         : 
       </mo> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           128 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msqrt> 
          <mrow> 
           <mn>
             64 
           </mn> 
          </mrow> 
         </msqrt> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           128 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           8 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. Result is 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mrow> 
           <mn>
             127 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. Example values for a custom implementation are 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         1.78 
       </mn> 
      </mrow> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         7.37 
       </mn> 
      </mrow> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         10.16 
       </mn> 
      </mrow> 
     </math>, 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mo>
        ⋯ 
      </mo> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mn>
           127 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         1.46 
       </mn> 
      </mrow> 
     </math>. Restoring the analog form for a noise segment, determined by Equations (6) and (7), gives the picture shown in <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>.</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. Analog representation of the noise realization obtained by the T-method at 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   K
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   1
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId190.jpeg?20250623045316" />
    </fig>
    <p>An estimation of the standard deviation for this realization is 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          σ 
        </mi> 
        <mi>
          n 
        </mi> 
        <mo>
          * 
        </mo> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         7.96 
       </mn> 
      </mrow> 
     </math>.</p>
    <p><u>N-method</u>.</p>
    <p>Generation of quadrature amplitudes based on (9):</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         m 
       </mi> 
       <mo>
         : 
       </mo> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           642 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msqrt> 
          <mrow> 
           <mrow> 
            <mn>
              1 
            </mn> 
            <mo>
              / 
            </mo> 
            <mn>
              5 
            </mn> 
           </mrow> 
          </mrow> 
         </msqrt> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           642 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0.45 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>.</p>
    <p>Example values for a custom implementation are:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         0.58 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         0.31 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         0.24 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mrow> 
         <mn>
           641 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         0.03 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>An example of an analog implementation of a noise segment, determined by Equation (8), is shown in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref>.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Analog representation of the noise realization obtained by the N-method at 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   K
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   1
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId199.jpeg?20250623045316" />
    </fig>
    <p>Sampling 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         N 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> in accordance with Equation (10) gives the desired vector of noise measurements: 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mrow> 
           <mn>
             127 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. Example values for a custom implementation are 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         1.65 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1.43 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         11.88 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mn>
           127 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         4.94 
       </mn> 
      </mrow> 
     </math>. An estimation of the standard deviation for this realization is 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          σ 
        </mi> 
        <mi>
          n 
        </mi> 
        <mo>
          * 
        </mo> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         7.94 
       </mn> 
      </mrow> 
     </math>, almost the same as previous.</p>
    <p>
     <xref ref-type="bibr" rid="scirp.143467-"></xref>Let’s make the intermediate conclusion 1: when 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         K 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math> (nominal T-method mode) both methods give identical results—the generation of vectors of discrete measurements in the 64 Hz noise band with almost identical values of standard deviation corresponding to the required value 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msqrt> 
        <mrow> 
         <mrow> 
          <mrow> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mi>
              s 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            / 
          </mo> 
          <mn>
            2 
          </mn> 
         </mrow> 
        </mrow> 
       </msqrt> 
       <mo>
         = 
       </mo> 
       <msqrt> 
        <mrow> 
         <mn>
           64 
         </mn> 
        </mrow> 
       </msqrt> 
       <mo>
         = 
       </mo> 
       <mn>
         8 
       </mn> 
      </mrow> 
     </math>. The resulting noise realizations, which reflect the operation of the models, naturally have a different appearance, but have completely identical statistical characteristics. Both methods give the same required result.</p>
   </sec>
   <sec id="s4_2">
    <title>4.2. Ultra-Full Band Noise When K = 2</title>
    <p>Now let’s imagine a situation where we use the same sampling rate 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mi>
          s 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         128 
       </mn> 
       <mtext>
           
       </mtext> 
       <mtext>
         Hz 
       </mtext> 
      </mrow> 
     </math>, but the input of both methods is noise with twice the frequency band 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         F 
       </mi> 
       <mi>
         H 
       </mi> 
       <mo>
         = 
       </mo> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mi>
          S 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         128 
       </mn> 
       <mtext>
           
       </mtext> 
       <mtext>
         Hz 
       </mtext> 
      </mrow> 
     </math>. Options 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mi>
          b 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mi>
         S 
       </mi> 
       <mi>
         N 
       </mi> 
       <mi>
         R 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math> let’s leave it the same, but use the value 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         K 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </math>. Obviously, the following result should be expected. The noise bandwidth represented by the measurement sample will remain equal to 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            S 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mn>
         64 
       </mn> 
      </mrow> 
     </math>, because the value 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mi>
          S 
        </mi> 
       </msub> 
      </mrow> 
     </math> hasn’t changed. However, since the amplitude-frequency response of analog-to-digital conversion is periodic (with a half-period 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            S 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
      </mrow> 
     </math>), the energy contained in out-of-band frequencies 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            S 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mi>
          S 
        </mi> 
       </msub> 
      </mrow> 
     </math> will “penetrate” into the main band 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         0 
       </mn> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mrow> 
        <mrow> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            S 
          </mi> 
         </msub> 
        </mrow> 
        <mo>
          / 
        </mo> 
        <mn>
          2 
        </mn> 
       </mrow> 
      </mrow> 
     </math> and add up with the energy of in-band frequencies. Consequently, the total noise power represented by discrete samples will increase by a factor of 2. This is equivalent to a double reduction of actual 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <mi>
         N 
       </mi> 
       <mi>
         R 
       </mi> 
      </mrow> 
     </math>. In this case, the standard deviation of noise measurements will increase by 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msqrt> 
        <mn>
          2 
        </mn> 
       </msqrt> 
      </mrow> 
     </math> times. Let’s check how equally both methods under consideration work in this situation. The simulation process and its results for 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         K 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </math>. In fact, the resulting noise bandwidth represented by the vectors for both methods are 64 Hz.</p>
    <p><u>T-method</u>.</p>
    <p>Generating a Noise Measurement Vector:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         : 
       </mo> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           128 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msqrt> 
          <mrow> 
           <mn>
             128 
           </mn> 
          </mrow> 
         </msqrt> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           128 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           11.31 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mrow> 
           <mn>
             127 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>.</p>
    <p>An example values for a custom implementation:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         4.97 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         7.69 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         5.36 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mn>
           127 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         5.27 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>Restoring the analog form for a noise segment, determined by Equations (6) and (7), gives the picture shown in <xref ref-type="fig" rid="fig5">
      Figure 5
     </xref>.</p>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>Figure 5. Analog representation of the noise realization obtained by the T-method at 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   K
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   2
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId244.jpeg?20250623045317" />
    </fig>
    <p>An estimation of the standard deviation for this realization is 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          σ 
        </mi> 
        <mi>
          n 
        </mi> 
        <mo>
          * 
        </mo> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         11.245 
       </mn> 
      </mrow> 
     </math>.</p>
    <p><u>N-method</u>.</p>
    <p>Generation of quadrature amplitudes based on Equation (8):</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         m 
       </mi> 
       <mo>
         : 
       </mo> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1282 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msqrt> 
          <mrow> 
           <mrow> 
            <mn>
              1 
            </mn> 
            <mo>
              / 
            </mo> 
            <mn>
              5 
            </mn> 
           </mrow> 
          </mrow> 
         </msqrt> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1282 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0.45 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>.</p>
    <p>An example values for a custom implementation:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         0.07 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         0.39 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         0.95 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mrow> 
         <mn>
           1281 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         0.26 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>The form of an analog implementation of a noise segment, determined by Equation (8), is shown in <xref ref-type="fig" rid="fig6">
      Figure 6
     </xref>.</p>
    <fig id="fig6" position="float">
     <label>Figure 6</label>
     <caption>
      <title>Figure 6. Analog representation of the noise realization obtained by the N-method at 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   K
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   2
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId253.jpeg?20250623045317" />
    </fig>
    <p>Sampling 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         N 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> in accordance with Equation (9) gives the desired vector of noise measurements: 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mrow> 
           <mn>
             127 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. For example:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         25.55 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         14.51 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         11.62 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mn>
           127 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         13.12 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>An estimation of the standard deviation for this realization is 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          σ 
        </mi> 
        <mi>
          n 
        </mi> 
        <mo>
          * 
        </mo> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         11.26 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>Let’s make the intermediate conclusion 2: when 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         K 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </math> (extended bandwidth abnormal mode) both methods give the same result—the generation of discrete measurement vectors, still corresponding to noise with a frequency band of 64 Hz with practically the same values of the standard deviation of discrete measurements, corresponding to the value 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msqrt> 
        <mrow> 
         <msub> 
          <mi>
            f 
          </mi> 
          <mi>
            s 
          </mi> 
         </msub> 
        </mrow> 
       </msqrt> 
       <mo>
         = 
       </mo> 
       <msqrt> 
        <mrow> 
         <mn>
           128 
         </mn> 
        </mrow> 
       </msqrt> 
       <mo>
         = 
       </mo> 
       <mn>
         11.31 
       </mn> 
      </mrow> 
     </math>. The resulting noise realizations, which reflect the operation of the models, naturally have a different appearance, but have completely identical statistical characteristics. Both methods give an incorrect result that corresponds to the expected one: the band expanded by 2 times actually transformed into a 2-fold deterioration in the channel energy 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <mi>
         N 
       </mi> 
       <mi>
         R 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         0.5 
       </mn> 
      </mrow> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         2 
       </mn> 
      </mrow> 
     </math>.</p>
   </sec>
   <sec id="s4_3">
    <title>4.3. Reduced Band Noise after Pre-Filtering K = 0.5</title>
    <p>Let us now consider the situation when full-band noise with frequency band 64 [Hz] before sampling with the same frequency as in previous cases 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          f 
        </mi> 
        <mi>
          S 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         128 
       </mn> 
       <mtext>
           
       </mtext> 
       <mtext>
         Hz 
       </mtext> 
      </mrow> 
     </math> pre-filtered by low pass filter (LPF) with passband 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           ⋯ 
         </mo> 
         <mn>
           32 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mtext>
           
       </mtext> 
       <mtext>
         Hz 
       </mtext> 
      </mrow> 
     </math>. We will use an idealized LPF, the amplitude-frequency response of which is equal to unity in the passband 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           ⋯ 
         </mo> 
         <mn>
           32 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mtext>
           
       </mtext> 
       <mtext>
         Hz 
       </mtext> 
      </mrow> 
     </math> and equal to zero—in the suppression band 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          [ 
        </mo> 
        <mrow> 
         <mn>
           33 
         </mn> 
         <mo>
           ⋯ 
         </mo> 
         <mn>
           64 
         </mn> 
        </mrow> 
        <mo>
          ] 
        </mo> 
       </mrow> 
       <mtext>
           
       </mtext> 
       <mtext>
         Hz 
       </mtext> 
      </mrow> 
     </math>, and the phase-frequency response is linear. We model a two-fold reduction in frequency band of noise using one model parameter 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         K 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         0.5 
       </mn> 
      </mrow> 
     </math> This idealization is used to simplify the specification of the situation using only one parameter of the models. You should not consider it as a possible error leading to a degenerate analysis. Because in a real situation, when we use N-method, it is sufficient to take into account only the amplitude-frequency characteristic of the filter. since in the noise model defined by Formula (8), the random phase of any harmonic is determined by the arctangent of the ratio of the random amplitudes of the sine and cosine quadrature components. These amplitudes are changed by the filter proportionally and the random value of the harmonic phase does not change.</p>
    <p>We will continue to use parameters 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mi>
          b 
        </mi> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mi>
         S 
       </mi> 
       <mi>
         N 
       </mi> 
       <mi>
         R 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math> . Let us show how the two considered models for generating noise measurements behave in this case. Expected Results:</p>
    <p><u>T-method</u>.</p>
    <p>Generating a Noise Measurement Vector:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         : 
       </mo> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           128 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msqrt> 
          <mrow> 
           <mn>
             32 
           </mn> 
          </mrow> 
         </msqrt> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           128 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           5.66 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mrow> 
           <mn>
             127 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>.</p>
    <p>An example values for a custom implementation:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         2.52 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         5.46 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         1.73 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mn>
           127 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         3.69 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>Restoring the analog form for a noise segment, determined by Equations (6) and (7), gives the picture shown in <xref ref-type="fig" rid="fig7">
      Figure 7
     </xref>.</p>
    <fig id="fig7" position="float">
     <label>Figure 7</label>
     <caption>
      <title>Figure 7. Analog representation of the noise realization obtained by the T-method at 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   K
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   0.5
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId293.jpeg?20250623045317" />
    </fig>
    <p>The actually obtained frequency band represented by the vector 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        n 
      </mi> 
     </math> is 64 Hz, i.e., is the same as in the examples of previous cases. Standard deviation is 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          σ 
        </mi> 
        <mi>
          n 
        </mi> 
        <mo>
          ∗ 
        </mo> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         5.62 
       </mn> 
      </mrow> 
     </math>. Energy parameters of the obtained model 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <mi>
         N 
       </mi> 
       <mi>
         R 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         2 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         0.5 
       </mn> 
      </mrow> 
     </math>, which absolutely does not correspond to the input data of the experiment.</p>
    <p><u>N-method</u>.</p>
    <p>Generation of quadrature amplitudes based on (8):</p>
    <p>
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         m 
       </mi> 
       <mo>
         : 
       </mo> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           322 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msqrt> 
          <mrow> 
           <mrow> 
            <mn>
              1 
            </mn> 
            <mo>
              / 
            </mo> 
            <mn>
              5 
            </mn> 
           </mrow> 
          </mrow> 
         </msqrt> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mi>
         r 
       </mi> 
       <mi>
         n 
       </mi> 
       <mi>
         o 
       </mi> 
       <mi>
         r 
       </mi> 
       <mi>
         m 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1282 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mn>
           0.45 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>.</p>
    <p>An example values for a custom implementation:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1.1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         0.42 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mo>
         − 
       </mo> 
       <mn>
         0.55 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          m 
        </mi> 
        <mrow> 
         <mn>
           321 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         0.5 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>An implementation example of a noise segment, determined by (8), is shown in <xref ref-type="fig" rid="fig8">
      Figure 8
     </xref>.</p>
    <fig id="fig8" position="float">
     <label>Figure 8</label>
     <caption>
      <title>Figure 8. Analog representation of the noise realization obtained by the N-method at 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   K
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   0.5
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId306.jpeg?20250623045317" />
    </fig>
    <p>Sampling 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         N 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> in accordance with Equation (9) gives the desired vector of noise measurements: 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         n 
       </mi> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            0 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <mo>
           ⋯ 
         </mo> 
         <mo>
           , 
         </mo> 
         <mtext>
             
         </mtext> 
         <msub> 
          <mi>
            n 
          </mi> 
          <mrow> 
           <mn>
             127 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. For example</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         3.75 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          1 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         4.26 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         0.1 
       </mn> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <mo>
         ⋯ 
       </mo> 
       <mo>
         , 
       </mo> 
       <mtext>
           
       </mtext> 
       <msub> 
        <mi>
          n 
        </mi> 
        <mrow> 
         <mn>
           127 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1.47 
       </mn> 
      </mrow> 
     </math>.</p>
    <p>The actually obtained frequency band represented by the vector 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        n 
      </mi> 
     </math> is 32 Hz. Standard deviation is 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msubsup> 
        <mi>
          σ 
        </mi> 
        <mi>
          n 
        </mi> 
        <mo>
          ∗ 
        </mo> 
       </msubsup> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         5.58 
       </mn> 
      </mrow> 
     </math>. Energy parameters of the obtained model are 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <mi>
         N 
       </mi> 
       <mi>
         R 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math>, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          N 
        </mi> 
        <mn>
          0 
        </mn> 
       </msub> 
       <mo>
         = 
       </mo> 
       <mn>
         1 
       </mn> 
      </mrow> 
     </math>, which fully corresponds to the input data of the experiment.</p>
    <p>The autocorrelation functions 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         C 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          τ 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> of the process 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         N 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, calculated for one arbitrary realization of noise, in the region of the main maximum for both methods have the forms shown in <xref ref-type="fig" rid="fig9">
      Figure 9
     </xref>.</p>
    <fig id="fig9" position="float">
     <label>Figure 9</label>
     <caption>
      <title>Figure 9. Autocorrelation functions of the process 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   N
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math>. (a) autocorrelation functions of the 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   N
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> obtained by T-method; (b) autocorrelation functions of the 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   N
  
         </mi>
  
         <mrow>
   
          <mo>
           
    (
   
          </mo> 
   
          <mi>
           
    t
   
          </mi> 
   
          <mo>
           
    )
   
          </mo>
  
         </mrow>
 
        </mrow>

       </math> obtained by N-method.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/9702627-rId327.jpeg?20250623045317" />
    </fig>
    <p>T-method does not correctly interpret the result of preliminary noise filtering. The noise measurement vector corresponds to the 64 Hz band. The width of the main lobe of the autocorrelation function of a discrete noise sample of N-method is 2 times larger than the similar value estimated for T-method. This means that the N-method generates a vector of discrete noise measurements that is fully compatible with the 32 Hz bandwidth. N-method is absolutely correct for generating a discrete sample of noise after its preliminary filtering.</p>
    <p>Intermediate conclusion 3: when 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         K 
       </mi> 
       <mo>
         = 
       </mo> 
       <mn>
         0.5 
       </mn> 
      </mrow> 
     </math> (for T-method – abnormal narrowed band mode) T-method does not work correctly, giving a false predominance of signal over noise, which is equivalent to a 2-fold overestimated SNR value. In this case, the vector of discrete samples 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        n 
      </mi> 
     </math> generated by the T-method corresponds to noise with a bandwidth of 64 Hz, instead of the actual value of 32 Hz. The N-method (analog-discrete method for modeling noise measurements) works absolutely correctly in this situation. The frequency band corresponding to the resulting discrete sample of noise measurements is 32 Hz. The standard deviation of discrete noise samples, despite the difference in frequency band, for both methods is practically the same and approximately equal 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msqrt> 
        <mrow> 
         <mrow> 
          <mrow> 
           <msub> 
            <mi>
              f 
            </mi> 
            <mi>
              S 
            </mi> 
           </msub> 
          </mrow> 
          <mo>
            / 
          </mo> 
          <mn>
            4 
          </mn> 
         </mrow> 
        </mrow> 
       </msqrt> 
       <mo>
         = 
       </mo> 
       <msqrt> 
        <mrow> 
         <mn>
           32 
         </mn> 
        </mrow> 
       </msqrt> 
       <mo>
         ≈ 
       </mo> 
       <mn>
         5.66 
       </mn> 
      </mrow> 
     </math>.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Conclusion</title>
   <p>The traditional model (T-method) is correct for the only (standard) full-band noise situation when 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
     </mrow> 
    </math>. In other cases when 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        2 
      </mn> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        K 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0.5 
      </mn> 
     </mrow> 
    </math> T-method is not suitable for use as it gives false noise characteristics. The analog-discrete model (N-method) works correctly not only for full-band noise, but also for the case of preliminary noise filtering. As has been shown above, when a sampling rate of 128 Hz, the N-method actually generates a vector of noise measurements with a bandwidth of 32 Hz, i.e., requirement 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         f 
       </mi> 
       <mi>
         s 
       </mi> 
      </msub> 
      <mo>
        &gt; 
      </mo> 
      <mn>
        2 
      </mn> 
      <mo>
        ⋅ 
      </mo> 
      <mi>
        F 
      </mi> 
      <mi>
        H 
      </mi> 
     </mrow> 
    </math> fulfilled. Methods of receiving noisy signals that are capable of providing better results compared to OCR require (before discretization) preliminary filtering of the signal-noise mixture. In this case, only the N-method proposed in this work is acceptable for modeling due to its universality and correctness of operation in models of promising digital demodulators.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.143467-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Proakis, J.G. and Manolakis, D.G. (1988) Introduction to Digital Processing. Macmillan. 
    </mixed-citation>
   </ref>
   <ref id="scirp.143467-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Proakis, J.G. (2008) Digital Communications. 5th Ed., McGraw-Hill.
    </mixed-citation>
   </ref>
   <ref id="scirp.143467-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kotelnikov, V.A. (1947) The Theory of Optimum Noise Immunity. Ph. D. Dissertation, Molotov Energy Institute.
    </mixed-citation>
   </ref>
   <ref id="scirp.143467-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Franks, L. (1969) Signal Theory. Prentice-Hall.
    </mixed-citation>
   </ref>
   <ref id="scirp.143467-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Price, R. (1956) Optimum Detection of Random Signals in Noise, with Application to Scatter-Multipath Communication-I. IEEE Transactions on Information Theory, 2, 125-135. &gt;https://doi.org/10.1109/tit.1956.1056827
    </mixed-citation>
   </ref>
   <ref id="scirp.143467-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rassomakhin, S.G. (2018) Mathematical and Physical Nature of the Channel Capacity. Telecommunications and Radio Engineering, 76, 1423-1451. &gt;https://doi.org/10.1615/telecomradeng.v76.i16.40
    </mixed-citation>
   </ref>
   <ref id="scirp.143467-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Shannon, C.E. (1948) A Mathematical Theory of Communication. Bell System Technical Journal, 27, 379-423. &gt;https://doi.org/10.1002/j.1538-7305.1948.tb01338.x
    </mixed-citation>
   </ref>
   <ref id="scirp.143467-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Shannon, C.E. (1959) Probability of Error for Optimal Codes in a Gaussian Channel. Bell System Technical Journal, 38, 611-656. &gt;https://doi.org/10.1002/j.1538-7305.1959.tb03905.x
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>