An AOCA-based VLSI architecture for non-recursive 2D discrete periodized wavelet transform

All traditional VLSI architectures of the 2D discrete wavelet transform (DWT) are based on the recursive pyramid algorithm. They need an interleaving technique to solve the confliction problem of multilevel input data. This increases circuit complexity and time latency as the decomposition stage is increased. Instead, this paper presents a non-recursive algorithm of separable 2D DPWT (discrete periodized wavelet transform), by which each stage's decomposition can be performed independently and the 2D DPWT coefficients of all stages can be obtained simultaneously. Based on the AOCA process, an efficient process called segment accumulation algorithm (SAA) is proposed to overcome the filter growing problem. With the property of using the same original data for all stages, a data sharing technique can be applied in the parallel processing scheme of the SAA for circuit complexity reduction. The SAA provides three fundamental 1D DPWT VLSI architectures with the advantages of requiring no multiplex, and fewer multiplier, adder, and non-interleaving processes. Moreover, the latency of the architecture is independent of the decomposition levels and can be very short.