An efficient algorithm for the computation of the reverse jacket transform
This paper proposes an efficient algorithm to compute the reverse jacket transform algorithm by introducing a two-step decomposition strategy coupled with an appropriate use of the Kronecker product. Comparisons are carried out with the existing algorithms and the results show that a significant reduction in the number of data transfers and address generations as well as the structural complexity can be easily achieved using the proposed algorithm without increasing the arithmetic complexity. It is also shown that the three weights used in the existing reverse jacket transform are not required and just two are sufficient. Further, it is shown that a significant reduction in the number of multiplications can be achieved by using two rather than three weights, without losing the generality of the reverse jacket transform