Perfect shuffle permutation-concept of permutation network, Computer Networking

Perfect Shuffle Permutation

This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  Xn-1, Xn-2, X  (N is chosen such that N = 2n.)  The ideal shuffle of these N objects is expressed as

                                             X n-1, X n-2,  X0     = X n-2, X 0    X n-1.

                                  657_Perfect Shuffle Permutation.png

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







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
Related Questions
There are three building blocks of client/server a) The client   b) The server and   c)  Middleware.

Define the term - frame and packets Frames sum up packets. When a packet arrives at data link layer, the complete packet, header, data and remaining all, is used as data field

What does a Standard IP Access-list use as test criteria Ans) Standard IP access list use only source address.


You need to enable both arpa and snap encapsulation on single router interface. How do you do this? Ans)Assign two network numbers, one for every encapsulation type.

A socket is an abstraction that shows an endpoint of communication. Most applications that consciously use TCP and UDP do so by making a socket of the appropriate type and then per

Connectionless Multiplexing  and De multiplexing Java program running in a host can create a UDP socket  with the  line Datagram's socket my socket =  new datagram's socket

Metrics For Performance Evaluation In this section, we would highlight different kinds of metrics involved for analyzing the performance of parallel algorithms for parallel co

PROTOCOL SOFTWARE AND ETHERNET WIRING:  All wiring methods use identical Ethernet specifications. e.g. they need same message format. They need same CSMA/CD algorithems. They m

Question : a) Give three examples of vulnerable services which are among the overwhelming majority of successful attacks. b) Name the five outside sources which can be the