Abstract
This paper introduces hyper-dimensional modulation (HDM), a new class of practical modulation scheme for robust communication among low-power and low- complexity devices. Unlike conventional orthogonal modulations, HDM conveys numerous information bits per symbol by combining hyper-dimensional vectors that are not strictly orthogonal to each other. Information bits are spread across many elements in the hyper-dimensional vector, thus HDM is tolerant of element-wise failures in high noise channels. Bit error rate (BER) evaluation results confirm that uncoded HDM with 256-dimension outperforms low density parity check (LDPC) and Polar codes with the same block length of 256. Analysis reveals HDM demodulation complexity is lower than that of LDPC and Polar decoders when the block length is relatively small. Moreover, HDM provides graceful tradeoffs between data rate and signal-to-noise ratio for robust short message communications among power- and complexity- constrained devices.
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.
