Geometrical relations between space time block code designs and complexity reduction
| dc.creator | Henkel, Oliver | |
| dc.date | 2005-10-17 | |
| dc.date | 2006-12-05 | |
| dc.date.accessioned | 2026-07-07T08:17:53Z | |
| dc.date.available | 2026-07-07T08:17:53Z | |
| dc.description | In this work, the geometric relation between space time block code design for the coherent channel and its non-coherent counterpart is exploited to get an analogue of the information theoretic inequality $I(X;S)\le I((X,H);S)$ in terms of diversity. It provides a lower bound on the performance of non-coherent codes when used in coherent scenarios. This leads in turn to a code design decomposition result splitting coherent code design into two complexity reduced sub tasks. Moreover a geometrical criterion for high performance space time code design is derived. | |
| dc.description | final version, 11 pages, two-column | |
| dc.identifier | https://arxiv.org/abs/cs/0510047 | |
| dc.identifier | http://arxiv.org/abs/cs/0510047 | |
| dc.identifier | IEEE Trans. Inform. Theory, vol. 52, no. 12 (Dec 2006), 5324-5335 | |
| dc.identifier | doi:10.1109/TIT.2006.885457 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134245 | |
| dc.subject | Information Theory | |
| dc.title | Geometrical relations between space time block code designs and complexity reduction | |
| dc.type | text |