Trellis structures of block codes are discussed. L-section trellis structures of some BCH codes are presented. A fast maximum likelihood decoding algorithm for BCH codes is proposed correspondingly, the decoding probl...Trellis structures of block codes are discussed. L-section trellis structures of some BCH codes are presented. A fast maximum likelihood decoding algorithm for BCH codes is proposed correspondingly, the decoding problem of q-ary images of qm-ary block codes is also discussed. The direct-sum partition and the associated decoding algorithms are given for the images.展开更多
Parallel concatenated spa ce time trellis code modulation, called Turbo STCM, can efficiently increase the coding gains of the space time codes. However, the complexity of the iterat iv e decoding restricts its ap...Parallel concatenated spa ce time trellis code modulation, called Turbo STCM, can efficiently increase the coding gains of the space time codes. However, the complexity of the iterat iv e decoding restricts its application. This paper introduces a lower complex deco ding algorithm based on soft output Viterbi algorithm (SOVA) for Turbo STCM. S imulational results show that the new SOVA algorithm for the Turbo STCM outperf orms the original space time trellis code (STTC) by 4~6 dB. At the same time, compared with the Max Log MAP (maximum a posteriori) algorithm, the new scheme requires a lower complexity and approaches the performance of Turbo STCM decod ing w ith Max Log MAP.展开更多
Space time trellis coding （STTC） techniques have been proposed to achieve both diversity and coding gains in multiple input multiple output （MIMO） fading channels. But with more transmit antennas STTCs suffer from...Space time trellis coding （STTC） techniques have been proposed to achieve both diversity and coding gains in multiple input multiple output （MIMO） fading channels. But with more transmit antennas STTCs suffer from the design dificulty and complexity increasing. This paper proposes a scheme, named parallel concatenated space time trellis codes （PC-STTC）, to achieve the tradeoff between the performances and complexity of STTCs for a large number of transmit antennas. Simulation results and complexity comparison are provided to demonstrate the performance and superiority of the proposed scheme over conventional schemes in fast fading channels in low signal-to-noise ratio （SNR） regions. And an EXIT （extrinsic information transform） chart is given to analyze the iterative convergence of the proposed scheme. It shows that PC-STTC has better iterative convergence in low SNR regions.展开更多
基金National Mobile Communications Key Laboratory at Southeast University(China)
文摘Trellis structures of block codes are discussed. L-section trellis structures of some BCH codes are presented. A fast maximum likelihood decoding algorithm for BCH codes is proposed correspondingly, the decoding problem of q-ary images of qm-ary block codes is also discussed. The direct-sum partition and the associated decoding algorithms are given for the images.
文摘Parallel concatenated spa ce time trellis code modulation, called Turbo STCM, can efficiently increase the coding gains of the space time codes. However, the complexity of the iterat iv e decoding restricts its application. This paper introduces a lower complex deco ding algorithm based on soft output Viterbi algorithm (SOVA) for Turbo STCM. S imulational results show that the new SOVA algorithm for the Turbo STCM outperf orms the original space time trellis code (STTC) by 4~6 dB. At the same time, compared with the Max Log MAP (maximum a posteriori) algorithm, the new scheme requires a lower complexity and approaches the performance of Turbo STCM decod ing w ith Max Log MAP.
基金supported by Shanghai Municipal Government and Nokia
文摘Space time trellis coding （STTC） techniques have been proposed to achieve both diversity and coding gains in multiple input multiple output （MIMO） fading channels. But with more transmit antennas STTCs suffer from the design dificulty and complexity increasing. This paper proposes a scheme, named parallel concatenated space time trellis codes （PC-STTC）, to achieve the tradeoff between the performances and complexity of STTCs for a large number of transmit antennas. Simulation results and complexity comparison are provided to demonstrate the performance and superiority of the proposed scheme over conventional schemes in fast fading channels in low signal-to-noise ratio （SNR） regions. And an EXIT （extrinsic information transform） chart is given to analyze the iterative convergence of the proposed scheme. It shows that PC-STTC has better iterative convergence in low SNR regions.
