Symbol error probability of hop-by-hop beamforming in Nakagami-m fading T.Q. Duong, H.-J. Zepernick and V.N.Q. Bao The symbol error probability (SEP) of amplify-and-forward (AF) multiple-input multiple-output (MIMO) cooperative networks where beamforming is adopted at both the source and destination is investigated. In particular, the tight lower bound for SEP of AF MIMO relay systems is presented with hop-by-hop beamforming over independent, but not necessarily identically distributed, Nakagami-m fading channels. Furthermore, assessing the high SNR, an asymptotic SEP expression is derived which reveals the array and diversity gain. Numerical results are shown to verify the analysis in some representative scenarios.

where pg2 ( g2) is the probability density function (PDF) of g2. As can clearly be seen from (1), in order to obtain FY ( y), we need to consider generating function (MGF) of G can the distribution of gi. The moment Q i ð1 þ s=aik Þmik , where mik is be easily obtained as Fgi ðsÞ ¼ nl¼1 assumed to be an integer and aik ¼ mik =Vik . Then, by expanding Fgi ðsÞ in partial fractions and applying the inverse Laplace transform, the PDF of gi can be expressed as: pg i ð g i Þ ¼

ni X mil X bilðmil kÞ k1 g expðail gi Þ ðk  1Þ! i l¼1 k¼1

where expansion coefficients can be computed as Y   Y  ni ni m bilðmil kÞ ¼ aij ij =ðmil  kÞ! d mil k =dt mil k ðt þ aij Þmij jt¼ail j¼1

