THE MODEL OF THE PERMUTATIONS GENERATOR BASED ON THE MANAGEABLE CIRCULAR SHIFT
The algorithm and structure of the permutations generator of n integer-valued elements are described. For the investigation of its work, the system-level model and the transaction-level model are implemented for the generator (in SystemC and VHDL, respectively). The generator of permutations is notable for the simplicity of its hardware implementation and for the flexibility of its configuration. It is achievable due to using of algorithm of the manageable circular shift. The models offered in this paper can be used in the design of the systems of hardware formatting of binary lines representing data in the computers.