Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/F24B28BF-ED11-4018-87C7-3D2703C30516 | ||
| Year | 2016 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | M. Gkizeli and G. N. Karystinos, "Polynomial-complexity GLRT-optimal noncoherent PNC," in 13th International Symposium on Wireless Communication Systems, 2016, pp. 258-264. doi: 10.1109/ISWCS.2016.7600911 https://doi.org/10.1109/ISWCS.2016.7600911 | ||
| Appears in Collections |
Noncoherent two-way relay (TWR) systems with physical-layer network coding (PNC) usually operate with differential or orthogonal modulation. In either case, due to channel-induced memory, the optimal receiver at both the relay and source nodes takes the form of a sequence detector. Such a receiver has exponential (in the sequence length) complexity, when implemented through an exhaustive search among all possible sequences. Hence, many works in the literature consider single-symbol or short-block noncoherent PNC. In this work, we consider transmission of frequency-shift keying (FSK) signals in a TWR system and present an algorithm that performs generalized-likelihood-ratio-test (GLRT) optimal noncoherent PNC with polynomial (in the sequence length) complexity. Although presented in the context of FSK, our developments hold for other orthogonal modulation techniques as well. As a low-cost alternative, we also present a quadratic-complexity suboptimal detector that attains near-optimal performance. Simulation studies indicate that the proposed GLRT-optimal and suboptimal noncoherent PNC attains near-coherent-PNC performance with affordable complexity when the sequence length is on the order of 64, offering a 2-4dB gain over conventional noncoherent PNC approaches that can handle only short values of the sequence length.
Copyright © DIAS 2013
