Decision Diagram based Computation of Lineary Independent Ternary Aritmetic Transform Spectra
- Lozano Cicilia C,
- Bohdan J Falkowski,
- Tadeusz Łuba
Classes of fastest linearly independent ternary arithmetic (FLITA) expansions have been proposed recently. They operate in arithmetic domain and have been shown to be useful for optimization of ternary functions representation. All FLITA transforms possess fast forward and inverse transforms and therefore can be calculated by fast transform method. However, it has been shown that for manipulation of large functions it is more advantageous to start from decision diagrams rather than truth vector. Hence in this paper new algorithm to obtain FLITA spectrum from ternary decision diagram is presented. It is developed based on the new notations for spectrum of an FLITA transform introduced here. The algorithm derives each spectral coefficient independently from each other, allowing the coefficients to be calculated in parallel manner. By starting from decision diagram, the algorithm enables the FLITA expansion to be computed for large functions for which the fast transform based algorithm may fail.
- Record ID
- Stewart Robert, Robert Stewart Weiss Stephan Stephan Weiss (eds.): Proceedings of the 17th European Signal Processing Conference, 2009, European Association for Signal Processing, 2692 p.
- http://www.eurasip.org/Proceedings/Eusipco/Eusipco2009/contents/papers/1569191138.pdf Opening in a new tab
- (en) English
- File: 1
- Score (nominal)
- Uniform Resource Identifier
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.