Results 1 
6 of
6
Random Access with Physicallayer Network Coding
"... Abstract—Leveraging recent progress in computeandforward we propose an approach to random access that is based on physicallayer network coding: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission, the receiver can t ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Leveraging recent progress in computeandforward we propose an approach to random access that is based on physicallayer network coding: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission, the receiver can thus obtain many linear combinations and eventually recover all original packets. This is by contrast to slotted ALOHA where packet collisions lead to complete erasures. The throughput of the proposed strategy is derived for a system with two users and shown to be significantly superior to the best known strategies, including multipacket reception. I.
Relays that cooperate to compute
 in Proc. Int. Symp. Wireless Commun. Syst
, 2012
"... Abstract—This paper proposes a new coding scheme that combines the advantages of statistical cooperation and algebraic structure. Consider a multipleaccess relay channel where two transmitters attempt to send the modulosum of their finite field messages to the receiver with the help of the relay. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract—This paper proposes a new coding scheme that combines the advantages of statistical cooperation and algebraic structure. Consider a multipleaccess relay channel where two transmitters attempt to send the modulosum of their finite field messages to the receiver with the help of the relay. The transmitters use nested lattice codes to ensure that sums of codewords are protected against noise and to preserve the modulo operation of the finite field. We develop a block Markov coding scheme where the relay recovers the real sum of the codewords and retransmits it coherently with the two transmitters. I.
On modulosum computation over an erasure multiple access channel
 in Prodeedings. IEEE International Symposium on Information Theory (ISIT), 2012
"... ar ..."
1On the EqualRate Capacity of the AWGN Multiway Relay Channel
"... Abstract—The Luser additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functionaldecodeforward coding strategy, is derived. For the case where there are three o ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—The Luser additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functionaldecodeforward coding strategy, is derived. For the case where there are three or more users, and all nodes transmit at the same power, the capacity is obtained. For the case where the relay power scales with the number of users, it is shown that both compressforward and functionaldecodeforward achieve rates within a constant number of bits of the capacity at all SNR levels; in addition, functionaldecodeforward outperforms compressforward and completedecodeforward at high SNR levels. Index Terms—Additive white Gaussian noise (AWGN), capacity, decodeforward, functionaldecodeforward, lattice code, multiway relay channel (MWRC). I.