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 __________.

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-----------------------.

Two sequences [a, b, c ] and [A, B, C ] are related as,
$$\left[ {\matrix{ A \cr B \cr C \cr } } \right] = \left[ {\matrix{ 1 \cr 1 \cr 1 \cr } {\mkern 1mu} \,\matrix{ 1 \cr {W_3^{ - 1}} \cr {W_3^{ - 2}} \cr } \,\matrix{ 1 \cr {W_3^{ - 2}} \cr {W_3^{ - 4}} \cr } } \right]{\mkern 1mu} \left[ {\matrix{ a \cr b \cr c \cr } } \right]$$ Where
$${W_3}$$ = $${e^{j{{2\pi } \over 3}}}$$ .
if another sequence $$\left[ {p,\,q,\,r} \right]$$ is derived as,
$$\left[ {\matrix{ p \cr q \cr r \cr } } \right] = \left[ {\matrix{ 1 \cr 1 \cr 1 \cr } \,\,\matrix{ 1 \cr {W_3^1} \cr {W_3^2} \cr } \,\matrix{ 1 \cr {W_3^2} \cr {W_3^4} \cr } } \right]\,\left[ {\matrix{ 1 \cr 0 \cr 0 \cr } \,\matrix{ 0 \cr {W_3^2} \cr {0\,} \cr } \,\matrix{ 0 \cr 0 \cr {W_3^4} \cr } } \right]\,\left[ {\matrix{ {A/3} \cr {B/3} \cr {C/3} \cr } } \right]$$ ,
Then the relationship between the sequences $$\left[ {p,\,q,\,r} \right]$$ and $$\left[ {a,\,b,\,c} \right]$$ is

Consider two real sequences with time- origin marked by the bold value, $${x_1}\left[ n \right] = \left\{ {1,\,2,\,3,\,0} \right\}\,,\,{x_2}\left[ n \right] = \left\{ {1,\,3,\,2,\,1} \right\}$$ Let $${X_1}(k)$$ and $${X_2}(k)$$ be 4-point DFTs of $${x_1}\left[ n \right]$$ and $${x_2}\left[ n \right]$$, respectively. Another sequence $${X_3}(n)$$ is derived by taking 4-ponit inverse DFT of $${X_3}(k)$$= $${X_1}(k)$$$${X_2}(k)$$. The value of $${x_3}\left[ 2 \right]$$