Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Code Controlled Sphere Decodin...

Code Controlled Sphere Decoding of Four Efficient MISO Lattices

Camilla Hollanti, Code Controlled Sphere Decoding of Four Efficient MISO Lattices. In: Proceedings of the 2006 IEEE International Symposium on Information Theory and its Applications (ISITA 2006), Oct. 29 - Nov. 1, Seoul, South Korea, 599-603, IEEE, 2006.

Abstract:

Previously we have constructed some geometrically dense, full-rank, rate-one matrix lattices with large non-vanishing minimum determinants for 4 transmit antenna MISO applications. In this paper, we will consider the decoding of these lattices. The main concern is not in improving existing algorithms, but in finding a way to decode our lattices that are not as simple in structure, at least not at the first glance, as the majority of previously known ST lattices. We show that the decoding can be efficiently performed by using a modified version of a certain sphere decoding algorithm. We call this method "Code Controlled Sphere Decoding" (CCSD).
Our lattice constructions are based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions. Simulations in a quasi-static Rayleigh fading channel have shown that our dense quaternionic constructions outperform the earlier rectangular lattices as well as the DAST-lattice.

Files:

Abstract in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpHollanti06a,
  title = {Code Controlled Sphere Decoding of Four Efficient MISO Lattices},
  booktitle = {Proceedings of the 2006 IEEE International Symposium on Information Theory and its Applications (ISITA 2006), Oct. 29 - Nov. 1, Seoul, South Korea},
  author = {Hollanti, Camilla},
  publisher = {IEEE},
  pages = {599-603},
  year = {2006},
  keywords = {Lattices, MIMO, space-time block codes (STBCs), sphere decoding},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication