Representations of Discrete Functions
Representations of Discrete Functions
Implementation of Relational Algebra Using Binary Decision Diagrams
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Fourier Analysis on Finite Groups with Applications in Signal Processing and System Design
Fourier Analysis on Finite Groups with Applications in Signal Processing and System Design
QMDD: A Decision Diagram Structure for Reversible and Quantum Circuits
ISMVL '06 Proceedings of the 36th International Symposium on Multiple-Valued Logic
XML Framework for Various Types of Decision Diagrams for Discrete Functions
IEICE - Transactions on Information and Systems
A Heterogeneous Decision Diagram Package
Computer Aided Systems Theory - EUROCAST 2009
Heterogeneous Decision Diagrams for Applications in Harmonic Analysis on Finite Non-Abelian Groups
ISMVL '10 Proceedings of the 2010 40th IEEE International Symposium on Multiple-Valued Logic
| Hi-index | 0.00 |
The Fourier transform is a classical method in mathematical modeling of systems. Assuming finite non-Abelian groups as the underlying mathematical structure might bring advantages in modeling certain systems often met in computer science and information technologies. Frequent computing of the inverse Fourier transform is usually required in dealing with such systems. These computations require for each function value to compute many times traces of certain matrices. These matrices are products of matrix-valued entries of unitary irreducible representations and matrix-valued Fourier coefficients. In the case of large non-Abelian groups the complexity of these computations can be a limiting factor in applications. In this paper, we present a method for speeding-up computing the traces by using decision diagrams to operate on matrix-valued group representations and related Fourier coefficients.