![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/7BE1244D-C98A-4CDD-80CE-82D640A91028 | ||
| Year | 2022 | ||
| Type of Item | Diploma Work | ||
| License |
|
||
| Bibliographic Citation | Nikolaos Nasoulis, "Blind FSK detection in SIMO systems", Diploma Work, School of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2022 https://doi.org/10.26233/heallink.tuc.91715 | ||
| Appears in Collections |
Noncoherent (blind) sequence detection offers significant performance gains in comparison with conventional single-symbol noncoherent detection when the communication channel is quasi-static, at the cost of increased (usually exponential in the sequence length) complexity. In 2015, optimal blind frequency-shift keying (FSK) sequence detection in single-input single-output (SISO) systems was proven to be polynomially solvable and quasilinear-complexity optimal detectors were developed. In this thesis, we examine the complexity of optimal blind FSK sequence detection in 1x2 single-input multiple-output (SIMO) systems, i.e., systems with one transmit and two receive antennas. We focus on the case of 3-FSK modulation, prove that optimal blind FSK sequence detection is polynomially solvable for these cases, and present an efficient detection algorithm that has worst-time complexity $O(N^3)$ where $N$ is the sequence length. Finally, we offer a few insights on generalizing these results for higher-order FSK modulation and larger number of receive antennas.
Copyright © DIAS 2013
