• DocumentCode
    765144
  • Title

    Highly parallel representations for linear maps

  • Author

    Aravena, J.L. ; Porter, W.A.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA
  • Volume
    139
  • Issue
    3
  • fYear
    1992
  • fDate
    5/1/1992 12:00:00 AM
  • Firstpage
    173
  • Lastpage
    178
  • Abstract
    A class of computationally-fast linear (CFL) transformations described have particularly efficient implementations in dedicated arrays with a small local memory. Using the least squares approximation technique, the paper develops an optimal orthogonal decomposition of arbitrary linear transformations in terms of these new CFL maps. The representation has a natural realisation in terms of parallel arrays. For an n*n transformation, square root (n) parallel units at most are required for an exact representation.
  • Keywords
    computational complexity; computerised signal processing; parallel algorithms; least squares approximation; linear maps; optimal orthogonal decomposition; parallel arrays; parallel representations; transformations;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings E
  • Publisher
    iet
  • ISSN
    0143-7062
  • Type

    jour

  • Filename
    141532
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=765144