Abstract
We investigate fast joint source-channel decoding employed for communication over frequency-flat and frequency-selective block-fading multiple-input multiple-output channels. Our setting has applications for communication with short codes under low-latency constraints. The case of no transmitter channel state information is considered. We propose a partial marginalization decoder that allows performance to be traded for computational complexity, by adjusting a user parameter. By tuning this parameter to its maximum value, the minimum mean square error (MMSE) decoder is obtained. In the conducted simulations, the proposed scheme almost achieves the MMSE performance for a wide range of the channel signal-to-noise ratios, with significant reductions in computational complexity.
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.
