Turbo decoding is iterative decoding, and the MAP algorithm isoptimal in terms of performance in Turbo decoding. The log-MAPalgorithms is the MAP executed in the logarithmic domain, so it isalso optimal. Both the MAP ...Turbo decoding is iterative decoding, and the MAP algorithm isoptimal in terms of performance in Turbo decoding. The log-MAPalgorithms is the MAP executed in the logarithmic domain, so it isalso optimal. Both the MAP and the log-MAP algorithm are complicatedfor implementation. The max-log MAP algorithm is de- Rived from thelog-MAP with approximation, which is simply compared with the log-MAPalgorithm but is subopti- Malin terms of performance. A modifiedmax-log-MAP algorithm is presented in this paper, based on the TaylorSeries of logarithm and exponent. Analysis and simulation resultsshow that modified max-log-MAP algorithm Outperforms the max-log-MAPalgorithm with almost the same complexity.展开更多
In free-space optical(FSO) communications, the performance of the communication systems is severely degraded by atmospheric turbulence. Channel coding and diversity techniques are commonly used to combat channel fadin...In free-space optical(FSO) communications, the performance of the communication systems is severely degraded by atmospheric turbulence. Channel coding and diversity techniques are commonly used to combat channel fading induced by atmospheric turbulence. In this paper, we present the generalized block Markov superposition transmission(GBMST) of repetition codes to improve time diversity. In the GBMST scheme, information sub-blocks are transmitted in the block Markov superposition manner, with possibly different transmission memories. Based on analyzing an equivalent system, a lower bound on the bit-error-rate(BER) of the proposed scheme is presented. Simulation results demonstrate that, under a wide range of turbulence conditions, the proposed scheme improves diversity gain with only a slight reduction of transmission rate. In particular, with encoding memory sequence(0, 0, 8) and transmission rate 1/3, a diversity order of eleven is achieved under moderate turbulence conditions. Numerical results also show that, the GBMST systems with appropriate settings can approach the derived lower bound, implying that full diversity is achievable.展开更多
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）.展开更多
文摘Turbo decoding is iterative decoding, and the MAP algorithm isoptimal in terms of performance in Turbo decoding. The log-MAPalgorithms is the MAP executed in the logarithmic domain, so it isalso optimal. Both the MAP and the log-MAP algorithm are complicatedfor implementation. The max-log MAP algorithm is de- Rived from thelog-MAP with approximation, which is simply compared with the log-MAPalgorithm but is subopti- Malin terms of performance. A modifiedmax-log-MAP algorithm is presented in this paper, based on the TaylorSeries of logarithm and exponent. Analysis and simulation resultsshow that modified max-log-MAP algorithm Outperforms the max-log-MAPalgorithm with almost the same complexity.
基金partially supported by the Basic Research Project of Guangdong Provincial Natural Science Foundation (No.2016A030308008)the National Natural Science Foundation of China (No.91438101 and No.61501206)the National Basic Research Program of China (973 Program) (No.2012CB316100)
文摘In free-space optical(FSO) communications, the performance of the communication systems is severely degraded by atmospheric turbulence. Channel coding and diversity techniques are commonly used to combat channel fading induced by atmospheric turbulence. In this paper, we present the generalized block Markov superposition transmission(GBMST) of repetition codes to improve time diversity. In the GBMST scheme, information sub-blocks are transmitted in the block Markov superposition manner, with possibly different transmission memories. Based on analyzing an equivalent system, a lower bound on the bit-error-rate(BER) of the proposed scheme is presented. Simulation results demonstrate that, under a wide range of turbulence conditions, the proposed scheme improves diversity gain with only a slight reduction of transmission rate. In particular, with encoding memory sequence(0, 0, 8) and transmission rate 1/3, a diversity order of eleven is achieved under moderate turbulence conditions. Numerical results also show that, the GBMST systems with appropriate settings can approach the derived lower bound, implying that full diversity is achievable.
文摘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）.
