1-D and 2-D algorithms for orthogonal transformations

Michael J. Corinthios and Youssef Geadah

Mathematics and Computers in Simulation (MATCOM), 1985, vol. 27, issue 5, 441-452

Abstract: Algorithms for orthoganal transformations of one-dimensional and two-dimensional signals are presented. These algorithms are well suited for the implementation of parallel high speed VLSI signal processors. In particular they are characterized by their constant geometry accessing as well as storing of data. Such property leads to a uniformity of signal paths with a potential toward improved VLSI implementation and lead to highly parallel and multiprocessing architectures.

Date: 1985
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475485900631
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:27:y:1985:i:5:p:441-452

DOI: 10.1016/0378-4754(85)90063-1

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().