Compute-and-forward on a multiaccess relay channel: Coding and symmetric-rate optimization

IEEE Transactions on Wireless Communications

Volumn 13, Issue 4, 2014, Pages 1932-1947

  El Soussi, Mohieddine ^a   Zaidi, Abdellatif ^b   Vandendorpe, Luc ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITÉ GUSTAVE EIFFEL   (France)

Author keywords

Compute and forward; geometric programming; lattice codes; mixed integer quadratic programming; network coding; relay channel

Indexed keywords

DECODING; ELECTRIC RELAYS; ITERATIVE METHODS; NETWORK CODING;

COMPUTE-AND-FORWARD; GEOMETRIC PROGRAMMING; LATTICE CODES; MIXED INTEGER QUADRATIC PROGRAMMING; RELAY CHANNELS;

INTEGER PROGRAMMING;

EID: 84899906901     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2014.022614.130502     Document Type: Article

References (31)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, July 2000.
2. L. R. Ford and D. R. Fulkerson, "Maximal flow through a network," Can. J. Math., vol. 8, pp. 399-404, 1956.
3. P. Elias, D. R. Feinstein, and C. E. Shannon, "A note on the maximal flow through a network," IRE Trans. Inf. Theory, vol. IT-72, pp. 117-119, Dec. 1956.
4. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. IT-49, pp. 371-381, Feb. 2003.
5. R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, pp. 782-795, Oct. 2003.
6. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, "Network coding theory," Found. Trends Commun. Inf. Theory, vol. 2, pp. 241-381, 2005.
7. C. Fragouli and E. Soljanin, Network Coding Fundamentals. Found. Trends Commun. Info. Theory, 2007.
8. A. Avestimeher, S. Diggavi, and D. Tse, "Wireless network information flow: a determenistic approach," IEEE Trans. Inf. Theory, vol. 57, pp. 1872-1905, Apr. 2011.
9. S. H. Lim, Y.-H. Kim, A. E. Gamal, and S.-Y. Chung, "Noisy network coding," IEEE Trans. Inf. Theory, vol. 57, pp. 3132-3152, May 2011.
10. J. H. Conway and N. J. A. Sloane, Sphere Packing, Lattices and Groups, 3rd ed. John Wiley & Sons Inc., 1988.
11. K. Narayanan, M. P. Wilson, and A. Sprinston, "Joint physical layer coding and network coding for bidirectioal relaying," in Proc. 2007 Allerton Conf. on Comm., Control, and Computing.
12. S. J. Kim, P. Mitran, and V. Tarokh, "Performance bounds for bidirectional coded cooperation protocols," IEEE Trans. Inf. Theory, vol. IT-54, pp. 5253-5241, Nov. 2008.
13. B. Nazer and M. Gastpar, "Compute-and-forward: harnessing interference through structured codes," IEEE Trans. Inf. Theory, vol. 57, pp. 6463-6486, 2011.
14. B. Nazer, A. Sanderovich, M. Gastpar, and S. Shamai, "Structured superposition for backhaul constrained cellular uplink," in Proc. 2009 IEEE International Symposium on Information Theory, pp. 1530-1534.
15. R. Zamir, S. Shamai,, and U. Erez, "Nested linear/lattice codes for structured multiterminal binning," IEEE Trans. Inf. Theory, vol. 48, pp. 1250-1276, June 2002.
16. Y. Song and N. Devroye, "Lattice codes for the Gaussian relay channel: decode-and-forward and compress-and-forward," IEEE Trans. Inf. Theory, 2011, submitted for publication. Available: http://arxiv.org/abs/1111. 0084
17. M. Chiang, C. W. Tan, D. P. Palomar, D. O'Neill, and D. Julian, "Power control by geometric programming," IEEE Trans. Wireless Commun., vol. 6, pp. 2640-2651, July 2007.
18. L. Sankaranarayanan, G. Kramer, and N. B. Mandayam, "Hierarchical sensor networks: capacity theorems and cooperative strategies using the multiple-access relay channel model," in Proc. 2004 IEEE Conference on Sensor and Ad Hoc Communications and Networks, pp. 191-199.
19. L. Sankar, Y. Liang, V. H. Poor, and N. B. Mandayam, "Opportunistic communications in an orthogonal multiaccess relay channel," in Proc. 2007 IEEE International Symposium on Information Theory, pp. 1261-1265.
20. A. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol. 22, pp. 1-10, 1976.
21. G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks," IEEE Trans. Inf. Theory, vol. 51, pp. 3037-3063, Sept. 2005.
22. U. Erez and R. Zamir, "Achieving 1 2 log(1 + SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, pp. 2293-2314, Oct. 2004.
23. J. Zhan, B. Nazer, U. Erez, and M. Gastpar, "Integer-forcing linear receivers," IEEE Trans. Inf. Theory, 2010, submitted for publication. Available: http://arxiv.org/abs/1003.5966
24. C. A. Floudas, Nonlinear and Mixed Integer Optimization. Oxford University Press, 1995.
25. E. L. Lawler and D. Wood, "Branch-and-bound methods: a survey," Operations Research, pp. 699-719, 1966.
26. L. A. Wolsey, Integer Programming. John Wiley and Sons, 1998.
27. C. Feng, D. Silva, and F. R. Kschischang, "Algebraic approach to physical-layer network coding," IEEE Trans. Inf. Theory, 2011, submitted for publication. Available: http://arxiv.org/abs/1108.1695
28. M. Chiang, Geometric Programming for Communication Systems. Foundations and Trends of Communications and Information Theory, 2005.
29. B. R. Marks and G. P.Wright, "A general inner approximation algorithm for nonconvex mathematical programs," Operations Research, vol. 26, pp. 681-683, 1978.
30. J. Zhan, B. Nazer, M. Gastpar, and U. Erez, "MIMO compute-andforward," in Proc. 2009 IEEE Int. Symposium on Inf. Theory, pp. 2848-2852.
31. Y. Nesterov and A. Nemirovsky, Interior Point Polynomial Algorithms in Convex Programming. SIAM Press, 1994.