Compute-and-forward in the two-hop multi-antenna X-channel

Jorswieck, Eduard A.; Richter, Johannes

doi:10.1109/isccsp.2012.6217847

Cited by 2 publications

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the analytical studies, including aforementioned works, consider the CMF from an information theory viewpoint which involves finding an achievable rate or a capacity region [7][8][9]. On the other hand, some works concentrate on the practical aspects and implementation of the CMF [10].…”

Section: Introductionmentioning

confidence: 99%

Simplified compute‐and‐forward and its performance analysis

Hejazi

Nasiri-Kenari

2013

IET Communications

View full text Add to dashboard Cite

The compute-and-forward (CMF) method has shown a great promise as an innovative approach to exploit interference towards achieving higher network throughput. The CMF was primarily introduced by means of information theory tools. Although there have been some recent works discussing different aspects of efficient and practical implementation of CMF, there are still some issues that are not covered. In this study, the authors first introduce a method to decrease the implementation complexity of the CMF method. They then evaluate the exact outage probability of the authors proposed simplified CMF scheme, and hereby provide an upper bound on the outage probability of the optimum CMF in all signal-tonoise ratio (SNR) values, and a close approximation of its outage probability in low SNR regimes. They also evaluate the effect of the channel estimation error (CEE) on the performance of both optimum and their proposed simplified CMF by simulations. Their simulation results indicate that the proposed method is more robust against CEE than the optimum CMF method for the examples considered.

show abstract

Section: Introductionmentioning

confidence: 99%

Simplified compute‐and‐forward and its performance analysis

Hejazi

Nasiri-Kenari

2013

IET Communications

View full text Add to dashboard Cite

show abstract

“…This node can be part of a bigger network, e.g., an interference network. The applicability of compute-and-forward to the interference network with multiple antennas at the relay is studied in [6].…”

Section: Introductionmentioning

confidence: 99%

An efficient branch-and-bound algorithm for compute-and-forward

Richter

Scheunert

Jorswieck

2012

2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC)

Self Cite

View full text Add to dashboard Cite

Compute-and-forward is a framework for reliable physical layer network coding introduced by Nazer and Gastpar. Instead of decoding single messages, it decodes linear combinations of messages with the help of nested lattice codes. Nazer and Gastpar derived an achievable rate for each node depending on the channel coefficients and the desired equation coefficients. However, it is open how to choose the coefficient vector with the equation coefficients. We provide a branch-and-bound algorithm that calculates the coefficient vector, which results in the highest computation rate at a single node. We implemented the algorithm in Matlab and compared the number of iterations to the number of needed iterations if we use a complete search over all possible vectors.Index Terms-compute-and-forward, network coding, branch-and-bound algorithm

show abstract

Compute-and-forward in the two-hop multi-antenna X-channel

Cited by 2 publications

References 10 publications

Simplified compute‐and‐forward and its performance analysis

Simplified compute‐and‐forward and its performance analysis

An efficient branch-and-bound algorithm for compute-and-forward

Contact Info

Product

Resources

About