Spectral analysis of Boolean functions as a graph eigenvalue problem

doi:10.1109/12.755000

Spectral analysis of Boolean functions as a graph eigenvalue problem

1999-03-01

61

PRE

AI

DOI：10.1109/12.755000

Original

Original request for help

Save

Abstract

En 中文

Several problems in digital logic can be conveniently approached in the spectral domain. In this paper we show that the Walsh spectrum of Boolean functions can be analyzed by looking at algebraic properties of a class of Cayley graphs associated with Boolean functions. We use this idea to investigate the Walsh spectrum of certain special functions.

Keywords:

Boolean function

graph eigenvalue

Cayley graph

Walsh spectrum

spectral coefficient

Spectral analysis of Boolean functions as a graph eigenvalue problem

Abstract

Journal

Organization