Adaptive Randomized Distributed Space-Time Coding in Cooperative MIMO Relay Systems
pith:N4UIXQWK Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{N4UIXQWK}
Prints a linked pith:N4UIXQWK badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
An adaptive randomized distributed space-time coding (DSTC) scheme and algorithms are proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receivers and an amplify-and-forward (AF) cooperation strategy are considered. In the proposed DSTC scheme, a randomized matrix obtained by a feedback channel is employed to transform the space-time coded matrix at the relay node. Linear MMSE expressions are devised to compute the parameters of the adaptive randomized matrix and the linear receive filter. A stochastic gradient algorithm is also developed to compute the parameters of the adaptive randomized matrix with reduced computational complexity. We also derive the upper bound of the error probability of a cooperative MIMO system employing the randomized space-time coding scheme first. The simulation results show that the proposed algorithms obtain significant performance gains as compared to existing DSTC schemes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.