Abstract
In this paper, error performance of a serially concatenated QPSK space-time system is investigated on quasi-static, block and rapid fading channels. We consider outer nonrecursive convolutional and inner recursive space-time trellis code case and iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is observed that when the recursive versions of some of the previously known space-time trellis codes are used as the inner codes, the Euclidean distance criterion based spaced-time codes lead to better error performance for both quasi-static and rapid fading channels. We also investigate the effects of various system parameters on the performance. We obtain the error performance for the large number of transmit and/or receive antennas increases the error performance improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
