Abstract
A max-log-MAP soft demapping algorithm with logarithmic complexity is proposed for M-PAM signals. Its algorithm complexity is only Θ(logM) for M-PAM signals, in contrast to Θ(MlogM) as achieved by the conventional max-log-MAP algorithm using exhaustive search. The algorithm applies to both Gray-coded and natural-coded signals. The max-log-MAP algorithm with logarithmic complexity may be straightforwardly extended to rectangular QAM signals when the rectangular QAM signal can be decomposed into two independent PAM signals.
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.
