Fast Hough transform for multidimensional signal processing

The recently developed Fast Hough Transform algorithm [3,4] alleviated the traditional exponential growth in computing complexity and storage of the Hough transform at a factor of several orders of magnitude thus enlightened the possibility of serving as a fundamental algorithm for multidimensional signal processing. This paper investigates its implementation on SIMD architectures consisting of a large number of identical bit-serial processing elements.