File(s) under permanent embargo
Efficient digital FFT convolution with boundary kernel renormalisation
conference contribution
posted on 2023-05-23, 08:16 authored by Christopher JackettChristopher Jackett, Robert OllingtonRobert Ollington, Lovell, JLThis 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)Editors
P de Souza and U EngelkePagination
1-6ISBN
978-1-4799-2126-3Department/School
School of Information and Communication TechnologyPublisher
IEEEPlace of publication
New York, USAEvent title
International Conference on Digital Image Computing: Techniques and Applications (DICTA-13)Event Venue
Hobart, AustraliaDate of Event (Start Date)
2013-11-26Date of Event (End Date)
2013-11-28Rights statement
Copyright 2013 IEEERepository Status
- Restricted