IDEAS home Printed from https://ideas.repec.org/a/epw/comput/v1y2021i1id10003.html

Finite Impulse Response Filters for Stagger-Period Signals, their Designs and Applications

Author

Listed:
  • Xubao Zhang

    (Unitron Hearing, Canada)

Abstract

Those theories of conventional filters for uniform-period signals do not apply to the analysis and design of the finite impulse response (FIR) filters for stagger-period signals. In this paper, we defined the fundamental concepts related to the stagger-period signals, derived the calculating equations, and described the time-variant property of the stagger-period filter; we proposed the Fourier transform pair between the frequency and impulse responses of this type filter, and proved the inverse of each other. Then, we discussed the design methods of stagger-period frequency-selective FIR filters, including lowpass, bandpass, and high-pass, presented the staggered windowing philosophies, illustrated different windows’ effectiveness, and described the principles and designs of optimized stagger-period high-pass filters with the match algorithm. As applications, we introduced three staggered optimization algorithms: eigenvalue, match, and linear prediction; and discussed performances of the filters designed for a moving target indication (MTI) radar. The stagger-period MTI filters not only extended the blind speed of flying targets, but also had an optimized improvement factor. Finally, we proposed a mathematical programming to search the best period code, which makes this type filter’s velocity response flattened. Meanwhile, we compared properties of the stagger-period to uniform-period filters, and provided with some examples to illustrate the theories and designs.

Suggested Citation

Handle: RePEc:epw:comput:v:1:y:2021:i:1:id:10003
DOI: 10.24018/compute.2021.1.1.3
as

Download full text from publisher

File URL: https://eu-opensci.org/index.php/compute/article/view/10003
File Function: Abstract page
Download Restriction: no

File URL: https://eu-opensci.org/index.php/compute/article/download/10003/1776
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.24018/compute.2021.1.1.3?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:epw:comput:v:1:y:2021:i:1:id:10003. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Support Team (email available below). General contact details of provider: https://eu-opensci.org/index.php/compute .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.