On convolutional lattice codes and lattice decoding using Trellis structure

Article English OPEN
Mortazawi Molu, Mehdi ; Cumanan, Kanapathippillai ; Bashar, Manijeh ; Burr, Alister Graham (2017)
  • References (29)
    29 references, page 1 of 3

    [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.

  • Metrics
    No metrics available
Share - Bookmark