• DocumentCode
    1320128
  • Title

    Notes on shuffle/exchange type permutation sets

  • Author

    Huang, Shing-Tsaan

  • Author_Institution
    Inst. of Comput. Sci., Nat. Tsing Hua Univ., Taiwan
  • Volume
    39
  • Issue
    7
  • fYear
    1990
  • fDate
    7/1/1990 12:00:00 AM
  • Firstpage
    962
  • Lastpage
    965
  • Abstract
    Properties of some shuffle/exchange type permutation sets are studied from operational points of view. The permutation sets studied are Ω, Ω-1, Ψ, L, and U; Ω and Ω-1 are, respectively, the omega and inverse omega permutation sets, Ω≡(Ω∩Ω-1); and L and U are, respectively, the admissible lower and upper triangular permutation sets. Several intuitive operations are introduced. Based on these operations, important known results relating to these sets are readdressed. The recursive nature of the sets is also discussed
  • Keywords
    multiprocessor interconnection networks; intuitive operations; shuffle/exchange type permutation sets; Boolean functions; Computer science; Councils;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.55699
  • Filename
    55699