A Choice of Lower Complexity for Two Filtering Operations Based on F-OFDM

DOI

10.2991/icmia-16.2016.120How to use a DOI?

Keywords

filter complexity; linear convolution; fast convolution; F-OFDM

Abstract

This paper introduces a choice of lower complexity for two different filtering operations based on Filtered OFDM (F-OFDM). The first filtering operation is implemented by linear convolution in time domain, and the second one is realized by multiplication in frequency domain (fast convolution). They are applied to guarantee a good performance for different data lengths. In order to always get the lower complexity of the filtering operation for F-OFDM, this paper combines both of them, and proposes a new filtering operation, which can ensure a good performance for larger class of data with almost all kinds of lengths. By comparing the computational complexity of two kinds of filtering operations and considering the effective calculating length (space complexity) of the filtering operation in frequency domain, the lower complexity of filtering operation is chosen according to the data length based on F-OFDM. Simulation based on F-OFDM in this paper illustrates the lower computational complexity of the filtering operation.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xianru Li
AU  - Wei Huang
AU  - Yixin Zhao
PY  - 2016/11
DA  - 2016/11
TI  - A Choice of Lower Complexity for Two Filtering Operations Based on F-OFDM
BT  - Proceedings of the 2016 5th International Conference on Measurement, Instrumentation and Automation (ICMIA 2016)
PB  - Atlantis Press
SN  - 1951-6851
UR  - https://doi.org/10.2991/icmia-16.2016.120
DO  - 10.2991/icmia-16.2016.120
ID  - Li2016/11
ER  -