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

Hard disk architecture, Hard disk Architecture: A hard disk drive ...

Hard disk Architecture: A hard disk drive having the platters and motor hub removed indicating the copper colored stator coils surrounding a bearing at the cen

Word puzzle, You are required to make a class of WordPuzzle, which is basic...

You are required to make a class of WordPuzzle, which is basically a game of finding words inside a 2d-array of characters. The class needs to take rows and columns as arguments an

Define top-down parsing techniques, Define Top-down parsing Techniques ...

Define Top-down parsing Techniques Top-down parsing can be observed as an attempt to find left-most derivations of an input-stream through searching for parse trees using a top

Grounding a variable - first-order logic, Grounding a variable - first-orde...

Grounding a variable - first-order logic: The perform of making ourselves clear about a variable by introducing an exists or a forall sign is called quantifying the variable.

Determine about the memory stack, Memory Stack Stack could exist as a s...

Memory Stack Stack could exist as a stand-alone unit or could be executed in a random-access memory attached to the CPU. The implementation of a stack in a CPU is done by assig

What is the linkage section, The linkage section is part of a known as prog...

The linkage section is part of a known as program that 'links' or maps to data items in the calling program are working storage. It is the part of the called program where these sh

In what way the protection fault handler concludes, In what way the protect...

In what way the protection fault handler concludes? After finishing the implementation of the fault handler, it sets the change and protection bits and clears the copy on write

Explain in detail about first generation electronic computer, First Generat...

First Generation Electronic Computers (1937-1953) Three machines have been promoted at different times as first electronic computers. These machines used electronic switches

What are the cycle based simulators, What are the Cycle based simulators ...

What are the Cycle based simulators Cycle based simulators are more like a high speed electric carving knife in comparison since they focus on a subset of the biggest problem:

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