mohatta2015.pdf
signal processing from power amplifier operation control point of view
signal processing from power amplifier operation control point of view
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
THE MATH 179<br />
8.3.1 Time-invariant channel and training sequence<br />
Consider the case in which the channel does not change with time (at least over the<br />
data burst being demodulated), and we wish to estimate the channel using only a<br />
set of contiguous pilot symbols. If we select received values that only depend on<br />
the training sequence, then we can model a vector of them as<br />
r = Sg + n, (8.12)<br />
where matrix S depends on the training sequence symbols, the path delays, and<br />
possibly the pulse shape, g is a vector of channel coefficients corresponding to<br />
different path delays, and n is noise.<br />
One approach, introduced earlier, is correlation channel estimation, in which<br />
the correlation of the received signal to the training sequence at the path delay of<br />
interest gives an estimate of the channel coefficient. Sometimes the first and last<br />
few symbols of the training sequence are not used, so that the channel estimate is<br />
not influenced by unknown, traffic symbols and the autocorrelation properties can<br />
be made perfect (the channel coefficient of one path is not interfered by the channel<br />
coefficient of another path).<br />
Another common approach is least-squares channel estimation. The idea is to<br />
find the channel coefficients that best predict the received samples corresponding to<br />
the training sequence. Here "best" means that the sum of the magnitude-squares<br />
of the differences between the received samples and the predicted samples is minimized.<br />
The predicted samples correspond to convolving the pilot symbols with the<br />
estimated channel. The result, mathematically, is<br />
g = (S H S)^1S H r. (8.13)<br />
The least-squares approach ensures that different paths don't interfere with one<br />
another, even if the autocorrelation properties of the training sequence are not<br />
perfect.<br />
The least-squares approach is a special case of maximum likelihood channel estimation<br />
in which the noise is assumed to be white. If noise or interference is modeled<br />
as colored noise, then the noise covariance (if known or estimated) can be used to<br />
improve channel estimation.<br />
So far, we have implicitly treated the channel coefficients as unknown, deterministic<br />
(nonrandom) quantities. Alternatively, we can treat them as random quantities<br />
with a certain distribution. A popular approach is MMSE channel estimation,<br />
which requires knowledge of the mean and covariance of the set of channel coefficients,<br />
independent of the distribution of the coefficients. Assuming the channel<br />
coefficients have zero mean and covariance C 9 , the MMSE estimate is given by<br />
g = C 9 S H (SC 9 S" + C Il )- 1 r. (8.14)<br />
If the coefficients are modeled with a Gaussian distribution, then MMSE channel<br />
estimation corresponds to MAP channel estimation. MAP channel estimation is a<br />
more general approach, as it allows for other distributions to be used.