Log-Linear-Complexity GLRT-Optimal Noncoherent Sequence Detection for Orthogonal and RFID-Oriented Modulations

PROJECT TITLE :

Log-Linear-Complexity GLRT-Optimal Noncoherent Sequence Detection for Orthogonal and RFID-Oriented Modulations

ABSTRACT:

Orthogonal modulation, as an example, frequency-shift keying (FSK) or pulse-position modulation (PPM), is primarily employed in comparatively-low-rate Communication systems that operate in the power-restricted regime. Optimal noncoherent detection of orthogonally modulated signals takes the shape of sequence detection and has exponential (within the sequence length) complexity when implemented through an exhaustive search among all doable sequences. During this work, for the primary time within the literature, we have a tendency to present an algorithm that performs generalized-likelihood-ratio-take a look at (GLRT) optimal noncoherent sequence detection of orthogonally modulated signals in flat fading with log-linear (within the sequence length) complexity. Moreover, for Rayleigh fading channels, the proposed algorithm is similar to the maximum-likelihood (ML) noncoherent sequence detector. Simulation studies indicate that the optimal noncoherent FSK detector attains coherent-detection performance when the sequence length is on the order of a hundred, giving a 3–5 dB gain over the standard energy (single-image) detector. While the standard exhaustive-search approach becomes infeasible for such sequence lengths, the proposed implementation needs a log-linear solely range of operations, gap new avenues for practical deployments. Finally, we have a tendency to show that our algorithm additionally solves efficiently the optimal noncoherent sequence detection downside in modern radio frequency identification (RFID) systems.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here