University of Tasmania
Browse

Efficient digital FFT convolution with boundary kernel renormalisation

Version 2 2025-01-15, 01:15
Version 1 2023-05-23, 08:16
conference contribution
posted on 2025-01-15, 01:15 authored by Christopher JackettChristopher Jackett, Robert OllingtonRobert Ollington, JL Lovell
This paper describes a correction method for Fast Fourier Transform (FFT) convolution that limits boundary contamination artefacts resulting from convolution padding methods. The proposed correction method makes a single data-driven boundary condition assumption and only uses information contained within the original input signal to produce consistent convolution results and maintain data integrity. An analysis of the algorithm shows that it performs identically to the standard convolution approach with the only discernible differences being resolved at the level of machine rounding errors. The correction method can be applied at minimal cost to performance and has valuable applications for scientific data processing where algorithm efficiency and data accuracy are imperative.

History

Publication title

Proceedings of the International Conference on Digital Image Computing: Techniques and Applications (DICTA-13)

Volume

114

Editors

P de Souza and U Engelke

Pagination

1-6

ISBN

978-1-4799-2126-3

Department/School

Information and Communication Technology

Publisher

IEEE

Publication status

  • Published

Place of publication

New York, USA

Event title

International Conference on Digital Image Computing: Techniques and Applications (DICTA-13)

Event Venue

Hobart, Australia

Date of Event (Start Date)

2013-11-26

Date of Event (End Date)

2013-11-28

Rights statement

Copyright 2013 IEEE

Socio-economic Objectives

280115 Expanding knowledge in the information and computing sciences

Usage metrics

    University Of Tasmania

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC