where, in general, the values y
k
, x
k
, n
k
can be vectors, and H
k
can be a matrix. Thus, the delay spread of
the channel is L symbol periods. An exponentially-decaying profile of channel taps is modeled by fixing the
powers of all the elements in each random matrix H
k
to a constant E
i
. These coefficients E
i
form a decaying
geometric progression in the variable i. During a coherence time interval, all matrices H
k
are constant, and
when the channel decorrelates, they are all drawn newly according to their respective pdf’s. Further, for
simplicity it is assumed that the channel decorrelates at the end of an OFDM symbol transmission.
Channel estimation inverts the effect of non-selective fading on each subcarrier. Usually OFDM systems
provide pilot signals for channel estimation. In the case of time-varying channels, the pilot signal should be
repeated frequently. The spacing between pilot signals in time and frequency depends on coherence time
and bandwidth. Throughout this paper, the channel estimates are assumed to be perfect, and available to
both the transmitter and the receiver. Given full knowledge of the channel, the transmitter and receiver can
determine the frequency response of the channel, and the channel gains at each tone of the OFDM symbol.
Given these gains, the adaptive algorithm can proceed to calculate the optimal bit and power allocation.
This step will be expounded in Section III.
Cyclic Prefix
The cyclic prefix is added to an OFDM symbol in order to combat the effect of multipath. Intersymbol inter-
ference is avoided between adjacent OFDM symbols by introducing a guard period in which the multipath
components of the desired signal are allowed to die out, after which the next OFDM symbol is transmitted.
A useful technique to help reduce the complexity of the receiver is to introduce a guard symbol during the
guard period. Specifically, this guard symbol is chosen to be a prefix extension to each block. The reason
for this is to convert the linear convolution of the signal and channel to a circular convolution and thereby
causing the FFT of the circularly convolved signal and channel to simply be the product of their respective
FFT’s. However, in order for this technique to work, the guard interval should be greater than the channel
delay spread. Thus, we see that the relative length of the cyclic prefix depends on the ratio of the channel
delay spread to the OFDM symbol duration.
Modulation and Demodulation
A modulator transforms a set of bits into a complex number corresponding to an element of a signal constel-
lation. In this paper, given the adaptive algorithm, the modulator has as input a set of bits and an energy
value, so that the output of the modulator is a constellation symbol corresponding to the number of bits on
the input, appropriately scaled to have a desired energy.
The modulator is taken to have only a finite number of rates available, which means that only a finite number
of constellations are available for the modulation. Specifically these constellations are drawn from the set of
constellations having number of symbols equal to an even power of 2. Further, in order to provide robustness
against bit errors, Gray-coded constellations are employed for each modulation order available. This Gray
coding ensures that if a symbol error occurs, where the decoder selects an adjacent symbol to that which
the transmitter intended to be decoded, there is only a single bit error resulting.
Many demodulation techniques can be employed, including maximum-likelihood, MMSE, and zero-forcing.
For the paper, in order to simplify the demodulator, demodulation is performed using a zero-forcing ap-
proach, given knowledge of the individual flat-fading channel gain for each subchannel.
4
评论1
最新资源