Introduction: The use of a beamforming technique at the source and destination in multiple-input multiple-output (MIMO) relay networks has recently gained high attention [1 – 3]. Beamforming in dual-hop amplify-and-forward (AF) MIMO relay networks was first proposed in [1] where two independent beamforming schemes are sequentially performed for the source-to-relay and relay-to-destination links, referred to as hop-by-hop beamforming (HBF). Lately, it has been shown that this new type of beamforming technique provides identical performance as conventional beamforming (CBF) in which the overall channel from source-to-relay and to-destination is taken into account [2]. More interestingly, when the channel state information (CSI) is uncertain, HBF outperforms CBF in terms of the error rate performance. Although HBF yields a good performance over AF MIMO relay systems as the received signal-to-noise ratio (SNR) is maximised, this work only focuses on the Rayleigh fading. Specifically, the symbol error probability (SEP) in independent Rayleigh fading has been investigated [1, 2]. More recently, the SEP performance has been extended to the correlated Rayleigh fading channels [3]. To the best of the authors’ knowledge, there is no published work analysing the performance of dual-hop AF MIMO relay networks using HBF in Nakagami-m fading channels. In this Letter, we first derive a closed-form expression for the cumulative distribution function (CDF) of the received SNR which enables us to obtain a tight lower bound for SEP with M-ary phase-shift keying (MPSK) modulation of AF MIMO relay systems using HBF over independent but not identically distributed (INID) Nakagami-m fading channels. Furthermore, at sufficiently large SNR, the asymptotic approximation for SEP containing a simple form of average SNR is presented. Its simplicity provides valuable insights into the array and diversity gain of cooperative networks. Finally, analytical results are verified by comparing with Monte Carlo simulations. System and channel model: Let us give a general overview of dual-hop AF MIMO cooperative wireless systems with HBF consisting of an n1antenna source (S), a single antenna relay (R), and an n2-antenna destination (D). The communication between S and D occurs in two hops. In the first hop, S transmits its signal to R. Assuming that S has full CSI knowledge of the S ! R link, the beamforming for the first hop can be achieved. Then, R amplifies its received signal and forwards it to D in the second hop. At the destination, we also presume that D has perfect CSI knowledge of the R ! D link and hence the beamforming can be performed for the second hop 1 2 and fh2k gnk¼1 as the channel coeffitransmission. Let us define fh1k gnk¼1 cients for the channels from the kth antenna of S to R and from R to the kth antenna of D, respectively. Further assume that hik , i [ f1; 2g and k ¼ 1; . . . ; ni , is subject to INID Nakagami-m fading with the fading severity parameter mik and average fading power Vik. Similarly as in previous work [1, 3], we assume that S and R use the same transmit power and R has full knowledge of the instantaneous channel coefficient of the S ! R link. As such, the instantaneous received SNR at the destination can be approximated in the high SNR regime as [1, 3] gBF ¼ g0 Y , where g1 g2 Þ=ðg1 þ g2 Þ and g0 represents the average SNR. Furthermore, Y ¼ ðP i gi ¼ nk¼1 jhik j2 , with i [ f1; 2g is the instantaneous SNR for the ith hop. Symbol error probability: To start our analysis, first we derive the CDF of Y, FY ( y), by writing [1]:   ðy  ð1  yg2 yg2 pg2 ðg2 Þ dg2 þ Pr g1  pg2 ðg2 Þ dg2 FY ðyÞ ¼ Pr g1 . g2  y g2  y 0 y |fflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl ffl{zfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl} |fflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl{zfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflfflffl} I

J

ð1Þ

ð2Þ

j¼1;j=l

The CDF of gi can be easily obtained by integrating pgi ( gi ) as follows:   ni X mil X Gðk; ail gi Þ ð3Þ bilðmil kÞ ak 1  Fgi ðgi Þ ¼ il GðkÞ l¼1 k¼1 where Gðn; xÞ is the incomplete gamma function [4, eqn. 8.350.2]. With the PDF and CDF of gi at hand, we can now derive the CDF of Y. As observed in (1), since Prðg1 . yg2 =g2  yÞ ¼ 1 as g2 [ ½0; y, we have I ¼ Fg2 ðyÞ. Ð 1 Next, exchanging the variables z ¼ g2  y for J results in J ¼ 0 Fg1 ðy þ y2 =zÞpg2 ðy þ zÞdz. To compute the integral J, we first expand the incomplete gamma function of Fg1 ðy þ y2 =zÞðFg1 ðg1 Þ is given in (3)) into a finite sum [4, eqn. 8.352.2] and then apply the binomial theorem. After some simple algebraic manipulations which are omitted here for brevity, we have: J¼

m1l n1 X X l¼1 k¼1

ðm1l kÞ k b1l a1l

m2u ðm2u vÞ n2 X X b 2u

u¼1

ðv  1Þ! v¼1

" v1 X ðv  1Þ!  aj1 yvj1 expða2u yÞ ðv  1  jÞ! 2u j¼0

ð4Þ

  wiþ1=2 k1 i vþi1 X vþi1 a1l X a1l 2  i! w¼0 a2u w i¼0 pffiffiffiffiffiffiffiffiffiffiffiffiffi   yvþi exp½ða1l þ a2u ÞyKwiþ1 ð2 a1l a2u yÞ where (4) follows immediately using [4, eqn. 3.471.9]. By summing up I ¼ Fg2 ðyÞ and J given in (5), we get FY ( y) which allows us to derive the SEP of AF MIMO relay systems with beamforming. Specifically, the SEP expression can be given in the form of FY ( y) as [1, 3]: pffiffiffi ð   bt a b 1 t e pffi dt FY P s ¼ pffiffiffiffi ð5Þ 2 p 0 g0 t where a and b are modulation specific constants. The SEP formula given in (5) is considered as the exact and/or approximated SEP expression for various binary and M-ary modulation schemes. Finally, substituting FY ( y) in (4) along with the help of [4, eqn. 8.312.2] and [4, eqn. 6.621.3], after some simplifications, we obtain the closed-form expression for a tight lower bound of SEP as follows: "rffiffiffiffi pffiffiffi n2 m2l  k1  X ðm kÞ a bX p X a2l i k 2l  b2l a2l P s ¼ pffiffiffiffi 2 p l¼1 k¼1 b i¼0 g0 # pffiffiffi n1 m1l  i1=2 X ðm kÞ a2l Gði þ 1=2Þ a bX þ pffiffiffiffi þb b 1l  i! 2 p l¼1 k¼1 1l g0 " m2u X n2 X v1 X ðv  1Þ! k  a1l aj1 g0 jþ1v ðv  1  jÞ! 2u u¼1 v¼1 j¼0 ð6Þ    1 a2u þ b jþ1=2v G vj 2 g0   v=2 k1 i vþi1 X vþi1 a1l X a1l  2 i! a w 2u i¼0 w¼0   1 1 sj ; ; gvi J F m þ v; v þ m þ 2 1 0 2 2 sþj

ELECTRONICS LETTERS 24th September 2009 Vol. 45 No. 20 Authorized licensed use limited to: Ulsan University. Downloaded on November 18, 2009 at 00:04 from IEEE Xplore. Restrictions apply.

where v ¼ w  i þp1,ffiffiffiffi m ¼ v þ i þ 1=2, s ¼ a1l þ a2u =g0 þ b, j ¼ pffiffiffiffiffiffiffiffiffiffiffiffiffi 2 a1l a2u =g0 , J ¼ pð2jÞv =ðs þ jÞmþv Gðm þ vÞGðm  vÞ=Gðm þ1=2Þ, and 2F1 (a, b; c; z) is the Gauss hypergeometric function defined in [4, eqn. 9.111]. We next derive the asymptotic approximation for SEP which helps us to calculate the array and diversity gain. The SEP can be asymptotically approximated as [5]: QN þ1

Ps ’

ð2i  1Þ @N pY ð0Þ ðN þ 1Þ!ð2g g0 ÞNþ1 @yN i¼1

ð7Þ

where g ¼ sin2 ðp=M Þ for M-PSK modulation, pY( y) is the PDF of Y, and @N =@yN pY ð0Þ is the first non-zero Nth-order derivatives of pY( y) at y ¼ 0, i.e. all the derivatives of pY( y) evaluated at zero value up to the order of N21 are zero. Our objective now is to find out N. To do so, by m i aij ij = recursively utilisingP [6, Lemma 1], we have pgi ðgi Þ ’ Pnj¼1 Pi i mij  1Þ!=gi nj¼1 mij  1. Then, by conducting a similar approach ð nj¼1 as in [6] P which is neglected here owing to space limitation, we get P2 1 N N ¼ minð nk¼1 m1k ; nk¼1 m2k Þ  1 and @P =@yN pY ð0Þ is as Pnobtained n1 2 1 a if m , m , b) follows: a) @N =@yN pY ð0Þ ¼ Pnk¼1 1k 1k 2k k¼1 k¼1 Pn2 Pn1 2 @N =@yN pY ð0Þ ¼ Pnk¼1 a2k if m1k and c) 2k , k¼1 mP k¼1P n1 n2 1 2 a1k þ Pnk¼1 a2k if @N =@yN pY ð0Þ ¼ Pnk¼1 k¼1 m1k ¼ k¼1 m2k . With the resultant value of @N =@yN pY ð0Þ, we can assess the asymptotic SEP performance as well as obtain the array and diversity gain. As can clearly be seen from P (7), the Pdiversity gain is in the order of 1 2 m1k ; nk¼1 m2k Þ. For Rayleigh fading channels, i.e. N þ 1 ¼ minð nk¼1 m1k ¼ m2k ¼ 1, the diversity gain becomes min ðn1 ; n2 Þ which exactly agrees with the result in [1]. The array gain is easily obtained from (7) together with the above derived value of @N =@yN pY ð0Þ [5]. Numerical results and discussion: Numerical results are provided to verify our analysis. We consider the case of n1 ¼ n2 ¼ 2 antennas where average channel powers for all links are chosen as fV1k g2k¼1 ¼ f1:1; 1:2g and fV2k g2k¼1 ¼ f1:6; 1:5g. Furthermore, to clearly illustrate the diversity gain obtained in the previous Section, we investigate the SEP performance for three channel profiles specified by different fading severity parameters m: 1) profile 1: fm1k g2k¼1 ¼ f1; 2g, and fm2k g2k¼1 ¼ f2; 1g, 2) profile 2: fm1k g2k¼1 ¼ f2; 3g and fm2k g2k¼1 ¼ f3; 4g, and 3) profile 3: fm1k g2k¼1 ¼ f1; 3g and fm2k g2k¼1 ¼ f4; 2g. Fig. 1 shows the SEP of AF MIMO relay systems with HBF for 16-PSK modulation against average SNR. As can be observed from this Figure, for the three profiles, tight lower bound curves match very well with exact curves which are obtained from Monte Carlo simulations. Furthermore, asymptotic curves tightly converge to those of simulations and tight lower bounds. Among the three considered profiles, profile 2 outperforms the others since P 2 the highest value of diversity gain P 1 it has m1k ; nk¼1 m2k Þ ¼ 5 while those of profile 1 and N þ 1 ¼ minð nk¼1 profile 3 equal to N þ 1 ¼ 3 and 4, respectively. This observation verifies the correctness of our derived diversity gain in the considered scenarios.

