• DocumentCode
    2659376
  • Title

    Algorithm and architecture for Gray code ordered fast Walsh transform

  • Author

    Falkowski, Bogdan J. ; Perkowski, Marek A.

  • Author_Institution
    Dept. of Electr. Eng., Portland State Univ., OR, USA
  • fYear
    1990
  • fDate
    1-3 May 1990
  • Firstpage
    1596
  • Abstract
    The generation of two new Walsh transforms in Gray code orderings from the straight binary code is shown. A recursive algorithm for Gray-code-ordered Walsh transforms is based on a novel operator called the bisymmetrical pseudo Kronecker product. The recursive algorithm is the basis for the flow diagram of a constant geometry fast Walsh transform in Gray code ordering. The algorithm is fast (N log 2 N additions/subtractions), is computer efficient, and is implemented in the iterative architecture
  • Keywords
    iterative methods; signal processing; transforms; Gray code orderings; bisymmetrical pseudo Kronecker product; computer efficient; fast Walsh transform; iterative architecture; recursive algorithm; straight binary code; Application software; Binary codes; Computer architecture; Digital communication; Digital images; Geometry; Image analysis; Iterative algorithms; Reflective binary codes; Signal generators;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1990., IEEE International Symposium on
  • Conference_Location
    New Orleans, LA
  • Type

    conf

  • DOI
    10.1109/ISCAS.1990.112441
  • Filename
    112441
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2659376