Iterated fast decodable space-time codes from crossed-products

• Main Authors: Markin, Nadya, Oggier, Frederique
• Other Authors: School of Physical and Mathematical Sciences
• Format: Conference or Workshop Item
• Language: English
• Published: 2012
• Subjects: DRNTU::Science::Mathematics
• Online Access: https://hdl.handle.net/10356/79790; http://hdl.handle.net/10220/8863; http://www.mtns2012.conference.net.au/cgi-bin/readcsvplus.pl?config=mtns.pl&Presentation=%3DExtended&sort_a=Author1&template=2&pmatches=30&page=2
• Institution: Nanyang Technological University

We consider the following coding problem arising in wireless communication. Suppose we have transmission over a coherent Rayleigh fading channel with 8 Tx antennas, 2 Rx antennas and perfect channel state information at the receiver: Y = H2 8X8 8 + V2 8; where H2 8 is the channel matrix, V2 8 is the noise at the receiver, and both matrices have complex Gaussian independently distributed coe cients with zero mean. The matrix X8 8 = g1B1 + + grBr is a codeword from a space-time codebook C, defined by the generating matrices B1; : : : ;Br, also called Z-basis of the code. The information symbols g1; : : : ; gr are assumed to be scaled integers (PAM symbols) in some set S. We consider full-rate codes, that is the case r = 32.