Conclusion: This letter investigates the SEP performance of AF MIMO relay systems with HBF. We derived closed-form expressions for the tight lower bound of SEP in INID Nakagami-m fading channels. In sufficiently high SNR, we present the asymptotic SEP which helps us to obtain the array and diversity gain. Numerical results are also provided to validate the analysis. # The Institution of Engineering and Technology 2009 4 June 2009 doi: 10.1049/el.2009.1581 T.Q. Duong and H.-J. Zepernick (Blekinge Institute of Technology, SE-372 25 Ronneby, Sweden) E-mail: [email protected] V.N.Q. Bao (University of Ulsan, Ulsan 680-749, Korea) References 1 Louie, R.H.Y., Li, Y., and Vucetic, B.: ‘Performance analysis of beamforming in two hop amplify and forward relay networks’. Proc. IEEE Int. Communication Conf., Bejing, China, May 2008 2 Lee, C., Joung, J., and Lee, Y.H.: ‘A pilot emitting amplify-and-forward relay and its application to hop-by-hop beamforming’. Proc. IEEE Personal, Indoor and Mobile Radio Communication, Cannes, France, September 2008 3 Louie, R.M.Y., Li, Y.H., Suraweera, H.A., and Vucetic, B.: ‘Performance analysis of beamforming in two hop amplify and forward relay networks with antenna correlation’, IEEE Trans. Wireless Commun., 2009, 8, (6), pp. 3132–3141 4 Gradshteyn, I.S., and Ryzhik, I.M.: ‘Table of Integrals, Series, and Products’ (Academic, San Diego, CA, USA, 2000, 6th edn.) 5 Ribeiro, A., Cai, X., and Giannakis, G.B.: ‘Symbol error probabilities for general cooperative links’, IEEE Trans. Wirel. Commun., 2005, 4, (3), pp. 1264–1273 6 Li, Y., and Kishore, S.: ‘Asymptotic analysis of amplify-and-forward relaying in Nakagami-fading environments’, IEEE Trans. Wirel. Commun., 2007, 6, (12), pp. 4256–4262

