Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap

IEEE Transactions on Information Theory

Volumn 61, Issue 1, 2015, Pages 323-340

  Ordentlich, Or ^a   Erez, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Equalizers; Linear codes; MIMO; Space time codes

Indexed keywords

ANTENNAS; CODES (SYMBOLS); COMMUNICATION CHANNELS (INFORMATION THEORY); ENCODING (SYMBOLS); EQUALIZERS; LOCAL AREA NETWORKS; MIMO SYSTEMS; TRELLIS CODES;

COMMUNICATION ARCHITECTURES; COMMUNICATION SCHEMES; ENCODING MATRIX; LINEAR CODES; LINEAR DISPERSION SPACE-TIME CODES; MIMO CAPACITY; MULTIPLE ANTENNA; TRANSMIT ANTENNA;

SPACE TIME CODES;

EID: 84920178372     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2370047     Document Type: Article

References (51)

1. G. J. Foschini, "Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas," Bell Labs Tech. J., vol. 1, no. 2, pp. 41-59, 1996.
2. G. J. Foschini and M. J. Gans, "On limits of wireless communications in a fading environment when using multiple antennas," Wireless Pers. Commun., vol. 6, no. 3, pp. 311-335, Mar. 1998.
3. E. Telatar, "Capacity of multi-antenna Gaussian channels," Eur. Trans. Telecommun., vol. 10, no. 6, pp. 585-595, Nov./Dec. 1999.
4. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge, U.K.: Cambridge Univ. Press, 2005.
5. L. Zheng and D. N. C. Tse, "Diversity and multiplexing: A fundamental tradeoff in multiple-antenna channels," IEEE Trans. Inf. Theory, vol. 49, no. 5, pp. 1073-1096, May 2003.
6. S. Tavildar and P. Viswanath, "Approximately universal codes over slowfading channels," IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 3233-3258, Jul. 2006.
7. P. Elia, K. R. Kumar, S. A. Pawar, P. R. Kumar, and H.-F. Lu, "Explicit space-time codes achieving the diversity-multiplexing gain tradeoff," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3869-3884, Sep. 2006.
8. F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, "Perfect space-time block codes," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 3885-3902, Sep. 2006.
9. P. Elia, B. A. Sethuraman, and P. V. Kumar, "Perfect space-time codes for any number of antennas," IEEE Trans. Inf. Theory, vol. 53, no. 11, pp. 3853-3868, Nov. 2007.
10. H. Yao and G. W. Wornell, "Achieving the full MIMO diversitymultiplexing frontier with rotation-based space-time codes," in Proc. Allerton Conf. Commun., Control, Comput., 2003.
11. J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The golden code: A 2 ? 2 full-rate space-time code with nonvanishing determinants," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1432-1436, Apr. 2005.
12. J. Zhan, B. Nazer, U. Erez, and M. Gastpar, "Integer-forcing linear receivers," IEEE Trans. Inf. Theory, to be published.
13. S.-N. Hong and G. Caire, "Reverse compute and forward: A lowcomplexity architecture for downlink distributed antenna systems," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Cambridge, MA, USA, Jul. 2012, pp. 1147-1151.
14. S.-N. Hong and G. Caire, "Structured lattice codes for 2 ? 2 ? 2 MIMO interference channel," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 2229-2233.
15. V. Ntranos, V. R. Cadambe, B. Nazer, and G. Caire, "Integer-forcing interference alignment," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2013, pp. 574-578.
16. A. Sakzad, J. Harshan, and E. Viterbo, "Integer-forcing MIMO linear receivers based on lattice reduction," IEEE Trans. Wireless Commun., vol. 12, no. 10, pp. 4905-4915, Oct. 2013.
17. E. Domanovitz and U. Erez, "Combining space-time block modulation with integer forcing receivers," in Proc. 27th Conv. Elect. Electron. Eng. Israel (IEEEI), Nov. 2012, pp. 1-4.
18. M. Hussain and J. Levesley, "The metrical theory of simultaneously small linear forms," Funct. Approx. Commentarii Math., vol. 48, no. 2, pp. 167-181, 2013.
19. J. Jalden and P. Elia, "DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models," IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 4765-4780, Oct. 2010.
20. H. El Gamal, G. Caire, and M. O. Damen, "Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 968-985, Jun. 2004.
21. R. H. Etkin, D. N. C. Tse, and H. Wang, "Gaussian interference channel capacity to within one bit," IEEE Trans. Inf. Theory, vol. 54, no. 12, pp. 5534-5562, Dec. 2008.
22. S. Avestimehr, S. Diggavi, and D. Tse, "Wireless network information flow: A deterministic approach," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1872-1905, Apr. 2011.
23. A. Ozgur and S. N. Diggavi, "Approximately achieving Gaussian relay network capacity with lattice-based QMF codes," IEEE Trans. Inf. Theory, vol. 59, no. 12, pp. 8275-8294, Dec. 2013.
24. D. Tse, "It's easier to approximate," in Proc. Plenary Talk, IEEE Int. Symp. Inf. Theory (ISIT), Seoul, Korea, Jun. 2009.
25. T. Philosof, R. Zamir, U. Erez, and A. J. Khisti, "Lattice strategies for the dirty multiple access channel," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5006-5035, Aug. 2011.
26. G. Bresler, A. Parekh, and D. N. C. Tse, "The approximate capacity of the many-to-one and one-to-many Gaussian interference channels," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4566-4592, Sep. 2010.
27. B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6463-6486, Oct. 2011.
28. M. P. Wilson, K. Narayanan, H. D. Pfister, and A. Sprintson, "Joint physical layer coding and network coding for bidirectional relaying," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5641-5654, Nov. 2010.
29. W. Nam, S.-Y. Chung, and Y. H. Lee, "Capacity of the Gaussian twoway relay channel to within 1/2 bit," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5488-5494, Nov. 2010.
30. O. Ordentlich, U. Erez, and B. Nazer, "The approximate sum capacity of the symmetric Gaussian K-user interference channel," IEEE Trans. Inf. Theory, vol. 60, no. 6, pp. 3450-3482, Jun. 2014.
31. R. Zamir, Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory. Cambridge, U.K.: Cambridge Univ. Press, 2014.
32. 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, no. 10, pp. 2293-2314, Oct. 2004.
33. C. Feng, D. Silva, and F. R. Kschischang, "An algebraic approach to physical-layer network coding," IEEE Trans. Inf. Theory, vol. 59, no. 11, pp. 7576-7596, Nov. 2013.
34. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. New York, NY, USA: Springer-Verlag, 1988.
35. H.-A. Loeliger, "Averaging bounds for lattices and linear codes," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1767-1773, Nov. 1997.
36. U. Erez and S. ten Brink, "A close-to-capacity dirty paper coding scheme," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3417-3432, Oct. 2005.
37. O. Ordentlich, U. Erez, and B. Nazer, "Successive integer-forcing and its sum-rate optimality," in Proc. 51st Annu. Allerton Conf. Commun., Control, Comput., Oct. 2013, pp. 282-292.
38. J. Zhan, B. Nazer, O. Ordentlich, U. Erez, and M. Gastpar, "Integer-Forcing architectures for MIMO: Distributed implementation and SIC," in Proc. 44th Asilomar Conf. Signals, Syst. Comput., Nov. 2010, pp. 322-326.
39. O. Ordentlich, J. Zhan, U. Erez, B. Nazer, and M. Gastpar, "Practical code design for compute-and-forward," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), St. Petersburg, Russia, Jul./Aug. 2011, pp. 1876-1880.
40. O. Ordentlich and U. Erez, "A simple proof for the existence of 'good' pairs of nested lattices," in Proc. 27th Conv. Elect. Electron. Eng. Israel (IEEEI), Nov. 2012, pp. 1-12.
41. H. Yao and G. W. Wornell, "Lattice-reduction-aided detectors for MIMO communication systems," in Proc. IEEE GLOBECOM, Taipei, Taiwan, Nov. 2002, pp. 424-428.
42. C. Windpassinger and R. F. H. Fischer, "Low-complexity nearmaximum-likelihood detection and precoding for MIMO systems using lattice reduction," in Proc. IEEE Inf. Theory Workshop, Mar./Apr. 2003, pp. 345-348.
43. W. Banaszczyk, "New bounds in some transference theorems in the geometry of numbers," Math. Ann., vol. 296, no. 1, pp. 625-635, 1993.
44. J. W. S. Cassels, An Introduction to the Geometry of Numbers, vol. 99. New York, NY, USA: Springer-Verlag, 1997.
45. R. S. Kemble, "A Groshev theorem for small linear forms," Mathematika, vol. 52, nos. 1-2, pp. 79-85, 2005.
46. M. Hussain and S. Kristensen, "Metrical results on systems of small linear forms," Int. J. Number Theory, vol. 9, no. 3, pp. 769-782, 2013.
47. B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1804-1824, Jul. 2002.
48. J. C. Lagarias, H. W. Lenstra, Jr., and C. P. Schnorr, "Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice," Combinatorica, vol. 10, no. 4, pp. 333-348, Dec. 1990.
49. O. Fischler and U. Erez, "Performance of precoded integer-forcing for parallel Gaussian channels," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun./Jul. 2014, pp. 1732-1736.
50. E. Domanovitz and U. Erez, "Performance of precoded integer-forcing for closed-loop MIMO multicast," in Proc. Inf. Theory Workshop (ITW), pp. 283-287, Nov. 2014.
51. C. Köse and R. D. Wesel, "Universal space-time trellis codes," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2717-2727, Oct. 2003.