Premium
A comparison of the speeds of three convolution algorithms
Author(s) -
Boyer Arthur L.,
Wackwitz Ronald,
Mok Edward C.
Publication year - 1988
Publication title -
medical physics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.473
H-Index - 180
eISSN - 2473-4209
pISSN - 0094-2405
DOI - 10.1118/1.596254
Subject(s) - algorithm , convolution (computer science) , lookup table , computer science , ray tracing (physics) , benchmark (surveying) , fast fourier transform , tracing , fourier transform , table (database) , mathematics , optics , artificial intelligence , physics , mathematical analysis , geodesy , artificial neural network , data mining , programming language , geography , operating system
The speeds of three computer algorithms suitable for use in three‐dimensional radiotherapy planning codes were compared. Two of the algorithms are based on ray‐tracing methods, the first algorithm uses a fast ray‐tracing procedure directly and the second employs a table lookup procedure; the table was originally calculated by ray tracing. The third algorithm was a convolution procedure using the fast Fourier transform. Benchmark programs were written to compare the fundamental running speeds of the three algorithms operating on three‐dimensional arrays of various sizes. The convolution procedure employing the three‐dimensional fast Fourier transform had the shortest running times on a VAX/750 (Digital Equipment Corp.) computer. We concluded that this algorithm holds significant potential for practical three‐dimensional dose calculations.