Space-time block codes with low maximum-likelihood decoding complexity
In this thesis, we consider the problem of designing space-time block codes that have low maximum-likelihood (ML) decoding complexity. We present a unified framework for determining the worst-case ML decoding complexity of space-time block codes. We use this framework to not only determine the worst...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/31752 |