Fourier transform of a quantized signal

AI Thread Summary
The discussion centers on the impact of quantizing a continuous function f(x) on its Fourier transform. Specifically, it examines the function g(x) defined as g(x) = ⌊f(x)⌋, where f(x) maps to [0, 100) and g(x) produces discrete values. The quantization introduces colored noise into the spectral representation G(ω), which is influenced by the nature of the quantization method used (floor, ceiling, etc.). The conversation highlights the relevance of this topic in digital signal processing, suggesting that the effects of quantization have been extensively studied in the literature. Resources such as Oppenheim and Schafer's work on discrete time signal processing are recommended for further exploration.
mnb96
Messages
711
Reaction score
5
Hello,
this time it's hard to tell whether this is the right forum to post this thread.

Suppose I have a continuous function f:\mathbb{R}\rightarrow [0,100), whose Fourier transform exists and is known. Note that the codomain of the function is composed by all the real numbers between 0 and 100.

If I "quantize" the values f(x), how this quantization affects the spectral representation of f ?

More formally, suppose I have f(x) defined as above, and also its Fourier transform F(ω) is known.
I want to consider the function: g(x)=\lfloor f(x) \rfloor.
How can I study the Fourier transform G(ω) ?
 
Last edited:
Physics news on Phys.org
I am not sure whether you are quantizing the amplitude of f in the time domain, or evaluating f at discrete times. I'll assume you mean the latter: g(t) is the product of f(t) and a train or sum of delta functions at the discrete times of interest. The continuous spectrum G(w) is therefore the convolution of F(w) with the transform of your delta function train. If the train happens to consist of deltas at equally spaced times (a comb), then its transform is also a comb (a train of deltas at equally spaced frequencies). This latter case arises in signal processing as the first step in producing a discrete Fourier transform (DFT) as well as in explaining aliasing. It therefore has a vast literature that you can access by searching on "discrete time Fourier transform."
 
Last edited:
Hi marcusl,

unfortunately I have to admit that I meant exactly the former of the two cases mentioned by you. I am interested in what happens when the "amplitude" in time domain of the function f(x) is quantized. I tried to express this when I wrote that I am interested in knowing whether it is possible to study (or at least say something) about the Fourier transform of another function g(x) defined in the following way:

g(x)=\lfloor f(x) \rfloor

If f(x) is a continuous function f:\mathbb{R} \rightarrow [0,100) then g(x) will be a function g:\mathbb{R} \rightarrow \{0,1,2,\ldots,99 \}.
For example if we define f(x)=x, then g(x) will look like a "staircase".
 
Sorry, I'm not a mathematician, don't know what brackets missing their tops mean, and got confused over which axis the range refers to. You are in luck, however, because this problem has also been studied exhaustively since our digital world is powered by analog-to-digital converters (ADC's). Colored noise due to the quantization errors will add onto G(ω). The noise is non-white because the distribution of errors is non-Gaussian, assuming that the input signal takes on all real values. Pay attention to whether your quantizer rounds, or takes floor or ceiling values, in case it matters. (I can't remember if it does.)

Take a look at digital signal processing books like Oppenheim and Schafer, Discrete Time Signal Processing. If they don't discuss the spectrum adequately there, you will find what you need in the vast engineering literature. Folks at the Electrical Engineering forum here can also help you further with questions.

EDIT:Here is an online reference that will get you started.
http://oldweb.mit.bme.hu/books/quantization/spectrum.pdf
 
Last edited:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
2
Views
487
Replies
4
Views
3K
Replies
6
Views
3K
Replies
3
Views
2K
Replies
47
Views
3K
Replies
3
Views
2K
Back
Top