Multi-dimensional integer discrete W transform

By combining the one-dimensional type-II integer discrete W transform and the polynomial transform, the PT-based multi-dimensional (MD) type-II integer discrete W transform and its fast algorithm are proposed. The proposed MD integer transform needs a much smaller number of operations than the row-column MD integer transform does. It is invertible and its inverse is also an integer transform. It has a non-separable kernel and approximates to the MD type-II discrete W transform. Numerical experiments have been made to show its approximation performance.