• DocumentCode
    1264177
  • Title

    A tensor product factorization of the linear convolution matrix

  • Author

    Granata, J. ; Conner, M. ; Tolimieri, R.

  • Author_Institution
    Center for Large-Scale Comput., City Univ. of New York, NY, USA
  • Volume
    38
  • Issue
    11
  • fYear
    1991
  • fDate
    11/1/1991 12:00:00 AM
  • Firstpage
    1364
  • Lastpage
    1366
  • Abstract
    A tensor product representation of the Agarwal-Burns nesting scheme is presented. In addition to providing a highly compact representation of this approach to nesting, it is shown that the tensor product approach provides the structure needed to easily derive several variant schemes that are well suited for use on vector processor and multiprocessor computers
  • Keywords
    mathematics computing; matrix algebra; Agarwal-Burns nesting scheme; linear convolution matrix; multiprocessor computers; tensor product factorization; vector processor; Algebra; Convolution; Discrete Fourier transforms; Matrix decomposition; Polynomials; Programming profession; Signal processing algorithms; Sparse matrices; Tensile stress; Vector processors;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.99165
  • Filename
    99165
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1264177