• DocumentCode
    947864
  • Title

    Systolic computation of the running min and max

  • Author

    Butz, A.R.

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL, USA
  • Volume
    29
  • Issue
    17
  • fYear
    1993
  • Firstpage
    1547
  • Lastpage
    1548
  • Abstract
    A method of computing the running min and max, requiring non fan-in and hence compatible with systolic implementation, is proposed. The time period complexity for the computation of the running min and max, or for more general rank order functions expressible in terms of min and max functions, is O(b), where b is the word length.<>
  • Keywords
    computational complexity; filtering and prediction theory; parallel algorithms; pipeline processing; systolic arrays; max functions; min functions; rank order functions; running max; running min; time period complexity; word level pipelining;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19931031
  • Filename
    234383
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=947864