Two Low-Complexity Decoding Algorithms for Unitary Space-Time Codes(WSANE2006)

概要

論文の詳細を見る
Two reduced complexity decoding algorithms for unitary space-time codes (USTC) based on tree-structured constellation are presented. The original unitary space-time constellation is divided into several groups. Each one is treated as the leaf nodes set of a sub tree. Choosing the unitary signals that represent each group as the roots of these sub trees generates a tree-structured constellation. The proposed tree search decoder decided to which sub tree the receive signal belongs by searching in the set of sub tree roots. The final decision is made after a local search in the leaf nodes set of the selected sub tree. The adjacent sub tree joint decoder performs joint search in the selected sub tree and its "surrounding" sub trees, which improves the BER performance of purely tree search method. The exhaustive search in the whole constellation is avoided in our proposed decoding algorithms, a lower complexity is obtained compared to that of maximum likelihood (ML) decoding. Simulation results have also been provided to demonstrate the feasibility of these new methods.
社団法人電子情報通信学会の論文
2006-04-03