Abstract
A cooperative multiple-input multiple-output wireless communication has two phases: data exchange (information sharing) among source nodes, and cooperative transmission to the base station by these nodes. A bandwidth efficient method for implementing such a communication link is orthogonal distributed space---time Block Codes (ODSTBCs). It can provide full diversity with low decoding complexity, when all exchanged data correctly received by the cooperative nodes. However, in this paper, we consider that the data exchange is not error-free, and in this case, we derive a closed-form expression for the upper bound of ODSTBC bit error rate (BER). Moreover, we show that for achieving a desired BER, without sacrificing throughput or increasing complexity, it's sufficient that the number of cooperative nodes is kept in a specific range, which can be obtained by using this BER upper bound. Numerical and simulation results prove the accuracy of the ODSTBC BER upper bound, and the validity of the proposed method for calculating number of cooperative nodes required to achieve a desired BER.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
