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₀   (N is chosen such that N = 2ⁿ.)  The ideal shuffle of these N objects is expressed as

                                             X _n-1, X _n-2,  X₀     = X _n-2, X ₀    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:-

Posted Date: 3/2/2013 6:20:41 AM | Location : United States

Ask an Expert

Related Discussions:- Perfect shuffle permutation-concept of permutation network, Assignment Help, Ask Question on Perfect shuffle permutation-concept of permutation network, Get Answer, Expert's Help, Perfect shuffle permutation-concept of permutation network Discussions

Write discussion on Perfect shuffle permutation-concept of permutation network
Your posts are moderated

Write your message here..

Related Questions

What security risks present on the networks, Security risks present on the ... Security risks present on the networks Lots of risks are present everywhere on Internet as well as on Intranet, if it is not known what is being done. Every day a number of

Network interface hardware, NETWORK INTERFACE HARDWARE:  CPU can't ope... NETWORK INTERFACE HARDWARE:  CPU can't operate data at network speeds. So in order to connect to the network device systems use special purpose hardware for network connection

Quality of service, Networks are more frequently being prepared to allow sp... Networks are more frequently being prepared to allow specification of the quality of service needed by users. For example: - a typical voice telephone call may give a QoS para

Tcp connections - transport layer, TCP Connections TCP  is an end to e... TCP Connections TCP  is an end to end point to point  transport  used in internet. being a point  to point  protocols  means that  there is always  s single  sender  a single

Configure spanning tree- ccna, Configure Spanning Tree Step 1: Ex... Configure Spanning Tree Step 1: Examine the default configuration of 802.1D STP. On each switch, display the spanning tree table with the show spanning-tree command. R

Explain asynchronous FDDI, Explain Asynchronous FDDI Asynchronous bandw... Explain Asynchronous FDDI Asynchronous bandwidth is allocated utilizing an eight-level priority scheme. Every station is assigned an asynchronous priority level. FDDI as wel

Substantial capital investments in new networks, Question: (a) How can... Question: (a) How can governments provide the mobile industry with the long-term clarity and certainty it needs to make substantial capital investments in new networks? (b)

Packet processing on vpn router, Consider the site-to-site VPN scenario sho... Consider the site-to-site VPN scenario shown in Figure 2. Let's deploy the AH protocol on the two VPN routers so that no desktop on the two sites need to do any AH operations. Assu

what are the dissimilar kinds of firewalls, Dissimilar kinds of firewalls Dissimilar kinds of firewalls?

Illustrate stop-and-wait automatic repeat request, Q. Illustrate Stop-and-W... Q. Illustrate Stop-and-Wait Automatic Repeat request? - Simplest flow as well as error control mechanism - The sending device keeps a duplicate copy of the last frame transm