Explain about butterfly permutation, Computer Engineering

Assignment Help:

Q. Explain about Butterfly permutation?

Butterfly permutation:  This kind of permutation is attained by interchanging the most significant bit in address with least significant bit.

348_Explain about Butterfly permutation.png

Figure: Butterfly permutation

E.g. Xn-1,   Xn-2, and X1.X0 = X0 Xn-2 ....... X1 Xn-1

 001↔100,    010↔010

 011↔110,

An interconnection network derived from this permutation is the butterfly network. A butterfly network falls under the type of blocking networks and it doesn't permit an arbitrary connection of N inputs to N outputs without conflict. The butterfly network is customized in Benz network.  The Benz network comes under non-blocking network and it is produced by combining two butterfly networks end to end, in a manner that data flows forward by one and in reverse by the other.


Related Discussions:- Explain about butterfly permutation

Calculate the shortest distance using minimum spanning tree, Does the minim...

Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? No. The Minimal spanning tree makes sure that the total weight of the tree i

Basic performance equation, Explain the basic performance equation Ans...

Explain the basic performance equation Ans: The basic performance equation is following T = N * S/ R T =>  It is processor time required to execute a program N => act

Operations from events, Operations from events During analysis, events...

Operations from events During analysis, events which are sent to target objects. An operation on these object are presented as labels on transitions and should not be explicit

What are the features of the hardwired control, What are the features of th...

What are the features of the hardwired control? A controller that uses this approach can function at high speed. It has little flexibility and the complexity of the instruction

Data structures.., in asingle function declaration what is maximum no of st...

in asingle function declaration what is maximum no of statements that may be recursive calls

Define edge triggered d flip flop, Define Edge Triggered D flip-flop? D...

Define Edge Triggered D flip-flop? D latch has only two inputs C(control) and D(data). The operation of a D flip-flop is a lot simpler and it has only one input addition to the

Id3 algorithm - artificial intelligence, Th e ID3 algorithm The cal...

Th e ID3 algorithm The calculation for information gain is the very difficult phase of this algorithm. ID3 performs a search whereby the search states are decision trees an

Illustrate 16-bit isa, Illustrate 16-bit ISA?  Compare it with 8-bit ISA bu...

Illustrate 16-bit ISA?  Compare it with 8-bit ISA bus.  The only difference between 8 and 16-bit ISA bus is that an extra connector is attached behind the 8-bit connector. 16-b

Recombination - canonical genetic algorithm, Recombination: Therefore...

Recombination: Therefore during the selection and mating process then the GA repeatedly lines up pairs of individuals for reproduction. Hence the next question is how to gener

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd