Affiliations: [a] Department of Electrical and Computer Engineering, Sultan Qaboos University, Muscat, Oman | [b] Institute for Network and System Theory, Christian-Albrechts University, Kiel, Germany
Correspondence:
[*]
Corresponding author: Abdulnasir Hossen, Department of Electrical and Computer Engineering, Sultan Qaboos University, P.O.Box 33 Al-Khod, 123 Oman. E-mail: [email protected].
Abstract: In this paper we present a new fast approximate inverse FFT for short-time signal applications. This approach is derived from the sub-band FFT (SB-FFT) and it is called Sub-Segment IFFT (SS-IFFT). SS-IFFT uses the idea of decomposing the input signal into two segments (early and late) according to their order of occurence in time. An approximation can be done by implementing the IFFT of one of the two-segments according to a pre-known information about the time-domain characteristics of the signal. Such an approximation leads to fast computation at the cost of less accuracy. Both the reduction in complexity and the approximation errors of the new algorithm are investigated in this paper. The SS-IFFT has an adaptive capability like the forward SB-FFT. The idea of SS-IFFT is extended also to the two dimensional case. The algorithm is also tested by using different filters other than the Hadamard filters used in the SB-FFT. Different applications of the new technique are included in speech analysis, echo detection, FIR filter design, and ECG compression.
Keywords: Fast algorithms, SB-FFT, SS-IFFT, complexity, approximation errors, different wavelets filters, speech analysis, echo detection, FIR filters design, ECG compression
