High speed 2D hexagonal convolution by polynomial transform

The inherent nonseparable difficulty in 2D hexagonal sampled data can be overcome by choosing suitable periodicity and sampling basis, this will turn the original hexagonal data into very simple separable parallelograms, and then the rectangular polynomial transforms can be used to efficiently calculate 2D hexagonal convolutions; This algorithm is much faster than the hexagonal discrete Fourier transform method.