Space-Time Code Constructions and Analysis
Zusammenfassung der Projektergebnisse
Multiple antenna systems are today the standard approach in wireless communications. Several answers have been devised for the question which signal to transmit over the individual antennas. One of these is the concept of space time coding, where coding theory is combined with signal theory. The main focus of this project was to analyze code constructions that can be used as space time codes (STC). The code constructions are based on known code classes. The investigated code classes can be split into two groups: algebraic codes and convolutional codes. Also code constructions based on generalized concatenations were considered and design rules derived. In this case the codeword size of the space time codes is not limited, because the generalized concatenation is a method which allows to construct long codes by concatenation of short codes. While in the first part of the project three algebraic code classes were proposed and some parallel concatenated convolutional codes were analyzed, in the second part of the project space time code constructions based on serially concatenated convolutional codes were studied. Also special variants of serially concatenated convolutional codes, namely Woven convolutional and product convolutional codes were used to construct full diversity space time codes. A combination of continuous phase modulation (CPM) with space time coding led to good performances. Hereby CPM is considered as a convolutional code and with this several possibilities of concatenation were analyzed. All theoretical analyses were done for an arbitrary number of transmit antennas and different overall code rates. The results improve existing constructions from the literature and/or are theoretically interesting because the diversity can be determined analytically. The results have been published in one journal and 7 conference papers. It is not planned to continue the project on space time codes. Meanwhile the results from space time codes led to extended concepts, namely broadcast transmission and multiple access which are presently in the focus of research for multiple antenna systems.
Projektbezogene Publikationen (Auswahl)
-
C. Medina and M. Gabrowska. Space time product convolutional codes with full antenna diversity. In Proc. IEEE 2006 International Zürich Seminar on Communications, Zürich, Swiss, February 2006.
-
Gerd Richter and Simon Plass. Error and erasure decoding of rank codes with a modified Berlekamp-Massey algorithm. In Proc. 5th International ITG Conference on Source and Channel Coding, Erlangen, Germany, January 2004.
-
Gerd Richter and Simon Plass. Fast decoding of rank codes with rank errors and column erasures. In Proc. IEEE International Symposium on Information Theory, Chicago, USA, July 2004.
-
M. Bossert M. Gabrowska and S. Shavgulidze. On multiple space time convolutional codes (MSTCC) with CPM. In Proc. of the 9th International Symposium on Communication Theory and Applications, Ambleside, UK, 2007.
-
M. Bossert M. Gabrowska and S. Shavgulidze. On space time coded CPM schemes. In Proc. International Workshop on Algebraic and Convolutional Coding, Kranevo, Bulgaria, June 2004.
-
M. Bossert M. Gabrowska and S. Shavgulidze. Some simulation results for space time woven convolutional codes with two-level UEP. In Proc. of the 8th International Symposium on Communication Theory and Applications, Ambleside, UK, 2005.
-
M. Bossert, E. Gabidulin, and P. Lusina. Maximum rank distance codes as space time codes. In IEEE Trans, on Inf. Theory, pages 2757-2760,49, 2003.
-
M. Bossert, E. Gabidulin, and P. Lusina. Space-time codes based on Gaussian integers. In Proc. IEEE International Symposium on Information Theory, Lausann, Switzerland, July 2002.
-
M. Gabrowska and M. Bossert. On generalized space time convolutional codes. In Proc. 4th International Workshop on Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 2005.
-
M. Gabrowska and M. Bossert. On multiple space time convolutional codes with CPM, In Proc. 4th International Workshop on Optimal Codes and Related Topics, Pamporovo, Bulgaria, June 2005.
-
M. Gabrowska, S. Shavgulidze, and Egon Schulz. Space time partially concatenated convolutional codes with full antenna diversity. In Proa International Simposium on Turbo Codes, pages 287-290, Brest, France, September 2003.
-
M. Gabrowska, S. Shavgulidze, M. Bossert, and M. Weckerle. On space time concatenated convolutional codes. In Proc. ITG Workshop On Smart Antennas, Munich, Germany, March 2004.
-
M. Gabrowska, S. Shavgulidze, M. Bossert, and M. Weckerle. Space time turbo and woven turbo codes with full antenna diversity. In Proc. Seventh International Symposium on Communication Theory and Applications, pages 170-174, Ambelside, UK, July 2003.
-
M. Gabrowska. On EXIT charts of space time convolutional codes. In Proc. 5th International Workshop on Optimal Codes and Related Topics, White Lagoon, Bulgaria, June 2007.
-
Maria Gabrowska. On Space Time Concatenated Codes. Dissertation, Universität Ulm, 2007.
-
P. Lusina, D. Giustiniano, and M. Bossert. Diagonal space time Hadamard codes. In Proc. Seventh International Symposium on Communication Theory and Applications - ISCSTA'Ol, Ambelside,UK, July 2003.
-
P. Lusina, S- Shavguidze, and M. Bossert. Space-time block code construction based on cyclotomic coset factorization. In Proc. IEEE International Symposium on Information Theory, Lausann, Switzerland, July 2002.
-
P. Lusina, S. Shavguidze, and M. Bossert. Space-time code construction using the code factorization technique. In International Journal of Electronics and Communications, 2003.
-
P. Lusina, S. Shavgulidze, and M. Bossert. Space-time block factorization codes over gaussian integers. InAEÜ, 2004.
-
Paul James Lusina. Algebraic Designs of Space Time Codes. Dissertation, Universität Ulm, 2003.
