0% found this document useful (0 votes)
331 views3 pages

An N Input Omega Network Has Loga N Stages

An n input omega network has log(n) stages and can implement n^2/2 permutations in a single pass using 2x2 switch boxes. For a 16 input omega network with 2x2 switches, this means it can implement 16^2/2 = 256 of the total 16! = 20,922,789,888 permutations in one pass. A permutation is an ordered arrangement of items in a set, and the number of permutations of a set of N items is N factorial.

Uploaded by

rajsingh11
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
331 views3 pages

An N Input Omega Network Has Loga N Stages

An n input omega network has log(n) stages and can implement n^2/2 permutations in a single pass using 2x2 switch boxes. For a 16 input omega network with 2x2 switches, this means it can implement 16^2/2 = 256 of the total 16! = 20,922,789,888 permutations in one pass. A permutation is an ordered arrangement of items in a set, and the number of permutations of a set of N items is N factorial.

Uploaded by

rajsingh11
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

An n input omega network has loga n stages.

The stages labeled from 0 to log(n-1)


from input end to out end. If 2x2 switch boxes are used, an n input omega network
can implement nn/2 permutation in single pass. There are n! Permutations in total.

For n=16 with 2x2 switch, this implies that 1616/2 /16! of all permutations can be
implemented in a single pass through a 16 input omega network.

The permutation of a set is the number of ways that the items in the set can be
uniquely ordered. For example, the permutations of the set { 1, 2, 3} are { 1, 2, 3},
{ 1, 3, 2}, { 2, 1, 3}, { 2, 3, 1}, { 3, 1, 2} and { 3, 2, 1}. For N objects, the number
of permutations is N! (N factorial, or 1 * 2 * 3 * ... N).
For 4x4 switches

You might also like