A major challenge in the area of the space time codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing space time code designs which require maximum-likelihood (NIL) decod...
详细信息
ISBN:
(纸本)0780389662
A major challenge in the area of the space time codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing space time code designs which require maximum-likelihood (NIL) decoding. A solution could be to apply Single-Input Single-Output (SISO) channel codes and theory over temporal channel fading to the Multi-Input Single-Output (MISO) code construction and classical suboptimum decoding methods. For these purposes, a space time code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal space time Hadamard (D-STH) code [11 [21 with Paley constructions and the outer code is an algebraic block code, such as a Reed-Solomon (RS) code. Our perspective is different than most existing concatenation type schemes, which destroy the inter-dependence of the outer channel code and the inner space time code by using an interleaver. As decoding method, we investigate boundedminimumdistance (BMD) with erasure decoding algorithm. A simple method to achieve the optimum threshold for deciding on an erased symbol will be derived. Using that, the proposed concatenated scheme is able to exploit almost all of the spatial diversity of the system.
暂无评论