A fast multi-level GFSK matched filter receiver

C. Tibenderana, S. Weiss

Research output: Contribution to conferencePaper

17 Downloads (Pure)

Abstract

Near optimal reception of a multilevel Gaussian frequency shift keying symbol can be achieved using a matched filter bank (MFB) receiver, which will require M^(K+L-1) filters for M modulation levels, a K-symbol observation interval, and a Gaussian filter with an L-symbol support length. This is prohibitive for most applications for the large values of K necessary to ensure best performance. In this paper we present a recursive algorithm that eliminates redundancy in providing the matched filter outputs by use of a smaller set of 1-symbol long intermediate filters, followed by an iterative process to propagate phase gained over K successive single symbol stages. If exemplarily operated in a Bluetooth receiver, the computational cost can be reduced by two orders of magnitude. Additionally we demonstrate that the intermediate filter outputs provide a means to detect carrier frequency and modulation index offsets, which can be corrected by iteratively recomputing the coefficients of the intermediate filter bank.
Original languageEnglish
Number of pages4
Publication statusPublished - 2004
Event6th International Conference on Mathematics in Signal Processing - Cirencester, United Kingdom
Duration: 14 Dec 200416 Dec 2004

Conference

Conference6th International Conference on Mathematics in Signal Processing
CountryUnited Kingdom
CityCirencester
Period14/12/0416/12/04

Keywords

  • fast
  • multi-level
  • gfsk
  • matched
  • filter receiver

Fingerprint Dive into the research topics of 'A fast multi-level GFSK matched filter receiver'. Together they form a unique fingerprint.

  • Cite this

    Tibenderana, C., & Weiss, S. (2004). A fast multi-level GFSK matched filter receiver. Paper presented at 6th International Conference on Mathematics in Signal Processing, Cirencester, United Kingdom.