• DocumentCode
    3310325
  • Title

    Reduced complexity space-time coding in single-frequency networks

  • Author

    Pölönen, Keijo ; Koivunen, Visa

  • Author_Institution
    Sch. of Electr. Eng., Dept. of Signal Process. & Acoust., Aalto Univ., Aalto, Finland
  • fYear
    2011
  • fDate
    28-31 March 2011
  • Firstpage
    1523
  • Lastpage
    1528
  • Abstract
    Mobile broadcasting MIMO systems differ in several essential ways from conventional MIMO applications, especially when they are operating in single-frequency networks. There are certain channel features, like the imbalance of received average powers, which should be taken into account in system design. In this paper, space-time coding that allows reduced complexity maximum likelihood decoding of the received signal in a single-frequency network is introduced. A novel optimization criterion for fast-decodable 4×2 structures is proposed and the performance in single-frequency networks is studied in different scenarios through simulations. It is noticed that the reduced complexity codes suffer only a fraction of a decibel performance loss compared to an earlier proposed alternative for digital video broadcasting while achieving significant savings in computational complexity when maximum likelihood decoding is applied.
  • Keywords
    MIMO communication; channel coding; digital video broadcasting; maximum likelihood decoding; optimisation; space-time block codes; MIMO systems; computational complexity; digital video broadcasting; maximum likelihood decoding; mobile broadcasting; optimization; single-frequency networks; space-time coding; Complexity theory; Encoding; MIMO; Matrix decomposition; Maximum likelihood decoding; Optimization; Transmitters; MIMO; digital video broadcasting; single-frequency networks; space-time coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference (WCNC), 2011 IEEE
  • Conference_Location
    Cancun, Quintana Roo
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-61284-255-4
  • Type

    conf

  • DOI
    10.1109/WCNC.2011.5779356
  • Filename
    5779356