Location of Repository

Cooperative Communication Protocols : Diversity-Multiplexing Gain Tradeoff And Code Constructions

By K Vinodh


Cooperative relay communication is a promising means of wireless communication in which cooperation is used to create a virtual transmit array between the source and the destination, thereby providing spatial diversity for combating the fading channel. In this thesis we develop cooperative communication protocols namely the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The code construction is based on Cyclic Division Algebras. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays

Topics: Coding Theory, Computer Communication Protocols, Orthogonal Amplify-And-Forward Protocol (OAF), Selection Decode-And-Forward Protocol (SDF), Cyclic Division Algebras, Cyclic Division Algebra Codes, Diversity-Mulplexing Gain Tradeoff (DMT), Cooperative Communication Protocols, Communications Engineering
Year: 2007
OAI identifier: oai:etd.ncsi.iisc.ernet.in:2005/505
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2005/505 (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.