Abstract

In cooperative communication systems, multiple-input multiple-output (MIMO) amplify-and-forward (AF) relaying is a promising solution for upcoming wireless standards due to its intrinsic benefits in terms of extended coverage and increased spatial diversity. However, the deployment of MIMO AF relays faces some key challenges such as the need of channel state information (CSI) for the partial channels associated with the different communication links, which is required by some transmit optimization techniques. In this paper, we consider a one-way two-hop MIMO AF cooperative scheme employing space-time (ST) codings at the transmitter and relay nodes. First, we formulate a nested PARAFAC model for the tensor of signals received at destination. A theoretical study on the identifiability and uniqueness issues for the nested PARAFAC model is also carried out. Then, two iterative semi-blind receivers that exploit differently the algebraic properties of this model are formulated for a joint channel and symbol estimation at the destination. Uniqueness and least squares identifiability conditions are derived for these receivers, and their computational complexities are analyzed. Simulation results evaluate the bit error rate and the channel estimation accuracy obtained with the proposed semi-blind receivers, corroborating the performance improvements over recent semi-blind and supervised competitors, thanks to the use of a double Khatri-Rao coding associated with the source and relay nodes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.