Please use this identifier to cite or link to this item:
|Title:||Iterated fast decodable space-time codes from crossed-products||Authors:||Markin, Nadya
|Keywords:||DRNTU::Science::Mathematics||Issue Date:||2012||Source:||Markin, N., & Oggier, F. (2012). Iterated fast decodable space-time codes from crossed-products. 20th International Symposium on Mathematical Theory of Networks and Systems Proceedings.||Abstract:||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.||URI:||https://hdl.handle.net/10356/79790
|Rights:||© 2012 20th International Symposium on Mathematical Theory of Networks and Systems.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.