A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Perfect space-time block codes (STBCs) were first introduced by Oggier et al. to have full rate, full diversity and non-vanishing determinant. A maximum likelihood decoder based on the sphere decoder has been used for efficient decoding of perfect STBCs. However the worst-case complexity for the sphere decoder is an exhaustive search. In this paper we present a reduced complexity algorithm for 3 × 3 perfect STBC which gives essentially maximum likelihood (ML) performance and which can bedoi:10.1109/icassp.2009.4960186 dblp:conf/icassp/HowardSC09 fatcat:avhx42uvvzg7pj3tix3uhocw3m