Low-Complexity Butterfly Integration Structure for MMSE-SIC SISO Detector
Wireless Personal Communications: An International Journal
| Hi-index | 0.01 |
In this letter, we study iterative demodulation and decoding methods for lattice based space-time coded systems concatenated with convolutional codes. We first apply the optimal MAP demodulation and the suboptimal linear MMSE methods to lattice based space-time demodulation and decoding. We then propose two other methods based on the idea of soft interference cancellation and in one method vector Gaussian approximation is used and in the other method scalar Gaussian approximation is used. We also present the EXIT chart analyses for the performance analyses for these iterative methods. Both theoretical and simulation results show that the performance of the vector Gaussian approximation method is the same as that of the linear MMSE method but in some cases the vector Gaussian approximation method has lower complexity. The complexity of the scalar Gaussian approximation method is the lowest among these different methods and grows linearly with the transmission rate while it still has an acceptable performance. Full diversity and full rate lattice based space-time coding is compared with the BLAST scheme and simulations show that the former has a better performance than the later even with the proposed suboptimal iterative demodulation and decoding methods