Sphere Decoding Complexity Exponent for Decoding Full Rate Codes Over the Quasi-Static MIMO Channel

In the setting of quasi-static Multiple-Input Multiple-Output (MIMO) channels, the authors consider the high Signal-to-Noise Ratio (SNR) asymptotic complexity required by the Sphere Decoding (SD) algorithm for decoding a large class of full rate linear space-time codes. With SD complexity having random fluctuations induced by the random channel, noise and codeword realizations, the introduced SD complexity exponent manages to concisely describe the computational reserves required by the SD algorithm to achieve arbitrarily close to optimal decoding performance. Bounds and exact expressions for the SD complexity exponent are obtained for the decoding of large families of codes with arbitrary performance characteristics.

Provided by: KTH - Royal Institute of Technology Topic: Mobility Date Added: Feb 2011 Format: PDF

Find By Topic