Spelling suggestions: "subject:"twoway delaying"" "subject:"twoway displaying""
1 |
Relay-aided communications with partial channel state informationYazdan Panah, Ali 21 October 2011 (has links)
Modern wireless communication systems strive to enable communications at high data rates, over wide geographical areas, and to multiple users. Unfortunately, this can be a daunting task in practice, as natural laws governing the wireless medium may hinder point-to-point transmissions. Communications over large distances (path loss), and physical obstructions in line-of-sight signals (shadowing) are prime examples of such impediments. One promising solution is to deploy intermediary terminals to help reestablish such broken point-to-point communication links. Such terminals are called relay nodes, and the corresponding systems are referred to as being relay-aided.
As in the case of point-to-point communication, design of efficient transmission and reception techniques in relay-aided systems depends on the availability of propagational channel state information. In practice, such information is only accurate to a certain degree which is governed by overhead constraints, feedback delay, and channel fluctuations due to mobility. Understanding the impacts of such partial channel state information, and devising transmission and reception methods based on such understandings, is the main topic of this dissertation.
The transmission protocol classifies relays as either one-way, where the relay receives signals from one terminal, or two-way, where the relay receives signals from more than one terminal. Designs and solutions for both one- and two-way relaying systems are presented in this dissertation. Emphasis is placed on two-way relaying systems given their superior efficiency in utilizing channel resources.
For one-way relaying this dissertation presents power loading strategies for multiuser-multicast systems derived based on the availability of full or partial channel state information at the terminals.
In the case of two-way relaying, both single and multi-user systems are analyzed. For single-user two-way relaying, this dissertation presents optimal methods of acquiring partial channel state information via pilot-aided channel estimation methods. This includes an analysis of the effects of channel estimation upon the system sum-rate. Also, the design of channel equalizers exhibiting robustness to partial channel state information is proposed. For multi-user two-way relaying, this dissertation presents several precoding strategies at the relay terminal(s) to combat the effects co-channel interference in light of the existence of self-interference inherent to two-way relaying operations. / text
|
2 |
Relay Selection and Resource Allocation in One-Way and Two-Way Cognitive Relay NetworksAlsharoa, Ahmad M. 08 May 2013 (has links)
In this work, the problem of relay selection and resource power allocation in one- way and two-way cognitive relay networks using half duplex channels with different relaying protocols is investigated. Optimization problems for both single and multiple relay selection that maximize the sum rate of the secondary network without degrading the quality of service of the primary network by respecting a tolerated interference threshold were formulated. Single relay selection and optimal power allocation for two-way relaying cognitive radio networks using decode-and-forward and amplify-and-forward protocols were studied. Dual decomposition and subgradient methods were used to find the optimal power allocation. The transmission process to exchange two different messages between two transceivers for two-way relaying technique takes place in two time slots. In the first slot, the transceivers transmit their signals simultaneously to the relay. Then, during the second slot the relay broadcasts its signal to the terminals. Moreover, improvement of both spectral and energy efficiency can be achieved compared with the one-way relaying technique. As an extension, a multiple relay selection for both one-way and two-way relaying under cognitive radio scenario using amplify-and-forward were discussed. A strong optimization tool based on genetic and iterative algorithms was employed to solve the
formulated optimization problems for both single and multiple relay selection, where
discrete relay power levels were considered. Simulation results show that the practical and low-complexity heuristic approaches achieve almost the same performance of the optimal relay selection schemes either with discrete or continuous power distributions while providing a considerable saving in terms of computational complexity.
|
3 |
Network Coding for Wirless Relaying and Wireline NetworksVijayvaradharaj, T M January 2014 (has links) (PDF)
Network coding has emerged as an attractive alternative to routing because of the through put improvement it provides by reducing the number of channel uses. In a wireless scenario, in addition, further improvement can be obtained through Physical layer Network Coding (PNC), a technique in which nodes are allowed to transmit simultaneously, instead of transmitting in orthogonal slots. In this thesis, the design and analysis of network coding schemes are considered, for wireless two-way relaying, multi-user Multiple Access Relay Channel (MARC) and wireline networks.
In a wireless two-way relay channel with PNC, the simultaneous transmissions of user nodes result in Multiple Access Interference (MAI) at there lay node. The harmful effect of MAI is the presence of signal set dependent deep channel fade conditions, called singular fade states, under which the minimum distance of the effective constellation at the relay become zero. Adaptively changing the network coding map used at the relay according to channel conditions greatly reduces the impact of this MAI. In this work, we obtain these adaptive PNC maps, which are finite in number ,by completing partially filled Latin Squares and using graph vertex coloring. Having obtained the network coding maps, the set of all possible channel realizations is quantized into a finite number of regions, with a specific network coding map chosen in a particular region and such a quantization is obtained analytically for 2λ-PSK signal set. The performance of the adaptive PNC scheme for two-way relaying is analyzed and tight high SNR upper bounds are obtained for the average end-to-end symbol error probability, in terms of the average error probability of a point-to-point fading channel. The adaptive PNC scheme is generalized for two-way relaying with multiple antennas at the nodes.
As an alternative to the adaptive PNC scheme for two-way relaying, a Distributed Space Time Coding (DSTC) scheme is proposed, which effectively re-moves the effect of singular fade states at the transmitting nodes itself without any Channel State Information at the Transmitter (CSIT), and without any need to change the PNC map as a function of channel fade conditions. It is shown that the singular fade states can be viewed equivalently as vector subspaces of C2, which are referred to as the singular fade subspaces. DSTC design criterion to minimize the number of singular fade subspaces and maximize the coding gain is formulated and explicit low decoding complexity DSTC designs are provided.
For the K-user MARC, in which K source nodes want to transmit messages to a destination node D with the help of are lay node R, a new PNC scheme is proposed. Use of a many-to-one PNC map with conventional minimum squared Euclidean distance decoding at D, results in a loss of diversity order due to error propagation from the relay node. To counter this, we propose a novel low complexity decoder which offers the maximum diversity order of two.
Next, we consider wire line networks and explore the connections between linear network coding, linear index coding and discrete polymatroids, which are the multi-set analogue of matroids.
We define a discrete polymatroidal network and show that a fractional vector linear solution over a field Fq exists for a network if and only if the network is discrete polymatroidal with respect to a discrete polymatroid representable over Fq.An algorithm to construct networks starting from certain class of discrete polymatroids is provided. Every representation over Fq for the discrete polymatroid, results in a fractional vector linear solution over Fq for the constructed network.
It is shown that a linear solution to an index coding problem exists if and only if there exists a representable discrete polymatroid satisfying certain conditions which are determined by the index coding problem considered. El Rouayheb et. al. showed that the problem of finding a multi-linear representation for a matroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that matroid. Multi-linear representation of a matroid can be viewed as a special case of representation of an appropriate discrete polymatroid. We generalize the result of El Rouayheb et. al. by showing that the problem of finding a representation for a discrete polymatroid can be reduced to finding a perfect linear index coding solution for an index coding problem obtained from that discrete polymatroid.
|
Page generated in 0.0641 seconds