Abstract
In this paper, we propose a novel high-dimensional mapping scheme based on erroneous bits minimization. Analysis and simulation results show that the proposed mapping can improve the bit-error-rate (BER) performance in comparison with random mapping and Millar mapping. It is also shown that the computational complexity of erroneous bits minimization mapping is much lower than that of Millar mapping.
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.
