Computer Science – Information Theory
Scientific paper
2011-02-07
Computer Science
Information Theory
19 Pages, 4 figures. Submitted to the IEEE Transactions on Information Theory
Scientific paper
In the setting of quasi-static multiple-input multiple-output (MIMO) channels, we 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. For the particular example of decoding the recently introduced threaded cyclic division algebra (CDA) based codes -- the only currently known explicit designs that are uniformly optimal with respect to the diversity multiplexing tradeoff (DMT) -- the SD complexity exponent is shown to take a particularly concise form as a non-monotonic function of the multiplexing gain. To date, the SD complexity exponent also describes the minimum known complexity of any decoder that can provably achieve a gap to maximum likelihood (ML) performance which vanishes in the high SNR limit.
Elia Petros
Jalden Joakim
No associations
LandOfFree
Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sphere decoding complexity exponent for decoding full rate codes over the quasi-static MIMO channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-681010