DocumentCode
1836126
Title
Low-complexity, information-lossless STBCs for two-user MISO-MAC with partial CSIT
Author
Harshan, J. ; Rajan, B. Sundar
Author_Institution
Dept. of ECE, Indian Inst. of Sci., Bangalore, India
fYear
2010
fDate
29-31 Jan. 2010
Firstpage
1
Lastpage
5
Abstract
In this paper, Space-Time Block Codes (STBCs) with low Maximum-Likelihood (ML) decoding complexity and information-losslessness property are proposed for a two-user Multiple-Input Single-Output, frequency-flat fading multiple access channel. In particular, two distinct classes of STBC pairs which are derived from the well known class of real orthogonal designs are proposed. The first class of code pairs which are derived from a class of complex designs called separable orthogonal designs are shown to be (i) information-lossless for arbitrary values of Nt (where Nt denotes the number of transmit antennas of each user) and (ii) have reduced ML decoding complexity whereas the second class of code pairs are shown to be (i) information-lossless only for large values of Nt and (ii) are single-symbol ML decodable.
Keywords
block codes; fading channels; maximum likelihood decoding; multi-access systems; space-time codes; transmitting antennas; CSIT; MISO-MAC; code pairs; frequency-flat fading multiple access channel; information-lossless STBC; information-losslessness property; maximum-likelihood decoding complexity; multiple-input single-output; reduced ML decoding complexity; separable orthogonal designs; single-symbol ML decodable; space-time block codes; transmit antennas; Amplitude modulation; Block codes; Channel state information; Fading; Frequency; MIMO; Maximum likelihood decoding; Pulse modulation; Symmetric matrices; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (NCC), 2010 National Conference on
Conference_Location
Chennai
Print_ISBN
978-1-4244-6383-1
Type
conf
DOI
10.1109/NCC.2010.5430212
Filename
5430212
Link To Document