Record Details

Coding For Wireless Relay Networks And Mutiple Access Channels

Electronic Theses of Indian Institute of Science

View Archive Info
 
 
Field Value
 
Title Coding For Wireless Relay Networks And Mutiple Access Channels
 
Creator Harshan, J
 
Subject Wireless Relay Communication
Wireless Relay Networks - Coding
Multiple Access Channels - Coding
Space-Time Block Codes (STBCs)
Distributed Space-Time Block Codes (DSTBCs)
Antennas
Gaussian Multiple Access Channels (GMAC)
Wireless Communication
Multiple Input-Multiple Output Channels
Distributed Space-Time Coding
Two-Antenna-Relays Networks
Relay Networks
Multiple-Input Multiple-Output (MIMO)
Communication Engineering
 
Description This thesis addresses the design of low-complexity coding schemes for wireless relay networks and multiple access channels. The first part of the thesis is on wireless relay networks and the second part is on multiple access channels.
Distributed space-time coding is a well known technique to achieve spatial diversity in wireless networks wherein, several geographically separated nodes assist a source node to distributively transmit a space-time block code (STBC) to the destination. Such STBCs are referred to as Distributed STBCs (DSTBCs). In the first part of the thesis, we focus on designing full diversity DSTBCs with some nice properties which make them amenable for implementation in practice. Towards that end, a class of full diversity DST-BCs referred to as Co-ordinate Interleaved DSTBCs (CIDSTBCs) are proposed for relay networks with two-antenna relays. To construct CIDSTBCs, a technique called co-ordinate vector interleaving is introduced wherein, the received signals at different antennas of the relay are processed in a combined fashion. Compared to the schemes where the received signals at different antennas of the relay are processed independently, we show that CIDSTBCs provide coding gain which comes in with negligible increase in the processing complexity at the relays. Subsequently, we design single-symbol ML decodable (SSD) DSTBCs for relay networks with single-antenna nodes. In particular, two classes of SSD DSTBCs referred to as (i) Semi-orthogonal SSD Precoded DSTBCs and (ii) Training-Symbol Embedded (TSE) SSD DSTBCs are proposed. A detailed analysis on the maximal rate of such DSTBCs is presented and explicit DSTBCs achieving the maximal rate are proposed. It is shown that the proposed codes have higher rates than the existing SSD DSTBCs.
In the second part, we study two-user Gaussian Multiple Access Channels (GMAC). Capacity regions of two-user GMAC are well known. Though, capacity regions of such channels provide insights into the achievable rate pairs in an information theoretic sense, they fail to provide information on the achievable rate pairs when we consider finitary restrictions on the input alphabets and analyze some real world practical signal constellations like QAM and PSK signal sets. Hence, we study the capacity aspects of two-user GMAC with finite input alphabets. In particular, Constellation Constrained (CC) capacity regions of two-user SISO-GMAC are computed for several orthogonal and non-orthogonal multiple access schemes (abbreviated as O-MA and NO-MA schemes respectively). It is first shown that NO-MA schemes strictly offer larger capacity regions than the O-MA schemes for finite input alphabets. Subsequently, for NO-MA schemes, code pairs based on Trellis Coded Modulation (TCM) are proposed such that any rate pair on the CC capacity region can be approached. Finally, we consider a two-user Multiple-Input Multiple-Output (MIMO) fading MAC and design STBC pairs such that ML decoding complexity is reduced.
 
Contributor Sundar Rajan, B
 
Date 2011-07-12T05:35:55Z
2011-07-12T05:35:55Z
2011-07-12
2010-02
 
Type Thesis
 
Identifier http://etd.iisc.ernet.in/handle/2005/1283
http://etd.ncsi.iisc.ernet.in/abstracts/1665/G23714-Abs.pdf
 
Language en_US
 
Relation G23714