Abstract
This letter considers a hardware-friendly log-likelihood ratio (LLR)-based successive cancellation (SC) decoding of polar codes for two-user binary-input multiple access channels. Based on the known recursive equations in the likelihood domain, we obtain LLR-based recursive equations for the SC decoding. An approximate LLR-based decoding is also introduced, which shows small performance loss at high error rate, but has significantly low complexity compared with the previous likelihood-based decoding.
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.
