Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

A new time domain, multistage permutation algorithm (switching systems)

By: Sauer, J.R.; Jordan, H.F.; Ramanan, S.V.;

1990 / IEEE

Description

This item was taken from the IEEE Periodical ' A new time domain, multistage permutation algorithm (switching systems) ' It is shown that a frame of N time slots can be arbitrarily permuted with 2log/sub 2/N-1 controlled exchange switches with associated delay elements. This is an improvement over previously known interconnection networks that require O(N) exchange elements. The proof utilizes the recursive algorithm of V.E. Benes (1965) and the time interchange properties of a particular configuration of a single exchange element. The architecture is especially applicable in optical systems, since optical exchange switches are among the simplest optical logic devices to build, are inherently very fast, and are the best developed, although expensive.<>