On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"
Ender Ayanoglu
TL;DR
This paper discusses a new decoding algorithm for orthogonal space-time block codes that aims to improve computational efficiency over existing maximum likelihood methods.
Contribution
It introduces a novel maximum likelihood decoding algorithm that reduces computational complexity for orthogonal space-time block codes.
Findings
Reduced decoding complexity demonstrated
Algorithm outperforms previous methods in efficiency
Potential for faster wireless communication systems
Abstract
The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
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
TopicsAdvanced Wireless Communication Techniques · Coding theory and cryptography · Error Correcting Code Techniques