CAJ | 학술논문

该文从群论的角度分析了比特交织编码调制(迭代译码)(BICM(-ID))系统中标识映射的对称性。首先给出了标识映射对称性的定义，并指出，二进制标识映射的对称性是 BICM(-ID)系统的固有特性，该对称性同构于 m阶超立方的对称群。然后基于 BICM(-ID)的对称性，提出一种改进的二进制交换算法(IBSA)。该算法的搜索空间为标识映射对称群陪集的代表系。因此，与传统的二进制算法相比，IBSA的搜索效率得到了提高。最后，2维16阶星座图的仿真结果表明，在40000次的运行过程中，IBSA能提高4%的搜索效率；32阶相移键控星座图的仿真结果表明，该算法至少可提高3.5%的搜索效率，单个映射的计算时间缩短了约4000倍。
해문종군론적각도분석료비특교직편마조제(질대역마)(BICM(-ID))계통중표식영사적대칭성。수선급출료표식영사대칭성적정의，병지출，이진제표식영사적대칭성시 BICM(-ID)계통적고유특성，해대칭성동구우 m계초립방적대칭군。연후기우 BICM(-ID)적대칭성，제출일충개진적이진제교환산법(IBSA)。해산법적수색공간위표식영사대칭군배집적대표계。인차，여전통적이진제산법상비，IBSA적수색효솔득도료제고。최후，2유16계성좌도적방진결과표명，재40000차적운행과정중，IBSA능제고4%적수색효솔；32계상이건공성좌도적방진결과표명，해산법지소가제고3.5%적수색효솔，단개영사적계산시간축단료약4000배。
Based on the group theory, the symmetries of mappings of Bit-Interleaved Coded Modulation (or with Iterative Decoding) systems (BICM(-ID)) are studied. Firstly, the definitions of the symmetries of mappings for BICM (-ID) are given. The symmetries of binary labels of a mapping are the intrinsic properties of BICM(-ID), which are isomorphic to the symmetry group of a hypercube of order m. According to the symmetries of BICM (-ID), an Improved Binary Switch Algorithm (IBSA) is proposed. The search space of IBSA is a transversal of the symmetry group of mappings. Consequently, the efficiency of IBSA is improved compared to the traditional BSA. Finally, Simulation results of a 16-ary two dimensional constellation show that the search efficiency of IBSA can be improved about 4%during 40000 trials. For 32-PSK, the results show that the search efficiency can be improved at least 3.5%and the time required to calculate a single mapping is shorten about 4000 times.