A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound
Tekijät: Toni Ernvall, Roope Vehkalahti
Julkaisuvuosi: 2012
Journal: IEEE International Symposium on Information Theory
Kokoomateoksen nimi: IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY
Tietokannassa oleva lehden nimi: 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)
Lehden akronyymi: IEEE INT SYMP INFO
Aloitussivu: 21
Lopetussivu: 25
ISBN: 978-1-4673-2579-0
Tiivistelmä
This paper provides a general construction method for multiple-input multiple-output multiple access channel codes (MIMO MAC codes) that have so called generalized full rank property. The achieved constructions give a positive answer to the question whether it is generally possible to reach the so called pigeon hole bound, that is an upper bound for the decay of determinants of MIMO-MAC channel codes.
This paper provides a general construction method for multiple-input multiple-output multiple access channel codes (MIMO MAC codes) that have so called generalized full rank property. The achieved constructions give a positive answer to the question whether it is generally possible to reach the so called pigeon hole bound, that is an upper bound for the decay of determinants of MIMO-MAC channel codes.
Turun yliopiston Tutkimustietojärjestelmän portaali