Results 1  10
of
17
Capacity theorems for the AWGN multiway relay channel
 in IEEE Intl. Symp. on Inf. Theory (ISIT
, 2010
"... ar ..."
(Show Context)
The capacity region of multiway relay channels over finite fields with full data exchange
 IEEE Trans. Inf. Theory
, 2011
"... ar ..."
(Show Context)
FunctionalDecodeForward for the General Discrete Memoryless TwoWay Relay Channel
"... Abstract—We consider the general discrete memoryless twoway relay channel, where two users exchange messages via a relay, and propose two functionaldecodeforward coding strategies for this channel. Functionaldecodeforward involves the relay decoding a function of the users ’ messages rather than ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract—We consider the general discrete memoryless twoway relay channel, where two users exchange messages via a relay, and propose two functionaldecodeforward coding strategies for this channel. Functionaldecodeforward involves the relay decoding a function of the users ’ messages rather than the individual messages themselves. This function is then broadcast back to the users, which can be used in conjunction with the user’s own message to decode the other user’s message. Via a numerical example, we show that functionaldecodeforward with linear codes is capable of achieving strictly larger sum rates than those achievable by other strategies. I.
The Capacity of a Class of MultiWay Relay Channels
"... Abstract—The capacity of a class of multiway relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The cutset upper bound to the capacity is shown to be a ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—The capacity of a class of multiway relay channels, where L users communicate via a relay (at possibly different rates), is derived for the case where the channel outputs are modular sums of the channel inputs and the receiver noise. The cutset upper bound to the capacity is shown to be achievable. More specifically, the capacity is achieved using (i) rate splitting, (ii) functionaldecodeforward, and (iii) joint sourcechannel coding. We note that while separate sourcechannel coding can achieve the commonrate capacity, joint sourcechannel coding is used to achieve the capacity for the general case where the users are transmitting at different rates. I.
1Degrees of Freedom for MIMO TwoWay X Relay Channel
"... We study the degrees of freedom (DOF) of a multipleinput multipleoutput (MIMO) twoway X relay channel, where there are two groups of source nodes and one relay node, each equipped with multiple antennas, and each of the two source nodes in one group exchanges independent messages with the two sou ..."
Abstract
 Add to MetaCart
We study the degrees of freedom (DOF) of a multipleinput multipleoutput (MIMO) twoway X relay channel, where there are two groups of source nodes and one relay node, each equipped with multiple antennas, and each of the two source nodes in one group exchanges independent messages with the two source nodes in the other group via the relay node. It is assumed that every source node is equipped with M antennas while the relay is equipped with N antennas. We first show that the upper bound on the total DOF for this network is 2min {2M;N} and then focus on the case of N ≤ 2M so that the DOF is upper bounded by twice the number of antennas at the relay. By applying signal alignment for network coding and joint transceiver design for interference cancellation, we show that this upper bound can be achieved when N ≤ ⌊ 8M5 ⌋. We also show that with signal alignment only but no joint transceiver design, the upper bound is achievable when N ≤ ⌊ 4M3 ⌋. Simulation results are provided to corroborate the theoretical results and to demonstrate the performance of the proposed scheme in the finite signaltonoise ratio regime. Index Terms MIMO X channel, relay, twoway communication, signal alignment, joint transceiver design. Copyright (c) 2012 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending a request to pubspermissions@ieee.org.
University of Alberta DESIGN AND ANALYSIS OF NEW WIRELESS TRANSMISSION STRATEGIES FOR COOPERATIVE RELAY NETWORKS
"... Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of ..."
Abstract
 Add to MetaCart
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author’s prior written permission. Dedicated to my beloved parents and wife... Cooperative relay technologies are currently being researched to address the everincreasing demand for higher data rates, extended coverage, greater mobility, and enhanced reliability. This thesis thus focuses on (1) developing new physicallayer wireless technologies for cooperative relay networks and (2) ascertaining their viability through performance analysis. Specifically, (i) new system and channel models, (ii) signaling and relayprocessing algorithms, (iii) joint relayantenna selection strategies, (iv) joint transmitreceive beamforming techniques, and (v) comprehensive performance analysis frameworks are developed for
Edinburgh, UK.
"... In this paper, the multiway relaying scenario is considered with M users who want to exchange their information with each other with the help of N relays (N ≫ M) among them. There are no direct transmission channels between any two users. Particularly all users transmit their signals to all relays ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper, the multiway relaying scenario is considered with M users who want to exchange their information with each other with the help of N relays (N ≫ M) among them. There are no direct transmission channels between any two users. Particularly all users transmit their signals to all relays in the first time slot and M − 1 relays are selected later to broadcast their mixture signals during the following M − 1 time slots to all users. Compared to the transmission with the help of single relay, the multiway relaying scenario reduces the transmit time significantly from 2M to M time slots. Random and semiorthogonal relays selections are applied. Rician fading channels are considered between the users and relays, and analytical expressions for the outage probability and ergodic sum rate for the proposed relaying protocol are developed by first characterizing the statistical property of the effective channel gain based on random relays selection. Also, the approximation of ergodic sum rate at high signaltonoise ratio (SNR) regime is derived. In addition, the diversity order of the system is investigated for both random and semiorthogonal relay selections. Meanwhile, it is shown that when the relays are randomly separated into L groups of M − 1 relays, the group with maximum average channel gain can achieve the diversity order L which will increase when more relays considered in the
NonRegenerative MultiWay Relaying: Combining the Gains of Network Coding and Joint Processing
"... In this paper, we consider a nonregenerative multigroup multiway relaying scenario in which each group consists of multiple halfduplex nodes. Each node wants to share its data with all other nodes within its group. The transmissions are performed via an intermediate nonregenerative halfduplex ..."
Abstract
 Add to MetaCart
In this paper, we consider a nonregenerative multigroup multiway relaying scenario in which each group consists of multiple halfduplex nodes. Each node wants to share its data with all other nodes within its group. The transmissions are performed via an intermediate nonregenerative halfduplex multiantennarelay station, termed RS, which spatially separates the different groups. In our proposal, all nodes simultaneously transmit to RS during a common multiple access phase and RS retransmits linearly processed versions of the received signals back to the nodes during multiple broadcast (BC) phases. We propose a novel transmit strategy which exploits analog network coding (ANC) and efficientlycombines spatial transceive processing at RS with joint receive processing at each node over multiple BC phases. A closedform solution for an ANC aware relay transceive filter is introduced and closedform solutions for the joint receive processing filters at the nodes are presented. Furthermore, selfinterference cancellation and successive interference cancellation are exploited at the nodes to improve the joint receive processing. By numerical results, it is shown that the proposed transmit strategy significantly outperforms existing multiway strategies.