Skip to main navigation Skip to search Skip to main content

Computationally efficient mismatched filters based on sidelobe inversion

  • SUNY Buffalo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

A computationally efficient mismatched filter comprised of a matched filter in cascade with a multi-stage filter based on sidelobe inversion is proposed. For this approach to work, the autocorrelation of the given code has to satisfy certain conditions that are derived in this work. If in addition, the sidelobes are sparse and of small integer values, such as in Barker codes and Huffman sequences, then the proposed filters are shown to be computationally very efficient. When implemented in VLSI, they require significantly smaller chip area and less power compared to the length-optimal filters achieving comparable sidelobe suppression.

Original languageEnglish
Title of host publicationISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology
Pages558-563
Number of pages6
DOIs
StatePublished - 2007
EventISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology - Cairo, Egypt
Duration: Dec 15 2007Dec 18 2007

Publication series

NameISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology

Conference

ConferenceISSPIT 2007 - 2007 IEEE International Symposium on Signal Processing and Information Technology
Country/TerritoryEgypt
CityCairo
Period12/15/0712/18/07

Keywords

  • Barker codes
  • Mismatched filter
  • Sidelobe suppression

Fingerprint

Dive into the research topics of 'Computationally efficient mismatched filters based on sidelobe inversion'. Together they form a unique fingerprint.

Cite this