Results 1  10
of
17
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.
Simplified computeandforward and its performance analysis
 IET Commun
, 2013
"... ar ..."
(Show Context)
Improved Rates and Coding for the MIMO TwoWay Relay Channel
"... Abstract—The Gaussian multipleinput multipleoutput twoway relay channel is considered. By applying linear pre and postprocessing, the channel matrices are transformed into triangular form having equal diagonals. Over the obtained triangular channels, dirtypaper coding is applied, yielding par ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—The Gaussian multipleinput multipleoutput twoway relay channel is considered. By applying linear pre and postprocessing, the channel matrices are transformed into triangular form having equal diagonals. Over the obtained triangular channels, dirtypaper coding is applied, yielding parallel symmetric scalar twoway relay channels; thus, reducing the coding task to that of coding over the scalar symmetric twoway relay channel. Any existing coding technique can then be readily applied over these resulting channels. This technique allows to obtain new achievable rates in the symmetric case. Index Terms—Physicallayer network coding, network capacity, multipleaccess channel, structured codes, MIMO channels, twoway relay channel, compressandforward, decodeandforward, joint matrix decomposition, successive interference cancellation, dirtypaper coding I.
Signal space alignment for the Gaussian Ychannel
 in Proc. of IEEE International Symposium on Info. Theory (ISIT
, 2012
"... ar ..."
(Show Context)
1The Dirty MIMO MultipleAccess Channel
"... Abstract—In the scalar dirty multipleaccess channel, in addition to Gaussian noise, two additive interference signals are present, each known noncausally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an i.i.d. ensemble of codes does not achieve the capaci ..."
Abstract
 Add to MetaCart
Abstract—In the scalar dirty multipleaccess channel, in addition to Gaussian noise, two additive interference signals are present, each known noncausally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an i.i.d. ensemble of codes does not achieve the capacity region. Rather, a structuredcodes approach was presented, which was shown to be optimal in the limit of high signaltonoise ratios, where the sumcapacity is dictated by the minimal (“bottleneck”) channel gain. In the present work, we consider the multipleinput multipleoutput (MIMO) variant of this setting. In order to incorporate structured codes in this case, one can utilize matrix decompositions, which transform the channel into effective parallel scalar dirty multipleaccess channels. This approach however suffers from a “bottleneck ” effect for each effective scalar channel and therefore the achievable rates strongly depend on the chosen decomposition. It is shown that a recently proposed decomposition, where the diagonals of the effective channel matrices are equal up to a scaling factor, is optimal at high signaltonoise ratios, under an equal rank assumption. This approach is then extended to any number of users. Finally, an application to physicallayer network coding for the MIMO twoway relay channel is presented. Index Terms—Multipleaccess channel, dirtypaper coding, multipleinput multipleoutput channel, matrix decomposition, physicallayer network coding, twoway relay channel. I.
The Generalized Degrees of Freedom of the Interference Relay Channel with Strong Interference
"... Abstract—The interference relay channel (IRC) under strong interference is considered. A highsignaltonoise ratio (SNR) generalized degrees of freedom (GDoF) characterization of the capacity is obtained. To this end, a new GDoF upper bound is derived based on a genieaided approach. The achievabil ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—The interference relay channel (IRC) under strong interference is considered. A highsignaltonoise ratio (SNR) generalized degrees of freedom (GDoF) characterization of the capacity is obtained. To this end, a new GDoF upper bound is derived based on a genieaided approach. The achievability of the GDoF is based on cooperative interference neutralization. It turns out that the relay increases the GDoF even if the relaydestination link is weak. Moreover, in contrast to the standard interference channel, the GDoF is not a monotonically increasing function of the interference strength in the strong interference regime. I.
1Suboptimality of Treating Interference as Noise in the Cellular Uplink with Weak Interference
"... Despite the simplicity of the scheme of treating interference as noise (TIN), it was shown to be sumcapacity optimal in the Gaussian interference channel (IC) with veryweak (noisy) interference. In this paper, the 2user IC is altered by introducing a further transmitter that wants to communicate ..."
Abstract
 Add to MetaCart
(Show Context)
Despite the simplicity of the scheme of treating interference as noise (TIN), it was shown to be sumcapacity optimal in the Gaussian interference channel (IC) with veryweak (noisy) interference. In this paper, the 2user IC is altered by introducing a further transmitter that wants to communicate with one of the receivers of the IC. The resulting network thus consists of a pointtopoint channel interfering with a multiple access channel (MAC) and is denoted PIMAC. The sumcapacity of the PIMAC is studied with main focus on the optimality of TIN. It turns out that TIN in its naïve variant, where all transmitters are active and both receivers use TIN for decoding, is not the best choice for the PIMAC. In fact, a scheme that combines both time division multiple access and TIN (TDMATIN) outperforms the naïve TIN scheme. Furthermore, it is shown that in some regimes, TDMATIN achieves the sumcapacity for the deterministic PIMAC and the sumcapacity within a constant gap for the Gaussian PIMAC. Additionally, it is observed that, even for veryweak interference, there are some regimes where a combination of interference alignment and TIN outperforms TDMATIN. I.