Skip to main content
SpringerLink
Log in

A block matrix representation of permutation networks

  • Articles
  • Published:
Circuits, Systems and Signal Processing Aims and scope Submit manuscript

Abstract

This work provides a mathematical framework for topologically-independent analysis of permutation networks. First, a structure-dependent representation is provided using matrices whose entries are switching expressions. Then, a transformation is presented which maps these matrices into structure-independent representations which are matrices whose entries are 0/1 matrices. Algebraic tools for manipulating the second type of matrices are also provided. Notions such as permutations realizable by a network, the rearrangeability property, and series and parallel connections of networks are defined and discussed with regard to the proposed representations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K. J. Thurber, “Interconnection Networks—A Survey and Assessment,” in Proc. 1974 NCC, AFIPS, Vol. 43, Jun. 1974, pp. 909–919.

    Google Scholar 

  2. H. J. Siegel, R. J. McMillen, and P. T. Mueller, Jr., “A Survey of Inter-connection Methods for Reconfigurable Parallel Processing Systems,” in Proc. 1979 NCC, AFIPS, Vol. 48, Jun. 1979, pp. 387–400.

    Google Scholar 

  3. G. A. Anderson and E. D. Jensen, “Computer Interconnection Structures: Taxonomy, Characteristics, and Examples,” ACM Comput. Surveys, Vol. 7, Dec. 1975, pp. 197–213.

    Google Scholar 

  4. A. E. Joel, Jr., “On Permutation Switching Networks,” Bell System Tech. Journal, Vol. 43, Jun. 1968, pp. 813–822.

    Google Scholar 

  5. D. K. Pradham and K. L. Kodandapani, “A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD Machines,” IEEE Trans. Comput., Vol. C-29, Sep. 1980, pp. 771–791.

    Google Scholar 

  6. S. K. Afshar, “Switching Matrix Representation of Permutation Networks with Applications,” Dept. of Electrical Engineering, Louisiana State University, Tech. Report EE 705, Apr. 1981.

  7. C. L. Wu and T. Y. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Comput., Vol. C-29, Aug. 1980, pp. 694–702.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Louisiana State University, 70803, Baton Rouge, Louisiana, USA

    Siroos Afshar

Authors
  1. Siroos Afshar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Afshar, S. A block matrix representation of permutation networks. Circuits Systems and Signal Process 1, 251–266 (1982). https://doi.org/10.1007/BF01600055

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01600055

Keywords

Search

Navigation