Performance analysis of fixed gain amplify-and-forward relaying with time-efficient cascaded channel estimation
Data(s) |
2011
|
---|---|
Resumo |
In a cooperative system with an amplify-and-forward relay, the cascaded channel training protocol enables the destination to estimate the source-destination channel gain and the product of the source-relay (SR) and relay-destination (RD) channel gains using only two pilot transmissions from the source. Notably, the destination does not require a separate estimate of the SR channel. We develop a new expression for the symbol error probability (SEP) of AF relaying when imperfect channel state information (CSI) is acquired using the above training protocol. A tight SEP upper bound is also derived; it shows that full diversity is achieved, albeit at a high signal-to-noise ratio (SNR). Our analysis uses fewer simplifying assumptions, and leads to expressions that are accurate even at low SNRs and are different from those in the literature. For instance, it does not approximate the estimate of the product of SR and RD channel gains by the product of the estimates of the SR and RD channel gains. We show that cascaded channel estimation often outperforms a channel estimation protocol that incurs a greater training overhead by forwarding a quantized estimate of the SR channel gain to the destination. The extent of pilot power boosting, if allowed, that is required to improve performance is also quantified. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/46109/1/Glob_Tele_com_Con_1_2011.pdf Bharadwaj, Sachin and Mehta, Neelesh B (2011) Performance analysis of fixed gain amplify-and-forward relaying with time-efficient cascaded channel estimation. In: 54th Annual IEEE Global Telecommunications Conference (GLOBECOM), 5-9 Dec. 2011, Houston, TX, USA. |
Publicador |
IEEE |
Relação |
http://dx.doi.org/10.1109/GLOCOM.2011.6133657 http://eprints.iisc.ernet.in/46109/ |
Palavras-Chave | #Electrical Communication Engineering |
Tipo |
Conference Paper PeerReviewed |