Single-Symbol Maximum Likelihood Decodable Linear STBCs
| dc.creator | Khan, Md. Zafar ALi | |
| dc.creator | Rajan, B. Sundar | |
| dc.date | 2006-02-08 | |
| dc.date.accessioned | 2026-07-07T08:16:21Z | |
| dc.date.available | 2026-07-07T08:16:21Z | |
| dc.description | Space-Time block codes (STBC) from Orthogonal Designs (OD) and Co-ordinate Interleaved Orthogonal Designs (CIOD) have been attracting wider attention due to their amenability for fast (single-symbol) ML decoding, and full-rate with full-rank over quasi-static fading channels. However, these codes are instances of single-symbol decodable codes and it is natural to ask, if there exist codes other than STBCs form ODs and CIODs that allow single-symbol coding? In this paper, the above question is answered in the affirmative by characterizing all linear STBCs, that allow single-symbol ML decoding (not necessarily full-diversity) over quasi-static fading channels-calling them single-symbol decodable designs (SDD). The class SDD includes ODs and CIODs as proper subclasses. Further, among the SDD, a class of those that offer full-diversity, called Full-rank SDD (FSDD) are characterized and classified. | |
| dc.description | 38 pages, 9 Figures, accepted for publication in IEEE Trans. Information Theory, 2006 | |
| dc.identifier | https://arxiv.org/abs/cs/0602030 | |
| dc.identifier | http://arxiv.org/abs/cs/0602030 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133751 | |
| dc.subject | Information Theory | |
| dc.title | Single-Symbol Maximum Likelihood Decodable Linear STBCs | |
| dc.type | text |