• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Diversity-Mutiplexing Tradeoff Of Asynchronous Cooperative Relay Networks And Diversity Embedded Coding Schemes

Naveen, N 07 1900 (has links)
This thesis consists of two parts addressing two different problems in fading channels. The first part deals with asynchronous cooperative relay communication. The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In this work we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding Diversity-Multiplexing Tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound on DMT for all multiplexing gains and for number of relays N ≥ 2. The distributed space-time codes for all the protocols considered are based on Cyclic Division Algebras (CDA). The second part of the work addresses the DMT analysis of diversity embedded codes for MIMO channels. Diversity embedded codes are high rate codes that are designed so that they have a high diversity code embedded within them. This allows a form of opportunistic communication depending on the channel conditions. The high diversity code ensures that at least a part of the information is received reliably, whereas the embedded high rate code allows additional information to be transferred if the channel is good. This can be thought of coding the data into two streams: high priority and low priority streams so that the high priority stream gets a better reliability than the lower priority stream. We show that superposition based diversity embedded codes in conjunction with naive single stream decoding is sub-optimal in terms of the DM tradeoff. We then construct explicit diversity embedded codes by the superposition of approximately universal space-time codes from CDAs. The relationship between broadcast channels and the diversity embedded setting is then utilized to provide some achievable Diversity Gain Region (DGR) for MIMO broadcast Channels.

Page generated in 0.0931 seconds