Let’s talk about that diamond-shaped region in the plane we so often see associated with CSP. I’m talking about the principal domain for the discrete-time/discrete-frequency spectral correlation function. Where does it come from? Why do we care? When does it come up?
The Principal Domain in Conventional DSP
When we talk about the Fourier transform of a continuous-time signal ,
there is no necessary structure to the transform . That is, it is not necessarily periodic, constant, bounded (think ), of bounded support, etc. It can possess some symmetries for some signals, such as when is real-valued.
On the other hand, when we consider the discrete Fourier transform (DFT), typically computed by the fast Fourier transform (FFT) algorithm, the transform does have strong structure: it is periodic. The DFT for a sequence is given by
Here I’ve implicitly set the sampling increment equal to unity, as is my custom at the CSP Blog. The Fourier frequencies are and the time instants are . To relate to a physical analog signal that was sampled at rate Hz, replace with and with . In normalized units, the Fourier frequencies range from to , and in physical units they range from to . But they don’t have to be assigned to that range. Let’s see why.
Removing the restriction on , we simply have the function
defined for all integers . Let’s look at ,
We see immediately that if , with any integer, then . Therefore is a periodic function of index with period .
The periodicity of the DFT means we can view the frequency-domain content of by looking at any set of consecutive values of the transform . Mathematicians (and MATLAB through fft.m) choose . Electrical engineers and signal processors typically choose (in MATLAB, follow fft.m with fftshift.m).
We can also view the periodicity of the DFT in terms of the Fourier frequencies themselves–the . Changing the notation slightly, we obtain the alternative expression
where . This means the DFT is a periodic function of frequency with period equal to . In signal processing, we like to look at the period that corresponds to the frequency interval , which puts zero frequency in the middle of the interval. In terms of physical frequencies, the interval is , where the open right end of the interval means . This interval of frequencies is the principal domain in signal processing. You can see it follows from the periodicity of the discrete Fourier transform. We’ll now turn to the principal domain in CSP, which also depends on the periodic property of the DFT.
The Principal Domain in CSP
What is the region in the plane for which the spectral correlation function is, or can be, unique? That is, what is the minimal-area region for which each point within the region can be different (not dependent on) all other points within the region, but which is identical to one or more points outside of the region? Where is the spectral correlation function non-redundant?
Let’s approach these questions by looking at the non-conjugate cyclic periodogram,
where is the discrete Fourier transform for samples of beginning with sample .
Each of the discrete Fourier transforms in (6) are periodic functions of frequency , with period equal to . For cycle-frequency , we have the conventional periodogram,
which must be periodic with period . That simply means that the periodogram is unique (need only be considered) on an interval of length , and we signal processors typically choose the interval as discussed earlier.
For spectral frequency , we have the cyclic periodogram slice given by
which is periodic with period ,
So we know the non-redundant set of frequencies can be specified by the interval , and the non-redundant set of cycle frequencies can be specified by the interval . That is, the maximum and minimum frequencies to consider are and , and the maximum and minimum cycle frequencies to consider are and , when is large. And this does suggest the diamond shape we’ve seen in previous CSP Blog posts and in many papers–the one with vertices and .
The diamond shape of the spectral correlation principal domain can be inferred by considering the act of shifting the -point FFT to the left and to the right by the amount , where is the cycle frequency in normalized Hz. The amount of overlap is for (the periodogram), and linearly decreases to zero for . For any valid , the overlap is about in Hz.
The periodicity means that we can write the following relationship between the principal domain centered at the origin and all other domains:
where and are arbitrary integers.
So each point in the principal domain diamond translates to a corresponding point in each of an infinite number of non-principal-domain diamonds. The redundancy of a point within the principal domain with another point within the principal domain is possible too, and depends on the nature of the signal. See the CSP Blog post on symmetry relations for second-order cyclostationarity for more details. For complex-valued data, we can safely restrict our attention to and for the non-conjugate spectral correlation function, but must consider the entire principal-domain diamond for conjugate spectral correlation.
Time- and Frequency-Domain Reconciliation
But there is a catch or stumbling block. The kinds of results we get depends on whether we proceed with estimation in the time domain or in the frequency domain. When we estimate the cyclic autocorrelation function directly in the time domain we can obtain results that appear to contradict the principal-domain results.
Staying with our usual rectangular-pulse BPSK signal, with bit rate and carrier offset , we can straightforwardly compute the cyclic autocorrelation function by a finite-time average,
where we have adopted the asymmetric version of the cyclic autocorrelation because we are in discrete time. Now substitute for the cycle frequency a shifted-by-one cycle frequency ,
This means, for example, that the magnitude of the non-conjugate cyclic autocorrelation function for is the same as for . We already know that the magnitude of the non-conjugate cyclic autocorrelation for is the same as that for , so that means that the cyclic autocorrelation magnitude for is the same as that for !
The result of applying (11) to our BPSK signal is shown in Figure 2. By comparing to the cyclic autocorrelation function gallery (or Figure 4 below), we can see that all is well for cycle frequencies , but after , the feature magnitudes repeat in reverse order: the feature for is the same as that for , the one for is the same as that for , etc. So this seems to imply that the range of cycle frequency is not , but is more like .
What happened? This is a question I’ve gotten many many times.
My answer is that when we start with (11), we are explicitly constructing and using a sine wave of the form , and the unique sine waves of this form have frequencies on the interval . That is, we cannot unambiguously represent all sine waves in this discrete-time formulation of the cyclic-autocorrelation estimation problem. We can only get results from (11) for sine waves with frequencies that are in the signal-processing principal domain. If we try to use , for example, we see that that sine wave is the same as the sine wave with frequency . It’s a result of the sampling theorem (which we’ll get to in the Signal Processing ToolKit series soon). Essentially, if we stick with this time-domain approach (equation (11)), we are limited in the values of the cycle frequency we can operate with relative to those that make up the full spectral-correlation principal domain.
One way out of this problem is to increase the sampling rate of the data. If we doubled the sampling rate of our BPSK signal, we’d have a bit rate of , and we could still ‘see’ the cyclic autocorrelation estimates for cycle frequencies up to , but this means ten harmonics of the symbol rate, not just five. The signal has an infinite number of cycle frequencies, but after eight or nine, the magnitudes of the cyclic autocorrelation are too small to be useful anyway, so upsampling helps as much as we need it to.
But another way out is to abandon the direct time-domain estimation method (11) and estimate the cyclic autocorrelation by first estimating the spectral correlation function and then inverse Fourier transforming. Because the cyclic periodogram requires only the multiplication of two frequency-shifted Fourier transforms, each with the usual periodicity of one, we sidestep the need to explicitly generate a sine wave with frequency related to a cycle frequency, unlike (11). If we estimate the spectral correlation function we get the results in Figure 3, and if we then inverse transform each slice (fixed cycle frequency, variable spectral frequency), we obtain the desired cyclic autocorrelation estimates shown in Figure 4.
So the principal domain for the spectral correlation function is the pink diamond in Figure 1, although we cannot achieve cyclic autocorrelation estimates for each correct slice in the spectral correlation function if we insist on direct time-domain estimation of the cyclic autocorrelation. If we focus on the frequency domain, we know that we will not miss any signal’s cycle frequencies if we cover the principal domain with spectral correlation function point estimates with appropriate resolution.
Are you buying what I’m selling? Let me, and all the CSP Blog readers, know in the comments.
2 thoughts on “The Principal Domain for the Spectral Correlation Function”
In the lines “So we know the non-redundant set of frequencies can be specified by the interval [-0.5, 0.5-1/N], and the non-redundant set of frequencies can be specified by the interval [-1.0, 1.0-1/N].”,just after equation 9 it should be “So we know the non-redundant set of frequencies can be specified by the interval [-0.5, 0.5-1/N], and the non-redundant set of cyclic frequencies can be specified by the interval [-1.0, 1.0-1/N].” Am I correct
Welcome to the CSP Blog Kaushal!
Yes, you are correct and I have fixed that sentence to include “cycle” prior to the second occurrence of “frequencies.”