Efficient Iterative Decoding of Serially Concatenated Multiplexed Alamouti Codes
We present a low complexity iterative decoding method for a multiplexed Alamouti space-time code serially concatenated by a convolutional code. The space-time signalling code consists of a Gray coded 16-QAM mapper and two spatially overlaid Alamouti signalling blocks. A linear complexity decoder is...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We present a low complexity iterative decoding method for a multiplexed Alamouti space-time code serially concatenated by a convolutional code. The space-time signalling code consists of a Gray coded 16-QAM mapper and two spatially overlaid Alamouti signalling blocks. A linear complexity decoder is used for decoding the inner space-time code. Ordinarily, an iterative decoding between the inner and outer decoders at the receiver does not improve performance when using a Gray coded modulation scheme. However we show that turbo gains are possible when a multiplexed Alamouti code is used. The low complexity inner decoder is based on Bayesian interference cancelling approach. We present a method of using both the extrinsic and full a posteriori values from the outer decoder to facilitate gains from iterations. The modified iterative decoder presented here favourably compares to a space-time bit interleaved coded modulation (ST-BICM) system providing the same spectral efficiency in terms of complexity-performance tradeoff. |
---|---|
ISSN: | 1550-3607 1938-1883 |
DOI: | 10.1109/icc.2011.5962689 |