DocumentCode
1713949
Title
Discrete orthogonal transforms based on Fibonacci-type recursions
Author
Egiazarian, Karen ; Astola, Jaakko
Author_Institution
Signal Process. Lab., Tampere Univ. of Technol., Finland
fYear
1996
Firstpage
405
Lastpage
408
Abstract
The idea of unified Fibonacci-type topology is used for construction of wide classes of discrete orthogonal transforms, including Rademacher-Fibonacci, Walsh-Fibonacci, Haar-Fibonacci-type transforms, etc. Efficient algorithms for proposed transforms directly related with the generalized Fibonacci topology are derived. The generation of discrete wavelets and wavelet packets based on Fibonacci-type recursions is established
Keywords
Boolean algebra; signal processing; signal synthesis; transforms; wavelet transforms; Fibonacci-type recursions; Haar-Fibonacci-type transform; Rademacher-Fibonacci transform; Walsh-Fibonacci transform; algorithms; discrete orthogonal transforms; discrete wavelets; generalized Fibonacci topology; signal processing; signal synthesis; unified Fibonacci-type topology; wavelet packets; Digital signal processing; Discrete transforms; Discrete wavelet transforms; Hypercubes; Laboratories; Matrix decomposition; Network topology; Signal processing algorithms; Tree graphs; Wavelet packets;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Signal Processing Workshop Proceedings, 1996., IEEE
Conference_Location
Loen
Print_ISBN
0-7803-3629-1
Type
conf
DOI
10.1109/DSPWS.1996.555547
Filename
555547
Link To Document