0
3.8kviews
Explain Quantization effect in computation of DFT
1 Answer
2
223views

Let $x(n)$ be a finite duration complex-valued sequence of length $N .$

By definition, $X(k)=D F T[x(n)]=\sum_N x(n) \cdot W_{N}^{n k},$ where $k=0,1,2, \ldots N-1$ and W is the twiddle factor.

Let the real and imaginary components of $\mathrm{x}(\mathrm{n})$ and $W_{N}^{n k}$ be represented by $\mathrm{b}$ bits with fixed-point arithmetic. …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.