• DocumentCode
    2989226
  • Title

    An algebraic tool for obtaining conditional non-vanishing determinants

  • Author

    Hollanti, Camilla ; Vehkalahti, R. ; Vehkalahti, Roope

  • Author_Institution
    Dept. of Math., Univ. of Turku, Turku, Finland
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    1388
  • Lastpage
    1392
  • Abstract
    An algebraic tool from the theory of central simple algebras is proposed to obtain families of complex matrices satisfying the conditional non-vanishing determinant (CNVD) property. Such property is of great use in e.g. the design of multiuser space-time (ST) codes, in which context it is not always crucial for the transmission matrix to be invertible. On the other hand, whenever it is invertible, it is important that it has a non-vanishing determinant. Also any submatrix of any subset of users multiplied with its transpose conjugate should preferably have a non-vanishing determinant, provided it is non-zero. In recent submissions by Lu et al. it has been shown that, with suitable multiplexing, such property yields a construction of space-time codes that achieve the optimal diversity-multiplexing tradeoff (DMT) of the multiple-input multiple-output (MIMO) multiple access channel (MAC) and outperform the previously known ST codes.
  • Keywords
    MIMO communication; determinants; matrix algebra; multi-access systems; space-time codes; telecommunication channels; MAC; MIMO multiple access channel; ST code; algebraic tool; central simple algebra; complex matrices; conditional nonvanishing determinant; diversity-multiplexing tradeoff; multiple-input multiple-output channel; multiuser space-time code; submatrix; transpose conjugate; Algebra; Lattices; MIMO; Machinery; Mathematics; OFDM modulation; Receiving antennas; Space time codes; Transmitting antennas;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5205904
  • Filename
    5205904