For a vector $$\overline x $$ = [x[0], x[1], ....., x[7]], the 8-point discrete Fourier transform (DFT) is denoted by $$\overline X $$ = DFT($$\overline x $$) = [X[0], X[1], ....., X[7]], where

$$X[k] = \sum\limits_{n = 0}^7 {x[n]\exp \left( { - j{{2\pi } \over 8}nk} \right)} $$.

Here, $$j = \sqrt { - 1} $$. If $$\overline x $$ = [1, 0, 0, 0, 2, 0, 0, 0] and $$\overline y $$ = DFT (DFT($$\overline x $$)), then the value of y[0] is __________ (rounded off to one decimal place).

A finite duration discrete-time signal $x[n]$ is obtained by sampling a continuous - time signal $x(t)=\cos (200 \pi t)$ at sampling instants $t=\frac{n}{400}, n=0,1, \ldots ., 7$. The 8-point discrete Fourier transform (DFT) is defined as

$$ X[k]=\sum_{n=0}^7 x[n] e^{-j \pi n k / 4} \text { for } k=0,1, \ldots ., 7 $$

Which one of the following statements is TRUE?

The Discrete Fourier Transform (DFT) of the 4-point sequence
$$x\left[ n \right]$$= {x[0], x[1], x[2], x[3]}
= {3, 2, 3, 4 } is
x[k] = {X[0], X[1], X[2], X[3]}
= {12, 2j, 0, -2j }
If $${X_1}$$ [k] is the DFT of the 12- point sequence$${X_1}$$[n] = {3, 0, 0, 2, 0, 0, 3, 0, 0, 4, 0, 0 },
The value of $$\left| {{{{X_1}[8]} \over {{X_1}[11]}}} \right|$$ is-----------------------.

A continuous-time speech signal $${x_a}(t)$$ is sampled at a rate of 8 kHz and the samples are subsequently grouped in blocks, each of size N. The DFT of each block is to be computed in real time using the radix-2 decimation-in-frequency FFT algorithm. If the processor performs all operations sequentially, and takes 20 µs for computing each complex multiplication (including multiplications by 1 and −1) and the time required for addition/ subtraction is negligible, then the maximum value of N is __________.