Bandpass filters (BPFs) are very important to extract target signals and eliminate noise from the received signals. A BPF of which frequency characteristics is a sum of Gaussian functions is called the Gaussian mixture BPF (GMBPF). In this research, we propose to implement the GMBPF approximately by the sum of several frequency components of the sliding Fourier transform (SFT) or the attenuated SFT (ASFT). Because a component of the SFT/ASFT can be approximately realized using the finite impulse response (FIR) recursive filters, its calculation complexity does not depend on the length of the impulse response. The property makes GMBPF ideal for narrow bandpass filtering applications. We conducted experiments to demonstrate the advantages of the proposed GMBPF over FIR filters designed by a MATLAB function with regard to the computational complexity.
Yukihiko YAMASHITA
Center for Innovative Teaching and Learning of the Tokyo Institute of Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yukihiko YAMASHITA, "Gaussian Mixture Bandpass Filter Design for Narrow Passband Width by Using a FIR Recursive Filter" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 10, pp. 1277-1285, October 2023, doi: 10.1587/transfun.2022EAP1108.
Abstract: Bandpass filters (BPFs) are very important to extract target signals and eliminate noise from the received signals. A BPF of which frequency characteristics is a sum of Gaussian functions is called the Gaussian mixture BPF (GMBPF). In this research, we propose to implement the GMBPF approximately by the sum of several frequency components of the sliding Fourier transform (SFT) or the attenuated SFT (ASFT). Because a component of the SFT/ASFT can be approximately realized using the finite impulse response (FIR) recursive filters, its calculation complexity does not depend on the length of the impulse response. The property makes GMBPF ideal for narrow bandpass filtering applications. We conducted experiments to demonstrate the advantages of the proposed GMBPF over FIR filters designed by a MATLAB function with regard to the computational complexity.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022EAP1108/_p
Copy
@ARTICLE{e106-a_10_1277,
author={Yukihiko YAMASHITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Gaussian Mixture Bandpass Filter Design for Narrow Passband Width by Using a FIR Recursive Filter},
year={2023},
volume={E106-A},
number={10},
pages={1277-1285},
abstract={Bandpass filters (BPFs) are very important to extract target signals and eliminate noise from the received signals. A BPF of which frequency characteristics is a sum of Gaussian functions is called the Gaussian mixture BPF (GMBPF). In this research, we propose to implement the GMBPF approximately by the sum of several frequency components of the sliding Fourier transform (SFT) or the attenuated SFT (ASFT). Because a component of the SFT/ASFT can be approximately realized using the finite impulse response (FIR) recursive filters, its calculation complexity does not depend on the length of the impulse response. The property makes GMBPF ideal for narrow bandpass filtering applications. We conducted experiments to demonstrate the advantages of the proposed GMBPF over FIR filters designed by a MATLAB function with regard to the computational complexity.},
keywords={},
doi={10.1587/transfun.2022EAP1108},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Gaussian Mixture Bandpass Filter Design for Narrow Passband Width by Using a FIR Recursive Filter
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1277
EP - 1285
AU - Yukihiko YAMASHITA
PY - 2023
DO - 10.1587/transfun.2022EAP1108
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2023
AB - Bandpass filters (BPFs) are very important to extract target signals and eliminate noise from the received signals. A BPF of which frequency characteristics is a sum of Gaussian functions is called the Gaussian mixture BPF (GMBPF). In this research, we propose to implement the GMBPF approximately by the sum of several frequency components of the sliding Fourier transform (SFT) or the attenuated SFT (ASFT). Because a component of the SFT/ASFT can be approximately realized using the finite impulse response (FIR) recursive filters, its calculation complexity does not depend on the length of the impulse response. The property makes GMBPF ideal for narrow bandpass filtering applications. We conducted experiments to demonstrate the advantages of the proposed GMBPF over FIR filters designed by a MATLAB function with regard to the computational complexity.
ER -