论文部分内容阅读
Symbol mapping is the crucial parameter to achieve high coding gain over the iterations in BICM-ID systems.The problem of finding the optimal symbol mapping can be formulated as an instance of the combinatorial optimization problem known as the quadratic assignment problem (QAP), which is of Non-Deterministic Polynomial (NP) complexity.When multi-dimension (multi-D) modulation is used, the computational complexity rapidly increases.In this paper, we investigate Simulated Annealing (SA) algorithm to solve the problem, which can efficiently find the optimal symbol mapping with low computational complexity.In addition, the SA algorithm can be used for any modulation schemes, and this is another remarkable advantage of SA algorithm.