ABSTRACT

This reference presents a more efficient, flexible, and manageable approach to unitary transform calculation and examines novel concepts in the design, classification, and management of fast algorithms for different transforms in one-, two-, and multidimensional cases. Illustrating methods to construct new unitary transforms for best algorithm sele

chapter 1|28 pages

Basic Concepts and N otation

chapter 2|51 pages

Discrete Transform Tensor Representations

chapter |7 pages

Bibliography

chapter 3|52 pages

Discrete Transform Paired Representations

chapter |4 pages

Bibliography

chapter 4|70 pages

4Mu ltip le Paired U nitary Transform s

chapter |4 pages

Bibliography

chapter 5|64 pages

Fast 1 -D Transform s

5.1 Basic statutes

chapter |6 pages

Bibliography

chapter 6|79 pages

Fast 2 -D Discrete U nitary Transform s

chapter |11 pages

Bibliography

chapter 7|26 pages

Paired A lgorithm s

part |2 pages

Bibliography

part |2 pages

Bibliography