100 n1 =n2 =2 Ω11=1.1, Ω12=1.2

10–1

symbol error probability

Ω21=1.6, Ω22=1.5 –2

10

profile 1 10–3

profile 1: m11 = 1, m12 = 2; m21 = 2, m22 = 1 profile 2: m11 = 2, m12 = 3; m21 = 3, m22 = 4 profile 3: m11 = 1, m12 = 3; m21 = 4, m22 = 2

10–4

profile 3

10–5

analysis (tight lower bound) analysis (asymptotic approximation) simulation (exact)

profile 2

10–6 5

10

15

20

25

30

SNR, dB

Fig. 1 SEP of 16-PSK for AF MIMO relay systems with HBH beamforming

ELECTRONICS LETTERS 24th September 2009 Vol. 45 No. 20 Authorized licensed use limited to: Ulsan University. Downloaded on November 18, 2009 at 00:04 from IEEE Xplore. Restrictions apply.

Symbol error probability of hop-by-hop beamforming in Nakagami-m ...

Nov 18, 2009 - is derived which reveals the array and diversity gain. Numerical results .... where v ј w А i ю 1, m ј v ю i ю 1=2, s ј a1l ю a2u=g0 ю b, j ј.

106KB Sizes 1 Downloads 187 Views

Recommend Documents

Error Amplification in Failure Probability Estimates of ... - CiteSeerX
University of Florida. Copyright .... used to fit the response surface approximation. Results ... Table 2 which also shows that the fit is reasonably good. However ...

Error Amplification in Failure Probability Estimates of ... - CiteSeerX
Analytical and engineering application examples are investigated to ... used to alleviate the computational expense in reliability ...... probability calculation.

Symbol Error Rate Expression for Decode-and-Forward ...
Apr 4, 2009 - prove the performance of wireless communications over fading ... The advantage of this scheme is that it not only allows us to optimize the.

Robust Beamforming in Cognitive Radio
commission (FCC) [1], spectrum utilization depends very much upon place and time and yet most ... exploited by CR [5], but higher spectrum utilization is antici- pated if coexistence between the primary (PU) and ... achieve various objectives, such a

Error Probability Performance for Multi-hop Decode ...
and to mitigate wireless channel impairment as well as to solve the high ... performance where there is no need a brute-force summation over all possible correct ...

