Searching Optimal Symbol Mapping for Multi-D BICM-ID Systems Using SA Algorithm
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.
symbol mapping Multi-D BICM-ID systems QAP SA low computational complexity
Liang Zhengfa Liu Hengzhu
School of Computer, National University of Defense Technology, Changsha,410073, China
国内会议
西宁
英文
315-319
2013-07-20（万方平台首次上网日期，不代表论文的发表时间）