Haar transformation of linear boolean function

Haar transform is known to have the smallest computational requirement with a considerable interest and attraction drawn towards its spectral properties of Boolean functions. This paper presents Haar transform of Linear Boolean functions, where by the discussion is based on the transformation f...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Mohamed Rafiq, Hashum, Siddiqi, Muhammad Umar
التنسيق: Conference or Workshop Item
اللغة:English
منشور في: 2009
الموضوعات:
الوصول للمادة أونلاين:http://irep.iium.edu.my/6506/1/Haar_Transformation_of_Linear_Boolean_Function.pdf
http://irep.iium.edu.my/6506/
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5166899&tag=1
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
الوصف
الملخص:Haar transform is known to have the smallest computational requirement with a considerable interest and attraction drawn towards its spectral properties of Boolean functions. This paper presents Haar transform of Linear Boolean functions, where by the discussion is based on the transformation from the Boolean domain to the Haar domain. The resulting spectrum is given with the corresponding calculations presented, while the analysis of the respective spectral coefficients and their general properties being explored. Furthermore, the general formulation and/or equation derivation for the transformation is introduced.