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

What do you mean by true complement method, Q. What do you mean by True Com...

Q. What do you mean by True Complement Method? Explain in detail. Q. Show IEEE format for (12.75)10. Q. What are the various ways to represent Negative Numbers in computer sy

Determine the term- files, Determine the term- Files File maintenance i...

Determine the term- Files File maintenance is significant. Updating of files generally involves inserting, amending and deleting data. Example: A bank would amend data

Methods for organising the associative memory, There are two methods for or...

There are two methods for organising the associative memory based on bit slices: Bit parallel organisation: In this organisation every bit slices which are not masked off,

What is the most common biometrics, What is the most common biometrics? ...

What is the most common biometrics? The most common biometrics is the given below: Face geometry (Photo): In this the computer takes the picture of your face and matches t

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

SIDE EFFECT , EXPLAIN SIDE EFFECT OF SCAN CONVERSION WITH DIGRAM

EXPLAIN SIDE EFFECT OF SCAN CONVERSION WITH DIGRAM

How to use multiple source files in php, a. How to use source files in PHP?...

a. How to use source files in PHP? Define with examples. b. What are benefits of PHP sessions? How is a PHP session formed? c. What is XML and explain its utility? Design an

Unification, Unification: As just above this we have said that the rul...

Unification: As just above this we have said that the rules of inference for propositional logic detailed in the last lecture can also be required in first-order logic. Moreov

State the hardware faults and softwate faults, State the hardware faults an...

State the hardware faults and softwate faults - protection against hardware faults could be to keep backups or use GFS; use of UPS (in case of power loss) and parallel system a

An algorithm, find cos(x) and sin(x) an pseudocode (while loop

find cos(x) and sin(x) an pseudocode (while loop

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