1-D and 2-D algorithms for orthogonal transformations
From MaRDI portal
Publication:1066620
DOI10.1016/0378-4754(85)90063-1zbMath0578.65035OpenAlexW2058401203MaRDI QIDQ1066620
Michael J. Corinthios, Youssef Geadah
Publication date: 1985
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-4754(85)90063-1
Fourierorthogonal transformationsHadamardKarhunen-Loeveparallel high speed VLSI signal processorsuniversal processing elementWalsh
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- A Parallel Radix-4 Fast Fourier Transform Computer
- Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform
- The Design of a Class of Fast Fourier Transform Computers
- On coding and filtering stationary signals by discrete Fourier transforms (Corresp.)
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: 1-D and 2-D algorithms for orthogonal transformations