QUOTE(MLXXX @ Mar 25 2008, 06:25)

QUOTE(pdq @ Mar 25 2008, 20:11)

A series of samples at 44.1 khz cannot be used to represent any frequency above 22.05 khz because there will be a perfectly valid frequency below 22.05 khz which also goes through those exact same samples. Therefore 'by definition' all of the resulting frequencies are below the Nyquist limit.
Yes, this is true of a continuous sine wave. And it is all part of sampling theory since Nyquist. It is why filters are used immediately prior to an analogue to digital conversion process.
And true of all signals (ok, provided they meet a variety of
conditions, none of which are important here).
QUOTE(MLXXX @ Mar 25 2008, 06:25)

I am not sure though that this is the analysis that is relevant to white noise (or its variants), as white noise consists of random events rather than natural waveforms created by vibrating objects. The only way to asynchronously sample white noise created in the 44.1KHz format would be to sample it at over 88.2KHz. Alternatively it can be captured by phase locking the sample rate, i.e. sample at 44.1KHz in phase with the 44.1KHz creation. This may sound like double Dutch. I am saying that transferring a digital steam undisturbed is a special case of sampling it. Some people may understand what I am trying to say here, particularly after reading the next two paragraphs.
Let me address this before the next two paragraphs. The sampling theorem, as originated from Shannon, Kotelnikov, etc. refers very specifically to a particular interpolation process. The theorem states that samples can be taken of a signal and interpolated with a specific process to produce the original signal if and only if the original signal only contained frequencies below fs/2 Hz. That particular interpolation process is widely called Sinc interpolation.
You are not seeking to produce a noise signal with frequencies in (0, 44100), you are seeking to produce samples of a noise process bandlimited to (0, 22050Hz). That noise process is bandlimited, so sampling at 44100Hz is just fine.
QUOTE(MLXXX @ Mar 25 2008, 06:25)

In video terms, this is like a aligning a 1920x1080 pixel video camera in front of a 1920x1080 test pattern such that the test pattern pixels line up in a perfect one to one correspondence with the pixels in the camera. [Actually practical high performance video cameras have optical filters to avoid optical aliasing, but if you removed the optical filter you could get a perfect 1920x1080 result.] This is the exception to Nyquist: if a signal varies at the sampling rate, and the sampling coincides with that variation, a perfect sampling can be done: synchronous sampling.
Yes, and no. If you do this process, you will certainly get a perfect photo of the original card. There are some important things to remember here:
1) The sampling process you are doing (using an imaging sensor) averages out the signal (image) over the sample period (pixel). In audio, the signal is sampled at a single instant - the signal between these instants is discarded.
2) The interpolation process is different. Viewing the image on a screen does a sort of zeroth-order hold on the signal - the value is held over the output sample period. In audio (and printers) the signal is interpolated between sampling instants. In audio, this is done with Sinc interpolation (or a low-pass filter, which is mathematically equivalent).
So this depends very strongly on your definition of sampling. The one most DSP uses, and the one the DFT depends on, requires that the samples are related to the original signal by sinc interpolation (or an ideal low pass filter).
QUOTE(MLXXX @ Mar 25 2008, 06:25)

Putting this in more familiar terms, if you created a square wave at 44.1KHz, and you modulated the height of the top step and independently the bottom step of each of the square wave cycles to convey data, you could perfectly recover that data by sampling the square wave at 44.1KHz locked in phase to the middle of each step: synchronous sampling. If you could not do synchronous sampling you would need to sample at over 88.2KHz to recover the encoded data [actually for an encoded wave of such complexity and precision you might need quite a bit more than 88.2KHz of conventional asynchronous sampling].
Yes, you can do this. No, the DFT won't do anything sensible with the signal so produced - neither would conventional upsampling procedures, conventional digital filters, or conventional DACs.
QUOTE(MLXXX @ Mar 25 2008, 06:25)

The frequency analysis algorithms built into cool edit pro etc are not designed to display frequencies above fs/2.
Because the sets of samples that cool edit deals with by definition contain no frequencies above fs/2. Cool edit makes the assumption that the samples were produced from a lowpass signal - not a bandpass signal.
QUOTE(MLXXX @ Mar 25 2008, 06:25)

The concept of frequency of a wave created by a random number generator is a difficult concept.
Yes, but it is extremely well defined for digital signals, via the
Wiener-Khinchine theorem (or Einstein-Weiner-Khintchine depending on the book) to the autocorrelation function - a simple function of the original samples. It's difficult conceptually, but certainly not hazy mathematically.
I know it can be a difficult concept to grasp - but time varying signals, random signals (provided they are time limited), and all sorts of other non-sinusoidal signals fit just perfectly into this scheme.
QUOTE(MLXXX @ Mar 25 2008, 06:25)

A random wave really has no frequency. Any readout of frequency is as a result of chance.
Random waves have very well defined power spectral densities (PSDs). Talking about their frequency isn't any more interesting than talking about the frequency of the Motorhead song "Ace of Spades". Talking about the power spectral density of both of these things is interesting, however.
QUOTE(MLXXX @ Mar 25 2008, 06:25)

For short periods (of sufficient duration to be measured) the random wave behaves in a similar manner to a continuous wave of a particular frequency.
Random discrete-time waves (with N samples) behave like the sum of N sine waves equally spaced in frequency from -fs/2 to fs/2 Hz, with randomly scrambled phase, weighted by the power spectrum of the chosen noise signal. This much we know from the definition of discrete time signals and the discrete Fourier transform. Sure, you might get lucky and find ten consecutive points that you can fit a single sine to - but that doesn't tell you much about the underlying signal.
QUOTE(MLXXX @ Mar 25 2008, 06:25)

An extremely quickly changing waveform cannot be recognized by the frequency analysis algorithm. So my example above of +1, -1, +1, -1 would be ignored by the analysis algorithm, as it has no normal meaning in a 44.1KHz asynchronous sampling environment, even though if listened to by a bat would be at 44.1KHz!
By frequency analysis algorithm, do you mean the discrete fourier transform? Or do you mean the short-time Fourier transform (like a sonogram)? In both cases this signal is an edge case. It's discrete fourier transform (in the commonly used form) will yield [0, 0, 2, 0]. If you fed this signal (or a longer extension of the pattern) to an ideal DAC, you would get a 22050Hz sine wave at the output. This is simply because these samples correspond to the samples of a 22050Hz sine wave with a particular phase. But please don't get fixated on the critically sampled case.