Calculation of best fixed polarity Reed-Muller transform over GF(5)
نویسندگان
چکیده
منابع مشابه
Calculation of best fixed polarity Reed-Muller transform over GF(5)
In this article, a new algorithm that takes the truth vector of a 5-valued function as its input and proceeds to generate all of the function’s fixed polarity Reed-Muller (FPRM) spectral coefficient vectors one by one in a certain sequence is presented. The experimental results for this algorithm are compared with other methods and it was found that it is more efficient than other methods for s...
متن کاملNew Ternary Fixed Polarity Linear Kronecker Transforms and Their Comparison with Ternary Reed-muller Transform
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed-Muller t...
متن کاملTernary Fixed Polarity Linear Kronecker Transforms and their Comparison with Ternary Reed-muller Transform
Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed–Muller t...
متن کاملFast computing of the positive polarity Reed - Muller transform over GF ( 2 ) and GF ( 3 )
The problem of efficient computing of binary and ternary positive (or zero) polarity Reed-Muller (PPRM) transform is important for many areas. The matrices, determining these transforms, are defined recursively or by Kronecker product. Using this fact, we apply the dynamic-programming strategy to develop three algorithms. The first of them is a new version of a previous our algorithm for perfor...
متن کاملOptimisation of Mixed Polarity Reed-Muller Functions
This paper presents a genetic algorithm (GA) search method in order to obtain better circuit implementation of the mixed polarity Reed-Muller functions. By combining global searching ability of genetic algorithm and local searching ability of simulated annealing, the proposed GA method could achieve fast convergence. It differs to traditional genetic algorithm, in which the proposed GA forms an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2004
ISSN: 1349-2543
DOI: 10.1587/elex.1.92