In this paper, a new method to approximate the compensation term in the Jacobian logarithm used by the MAP decoder is proposed. Using the proposed approximation, the complex functions In（.） and exp（.） in the Exact...In this paper, a new method to approximate the compensation term in the Jacobian logarithm used by the MAP decoder is proposed. Using the proposed approximation, the complex functions In（.） and exp（.） in the Exact-log-MAP algorithm can be estimated with high accuracy and lower computational complexity. The efficacy of the proposed approximation is investigated and demonstrated by applying it to iteratively decoded BICM （Bit Interleaved Coded Modulation）.展开更多
Let T（q, D） be a self-similar （fractal） set generated by {fi（x） = 1/q（（x ＋ di）}^Ni=1 where integer q 〉 1and D = {d1, d2 dN} C R. To show the Lipschitz equivalence of T（q, D） and a dust-iik-e T（q, C）, on...Let T（q, D） be a self-similar （fractal） set generated by {fi（x） = 1/q（（x ＋ di）}^Ni=1 where integer q 〉 1and D = {d1, d2 dN} C R. To show the Lipschitz equivalence of T（q, D） and a dust-iik-e T（q, C）, one general restriction is 79 C Q by Peres et al. [Israel] Math, 2000, 117： 353-379]. In this paper, we obtain several sufficient criterions for the Lipschitz equivalence of two self-similar sets by using dust-like graph-directed iterating function systems and combinatorial techniques. Several examples are given to illustrate our theory.展开更多
文摘In this paper, a new method to approximate the compensation term in the Jacobian logarithm used by the MAP decoder is proposed. Using the proposed approximation, the complex functions In（.） and exp（.） in the Exact-log-MAP algorithm can be estimated with high accuracy and lower computational complexity. The efficacy of the proposed approximation is investigated and demonstrated by applying it to iteratively decoded BICM （Bit Interleaved Coded Modulation）.
基金supported by National Natural Science Foundation of China (Grant No.10871180)
文摘Let T（q, D） be a self-similar （fractal） set generated by {fi（x） = 1/q（（x ＋ di）}^Ni=1 where integer q 〉 1and D = {d1, d2 dN} C R. To show the Lipschitz equivalence of T（q, D） and a dust-iik-e T（q, C）, one general restriction is 79 C Q by Peres et al. [Israel] Math, 2000, 117： 353-379]. In this paper, we obtain several sufficient criterions for the Lipschitz equivalence of two self-similar sets by using dust-like graph-directed iterating function systems and combinatorial techniques. Several examples are given to illustrate our theory.
