Shared Variable Extraction and Hardware Implementation for Nonlinear Boolean Functions Based on Swarm Intelligence

Algorithm 1

Pseudocode description of SVE-PSO algorithm.

Input: Term 1, Term 2, …, TermN; n; k_max; fit; min_sup; V_max.

Begin

Begin Initialization

basic parameters setting

and-term database encoding

undirected graph stabling

End Initialization

Start:

= v, = x

Search the nodes of undirected graph

If ( in the shortest_swapping_order)

Swapping with

Extract the associate terms from candidate set and calculate the value of fitness value

Refresh and

Else

Refresh and

If (optimal number of candidate set reaches the maximum)

If (valid associate term)

Output the term

Else

If (having searched all particles)

Break the loop

Else

Refresh and

Else

Chang the association logic

End

Output: all association items in Boolean variables A₁, A₂, …, A_t.