Linear space-time codes.
Published: 2005
Language: eng
Number of pages: 127
Description: This thesis is concerned with the design, decoding, and analysis of space-time codes. We design high-rate, high-performance linear space-time codes that can be encoded and decoded by algorithms with reasonable complexity. We use algebraic number theoretic results to ensure that the proposed codes are full-diverse. It is shown that the proposed codes have very good performance. These codes, as any other linear space-time codes, can be decoded through the sphere decoding algorithm. To reduce the complexity of the sphere decoding algorithm, we propose a new modulation scheme for linear space-time codes that is based on using constellations of different sizes for different symbols. It is shown that the proposed method reduces the complexity of the sphere decoding algorithm. Typically, a complexity reduction of one to two order of magnitude can be achieved at the expense of about 2--3 dB coding gain. We also investigate the use of modulo lattice transmission scheme in the design of capacity-effective linear space-time codes. We pose the problem in the context of communication over a Gaussian vector channel. Then we transform this channel to a modulo lattice channel via a lattice based transmission scheme. We show that this transformation is capacity-lossless if and only if the transmitter uses good-for-covering lattices and the linear minimum mean square error estimation is used at the receiver prior to the decoding.
Notes: Source: Dissertation Abstracts International, Volume: 66-10, Section: B, page: 5597.

Thesis (Ph.D.)--University of Toronto, 2005.

Electronic version licensed for access by U. of T. users.