• mirroring a signal before FFT - why?

    From hdreck@freenet.de@21:1/5 to All on Sat Dec 14 18:44:12 2019
    I am trying to make sense of some awful MATLAB code. The first thing it does
    is mirror the signal. By that I mean it doubles the array length, then puts
    a time-reversed signal at the newly created back half.
    So this would have the same amplitude spectum, but what else is going on? Possibly it increases the frequency resolution, as the time length is
    doubled.
    I wonder if the algorithm had some side effect - creating crap towards
    the end, and this is swept under the carpet (which is the mirror copy).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Christian Gollwitzer@21:1/5 to All on Sun Dec 15 10:20:30 2019
    Am 15.12.19 um 03:44 schrieb hdreck@freenet.de:
    I am trying to make sense of some awful MATLAB code. The first thing it does is mirror the signal. By that I mean it doubles the array length, then puts
    a time-reversed signal at the newly created back half.
    So this would have the same amplitude spectum, but what else is going on? Possibly it increases the frequency resolution, as the time length is doubled.
    I wonder if the algorithm had some side effect - creating crap towards
    the end, and this is swept under the carpet (which is the mirror copy).


    It removes discontinuity at then end of the interval. The FFT assumes
    that the input signal is periodic and repeats infinitely many times.
    This is necessary because the Fourier transform is defined for an
    infinite signal, but you only give it a finite number of samples. If
    done in this way, and the first and last samples have different values,
    there is a discontinuity at the boundary which results in a strong
    disturbance.

    Mirroring the signal reduces the discontinuity, though there is still a
    jump in the derivative. The result is the same as the discrete cosine
    transform (DCT), so this code may also simply be a way to perform a DCT.

    Christian

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Steve Pope@21:1/5 to auriocus@gmx.de on Sun Dec 15 13:48:03 2019
    Christian Gollwitzer <auriocus@gmx.de> wrote:

    Am 15.12.19 um 03:44 schrieb hdreck@freenet.de:

    I am trying to make sense of some awful MATLAB code. The first thing
    it does is mirror the signal. By that I mean it doubles the
    array length, then puts a time-reversed signal at the newly created back half.

    [...]

    The result is the same as the discrete cosine
    transform (DCT), so this code may also simply be a way to perform a DCT.

    This is alsmost certainly what is going on, as it is the easiest
    way to implement a DCT using the Matlab built-in fft().

    Also, very often a window would be used before the fft().

    Steve

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Eric Jacobsen@21:1/5 to hdreck@freenet.de on Sun Dec 15 22:07:28 2019
    On Sat, 14 Dec 2019 18:44:12 -0800 (PST), hdreck@freenet.de wrote:

    I am trying to make sense of some awful MATLAB code. The first thing it does >is mirror the signal. By that I mean it doubles the array length, then puts
    a time-reversed signal at the newly created back half.
    So this would have the same amplitude spectum, but what else is going on? >Possibly it increases the frequency resolution, as the time length is >doubled.
    I wonder if the algorithm had some side effect - creating crap towards
    the end, and this is swept under the carpet (which is the mirror copy).

    There are certain symmetries in DFTs that can be exploited if one so
    desires, like this one.

    Consider that the transform of a real-valued time-domain vector is
    symmetric about zero in the frequency domain. So if you load a
    transform with an input vector that is symmetric about zero, it will
    be akin to performing an inverse transform on the spectrum of a
    real-valued signal.

    As others have mentioned, it's essentially also a trick to do a DCT
    using an FFT, exploiting the same symmetries.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Eric Jacobsen@21:1/5 to auriocus@gmx.de on Sun Dec 15 22:32:35 2019
    On Sun, 15 Dec 2019 10:20:30 +0100, Christian Gollwitzer
    <auriocus@gmx.de> wrote:

    Am 15.12.19 um 03:44 schrieb hdreck@freenet.de:
    I am trying to make sense of some awful MATLAB code. The first thing it does >> is mirror the signal. By that I mean it doubles the array length, then puts >> a time-reversed signal at the newly created back half.
    So this would have the same amplitude spectum, but what else is going on?
    Possibly it increases the frequency resolution, as the time length is
    doubled.
    I wonder if the algorithm had some side effect - creating crap towards
    the end, and this is swept under the carpet (which is the mirror copy).


    It removes discontinuity at then end of the interval. The FFT assumes
    that the input signal is periodic and repeats infinitely many times.
    This is necessary because the Fourier transform is defined for an
    infinite signal, but you only give it a finite number of samples. If
    done in this way, and the first and last samples have different values,
    there is a discontinuity at the boundary which results in a strong >disturbance.

    There have been long discussions here (and elsewhere) in the past
    about this. The point of view you mention is not held by all
    practicioners, and other points of view are just as valid. e.g., a
    DFT is a matrix multiply of an input to produce an output, and
    produces a 1:1 mapping from an input domain to an output domain. No
    samples outside of the input vector have any influence on the output, regardless of periodicity or lack thereof.

    Likewise essentially all window functions used to explain the response
    in the frequency domain are zero outside of the input vector. e.g.,
    the basic rectangular window when a weighted window is not applied.

    The periodic/circular point of view is certainly valid, but it is not
    necessary and is not used by many practicioners in the field since
    real-world signals are essentially never periodic over the length of
    the input vector.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard (Rick) Lyons@21:1/5 to Christian Gollwitzer on Sun Dec 15 20:31:22 2019
    On Sunday, December 15, 2019 at 1:20:36 AM UTC-8, Christian Gollwitzer wrote:
    Am 15.12.19 um 03:44 schrieb hdreck@freenet.de:

    The FFT assumes that the input signal is periodic and
    repeats infinitely many times.

    Hi.
    The unfortunately popular notion that "The FFT assumes its input is periodic" must surely be the most profound misconception in all of DSP. The FFT cannot make assumptions. Making an assumption is a mental activity. Only a living creature with a brain
    can make an assumption.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Steve Pope@21:1/5 to Lyons on Tue Dec 17 03:58:11 2019
    Richard (Rick) Lyons <r.lyons@ieee.org> wrote:

    On Sunday, December 15, 2019 at 1:20:36 AM UTC-8, Christian Gollwitzer wrote:

    Hi.
    The unfortunately popular notion that "The FFT assumes its input is
    periodic" must surely be the most profound misconception in all of DSP.
    The FFT cannot make assumptions. Making an assumption is a mental
    activity. Only a living creature with a brain can make an assumption.

    "The FFT evangelists assume the input is periodic.." ??

    S.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dbd@21:1/5 to Steve Pope on Mon Dec 16 21:12:59 2019
    On Monday, December 16, 2019 at 7:58:14 PM UTC-8, Steve Pope wrote:
    Richard (Rick) Lyons <r.lyons@ieee.org> wrote:

    On Sunday, December 15, 2019 at 1:20:36 AM UTC-8, Christian Gollwitzer wrote:

    Hi.
    The unfortunately popular notion that "The FFT assumes its input is >periodic" must surely be the most profound misconception in all of DSP.
    The FFT cannot make assumptions. Making an assumption is a mental
    activity. Only a living creature with a brain can make an assumption.

    "The FFT evangelists assume the input is periodic.." ??

    S.

    The evangelists who wish to interpret the output of the DFT as samples of the Fourier Transform must assume that the input is periodic in the DFT size.

    Dale B Dalrymple

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard (Rick) Lyons@21:1/5 to dbd on Tue Dec 17 05:36:03 2019
    On Monday, December 16, 2019 at 9:13:02 PM UTC-8, dbd wrote:

    The evangelists who wish to interpret the output of the DFT as samples of the Fourier Transform must assume that the input is periodic in the DFT size.

    Dale B Dalrymple

    Hi Dale (and Steve Pope). The notion of periodicity is much more complicated than we first thought when we began to learn DSP theory. College DSP textbooks say that an x(n) sequence has a period of N samples if and only if:

    x[n+N] = x[n] for all n.

    But that equality is ONLY true for infinite-length sequences, and infinite-length sequences do not exist in reality. An infinite-length sequence is an abstract idea, ...like a perfect circle or one of Euclid's lines having infinite length and zero
    thickness. What this means is that, based on the above periodicity definition, we will never encounter, nor ever be able to generate, a periodic sequence in our real world.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Eric Jacobsen@21:1/5 to d.dalrymple@sbcglobal.net on Tue Dec 17 16:00:02 2019
    On Mon, 16 Dec 2019 21:12:59 -0800 (PST), dbd
    <d.dalrymple@sbcglobal.net> wrote:

    On Monday, December 16, 2019 at 7:58:14 PM UTC-8, Steve Pope wrote:
    Richard (Rick) Lyons <r.lyons@ieee.org> wrote:

    On Sunday, December 15, 2019 at 1:20:36 AM UTC-8, Christian Gollwitzer wrote:

    Hi.
    The unfortunately popular notion that "The FFT assumes its input is
    periodic" must surely be the most profound misconception in all of DSP.
    The FFT cannot make assumptions. Making an assumption is a mental
    activity. Only a living creature with a brain can make an assumption.

    "The FFT evangelists assume the input is periodic.." ??

    S.

    The evangelists who wish to interpret the output of the DFT as samples of the Fourier Transform must assume that the input is periodic in the DFT size.

    Dale B Dalrymple

    A limiting assumption. ;)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dbd@21:1/5 to All on Tue Dec 17 20:18:16 2019
    On Tuesday, December 17, 2019 at 5:36:07 AM UTC-8, Richard (Rick) Lyons wrote:
    ...
    ...an x(n) sequence has a period of N samples if and only if:

    x[n+N] = x[n] for all n.

    But that equality is ONLY true for infinite-length sequences, and infinite-length sequences do not exist in reality. An infinite-length sequence is an abstract idea, ...like a perfect circle or one of Euclid's lines having infinite length and zero
    thickness. What this means is that, based on the above periodicity definition, we will never encounter, nor ever be able to generate, a periodic sequence in our real world.

    Hi Rick

    As George Box said:
    'Essentially, all models are wrong, but some are useful'

    You and I may never live long enough to see an infinite sequence, but there may be sequences that meet the equation for all n that we have observed and it is perfectly useful to take advantage of that periodicity condition where it is met.

    I started in with spectrum analysis when I was hired by a company called Spectral Dynamics. One of their early systems analyzed machinery vibration of machines that provided a once-per-rev tach signal. That signal was the reference to a phased lock loop
    the could be used, along with choice of transform size to guarantee that all rotational rates generated by a gear chain would meet the periodicity condition as long as the loop was locked, even if the base rotational frequency drifted or was
    intentionally varied. As digital signal processing speeds increased, they went to sampling at a fixed rate, sampling the tach times and interpolating the data to synchronous sampling times.

    So it can be perfectly reasonable for an analyst to treat local data as periodic if there is other knowledge to justify it. That other knowledge could also be as simple as a comparison of the data values in the sequential data blocks for compliance with
    the equation.

    Dale B. Dalrymple

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Steve Pope@21:1/5 to d.dalrymple@sbcglobal.net on Wed Dec 18 04:23:13 2019
    dbd <d.dalrymple@sbcglobal.net> wrote:

    As George Box said:

    'Essentially, all models are wrong, but some are useful'

    I was wondering to whom to attribute this.

    I think it ought to be an official part of the scientific method.

    Steve

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard (Rick) Lyons@21:1/5 to All on Wed Dec 18 02:24:21 2019
    On Tuesday, December 17, 2019 at 8:18:19 PM UTC-8, dbd wrote:

    Hi Dale. I interpret your words to mean: Some sequences have a strong periodic nature if:

    x[n+N] = x[n] for many values of n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From makolber@yahoo.com@21:1/5 to All on Wed Dec 18 06:54:45 2019
    On Wednesday, December 18, 2019 at 5:24:25 AM UTC-5, Richard (Rick) Lyons wrote:
    On Tuesday, December 17, 2019 at 8:18:19 PM UTC-8, dbd wrote:

    Hi Dale. I interpret your words to mean: Some sequences have a strong periodic nature if:

    x[n+N] = x[n] for many values of n.

    this thread is an example of why I (still) read comp.dsp

    thanks

    Mark

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Phil Martel@21:1/5 to All on Wed Dec 18 11:39:39 2019
    On 12/18/2019 05:24, Richard (Rick) Lyons wrote:
    On Tuesday, December 17, 2019 at 8:18:19 PM UTC-8, dbd wrote:

    Hi Dale. I interpret your words to mean: Some sequences have a strong periodic nature if:

    x[n+N] = x[n] for many values of n.

    Hi Rick, I assume you meant "for many values of N" or "for all N > some
    large number"

    --
    Best wishes,
    --Phil
    pomartel At Comcast(ignore_this) dot net

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard (Rick) Lyons@21:1/5 to Phil Martel on Wed Dec 18 11:09:33 2019
    On Wednesday, December 18, 2019 at 8:39:42 AM UTC-8, Phil Martel wrote:

    Hi Rick, I assume you meant "for many values of N" or "for all N > some
    large number"

    --
    Best wishes,
    --Phil

    Hi Phil. No, I did mean "many values of n". The fixed variable N is the period (an integer measured in samples) of some sequence that appears to be periodic because it has repetitive equal-amplitude sample values separated by N samples.

    In my mind I've been formulating two different definitions of "periodicity" for finite-length sequences. But I'm not yet ready to advertise those definitions to you DSP guys for fear of looking like a knucklehead.

    Hey Phil, ... have you seen the following web page?

    https://www.dsprelated.com/showquiz/5

    Regards,
    [-Rick-]

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dbd@21:1/5 to All on Thu Dec 19 01:32:05 2019
    On Wednesday, December 18, 2019 at 2:24:25 AM UTC-8, Richard (Rick) Lyons wrote:
    On Tuesday, December 17, 2019 at 8:18:19 PM UTC-8, dbd wrote:

    Hi Dale. I interpret your words to mean: Some sequences have a strong periodic nature if:

    x[n+N] = x[n] for many values of n.

    Rick, I would say that in any range of n where the equation is satisfied, our data is indistinguishable from samples from a periodic sequence despite the fact that our data sequence is always finite. That means an analyst can safely act as if the data
    were periodic.

    Real data may consist of samples of the sum of components of types like periodic-in-N, periodic-not-in-N, aperiodic and stocastic. Real DSP systems can't process infinite sequences, they don't need to to justify treating data as containing periodic
    components.

    As Jerry would post:
    "Engineering is the art of making what you want from things you can get."

    Dale B. Dalrymple

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard (Rick) Lyons@21:1/5 to dbd on Thu Dec 19 03:24:08 2019
    On Thursday, December 19, 2019 at 1:32:09 AM UTC-8, dbd wrote:

    Rick, I would say that in any range of n where the equation is satisfied, our data is indistinguishable from samples from a periodic sequence despite the fact that our data sequence is always finite. That means an analyst can safely act as if the data
    were periodic.


    Dale B. Dalrymple

    Hi Dale. I agree with you. If we had a 10,000-sample sequence containing exactly 1,000 cycles of a cosine wave, we'd definitely say that sequence was "periodic" even though it does not satisfy the following textbook definition of periodicity:

    x[n+N] = x[n] for all n.

    [-Rick-]

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Steve Pope@21:1/5 to Lyons on Thu Dec 19 12:04:36 2019
    Richard (Rick) Lyons <r.lyons@ieee.org> wrote:

    Hi Dale. I agree with you. If we had a 10,000-sample sequence containing >exactly 1,000 cycles of a cosine wave, we'd definitely say that sequence
    was "periodic" even though it does not satisfy the following textbook >definition of periodicity:

    x[n+N] = x[n] for all n.

    The signal is short-term stationary and is also narrowband, and not
    noise-like. These may add up to it being "quasi-periodic", or some such.

    Steve

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Phil Martel@21:1/5 to All on Thu Dec 19 10:23:20 2019
    On 12/18/2019 14:09, Richard (Rick) Lyons wrote:
    On Wednesday, December 18, 2019 at 8:39:42 AM UTC-8, Phil Martel wrote:

    Hi Rick, I assume you meant "for many values of N" or "for all N > some
    large number"

    --
    Best wishes,
    --Phil

    Hi Phil. No, I did mean "many values of n". The fixed variable N is the period (an integer measured in samples) of some sequence that appears to be periodic because it has repetitive equal-amplitude sample values separated by N samples.

    In my mind I've been formulating two different definitions of "periodicity" for finite-length sequences. But I'm not yet ready to advertise those definitions to you DSP guys for fear of looking like a knucklehead.

    Hey Phil, ... have you seen the following web page?

    https://www.dsprelated.com/showquiz/5

    Regards,
    [-Rick-]

    Thanks Rick,
    I understand what you were saying better now. I guess I was confused by
    the concept of sampling and processing blocks of N samples
    0 <= n < N, N <= n < 2*N and so forth.
    I'll look over that quiz later.
    --
    Best wishes,
    --Phil
    pomartel At Comcast(ignore_this) dot net

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Eric Jacobsen@21:1/5 to d.dalrymple@sbcglobal.net on Thu Dec 19 17:07:06 2019
    On Thu, 19 Dec 2019 01:32:05 -0800 (PST), dbd
    <d.dalrymple@sbcglobal.net> wrote:

    On Wednesday, December 18, 2019 at 2:24:25 AM UTC-8, Richard (Rick) Lyons w= >rote:
    On Tuesday, December 17, 2019 at 8:18:19 PM UTC-8, dbd wrote:
    =20
    Hi Dale. I interpret your words to mean: Some sequences have a strong pe= >riodic nature if:
    =20
    x[n+N] =3D x[n] for many values of n.

    Rick, I would say that in any range of n where the equation is satisfied, o= >ur data is indistinguishable from samples from a periodic sequence despite = >the fact that our data sequence is always finite. That means an analyst can=
    safely act as if the data were periodic.

    Yup, or circular. ;)

    That's kinda sayin' the same thing, tho...

    I think when people can get to where they understand and can
    effectively use the various points of view they can be more productive
    as well as communicate efficiently with others working from whichever perspective. So don't just grab one point of view and run with it,
    understand as much as you can.

    Real data may consist of samples of the sum of components of types like per= >iodic-in-N, periodic-not-in-N, aperiodic and stocastic. Real DSP systems ca= >n't process infinite sequences, they don't need to to justify treating data=
    as containing periodic components.

    As Jerry would post:
    "Engineering is the art of making what you want from things you can get."

    Dale B. Dalrymple

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From dbd@21:1/5 to Steve Pope on Thu Dec 19 12:26:34 2019
    On Thursday, December 19, 2019 at 4:04:40 AM UTC-8, Steve Pope wrote:
    ...

    The signal is short-term stationary and is also narrowband, and not noise-like. These may add up to it being "quasi-periodic", or some such.

    Steve

    Steve

    The signal can be as noise-like as any sequence of only N samples can be. It also allows some parameters of the sequence to be specified in ways very hard to achieve with an analog signal source. This is useful to generate test signals for systems
    containing spectrum analysers. It is referred to as synchronous noise. Depending on the pre- and post-transform processing included in the scope of the test, the data period N may need to be far larger than the transform size being exercised in the test.

    Dale B. Dalrymple

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Steve Pope@21:1/5 to d.dalrymple@sbcglobal.net on Fri Dec 20 02:59:37 2019
    dbd <d.dalrymple@sbcglobal.net> wrote:

    On Thursday, December 19, 2019 at 4:04:40 AM UTC-8, Steve Pope wrote:

    Richard (Rick) Lyons <r.lyons@ieee.org> wrote:

    Hi Dale. I agree with you. If we had a 10,000-sample sequence containing >>> exactly 1,000 cycles of a cosine wave, we'd definitely say that sequence >>> was "periodic" even though it does not satisfy the following textbook
    definition of periodicity:

    The signal is short-term stationary and is also narrowband, and not
    noise-like. These may add up to it being "quasi-periodic", or some such.

    The signal can be as noise-like as any sequence of only N samples can
    be.

    Yes, I agree. (Although the specific signal described by Rick is
    not noise-like.)

    I think of "noise-like" as suggesting the signal contains little to no information and little to no autocorrelation. In that sense, one
    can make the signal more noise-like by randomising the sign, phase,
    or some other property of each repetition... which of course makes
    it not periodic, or less "quasi-periodic" than it was before.

    It also allows some parameters of the sequence to be specified in
    ways very hard to achieve with an analog signal source. This is useful
    to generate test signals for systems containing spectrum analysers. It
    is referred to as synchronous noise.

    Thanks, I had not previously heard of this term.

    Depending on the pre- and
    post-transform processing included in the scope of the test, the data
    period N may need to be far larger than the transform size being
    exercised in the test.

    Yes. Thanks.

    Steve

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Eric Jacobsen@21:1/5 to Pope on Sat Dec 21 03:31:17 2019
    On Fri, 20 Dec 2019 02:59:37 +0000 (UTC), spope384@gmail.com (Steve
    Pope) wrote:

    dbd <d.dalrymple@sbcglobal.net> wrote:

    On Thursday, December 19, 2019 at 4:04:40 AM UTC-8, Steve Pope wrote:

    Richard (Rick) Lyons <r.lyons@ieee.org> wrote:

    Hi Dale. I agree with you. If we had a 10,000-sample sequence containing >>>> exactly 1,000 cycles of a cosine wave, we'd definitely say that sequence >>>> was "periodic" even though it does not satisfy the following textbook
    definition of periodicity:

    The signal is short-term stationary and is also narrowband, and not
    noise-like. These may add up to it being "quasi-periodic", or some such.

    The signal can be as noise-like as any sequence of only N samples can
    be.

    Yes, I agree. (Although the specific signal described by Rick is
    not noise-like.)

    I think of "noise-like" as suggesting the signal contains little to no >information and little to no autocorrelation. In that sense, one
    can make the signal more noise-like by randomising the sign, phase,
    or some other property of each repetition... which of course makes
    it not periodic, or less "quasi-periodic" than it was before.

    Probably most of us generally think of noise along those lines, but
    one definition of "noise" that I've seen is "any unwanted signal".
    There are plenty of cases where a very pure tone would be a
    significant impairment and perhaps treated as "noise". In a
    spread-spectrum system, a tone will turn into pseudo-noise after the despreader.

    And back to Dale's point, it doesn't really matter. The DFT treats
    all of it the same.


    It also allows some parameters of the sequence to be specified in
    ways very hard to achieve with an analog signal source. This is useful
    to generate test signals for systems containing spectrum analysers. It
    is referred to as synchronous noise.

    Thanks, I had not previously heard of this term.

    Depending on the pre- and
    post-transform processing included in the scope of the test, the data >>period N may need to be far larger than the transform size being
    exercised in the test.

    Yes. Thanks.

    Steve

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Randy Yates@21:1/5 to Lyons" on Sat Dec 21 00:31:05 2019
    "Richard (Rick) Lyons" <r.lyons@ieee.org> writes:

    On Monday, December 16, 2019 at 9:13:02 PM UTC-8, dbd wrote:

    The evangelists who wish to interpret the output of the DFT as samples of the Fourier Transform must assume that the input is periodic in the DFT size.

    Dale B Dalrymple

    Hi Dale (and Steve Pope). The notion of periodicity is much more complicated than we first thought when we began to learn DSP theory. College DSP textbooks say that an x(n) sequence has a period of N samples if and only if:

    x[n+N] = x[n] for all n.

    But that equality is ONLY true for infinite-length sequences, and infinite-length sequences do not exist in reality.

    Neither do numbers.
    --
    Randy Yates, DSP/Embedded Firmware Developer
    Digital Signal Labs
    http://www.digitalsignallabs.com

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard (Rick) Lyons@21:1/5 to Randy Yates on Sat Dec 21 02:41:20 2019
    On Friday, December 20, 2019 at 9:31:12 PM UTC-8, Randy Yates wrote:
    "Richard (Rick) Lyons" <r.lyons@ieee.org> writes:

    On Monday, December 16, 2019 at 9:13:02 PM UTC-8, dbd wrote:

    The evangelists who wish to interpret the output of the DFT as samples of the Fourier Transform must assume that the input is periodic in the DFT size.

    Dale B Dalrymple

    Hi Dale (and Steve Pope). The notion of periodicity is much more complicated than we first thought when we began to learn DSP theory. College DSP textbooks say that an x(n) sequence has a period of N samples if and only if:

    x[n+N] = x[n] for all n.

    But that equality is ONLY true for infinite-length sequences, and infinite-length sequences do not exist in reality.

    Neither do numbers.
    --
    Randy Yates

    Randy, ...you rapscallion!! Ha ha.
    Now you're forcing me to decide if the number 3 exists.
    I thought it did. (There's a famous German 19th-century
    mathematician who said "God created the integers.")
    But now I have to think more about the number 3.

    Randy, does the musical note "middle C" exist?

    [-Rick-]

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Eric Jacobsen@21:1/5 to yates@digitalsignallabs.com on Sat Dec 21 17:16:42 2019
    On Sat, 21 Dec 2019 00:31:05 -0500, Randy Yates
    <yates@digitalsignallabs.com> wrote:

    "Richard (Rick) Lyons" <r.lyons@ieee.org> writes:

    On Monday, December 16, 2019 at 9:13:02 PM UTC-8, dbd wrote:

    The evangelists who wish to interpret the output of the DFT as samples of the Fourier Transform must assume that the input is periodic in the DFT size.

    Dale B Dalrymple

    Hi Dale (and Steve Pope). The notion of periodicity is much more complicated than we first thought when we began to learn DSP theory. College DSP textbooks say that an x(n) sequence has a period of N samples if and only if:

    x[n+N] = x[n] for all n.

    But that equality is ONLY true for infinite-length sequences, and
    infinite-length sequences do not exist in reality.

    Neither do numbers.

    But quantities do! ;)

    --
    Randy Yates, DSP/Embedded Firmware Developer
    Digital Signal Labs
    http://www.digitalsignallabs.com

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Steve Pope@21:1/5 to Eric Jacobsen on Sat Dec 21 21:45:31 2019
    Eric Jacobsen <theman@ericjacobsen.org> wrote:

    On Fri, 20 Dec 2019 02:59:37 +0000 (UTC), spope384@gmail.com (Steve

    [Rick describes a sigal]

    The signal is short-term stationary and is also narrowband, and not
    noise-like. These may add up to it being "quasi-periodic", or some such.

    The signal can be as noise-like as any sequence of only N samples can
    be.

    Yes, I agree. (Although the specific signal described by Rick is
    not noise-like.)

    I think of "noise-like" as suggesting the signal contains little to no >>information and little to no autocorrelation. In that sense, one
    can make the signal more noise-like by randomising the sign, phase,
    or some other property of each repetition... which of course makes
    it not periodic, or less "quasi-periodic" than it was before.

    Probably most of us generally think of noise along those lines, but
    one definition of "noise" that I've seen is "any unwanted signal".

    Okay.

    There are plenty of cases where a very pure tone would be a
    significant impairment and perhaps treated as "noise". In a
    spread-spectrum system, a tone will turn into pseudo-noise after the >despreader.

    Yes, and interleaving can turn bursty noise/interference into something
    that behaves more like non-bursty noise/interference.

    And back to Dale's point, it doesn't really matter. The DFT treats
    all of it the same.

    (The inclusion of a DFT is not a premise of this discussion?)

    Whether it matters: for lots of applications it does. I first encountered
    the idea of a signal analysis providing a metric of "tone like" vs.
    "noise like" in a discussion with Bob Orban -- must have been around
    1979 -- it was definitely needed in his audio products, many other audio products, and things like vocoders.

    In communications .. well, such distinctions also matter, of course,
    but if the local word usage considers all interferers to be "noise",
    (valid terminology), then you need a term other than "noise-like" for
    these sorts of distinctions.

    Steve

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Eric Jacobsen@21:1/5 to Pope on Sun Dec 22 03:31:41 2019
    On Sat, 21 Dec 2019 21:45:31 +0000 (UTC), spope384@gmail.com (Steve
    Pope) wrote:

    Eric Jacobsen <theman@ericjacobsen.org> wrote:

    On Fri, 20 Dec 2019 02:59:37 +0000 (UTC), spope384@gmail.com (Steve

    [Rick describes a sigal]

    The signal is short-term stationary and is also narrowband, and not
    noise-like. These may add up to it being "quasi-periodic", or some such.

    The signal can be as noise-like as any sequence of only N samples can >>>>be.

    Yes, I agree. (Although the specific signal described by Rick is
    not noise-like.)

    I think of "noise-like" as suggesting the signal contains little to no >>>information and little to no autocorrelation. In that sense, one
    can make the signal more noise-like by randomising the sign, phase,
    or some other property of each repetition... which of course makes
    it not periodic, or less "quasi-periodic" than it was before.

    Probably most of us generally think of noise along those lines, but
    one definition of "noise" that I've seen is "any unwanted signal".

    Okay.

    There are plenty of cases where a very pure tone would be a
    significant impairment and perhaps treated as "noise". In a >>spread-spectrum system, a tone will turn into pseudo-noise after the >>despreader.

    Yes, and interleaving can turn bursty noise/interference into something
    that behaves more like non-bursty noise/interference.

    And back to Dale's point, it doesn't really matter. The DFT treats
    all of it the same.

    (The inclusion of a DFT is not a premise of this discussion?)

    AFAICT the context is periodicity over the aperture of a DFT.

    Whether it matters: for lots of applications it does. I first encountered >the idea of a signal analysis providing a metric of "tone like" vs.
    "noise like" in a discussion with Bob Orban -- must have been around
    1979 -- it was definitely needed in his audio products, many other audio >products, and things like vocoders.

    In communications .. well, such distinctions also matter, of course,
    but if the local word usage considers all interferers to be "noise",
    (valid terminology), then you need a term other than "noise-like" for
    these sorts of distinctions.

    Steve

    This is pretty normal in the usual context of ambiguous or overlapping definitions of engineering terms and DSP and comm terms in particular.
    This is why I cited the particular outlier definition of "noise",
    since one assumes what is meant at one's peril if it is not clarified
    by something like "AWGN", which does imply specific characteristics.
    Otherwise you might not know for certain what kind of "noise" might be
    meant.

    Especially in things like audio, many non-engineers would call loud,
    intrusive tones, "noise". You and I might not, but I've also seen a
    lot of correlated things called "noise", like harmonic interference,
    etc., etc., if it presents an impairment. Quantization "noise" is
    often highly correlated, but we call it "noise", anyway.

    I just thought it was in context of the discussion of noise being
    periodic or phase-locked over a DFT aperture, that if an otherwise
    reasonably stochastic signal is impaired by a tone with an integer
    number of cycles over the aperture, it might fit the description of
    "noise" even if sinusoidal.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Steve Pope@21:1/5 to Eric Jacobsen on Mon Dec 23 01:37:49 2019
    Eric Jacobsen <theman@ericjacobsen.org> wrote:

    On Sat, 21 Dec 2019 21:45:31 +0000 (UTC), spope384@gmail.com (Steve

    Pope) wrote:
    (The inclusion of a DFT is not a premise of this discussion?)

    AFAICT the context is periodicity over the aperture of a DFT.

    Yes, right. I was addessing only the sub-dicussion started by
    Rick, regarding the "notion of periodicity". Here Rick envisions
    two as-yet-undescribed algorithms for analyzing this.

    Those algorithms are not described as using transforms, and so
    could be pure time-domain algorithms, as is the case with my
    subsequent comments.

    The original thread, yes, is about using transforms.

    Sorry for being unclear.

    Steve

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Randy Yates@21:1/5 to Lyons" on Thu Dec 26 16:29:36 2019
    "Richard (Rick) Lyons" <r.lyons@ieee.org> writes:

    On Friday, December 20, 2019 at 9:31:12 PM UTC-8, Randy Yates wrote:
    "Richard (Rick) Lyons" <r.lyons@ieee.org> writes:

    On Monday, December 16, 2019 at 9:13:02 PM UTC-8, dbd wrote:

    The evangelists who wish to interpret the output of the DFT as samples of the Fourier Transform must assume that the input is periodic in the DFT size.

    Dale B Dalrymple

    Hi Dale (and Steve Pope). The notion of periodicity is much more
    complicated than we first thought when we began to learn DSP
    theory. College DSP textbooks say that an x(n) sequence has a
    period of N samples if and only if:

    x[n+N] = x[n] for all n.

    But that equality is ONLY true for infinite-length sequences, and
    infinite-length sequences do not exist in reality.

    Neither do numbers.
    --
    Randy Yates

    Randy, ...you rapscallion!! Ha ha.
    Now you're forcing me to decide if the number 3 exists.

    I THOUGHT IT DID.

    (emphasis mine)

    Well now that's interesting. Can you show me the number "3" Rick? I
    don't mean one of a number of "representations" of the number "3," e.g.,
    using Roman numerals written in blue ink pen on one of Ziggy's thank-you
    notes in your handwriting (possibly while slightly intoxicated), but:

    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    THE ONE AND ONLY NUMBER "3."
    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

    Betcha can't.

    In my book, that makes it abstract: only a concept; not existing in the
    real world.

    And that was my point: if you insist that one concept must be dismissed
    solely because it is abstract, you must dismiss them all, and this would
    lead to a total breakdown of science, physics, and mathematics as we
    know them today.

    So perhaps it would be good to rethink periodicity and infinite-length sequences.

    [...]
    Randy, does the musical note "middle C" exist?

    Well, it depends on what you mean by "middle C." If you mean a note with
    the exact frequency 440 * (2^(1/12))^3 Hz, then no (please, let's not
    get into temperaments!).

    If you mean the 3rd white note C from the lowest C on a piano, then yes
    (on most pianos).

    Finally, I must thank you for expanding my vocabulary: I don't remember
    ever hearing of the word "rapscallion" before this. Thank you! I am
    not sure if I'm OK with being referred to as one, but thanks for
    the word anyway!
    --
    Randy Yates, DSP/Embedded Firmware Developer
    Digital Signal Labs
    http://www.digitalsignallabs.com

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard (Rick) Lyons@21:1/5 to Randy Yates on Sun Dec 29 07:00:51 2019
    On Thursday, December 26, 2019 at 1:29:45 PM UTC-8, Randy Yates wrote:

    Well now that's interesting. Can you show me the number "3" Rick? I
    don't mean one of a number of "representations" of the number "3," e.g., using Roman numerals written in blue ink pen on one of Ziggy's thank-you notes in your handwriting (possibly while slightly intoxicated), but:

    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    THE ONE AND ONLY NUMBER "3."
    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

    Betcha can't.

    In my book, that makes it abstract: only a concept; not existing in the
    real world.

    Hi Randy. Over the last few days I've been thinkin' about
    the question, "Does the number 3 exist?" My current opinion
    is: No. The number 3 does not exist.

    But this whole discussion troubles me because (don't laugh
    at me) I believe Santa Claus exists. So now you'll ask me,
    "How could Santa Claus exist but the number 3 does not exist?"
    I have to think more about all of this.

    And that was my point: if you insist that one concept must be dismissed solely because it is abstract, you must dismiss them all, and this would
    lead to a total breakdown of science, physics, and mathematics as we
    know them today.

    Wait, I didn't say that abstract ideas should be dismissed.
    The abstract notion of a perfect circle is a useful idea in
    math field of geometry. And the same can be said for the
    abstract notion of one of Euclid's lines having infinite
    length and zero thickness.

    So perhaps it would be good to rethink periodicity and infinite-length sequences.

    My main point was that the college textbook definition
    of "periodicity" does not apply to any discrete sequence
    that we will ever encounter (or ever generate) in practice.

    Finally, I must thank you for expanding my vocabulary: I don't remember
    ever hearing of the word "rapscallion" before this. Thank you! I am
    not sure if I'm OK with being referred to as one, but thanks for
    the word anyway!

    NO OFFENSE INTENDED.
    My guess is that the word "rapscallion" is a couple
    of hundred years old. To me the word means "a likeable
    guy who makes innocent trouble strictly for entertainment
    purposes", i.e., one who is playfully mischievous.
    (Huckleberry Finn, the boy created by Mark Twain,
    was a rapscallion. So, ha ha, you're in good company Randy!)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Randy Yates@21:1/5 to Lyons" on Sun Dec 29 18:37:43 2019
    "Richard (Rick) Lyons" <r.lyons@ieee.org> writes:

    On Thursday, December 26, 2019 at 1:29:45 PM UTC-8, Randy Yates wrote:

    Well now that's interesting. Can you show me the number "3" Rick? I
    don't mean one of a number of "representations" of the number "3," e.g.,
    using Roman numerals written in blue ink pen on one of Ziggy's thank-you
    notes in your handwriting (possibly while slightly intoxicated), but:

    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    THE ONE AND ONLY NUMBER "3."
    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

    Betcha can't.

    In my book, that makes it abstract: only a concept; not existing in the
    real world.

    Hi Randy. Over the last few days I've been thinkin' about
    the question, "Does the number 3 exist?" My current opinion
    is: No. The number 3 does not exist.

    But this whole discussion troubles me because (don't laugh
    at me) I believe Santa Claus exists. So now you'll ask me,
    "How could Santa Claus exist but the number 3 does not exist?"
    I have to think more about all of this.

    And that was my point: if you insist that one concept must be dismissed
    solely because it is abstract, you must dismiss them all, and this would
    lead to a total breakdown of science, physics, and mathematics as we
    know them today.

    Wait, I didn't say that abstract ideas should be dismissed.
    The abstract notion of a perfect circle is a useful idea in
    math field of geometry. And the same can be said for the
    abstract notion of one of Euclid's lines having infinite
    length and zero thickness.

    So perhaps it would be good to rethink periodicity and infinite-length
    sequences.

    My main point was that the college textbook definition
    of "periodicity" does not apply to any discrete sequence
    that we will ever encounter (or ever generate) in practice.

    Well, yeah, that's true. There are no infinite-length sequences in
    reality. There are no lines in reality. There are no circles in reality.
    There are no Dirac delta functions in reality. Sinusoids don't exist.
    Etc., etc.

    What of it? How is this fact pertinent to your point?

    In fact, color me thick, but I'm not exactly sure what your point even
    is. Can you please break it down to simple (but accurate) terms for me?

    Finally, I must thank you for expanding my vocabulary: I don't remember
    ever hearing of the word "rapscallion" before this. Thank you! I am
    not sure if I'm OK with being referred to as one, but thanks for
    the word anyway!

    NO OFFENSE INTENDED.
    My guess is that the word "rapscallion" is a couple
    of hundred years old. To me the word means "a likeable
    guy who makes innocent trouble strictly for entertainment
    purposes", i.e., one who is playfully mischievous.
    (Huckleberry Finn, the boy created by Mark Twain,
    was a rapscallion. So, ha ha, you're in good company Randy!)

    Gosh, I almost feel special now... :)
    --
    Randy Yates, DSP/Embedded Firmware Developer
    Digital Signal Labs
    http://www.digitalsignallabs.com

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From gah4@u.washington.edu@21:1/5 to All on Mon Jan 27 01:08:00 2020
    On Tuesday, December 17, 2019 at 5:36:07 AM UTC-8, Richard (Rick) Lyons wrote:

    (snip)

    Hi Dale (and Steve Pope). The notion of periodicity is much more
    complicated than we first thought when we began to learn DSP theory.
    College DSP textbooks say that an x(n) sequence has a period of
    N samples if and only if:

    x[n+N] = x[n] for all n.

    But that equality is ONLY true for infinite-length sequences,
    and infinite-length sequences do not exist in reality.
    An infinite-length sequence is an abstract idea, ...like a perfect
    circle or one of Euclid's lines having infinite length and
    zero thickness. What this means is that, based on the above
    periodicity definition, we will never encounter, nor ever
    be able to generate, a periodic sequence in our real world.

    This is bad, as much of physics, especially quantum mechanics,
    depends on Fourier transforms with t from -infinity to +infinity,
    or in higher dimension, over all space.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From gah4@u.washington.edu@21:1/5 to someone on Mon Jan 27 00:39:46 2020
    On Thursday, December 26, 2019 at 1:29:45 PM UTC-8, Randy Yates wrote:

    (sni, someone wrote)
    I THOUGHT IT DID.

    (emphasis mine)

    Well now that's interesting. Can you show me the number "3" Rick? I
    don't mean one of a number of "representations" of the number "3," e.g., using Roman numerals written in blue ink pen on one of Ziggy's thank-you notes in your handwriting (possibly while slightly intoxicated), but:

    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    THE ONE AND ONLY NUMBER "3."
    !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

    Reminds me of the proof that there is no least interesting number.

    1: Assume that there is a least interesting number.
    2: That number would be very interesting, as it has a property
    that no other number has.
    3: So it isn't least interesting after all.

    And definitely it isn't the number 3.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From gah4@u.washington.edu@21:1/5 to All on Mon Jan 27 01:28:43 2020
    On Sunday, December 15, 2019 at 8:31:26 PM UTC-8, Richard (Rick) Lyons wrote:
    On Sunday, December 15, 2019 at 1:20:36 AM UTC-8, Christian Gollwitzer wrote:
    Am 15.12.19 um 03:44 schrieb hdre..@freenet.de:

    The FFT assumes that the input signal is periodic and
    repeats infinitely many times.

    The unfortunately popular notion that "The FFT assumes its input
    is periodic" must surely be the most profound misconception
    in all of DSP. The FFT cannot make assumptions. Making an
    assumption is a mental activity. Only a living creature with
    a brain can make an assumption.

    I suppose so.

    But consider that the Fourier series is made up as a sum of
    periodic functions with the same period. Mathematically, the sum
    is also periodic with that period.

    So, who is making assumptions?

    There are transforms with other properties, but Fourier chose those
    functions when making the Fourier series. Does that move Fourier's
    assuming into the transform?

    Why can only living creatures with a brain make assumptions?
    Can robots with an electronic brain make assumptions? Or are the
    assumptions built-in by the designers and builders of the robot?

    Now consider a robot constructed to do some operation given some
    inputs, and maybe stretching it somewhat, the Fourier series is a
    robot that, given some input gives some other output. The assumptions
    that went into its design determine those outputs. To me, it isn't so
    hard to say that the robot makes assumptions based on the properties
    given to it by its designer.

    Even more, what is it that gives biochemical brains the ability to
    make assumptions but electronic ones don't have that ability?
    Both are built out of quantum-mechanical atoms and molecules,
    yet we give special properties to some, and not to others.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)