In this paper the problem of unitary rate space-time block coding for multiple-input multiple-output communication systems employing continuous phase frequency shift keying is investigated. First, one-shot noncoherent detection is analysed in a maximum likelihood perspective; then, design criteria for optimal space-time codes are proposed and some error bounds for the devised coding schemes are derived. Numerical results evidence that the use of the proposed coding schemes can entail a limited energy loss with respect to other solutions available in the technical literature for coherent systems, with the relevant advantage, however, of a simple detection algorithm
Space-Time Block Codes for Noncoherent CPFSK / Pancaldi, Fabrizio; Vitetta, Giorgio Matteo. - ELETTRONICO. - 5:(2005), pp. 3043-3047. (Intervento presentato al convegno GLOBECOM'05: IEEE Global Telecommunications Conference, 2005 tenutosi a St. Louis, MO, usa nel 28 Novembre - 2 Dicembre) [10.1109/GLOCOM.2005.1578316].
Space-Time Block Codes for Noncoherent CPFSK
PANCALDI, Fabrizio;VITETTA, Giorgio Matteo
2005
Abstract
In this paper the problem of unitary rate space-time block coding for multiple-input multiple-output communication systems employing continuous phase frequency shift keying is investigated. First, one-shot noncoherent detection is analysed in a maximum likelihood perspective; then, design criteria for optimal space-time codes are proposed and some error bounds for the devised coding schemes are derived. Numerical results evidence that the use of the proposed coding schemes can entail a limited energy loss with respect to other solutions available in the technical literature for coherent systems, with the relevant advantage, however, of a simple detection algorithmPubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris