Unformatted text preview: gives a useful relationship between the DFTs of y [ n ], x [ n ] and h [ n ]. When y [ n ] is passed through the CP block of Figure 3, the CP of y [ n ] (for α ≤ n < 0) gets removed. This results in N time-domain symbols whose DFT is Y [ k ] = H[ k ]X[ k ] in the absence of noise (as was explained in the previous paragraph). These time-domain symbols are sent through the serial-to-parallel converter and then passed through an FFT block. The outputs of the FFT block are the Y [ k ] samples, which are nothing but the scaled versions of the original symbols X [ k ] (over here, the scaling is H [ k ] because Y [ k ] = H[ k ]X[ k ] according to equation E9). Since H [k] is the channel gain associated with the k th subcarrier, each H [ k ] can be estimated...
View Full Document
- Spring '09
- Digital Signal Processing, infinite number, Circular convolution