• DocumentCode
    1365501
  • Title

    Scale-Recursive Lattice-Based Multiple-Access Symbol Constellations

  • Author

    Fiore, Paul D.

  • Author_Institution
    Lincoln Lab., Massachusetts Inst. of Technol. (MIT), Lexington, MA, USA
  • Volume
    56
  • Issue
    1
  • fYear
    2010
  • Firstpage
    211
  • Lastpage
    223
  • Abstract
    This paper describes scale-recursive symbol constellations for the synchronous multiple-access (MA) channel, which can be seen as a generalization of Voronoi coding. The constellations are related by a fixed scaling and rotation, and are designed so that in the noise-free case, the combined signal always falls onto an appropriate lattice. This allows high throughput and a linear complexity decoding algorithm. Novel constellations of up to 24 dimensions are given that show improved performance over conventional rectangular lattices.
  • Keywords
    communication complexity; matrix algebra; multi-access systems; Voronoi coding; linear complexity decoding algorithm; scale-recursive lattice-based multiple-access symbol constellations; synchronous multiple-access channel; AWGN; Additive white noise; Constellation diagram; Gaussian noise; Lattices; Maximum likelihood decoding; Multidimensional signal processing; Quadrature amplitude modulation; Signal design; Throughput; Automorphism group; coset; lattice; linear complexity decoder; multiple access channel; multiple user constellation; partition chain;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2009.2034890
  • Filename
    5361474