Abstract
In this paper, we consider coded asynchronous multiuser signals in an additive white Gaussian noise channel. Since optimum joint multiuser detection (MUD) and forward error correction (FEC) decoding is characterized with a very high computational complexity, we consider disjoint MUD and FEC decoding. The optimum disjoint multiuser detector is the soft-output maximum a posteriori detector that provides sequences of a posteriori probabilities to the corresponding FEC decoders. It involves backward and forward recursions resulting in high complexity and processing delay. In this paper, we consider several suboptimum soft output disjoint multiuser detectors that involve only forward recursions and have reduced complexity and delay.
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.
