Perfect Shuffle Permutation
This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say X_{n-1,} X_{n-2,} X_{0 } (N is chosen such that N = 2^{n}.) The ideal shuffle of these N objects is expressed as
X _{n-1}, X _{n-2}, X_{0} = X _{n-2}, X _{0 } X _{n-1}.
It means perfect shuffle is achieved by rotating the address by 1 bit left. E.g. shuffle of 8 objects is shown below as:-