✦ LIBER ✦

Computational Complexity of Decoding Orthogonal Space-Time Block Codes

✍ Scribed by Ayanoglu, E.; Larsson, E.G.; Karipidis, E.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Optimal Quasi-Orthogonal Space–Time B

✍ Haiquan Wang; Dong Wang; Xiang-Gen Xia 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 579 KB

Low-complexity sphere decoding algorithm

✍ Peng, A.Y.-C.; Il-Min Kim; Yousefi, S. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 215 KB

The Minimum Decoding Delay of Maximum Ra

✍ Adams, S.S.; Karst, N.; Pollack, J. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 185 KB

Space-Time Trellis Code Design Based on

✍ Dong Wang; Haiquan Wang; Xiang-Gen Xia 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 272 KB

Shift-orthogonal space-time block codes

✍ Tian Peng Ren; Yong Liang Guan; Gunawan, E.; Er Yang Zhang 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 317 KB

A novel maximum likelihood decoding algo

✍ Azzam, L.; Ayanoglu, E. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 159 KB