Minimizing the complexity of fast sphere decoding of STBCs

Jithamithra, G. R. ; Sundar Rajan, B. (2013) Minimizing the complexity of fast sphere decoding of STBCs IEEE Transactions on Wireless Communications, 12 (12). pp. 6142-6153. ISSN 1536-1276

Full text not available from this repository.

Official URL:

Related URL:


Decoding of linear space-time block codes (STBCs) with sphere-decoding (SD) is well known. A fast-version of the SD known as fast sphere decoding (FSD) was introduced by Biglieri, Hong and Viterbo. Viewing a linear STBC as a vector space spanned by its defining weight matrices over the real number field, we define a quadratic form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the FSD complexity of a linear STBC. It is shown that the FSD complexity is only a function of the weight matrices defining the code and their ordering, and not of the channel realization (even though the equivalent channel when SD is used depends on the channel realization) or the number of receive antennas. It is also shown that the FSD complexity is completely captured into a single matrix obtained from the HRQF. Moreover, for a given set of weight matrices, an algorithm to obtain an optimal ordering of them leading to the least FSD complexity is presented. The well known classes of low FSD complexity codes (multi-group decodable codes, fast decodable codes and fast group decodable codes) are presented in the framework of HRQF.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronics Engineers.
Keywords:Sphere Decoder; Decoding Complexity; Fast Sphere Decoding; Hurwitz-Radon Quadratic Form (HRQF); space-Time Block Codes(STBC)
ID Code:106896
Deposited On:08 Dec 2017 10:07
Last Modified:08 Dec 2017 10:07

Repository Staff Only: item control page