摘要

In order to solve the problem of big time consumption when do permutation transform with existing algorithm, This paper proposes a new permutation algorithm. It groups all the input data according to the order firstly, then gain the converse of all data's index through accessing look-up table combing with addition. Hence, realize write data to memory and finish permutation computation at the same time, which means permutation computation doesn't take extra time of hardware process.