在不改变译码性能的条件下,为了加快最大后验概率(Maximum A Posteriori Probability,MAP)译码器状态信息更新的速度和降低算法的复杂度,提出了一种用于Turbo码的MAP译码器的免归一化处理算法。算法采用二进制补码加法器和减法器将MAP...在不改变译码性能的条件下,为了加快最大后验概率(Maximum A Posteriori Probability,MAP)译码器状态信息更新的速度和降低算法的复杂度,提出了一种用于Turbo码的MAP译码器的免归一化处理算法。算法采用二进制补码加法器和减法器将MAP译码过程中的状态信息投影到一个归一化圆上,当状态信息更新时所有的状态信息在归一化圆上移动,通过保持归一化圆上状态信息的正确关系来计算似然比。归一化过程中不用搜索或估计状态信息的最大值,通过简化状态信息归一化过程加速了MAP译码器的状态信息更新并降低了复杂度。所提算法在与传统算法译码性能相同的情况下,可以降低36.2%的计算复杂度和17.4%的关键路径延迟,达到MAP译码器实现中的高速、低复杂度目标。展开更多
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）.展开更多
文摘在不改变译码性能的条件下,为了加快最大后验概率(Maximum A Posteriori Probability,MAP)译码器状态信息更新的速度和降低算法的复杂度,提出了一种用于Turbo码的MAP译码器的免归一化处理算法。算法采用二进制补码加法器和减法器将MAP译码过程中的状态信息投影到一个归一化圆上,当状态信息更新时所有的状态信息在归一化圆上移动,通过保持归一化圆上状态信息的正确关系来计算似然比。归一化过程中不用搜索或估计状态信息的最大值,通过简化状态信息归一化过程加速了MAP译码器的状态信息更新并降低了复杂度。所提算法在与传统算法译码性能相同的情况下,可以降低36.2%的计算复杂度和17.4%的关键路径延迟,达到MAP译码器实现中的高速、低复杂度目标。
文摘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）.
