![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/88628779-5660-4E4E-8B57-1895485A7863 | ||
| Year | 2015 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | G. N. Karystinos and A. Bletsas, “Cubic-complexity optimal noncoherent OOK sequence detection in flat fading,” in Proc. IEEE ICC 2015 - International Conference on Communications, pp. 2721-2726. doi: 10.1109/ICC.2015.7248737 https://doi.org/10.1109/ICC.2015.7248737 | ||
| Appears in Collections |
On-off keying (OOK) is a simple orthogonal modulation technique that is primarily used in the noncoherent mode, that is, when the propagation channel is unknown at the receiver. Although the noncoherent OOK detector is usually operated as a simple single-symbol (one-shot) energy detector, it does not take into account memory that is induced by the channel. Hence, optimal noncoherent detection of OOK takes the form of sequence detection and has exponential complexity in the sequence length when implemented through an exhaustive search among all possible sequences. In this work, we present a novel algorithm that performs generalized-likelihood-ratio-test (GLRT) optimal noncoherent sequence detection of OOK signals in flat fading with cubic (in the sequence length) complexity. Moreover, for Rayleigh fading channels, the proposed algorithm is equivalent to the maximum-a-posteriori (MAP) noncoherent sequence detector. Due to its polynomial complexity, the proposed algorithm allows implementation of the optimal sequence detector for large sequence lengths, for which the conventional exhaustive-search approach becomes infeasible. Interestingly, with a large enough sequence length, the noncoherent detector attains nearly-coherent performance, although it does not utilize any knowledge about the propagation channel.
Copyright © DIAS 2013
