Professional Documents
Culture Documents
7, JULY 2009
Moreover, we investigate the fact that the proposed scheme shows by 16QAM
a performance trade-off between bit power and time diversity ˧ , First Time Slot Packet
by BPSK
Index Terms—Wireless fading relay channel, diversity, modu-
lation, bit error probability. Source Destination
Fig. 1. Proposed ADM scheme in a wireless fading channel with one relay.
I. I NTRODUCTION The source is transmitting its packet by BPSK. In order to achieve additional
4th -order time diversity in the R→D link, the relay repeats and rearranges
interest in the use of relaying in cellular-based infrastructure as scheme is considered in a three-node fading network, called
a practical solution to mitigate fading and improve reliability a wireless fading relay channel, consisting of a source, a
[1]. The major advantage of relaying is that independent relay, and a destination, as shown in Fig. 1. It is known
transmission paths to the destination can be provided with that second-order diversity can be achieved through two
low deployment costs. Recent proposals have shown that this spatially independent links, i.e., source-destination and relay-
spatial diversity can be realized in a distributed fashion [2]-[3]. destination [5]. In addition to this spatial diversity, the pro-
In addition to the potential of increased diversity, relaying posed scheme additionally provides time diversity through
can offer improved link qualities thanks to decreased propa- the relay by transmitting multiple repeated source bits using
gation loss. This means that higher transmission rates can be high-order modulation. With this approach, each source bit
supported over relays using a spectrally efficient modulation will experience increased fading on the relay-destination link
scheme. However, the transmission rate used by a relaying depending on the order of modulation employed at the relay.
node cannot exceed the rate generated at the source, even Since high-order modulation reduces bit power, the proposed
though the relay link quality may support higher rates. For a method shows a bit-level performance trade-off between bit
single-source network, however, this very fact can be exploited power and time diversity in the relay-destination link. Using
to obtain additional performance enhancement. the proposed ‘bit’-based channel combining method, we derive
Based on this concept, we propose an asymmetric diversity its theoretical bit error rate (BER) performance and study this
modulation (ADM) scheme that utilizes the relay’s higher trade-off relationship. Moreover, in the relay-destination link,
transmission ability as a form of diversity. The proposed we compare the average BER performance with the existing
signal space diversity (SSD) techniques [4].
Manuscript received September 6, 2008; revised February 4, 2009; accepted
April 14, 2009. The associate editor coordinating the review of this letter and
approving it for publication was X.-G. Xia. II. P ROPOSED A SYMMETRIC D IVERSITY M ODULATION
The authors are with the Information Telecommunication Lab.(B715), Dept.
of Electrical and Electronic Engin., Yonsei Univ., 134 Shinchondong Seodae- S CHEME
mungu, Seoul, Korea, 120-749 (e-mail: {jmHan, daesikh}@yonsei.ac.kr). Let us define source, relay, and destination as S, R and D,
This research was supported by the MKE(Ministry of Knowledge Econ-
omy), Korea, under the ITRC(Information Technology Research Center) respectively. Consider a time-divided transmission of S and R
support program supervised by the IITA(Institute for Information Technology to D as shown in Fig. 1. If the block of binary source bits
Advancement)(IITA-2009-C1090-0902-0005). constitutes one packet for transmission, S broadcasts its packet
This work was supported by Korea Science and Engineering Foundation
through the NRL Program (Grant R0A-2007-000-20043-0). to R and D in the first time slot, and R decodes and forwards
Digital Object Identifier 10.1109/TWC.2009.081202 (DF) to D in the second time slot.
1536-1276/09$25.00
c 2009 IEEE
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on July 28, 2009 at 06:41 from IEEE Xplore. Restrictions apply.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 7, JULY 2009 3443
This single-source relaying topology can achieve second- A at the destination from the received symbols of (1) is
order spatial diversity. However, the unreliability of the S→R KS KR
link is a critical bottleneck which could degrade diversity k=1 P (ySi(k) |bk = 0) k=1 P (yRj(k) |bk = 0)
Ł(A) = log KS KR
performance down to the first order [5]. Hence, it is necessary k=1 P (ySi(k) |bk = 1) k=1 P (yRj(k) |bk = 1)
to assume a perfect S → R link for the relay to transmit KS KR
(2)
without errors. We also assume that the S → D and R → D = ŁxSi(k)(bk ) + ŁxRj(k)(bk ) ,
links are independent Rayleigh fading channels with mutually k=1 k=1
independent white Gaussian noise [6].
(y −hSD Q)2 (y −hSD Q)2
where ŁxSi(bk)=log exp(− Si N i
)/ exp(− Si N i
)
In the proposed ADM scheme, R duplicates the received Q∈{xS : bk =0} Q∈{xS : bk =1}
packet to the order of modulation employed and rearranges i i
(yR −hRD Q)2 (yR −hRD Q)2
them. For the case shown in Fig. 1 using a 4th -order mod- and ŁxRj(bk)=log exp(− j
N
j
)/ exp(− j
N
j
)
ulating relay, the 4 bits A, B, C, and D are repeated and Q∈{xR : bk =0}
j
Q∈{xR : bk =1}
j
rearranged to make up the relay packet while being relocated are bit LLRs [8] each from the source and the relay.
to a different bit position at a different symbol time. Thus, i(k) and j(k) are indices indicating symbol position in each
each bit is transmitted as part of a set of 4th -order modulation packet where the k th bit, bk , of the symbols xSi(k) and xRj(k)
symbols (xR1 , xR2 , xR3 , and xR4 ) in the relay packet. In order is bit A, respectively.
to provide additional time diversity for a specific bit, every Let us assume that binary phase shift keying (BPSK) is
symbol conveying that bit must go through the uncorrelated used for source transmission (KS = 1), so that we can focus
channel fading. That is, in Fig. 1, xR1 , xR2 , xR3 , and xR4 on the trade-off between bit power and diversity for the high-
need to be faded independently in order for bits A, B, C, and order modulating relay, as shown in Fig. 1. The destination
D to have 4 additional time diversities. then combines the LLR of bit A from the symbol xS1 in the
In practical environments, however, the coherence time of source packet with the corresponding LLRs of bit A from the
typical wireless channels is on the order of tens to hundreds symbols xR1 , xR2 , xR3 , and xR4 in the relay packet. Finally,
of symbols, so that the channel varies slowly relative to the decision of whether
0
to demodulate the bit A to zero or one
the symbol rate [7]. Thus, we assume that each packet is is made as Ł(A) ≷ 0. However, the non-linear and complicated
1
composed of several hundreds of symbols so as to give several forms of the bit LLR (2) make it difficult to derive the exact
independent fading gains. Therefore, in the proposed ADM BER and to show its trade-off relationship.
scheme, if the order of modulation employed at the relay
is less than or equal to the number of independent fading III. P ERFORMANCE A NALYSIS AND T RADE - OFF
gains, R can successfully lead its bits to have additional time At this point let us turn our focus to deriving the exact
diversity by arranging the same bits sufficiently far apart in BER performance of the proposed ADM scheme. Since it
time. is impossible to derive the theoretical BER when directly
With these assumptions, symbols in the received packets computing the decision variable of (2), we are proposing a
at the destination from the time-divided transmissions of the ‘bit’-based channel combining method. Furthermore, we will
source packet and the relay packet can be written as analyze the performance trade-off between bit power and
time diversity with a proposed ‘bit’-based channel probability
ySi = hSDi xSi + W and yRj = hRDj xRj + W, (1) density function (pdf).
where W is the destination complex white Gaussian noise Let us begin by establishing the notation to be used
(WGN) with variance N , and index i and j denote the i th throughout. We define the transmission power from the source
and j th symbol position in each packet. Thus, hSDi , hRDj are and relay to the destination noise ratio as SNRS = PNS and
Rayleigh fading variables from the S→D and R→D links, SNRR = PNR , respectively. We also denote G= SNR
SNRS , in order
R
where the i th symbol xSi of the source packet and j th symbol to represent the power gain from the smaller propagation loss
xRj of the relay packet have gone through, respectively. We fix in the relay. The pdf of chi-square random variable z with n
each Rayleigh fading power to be equal to 2σ 2 . However, we degree of freedoms is given by
set the power constraints for each transmitting node, E[xS ] = n
z 2 −1 exp(− 2σz 2 )
PS and E[xR ] = PR , so that we can reflect the relay’s smaller pz (z) = n , (3)
(2σ 2 ) 2 Γ( n2 )
propagation loss by controlling their transmission powers.
where σ 2 is a component variance. For convenience, we will
Since the destination combines diversity performance based
let z = χ2n (σ 2 ). The random variable of Rayleigh fading with
on ‘bit’, each bit in the received packets must be expressed
its expectation 2σ 2 can then be represented as χ22 (σ 2 ).
as a soft value to be combined before decision. By applying
Maximum Likelihood (ML) criterion with coherent demodu-
lation, we can obtain a measurement for a received bit, i.e., a A. Proposed Bit-based Channel Combining Method
bit log-likelihood ratio (LLR). Thus, in the proposed scheme, In the proposed scheme, it is a ‘bit’ that exploits channel
a bit decision variable is expressed as combining the bit LLRs diversity by combining spatial and time diversity in the form
corresponding to the same bit. In the general situation where of a bit LLR. This means that the same bit experiences several
the source is using Kth
S -order modulation and the relay is using independent channel fadings through different modulation
Kth
R -order modulation, total combined LLR for a specific bit symbols in each diversity path. Considering the fact that it
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on July 28, 2009 at 06:41 from IEEE Xplore. Restrictions apply.
3444 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 7, JULY 2009
is a modulation symbol (conveying bits) that undergoes the effects can be derived from the conditional BEP of M-
fading channel, and not the bit itself, if we can calculate the QAM. In general, the k th bit BEP of any real or imaginary
effect of channel fading directly on a given bit, this will make axis using
gray-coded
M-QAM over WGN is expressed as
k
it easier to perform a ‘bit’-based analysis to derive the average √2 Q 3SNR
for high SNRs [10]. Over fading,
M M−1
BER.
∞ k
First, let us define a notation for the concept described 2 3zSNRR
above. PBER, M-QAM (k) = √ Q pz (z) dz , (7)
Ifa bit A is part of a symbol through a channel fading 0 M M −1
h, |h|2 denotes a random variable of the effects of channel
A where z indicates a random variable of the channel fading with
fading directly on bit A. With this notation, we can easily a pdf, pz (z).
combine the effects of channel fadings directly on a specific bit
delivered by different modulation symbols. Since the source By changing variables, (7) can be expressed equivalently as
is using BPSK and the relay is using Kth R -order modulation, a ∞
random variable of the combined channel fading effects on a 2k
PBER, M-QAM (k) = √ Q( 2z SNRS )
received bit at the destination, zD , can be expressed as (for a M 0
(8)
specific bit A): 2(M − 1) 2(M − 1)
pz z dz .
KR
3G 3G
zD = zSD + zRD = |hSDi |2 + | hRDj(k) |2 , (4)
A A
k=1
Hence, the effect of the channel fading on the k th bit of
th th
where hSDi , hRDj(k) are channel fadings of the i and j(k) any axis in an M-QAM symbol is
now solved
as shown above
symbol position on the S → D and R → D links where the into the changed pdf 2(M−1) 2(M−1)
from its original
3G pz 3G z
corresponding bit A has beendelivered.
Forthe case shown pdf pz (z) of the channel fading. Any other linear modulation
4
in Fig. 1, zD = |hSD1 |2 + j=1 |hRDj |2 . Since all bits scheme can be employed at the relay, and the pdf of the bit-
A A
experience the same fading scenario, there is no difference in based channel fading effects can also be derived using the
zD for any specific bit. above approach.
In general, BER analysis over fading has a form that aver-
ages the channel fading on the conditional (fading-dependent) In the case of Rayleigh fading, that is when z = χ22 (σ 2 ),
bit error probability (BEP). For example, the average BER for the changed pdf is
BPSK over fading with coherent demodulation is [9]
∞ √ 2(M − 1)
2(M − 1) exp −z/ 3σ2 G
(M−1)
PBER, BPSK = Q 2 z SNR pz (z) dz , (5) pz z = 3σ2 G
, (9)
3G 3G (M−1)
0
where z indicates the random variable of the channel fading and (9) is the same as a pdf of two degrees of freedom chi-
with a pdf, pz (z). square random variable with its component variance scaled
3σ2 G
Since the proposed ADM scheme employs a different from σ 2 to 2(M−1) .
modulation order on each diversity path, the conditional BEPs
from the source and relay are different. Performing bit-based From (9), we can see that transformation to the bit-level
channel combining for the BER requires a bit-level BEP that basis by changing variables translates the reduced bit power
can serve as the basis for the combining. We regard the BEP of a higher-order modulation into the reduced component
for BPSK as a good candidate, because one
√
BPSK symbol variance of the random variable of the bit-based channel fading
means exactly one bit. In other words, Q 2zSNR is the effects. Furthermore, we can see in (9) that the power of the
basis for combining the bit-based channel fading effects that bit-based channel fading effects decreases exponentially as the
the corresponding bit has undergone. If we take SNRS as our QAM order increases. This is because the minimum distance
performance measure, the average BER over the combined between the constellation points decreases exponentially as
bit-based channel fading effects can be solved in a manner the order of modulation increases, since the required number
similar to equation (5) as of points is proportional to 2 to the power of the modulation
∞ order.
√
PBER, ADM = Q 2 zD SNRS pzD (zD ) dzD , (6)
0
Combining accordingly, the random variable of the total bit-
with the random variable zD of the combined bit-based based channel fading effects from the R→D link in the case
channel fading effects in (4). of Fig. 1 is
B. Derivation of the Bit-based Channel Fading Effects KR
zRD = |hRDj(k)|2
Since we assume that the source transmission is done by A
k=1
BPSK, the channel fading effect from the S→D link to bit A (10)
3σ 2 G
KR
3σ 2 G
( zSD in (4)
) is the same
as a random variable of the channel = χ22 2
= χ2KR ,
fading, i.e., |hSD1 | 2
= χ22 (σ 2 ). 2(M − 1) 2(M − 1)
A k=1
For a relay employing M-ary quadrature amplitude mod- 2 2
ulation (M-QAM) (M = 2KR ), the bit-based channel fading
3σ G
whereby its expectation is E χ22KR 2(M−1) = G 3K Rσ
2KR −1
.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on July 28, 2009 at 06:41 from IEEE Xplore. Restrictions apply.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 7, JULY 2009 3445
∞ ∞ 6
probability density
pzSD(zSD )pzRD(zRD ) dzSD dzRD , 4
2
3σ G
where zSD = χ22 (σ 2 ) and zRD = χ22KR 2(M−1) . 3
2
We use the upper bound Q(x) ≤ e−x /2 , for x > 0 [7], in 2
(11) to get
KR
1
1 1
PBER, ADM ≤ , (12) 0
1 + 2σ 2 SNRS 1 + 3σ
2G 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 1.8 2
M−1 SNRS
zRD
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on July 28, 2009 at 06:41 from IEEE Xplore. Restrictions apply.
3446 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 7, JULY 2009
−4
X −2
10 10
BER
BER
−6 −3
10 10
−8 −4
10 10
BPSK−ADM
4QAM−ADM
M=4 in Theor. BER of (15)
−5
−10
10 64QAM−ADM 10
M=64 in Theor. BER of (15) Crossover SNR between
S X
16QAM−ADM 16QAM−ADM and 64QAM−ADM
M=16 in Theor. BER of (15)
−12 −6
10 10
0 5 10 15 20 25 0 5 10 15 20 25
SNRS [dB] when G=1 SNRR [dB]
Fig. 3. BER for the proposed ADM scheme and its theoretical performance the 2-dimensional
θ −sin θSSD schemes. The simplest1 real rotation matrix is
in a wireless fading channel with one relay. A scheme showing the relay using R2,0 = cos with the optimum θ = 2 tan−1 2 [7]. Its complex
BPSK (BPSK-ADM) is also presented for comparison. The theoretical per-
sin θ cos θ
version is R2,1 = 1j 1j R2,0 . For R2,2 , we use the 2-dimensional rotation
formance tracks the corresponding simulation results quite well. Furthermore, matrix from the construction A of the general L-dimensional matrix,
due to its bit-based trade-off, a higher SNRS is required for the higher-order achieving not only full diversity
modulating relay to exhibit its additional time diversity performance. ⎡ but also maximizing
⎤ the minimum coding
1 α0 ··· αL−1
0
⎢ 1 α1 ··· αL−1 ⎥
TABLE I ⎢ 1 ⎥
gain [13]. That is, RL,2 = √1 ⎢ . . . . ⎥ where L = 2k for k ∈ N
L ⎣ .
C ROSSOVER SNRS FOR SEVERAL VALUES OF G CONSIDERING THE POWER . . . . . . ⎦
.
GAIN RATIO OF THE R→D LINK PROPAGATION LOSS VERSUS THE S→D L−1
1 αL−1 ··· αL−1
LINK PROPAGATION LOSS . A S G INCREASES , THE CROSSOVER SNRS and αi = exp j2π(i + 1/4)/L for i = 0, 1, . . . , L−1. N means the positive
FALLS DUE TO THE FACT THAT THE POWER GAIN FROM THE RELAY SHIFTS integers. Then, the 2-dimensional rotation matrix used in this simulation is
THE ENTIRE BER CURVE LEFT BY THE SAME AMOUNT OF SNRS , R2,2 . We can see that the proposed 4QAM-Relay-ADM achieves the best
RESULTING IN THE CROSSOVER POINTS MOVING LEFTWARD DUE TO THE BER performance compared to the other 2-dimensional SSD schemes.
DIFFERENT DIVERSITY SLOPES IN THE BER.
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on July 28, 2009 at 06:41 from IEEE Xplore. Restrictions apply.
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 7, JULY 2009 3447
−3
10
Authorized licensed use limited to: VELLORE INSTITUTE OF TECHNOLOGY. Downloaded on July 28, 2009 at 06:41 from IEEE Xplore. Restrictions apply.