New fast Walsh–Hadamard–Hartley transform algorithm

Abstract

<span lang="EN-US">This paper presents an efficient fast Walsh–Hadamard–Hartley transform (FWHT) algorithm that incorporates the computation of the Walsh-Hadamard transform (WHT) with the discrete Hartley transform (DHT) into an orthogonal, unitary single fast transform possesses the block diagonal structure. The proposed algorithm is implemented in an integrated butterfly structure utilizing the sparse matrices factorization approach and the Kronecker (tensor) product technique, which proved a valuable and fast tool for developing and analyzing the proposed algorithm. The proposed approach was distinguished by ease of implementation and reduced computational complexity compared to previous algorithms, which were based on the concatenation of WHT and FHT by saving up to 3N-4 of real multiplication and 7.5N-10 of real addition.</span>

Reduced encoder time complexity using enhanced adaptive multiple transform selection in versatile video coding

“…The trend of this nature continues for next years to come. Because of these efficient codecs will be in demand with video capacities more than high efficiency video coding (HEVC) [1]. Identical situation continuing the last 33 years.…”