Professional Documents
Culture Documents
0-7803-5653-5/99/$10.M)
D 1999 EEE
Consider the general antenna hopping system illustrated in Fig. 1. For simplicity of exposition, we assume
a single receive antenna; extension t o multiple antennas
follows in a straightforward manner. In this system bit
sequence b ( k ) is coded, interleaved, and modulated to
produce symbol sequence 4 7 1 ) . Each symbol is transmitted on antenna T ( n ) ,where T(n) is the known hopping
sequence ( T ( n )= 1 + transmit on antenna 1, T(71)= 2
--t transmit on antenna 2 ). We assume a system in which
the symbol duration is greater than the inverse channel
coherence bandwidth,
the frame duration is much less than the channel coherence time, and
the antennas are spaced sufficiently far apart to ensure
that each sees an uncorrelated channel (about A12 for mo-
14l
Authorized licensed use limited to: Alcatel Lucent. Downloaded on March 28, 2009 at 02:04 from IEEE Xplore. Restrictions apply.
142
Authorized licensed use limited to: Alcatel Lucent. Downloaded on March 28, 2009 at 02:04 from IEEE Xplore. Restrictions apply.
24
\
13
(5)
13
24
13
24
24
24
13
x -
4%
(7)
13
24
13
13
24
13
24
24
24
13
13
13
24
24
13
13
24
(4
(b)
cator of performance since, with a sequence of appropriate length, the probability of sequence error is roughly
the sanie as tlie frame error rate. Since deterniining
P, is difficult in general, we will characterize the performance with the pairwise error probability (PEP) denoted
P3(W+ WIW) which describes the probability that tlie
set W is decoded as W at the receiver. The P E P can be
related t o an upper bound of P, using the union bound.
To proceed, define D as the Euclidean distance between
W and W, let
denote Hermitian transpose, * denote
conjugate, denote transpose, and let h = [hl, h2]. Then
143
Authorized licensed use limited to: Alcatel Lucent. Downloaded on March 28, 2009 at 02:04 from IEEE Xplore. Restrictions apply.
we can write D z as
N-1
Dz
Ih'(w(k) -
=
k=O
TABLE 1
- w(k))(w(k)- W ( k ) ) H
k 0
:=
h'Rh'.
(lo) coding gain of the Zd-state code over the 2-state code
In (9) we have expanded the norm in (8) so that we can as 1olOgl0
~ j is~ the) eigen.
write the squared distance D
' in a quadratic form in (10). value of the matrix for the 2d State encoder and likewise
With these manipulations, we express the PEP as
Inatrix for the 2 State
of the
A;z) is the i t h
encoder. The souare-root is due to the uresence of second
order diversity (we assume that R has full rank) in each
case. This is essentially the ratio of the coding advantage
of the Zd-state code to that of the 2-state code in decibels,
over the 2-state case (see [l]).The next section assesses
performance via simulation with that indicated in Table
1.
-4
V . DISCUSSION
One of the difficulties with implenting decision directed
antenna hopping is that switching between antennas is
required at the symbol rate. Depending on the implementation, the symbol rate may thus be limited by the
speed at which we can hop from antenna to antenna. Additionally, hopping from antenna to antenna rapidly can
increase the peak-to-average requirements on the power
amplifier. In practice we can alleviate the switching problem by using the following trick. Note that the multiplication of w(n) bv a unitarv matrix U does not chanee
"_
the performance since h'URU"h* = I?Rh*, where h
Average performance of the system will be determined
has the same statistics as h. With this in mind, we could
by the eigenvalues of R which are dependent on the dischoose
dance between W and W (91. Loosely, the diversity atlvantage depends on the rank of R while the asymptotic
coding gain depends on the products of the eigenvalues.
This observation has led to the development of spacetime trellis codes which are designed to both maximize so hopping takes place across the basis or beams created
diversity and coding gain [l].
by the antenna weights [l,l]'/\/z and (1,-1Y/d. In this
Decision-directed antenna hopping can be viewed as case we might consider decision-directed basis hopping
a form of space-time coding where we impose a specific where the antenna selection function T ( n ) chooses the
structure on the spatial constellation at the transmitter. basis while s ( n ) chooses the weighting of the basis. In a
Our structure in Fig. 3 was chosen (i) t o combine the similar way we may also view the delay diversity system
process of antenna hopping and coding and (ii) t o provide in Fig. 6 a form of decision-directed basis hopping on the
a simple means of providing second order diversity while basis forming the rows of U.
achieving coding gain over delay diversity. Though we
A comparable strategy for transmit diversity, known
focused on two transmit antennas it is not too difficult t o as delay diversity, is illustrated in Fig. 6. The principle
see that with larger numbers of antennas we can obtain of delay diversity is t o convert spatial selectivity into fremore diversity gain by choosing a hopping and symbol quency selectivity which can be exloited at the receiver
using maximum likelihood sequence estimation. It should
mapping which maximizes the rank of R.
In Table 1. we give the performance characteristics of be clear that when using BPSK, delay diversity also rethe encoders displayed in Fig. 4 and Fig. 5. The ta- sults in a receive constellation with cardinallity IWI = 4.
ble lists the minimum length error event, the diversity The main difference between decision-directed hopping
gain, and the (asymptotic) coding gain. We compute the and delay diversity is that the former allows the inclusion
Equation (11) follows by definition of PEP. After applying the well-known Chernoff approximation in (12), we
evaluate the expected value over the complex multivariate vector h to arrive at (13). For convenience we seek
to expand the determinant in (13). Let Ak be the kth
eigenvalue of the matrix R. Then we can rewrite (13) as
144
Authorized licensed use limited to: Alcatel Lucent. Downloaded on March 28, 2009 at 02:04 from IEEE Xplore. Restrictions apply.
I
112
Fig. 6. Delay diversity
Pig. 7. R a m e error rate performance comparison of codes for 2PSK and rate 1 b/s/Hz with two tranSmit antennm and one
receive antenna
VI. SIMULATIONS
To assess the performance of the proposed codes we
used Monte Carlo simulations to estimate the frame error rate. We evaluated the performance over 5,000 franies
with 100 synibols in each frame. The encoder was forced
to the zero state at the end of each frame. Two independent, identically distributed, complex Gaussian random
variables were used to generate channels hl and R z for
each frame. The channel was perfectly known to the receiver. A maximum likelihood receiver, implemented via
the Viterhi algorithm, was used to detect the received
bits. In Fig. 7 we compare the proposed decision-directed
antenna hopping codes, delay-diversity, and no diversity
in terms of frame error rate. This figure verifies t,liat t,he
Z-st,at,eilccision-diroc:t,e[lantenna hopping code and delay
diversity have siniilar perforinance, with delay diversity
having a slight advantage at higher SNR. After increasing
to 4-states, only modest gains, about one-half a decibel
are obtained bv increasing the tnemorv of the system. For
the 16.state code, at FER of 10-1, we obtaiIl about 2dB
in gain over the 2-state code whereas we had predicted
3dB. Note that for an FER of lo-' we are about 3dB
from the outage capacity of about 6dB (obtained from
plots in [I]).
VII. CONCLUSION
In tllis paper we presented an idea for transmit diveresity which combines the operations of antenna l w p i %
and coding" at the transmitter. Such an aonroach avoids
the need for constellation expansion, interleaving, and
possible handwidth expansion typically required in other
systems where antenna hopping is used at the transmitwe presented 2, 4, 8, and 16 State codes for the
case of two transmitting antennas and BPSK modulation.
Performance analsysis using the pairwise error probahility was used to assess performance. Simulation results
I .
show that with a 16 state decision-directed antenna hopping encoder, for a ten-percent frame error rate, we are
3dB from the outage capacity. Future work will focus 011
designing general hopping strategies for higher order constellations and will consider multiple transmit and receive
antennas.
REFERENCES
(1) V. Tarakh, N. Seshadri, and A. R. Calderbank, "Space-time
vrc.
136-140.
145
Authorized licensed use limited to: Alcatel Lucent. Downloaded on March 28, 2009 at 02:04 from IEEE Xplore. Restrictions apply.