Fast algorithm for window computation in real-valued discrete Gabor transform for long sequences

2014 
To reduce the high complexity of the window computation using the biorthogonal relationship between the analysis window and the synthesis window in the Real-valued Discrete Gabor Transform(RDGT)for infinite or long sequences, this paper presents a fast algorithm based on the Discrete Hartley Transform(DHT). By transforming the equation set of the biorthogonal relationship into the form of DHT, the equation set can be separated into several independent sub-equation sets so that the computational complexity can be reduced. The experimental results also indicate that the proposed fast algorithm is correct and effective.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []