The evolving generation of slam transform is discussed by using the idea of bisection evolution, and a new pattern of bisection evolution is proposed. The pattern includes two kinds of bisection pattern which describe...The evolving generation of slam transform is discussed by using the idea of bisection evolution, and a new pattern of bisection evolution is proposed. The pattern includes two kinds of bisection pattern which describe two basic design techniques: copy and mutation, respectively. Then the relations between the four ordered slant transform matrices and the Walsh transform matrices, and on this basis, various fast algorithms for slant transform can be obtained. Here two fast algorithms for slant transform with bit-reversed Walsh order are given.展开更多
文摘The evolving generation of slam transform is discussed by using the idea of bisection evolution, and a new pattern of bisection evolution is proposed. The pattern includes two kinds of bisection pattern which describe two basic design techniques: copy and mutation, respectively. Then the relations between the four ordered slant transform matrices and the Walsh transform matrices, and on this basis, various fast algorithms for slant transform can be obtained. Here two fast algorithms for slant transform with bit-reversed Walsh order are given.
