Simple Maximum-Likelihood Decoding of Generalized First-order Reed-Muller Codes
Kai-Uwe Schmidt, Adolf Finger
TL;DR
This paper introduces a simple and efficient maximum-likelihood decoding algorithm for generalized first-order Reed-Muller codes, reducing complexity compared to existing methods and benefiting OFDM systems.
Contribution
It presents a novel decoding algorithm for RM_q(1,m) that is simpler and more efficient than previous maximum-likelihood decoders.
Findings
Lower decoding complexity than prior algorithms
Effective for orthogonal frequency-division multiplexing
Applicable to various block-coding schemes
Abstract
An efficient decoder for the generalized first-order Reed-Muller code RM_q(1,m) is essential for the decoding of various block-coding schemes for orthogonal frequency-division multiplexing with reduced peak-to-mean power ratio. We present an efficient and simple maximum-likelihood decoding algorithm for RM_q(1,m). It is shown that this algorithm has lower complexity than other previously known maximum-likelihood decoders for RM_q(1,m).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Wireless Communication Techniques · PAPR reduction in OFDM