A novel VLSI transform kernel based on fast rotation

This paper presents a new VLSI transform kernel which can perform non-overlapped and overlapped, orthogonal and biorthogonal transforms of any reasonable dimension. The architecture is based on a new fast recursive transform decomposition algorithm involving fast rotation only. As a result, a highly regular structure is achieved with a minimum of control overhead. The fast recursive transform decomposition algorithm is so efficient that the computational complexity of the transform kernel is competitive with those based on butterfly structure like FFT. The adoption of fast rotation technology leads to the silicon area-time cost of the transform being at least competitive with the butterfly version while the numerical robustness is optimal