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

Explain the working of bcd adder, Explain the working of BCD adder One ...

Explain the working of BCD adder One of the ways of adding decimal numbers in BCD is to use a 4-bit binary adder and perform arithmetic operation one digit at a time. The low-o

Explain the features of major scheduling algorithms, Explain the Features o...

Explain the Features of Major scheduling algorithms. The Features of Major scheduling algorithms is given below: FCFS - i.e. First come first served scheduli

Determine about the security- accidental damage, Determine about the securi...

Determine about the security- accidental damage accidental damage is best guarded against by keeping back up files or use Grandfather-Father-Son (GFS) method; also use of passw

How is the connectivity established in verilog, How is the connectivity est...

How is the connectivity established in Verilog when connecting wires of different widths? When connecting wires or ports of different widths, connections are right-justified, S

Define a variant of top-down parsing without backtracking, A parser which i...

A parser which is a variant of top-down parsing without backtracking is? Ans. Recursive Descend is a variant of top-down parsing without backtracking.

What is hamiltonian path, What is Hamiltonian path?  A Hamiltonian path...

What is Hamiltonian path?  A Hamiltonian path in a directed graph G is a directed path that goes through every node exactly once. We consider a special case of this problem whe

Write a program to echo the string, Write a program to echo the string 'Hel...

Write a program to echo the string 'Hello' to the serial channel (SCI) using the protocol of baud rate 9600,8 bits , no parity and 1 stop bit  Consider the baud register as show

What is dynamic modelling, What is Dynamic Modelling  As you know that...

What is Dynamic Modelling  As you know that computer systems are built from the objects which respond to events. External events arrive at boundary of system; you understan

Pipe and filter , How to draw the pipe and filter using data flow and it co...

How to draw the pipe and filter using data flow and it components and connectors

What is drive, Any data storage device. This having of  your CD-ROM drive, ...

Any data storage device. This having of  your CD-ROM drive, hard disk drive and floppy disk drive.

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