Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel

Thumbnail Image
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Author
Date
2016-03-01
Department
Department of Mathematics and Systems Analysis
Algebra and Discrete Mathematics
Nanyang Technological University
Major/Subject
Mcode
Degree programme
Language
en
Pages
14
1754-1767
Series
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, Volume 15, issue 3
Abstract
In this article, the first general constructions of fast-decodable, more specifically (conditionally) g-group decodable, space-time block codes for the nonorthogonal amplify and forward (NAF) multiple-input multiple-output (MIMO) relay channel under the half-duplex constraint are proposed. In this scenario, the source and the intermediate relays used for data amplification are allowed to employ multiple antennas for data transmission and reception. The worst-case decoding complexity of the obtained codes is reduced by up to 75%. In addition to being fast-decodable, the proposed codes achieve full-diversity and have nonvanishing determinants, which has been shown to be useful for achieving the optimal diversity-multiplexing tradeoff (DMT) of the NAF channel. Furthermore, it is shown that the same techniques as in the cooperative scenario can be utilized to achieve fast-decodability for K-user MIMO multiple-access channel (MAC) space-time block codes. The resulting codes in addition exhibit the conditional nonvanishing determinant property which, for its part, has been shown to be useful for achieving the optimal MAC-DMT.
Description
Keywords
Central simple algebras, distributed space-time block codes, fading channels, fast-decodability, lattices, multiple-access channel (MAC), multiple-input multiple-output (MIMO), relay channel, BLOCK-CODES, DIVISION-ALGEBRAS, FULL-DIVERSITY, CONSTRUCTIONS, COMPLEXITY, NETWORKS, DESIGN, STBCS
DOI
10.1109/TWC.2015.2496254
Citation
Barreal , A , Hollanti , C & Markin , N 2016 , ' Fast-Decodable Space-Time Codes for the N-Relay and Multiple-Access MIMO Channel ' , IEEE Transactions on Wireless Communications , vol. 15 , no. 3 , 7313045 , pp. 1754-1767 . https://doi.org/10.1109/TWC.2015.2496254
Permanent link to this item
https://urn.fi/URN:NBN:fi:aalto-201705315137
Collections
[article-cris] Perustieteiden korkeakoulu / SCI