Network Coordinated Opportunistic Beamforming in Downlink Cellular ...
Apr 4, 2012 - forming (NC-OBF) protocol for downlink K-cell networks with M-antenna .... MSs per cell and the received signal-to-noise ratio (SNR).

The symbol-grounding problem in numerical cognition A review of ...
The symbol-grounding problem in numerical cognition A review of theory evidence and outstanding questions.pdf. The symbol-grounding problem in numerical ...

Change in Symbol of the Company ??? Raisaheb Reckhchand ... - NSE
Jul 26, 2017 - This circular shall be effective from August 01, 2017. For and on behalf of ... Manager. Telephone No. Fax No. Email id. 022-26598235/36.

Symbol Implementation in Software Testing
“Software testing is an exploration accompanied to provide sponsors with information about the superiority of the product or provision under test. ... culture of software development, a challenging association may be separate from the expansion tea

Error Characterization in the Vicinity of Singularities in ... - IEEE Xplore
plified specification and monitoring of the motion of mo- bile multi-robot systems ... framework and its application to a 3-robot system and present the problem of ...

Exact Bit Error Probability of Multi-hop Decode-and ...
sion for M-PSK is presented for multi-hop Decode-and-Forward Relaying. (MDFR) scheme, in ... and transmit jointly as a virtual antenna array. This enables them ... (MRC) or selection combining (SC) have been published [2-9]. In particular, in.

Evolution of Symbol Conventionality
So, at least, in some cases the material nature of a sign has absolutely .... semiotic system (genetic code, human language) which both have a developed digital.

Evolution of Symbol Conventionality
In other words, it is an axiological (pragmatical), and ... In other words, the presence of a protein "means" ... (RNA) to use the host apparatus for its own needs.

Mo_Jianhua_WCNC13_Secure Beamforming for ...
Mo_Jianhua_WCNC13_Secure Beamforming for MIMO Two-Way Transmission with an Untrusted Relay.pdf. Mo_Jianhua_WCNC13_Secure Beamforming for ...

Adaptive Beamforming with Augmentable Arrays in Non ...
an augmented received data covariance matrix. Augmentable arrays have been used to maximize array aperture given a limited number of sensors. Minimally ...

Connectionist Symbol Processing - GitHub
Department of Computer Science, University of Toronto,. 10 Kings College Road, Toronto, Canada M5S 1A4. Connectionist networks are composed of relatively ...

Merging Diversity and Beamforming Perceptions in ...
case of a base station antenna array with a static environ- ment, this would approximately ...... IEE/IEEE Int. Conf. on Telecom. (ICT), Acapulco/Mx.,. May 2000.

A quantitative measure of error minimization in the ...
David Haig I and Laurence D. Hurst 2 t Department ... 2 Department of Zoology, University of Oxford, South Parks Road, Oxford OX 1 3PS, United Kingdom ... At some stage, adaptive evo- .... MS3 reflect the relative number of synonymous mu-.

Preliminary evidence for a processing error in the biosynthesis of ...
Our data provide evidence for the existence of AP in cultured skin fibroblasts and ..... with a greater than 75% recovery ofAPA. AP bound less ... E. Ranieri, B. Paton and A. Poulos. 15.0-. E 10.0. 0. E°. CD. 0. CL. E. -S. 0._. Ca c 5.0-. 0. c, cn.

Error bars in experimental biology
Apr 9, 2007 - column denotes the data mean M. The bars on ... data, M, with SE or CI error bars, gives an ... tial bars indicate large error; short inferen-.

Symbol-wavelength MMSE gain in a multi-antenna ...
the ultra high-speed data services (i.e. speeds up to 480. Mbps) in ... of the 4th Annual Communication Networks and Services Research Conference (CNSR'06).

Cartels: the Probability of Getting Caught in the ...
Mar 12, 2008 - b Constance Monnier: PhD student at the University of Paris I ...... the introduction of leniency programs in the European Union in 1996, should have .... Education, Migration, And Job Satisfaction: The Regional Returns Of ...

symbol conversion - Bourse de Montréal
Jun 22, 2011 - P.O. Box 61, 800 Victoria Square, Montréal, Québec H4Z 1A9. Telephone: (514) 871-2424. Toll-free within Canada and the U.S.A.: 1 800 361-5353 ... Clearing Members may contact the CDCC Member Services Department. Brian Gelfand. Vice-Pre