Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing( ZF) /minimum mean square error( MMSE) decoding algorithm, two low-complexity suboptimal decoding algorithms, ...
详细信息
Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing( ZF) /minimum mean square error( MMSE) decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate( BER) performance of the proposed algorithms is compared with that of the current known decoding ***, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF( pairwise-quasi-MMSE) decoder is equivalent to the pairwiseZF( pairwise-MMSE) decoder, while the computational complexity is significantly reduced.
暂无评论