A quadratic programming relaxation approach to compute-and-forward network coding design

@article{Zhou2014AQP,
  title={A quadratic programming relaxation approach to compute-and-forward network coding design},
  author={Baojian Zhou and Jinming Wen and Wai Ho Mow},
  journal={2014 IEEE International Symposium on Information Theory},
  year={2014},
  pages={2296-2300}
}
In wireless networks, the compute-and-forward strategy is a promising physical layer network coding scheme that can achieve high rates by effectively exploiting the interference between users. However, the design of the optimal integer-valued equation coefficient vectors in a compute-and-forward scheme turns out to be a shortest vector problem, which is known to be NP hard. In this work, we consider the problem of designing the equation coefficient vector for each relay with the objective being… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

An Efficient Algorithm for Optimally Solving a Shortest Vector Problem in Compute-and-Forward Design

  • IEEE Transactions on Wireless Communications
  • 2014
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Compute-and-forward protocol design based on improved sphere decoding

  • 2015 IEEE International Conference on Communications (ICC)
  • 2014
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Expanded Compute-and-Forward for Backhaul-Limited Cell-Free Massive MIMO

Jing Zhang, Jiayi Zhang, Jiakang Zheng, Shi Jin, Bo Ai
  • 2019 IEEE International Conference on Communications Workshops (ICC Workshops)
  • 2019

A linearithmic time algorithm for a shortest vector problem in compute-and-forward design

  • 2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

Efficient compute-and-forward design with low communication overhead

  • 2016 22nd Asia-Pacific Conference on Communications (APCC)
  • 2016

Compute-and-Forward: Finding the best equation

  • 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Compute-and-Forward: Harnessing Interference Through Structured Codes

  • IEEE Transactions on Information Theory
  • 2009
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Compute-and-forward: Harnessing interference with structured codes

  • 2008 IEEE International Symposium on Information Theory
  • 2008
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

A quadratic programming relaxation approach to compute-and-forward network coding design

B. Zhou, W. H. Mow
  • 2014 IEEE International Symposium on Information Theory (ISIT), June 2014, pp. 2296–2300.
  • 2014
VIEW 2 EXCERPTS

A quadratic programming relaxation approach to compute-and-forward network coding design

B. Zhou, W. H. Mow
  • 2014 IEEE International Symposium on Information Theory (ISIT), June 2014, pp. 2296–2300.
  • 2014
VIEW 2 EXCERPTS

Compute-and-Forward: Finding the best equation

  • 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
VIEW 2 EXCERPTS

Compute-and-forward protocol design based on improved sphere decoding

  • 2015 IEEE International Conference on Communications (ICC)
  • 2014
VIEW 2 EXCERPTS

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

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

Compute-and-Forward Network Coding Design over Multi-Source Multi-Relay Channels

  • IEEE Transactions on Wireless Communications
  • 2012
VIEW 1 EXCERPT