LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Mortazawi Molu, Mehdi; Cumanan, Kanapathippillai; Bashar, Manijeh; Burr, Alister Graham (2017)
Languages: English
Types: Article
Subjects:
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups. Springer, third ed., 1999.
    • [2] Y. Huang and K. R. Narayanan, “Construction πa and πd lattices: Construction, goodness, and decoding algorithms,” CoRR, vol. abs/1506.08269, 2015.
    • [3] A. Sakzad, M. Sadeghi, and D. Panario, “Turbo lattices: Construction and error decoding performance,” arXiv:1108.1873, 2012.
    • [4] A. Sakzad, M.-R. Sadeghi, and D. Panario, “Construction of turbo lattices,” in 48th Annual Allerton Conference on Communication, Control, and Computing, pp. 14-21, Sept 2010.
    • [5] E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, “Closest point search in lattices,” IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2201-2214, 2002.
    • [6] A. Ghasemmehdi and E. Agrell, “Faster recursions in sphere decoding,” IEEE Transactions on Information Theory, vol. 57, no. 6, pp. 3530- 3536, 2011.
    • [7] E. Viterbo and E. Biglieri, “Computing the voronoi cell of a lattice: the diamond-cutting algorithm,” IEEE Transactions on Information Theory, vol. 42, pp. 161-171, Jan 1996.
    • [8] M. Eslami and W. A. Krzymien, “Spc05-2: Turbo coded mc-cdm communications with spatial multiplexing,” in IEEE Globecom 2006, pp. 1-5, IEEE, 2006.
    • [9] O. Shalvi, N. Sommer, and M. Feder, “Signal codes: Convolutional lattice codes,” IEEE Transactions on Information Theory, vol. 57, pp. 5203-5226, Aug 2011.
    • [10] M. M. Molu, “Reduced complexity BCJR algorithms for Faster Than Nyquist (FTN) signalling,” M.Sc. Thesis, Lund University, 2009.
    • [11] M. M. Molu and A. Burr, “Constructing convolutional lattices and its application in compute and forward,” in 2015 IEEE International Conference on Communication Workshop (ICCW), pp. 2187-2193, June 2015.
    • [12] G. Forney, M. Trott, and S.-Y. Chung, “Sphere-bound-achieving coset codes and multilevel coset codes,” IEEE Transactions on Information Theory, vol. 46, pp. 820-850, May 2000.
    • [13] U. Erez and R. Zamir, “Achieving 12 log (1+SNR) on the AWGN channel with lattice encoding and decoding,” IEEE Transactions on Information Theory, vol. 50, pp. 2293-2314, Oct 2004.
    • [14] G. Poltyrev, “On coding without restrictions for the AWGN channel,” IEEE Transactions on Information Theory, vol. 40, pp. 409-417, Mar 1994.
    • [15] G. W. W. Charles H. Swannack, Uri Erez, “Geometric relationships between gaussian and modulo-lattice error exponents,” in arXiv:1308.1609.
    • [16] T. Liu, P. Moulin, and R. Koetter, “On error exponents of modulo lattice additive noise channels,” IEEE Transactions on Information Theory, vol. 52, pp. 454-471, Feb 2006.
    • [17] M. Molu and N. Goertz, “Optimal precoding in the relay and the optimality of largest eigenmode relaying with statistical channel state information,” IEEE Transactions on Wireless Communications, vol. 13, pp. 2113-2123, April 2014.
    • [18] M. M. Molu, K. Cumanan, and A. Burr, “Low-complexity computeand-forward techniques for multisource multirelay networks,” IEEE Communications Letters, vol. 20, pp. 926-929, May 2016.
    • [19] B. Nazer and M. Gastpar, “Compute-and-Forward: Harnessing interference through structured codes,” IEEE Transactions on Information Theory, vol. 57, pp. 6463-6486, Oct. 2011.
    • [20] B. Hassibi and H. Vikalo, “On the sphere-decoding algorithm i. expected complexity,” IEEE Transactions on Signal Processing, vol. 53, pp. 2806- 2818, Aug 2005.
    • [21] H. Vikalo and B. Hassibi, “On the sphere-decoding algorithm ii. generalizations, second-order statistics, and applications to communications,” IEEE Transactions on Signal Processing, vol. 53, pp. 2819-2834, Aug 2005.
    • [22] J. Forney, G.D., “A bounded-distance decoding algorithm for the Leech lattice, with generalizations,” IEEE Transactions on Information Theory, vol. 35, pp. 906-909, Jul 1989.
    • [23] M.-R. Sadeghi, A. Banihashemi, and D. Panario, “Low-density paritycheck lattices: Construction and decoding analysis,” IEEE Transactions on Information Theory, vol. 52, pp. 4481-4495, Oct 2006.
    • [24] N. Sommer, M. Feder, and O. Shalvi, “Low-density lattice codes,” IEEE Transactions on Information Theory, vol. 54, pp. 1561-1585, April 2008.
    • [25] R. H. Morelos-Zaragoza and H. Imai, “Binary multilevel convolutional codes with unequal error protection capabilities,” IEEE Transactions on Communications, vol. 46, no. 7, pp. 850-853, 1998.
    • [26] J. Harshan, E. Viterbo, and J.-C. Belfiore, “Construction of Barnes-Wall lattices from linear codes over rings,” in IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 3110-3114, July 2012.
    • [27] J. Harshan, E. Viterbo, and J.-C. Belfiore, “Practical encoders and decoders for euclidean codes from Barnes-Wall lattices,” IEEE Transactions on Communications, vol. 61, pp. 4417-4427, November 2013.
    • [28] Y. Yan, C. Ling, and X. Wu, “Polar lattices: Where Arikan meets Forney,” in IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1292-1296, July 2013.
    • [29] W. Kositwattanarerk and F. Oggier, “Connections between Construction D and related constructions of lattices,” arXiv:1308.6175, 2014.
  • No related research data.
  • No similar publications.

Share - Bookmark

Funded by projects

  • EC | DIWINE

Cite this article