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 some functions. Moreover, the presented algorithm requires very low memory storage.
- The Institute of Electronics, Information and Communication Engineersの論文
著者
-
FALKOWSKI Bogdan
School of Electrical & Electronic Engineering, Nanyang Technological University
-
Falkowski Bogdan
School of Electrical and Electronic Engineering, Nanyang Technological University
-
Lozano Cicilia
School of Electrical and Electronic Engineering, Nanyang Technological University
-
Rahardja Susanto
Institute for Infocomm Research
関連論文
- Comparative Study of Discrete Orthogonal Transforms in Adaptive Signal Processing (Special Section on Digital Signal Processing)
- Relationship between Haar and Reed-Muller spectral and functional domains
- Calculation of best fixed polarity Reed-Muller transform over GF(5)
- Application of modified sign Haar transform in logic functions