High-Level Synthesis under Fixed-Point Accuracy Constraint

Algorithm 3

Tabu search for solution improvement in WL optimization.

(1): 𝐰=𝐰_min

(2): 𝐶_opt=𝐶(𝐰)

(3): 𝐰_opt←∅

(4): 𝑇←∅ {tabuoperators}

(5): d ←(𝜆(𝐰)>𝜆_min)?−1∶1 {directionselection}

(6): while  |𝑇|<𝑁  do

(7): for  all  1≤𝑘∉𝑇≤𝑁  do  {computationof∇𝑘}

(8):  𝐰_Δ←𝐰

(9):  if  d>0∧𝐰(𝑘)<𝐰^max(𝑘)  then

(10):   𝐰_Δ(𝑘)←𝐰(𝑘)+1

(11):  else  if d<0∧𝐰(𝑘)>𝐰^min(𝑘)  then

(12):   𝐰_Δ(𝑘)←𝐰(𝑘)−1

(13):  else

(14):   𝑇←𝑇∪{𝑘}

(15):  end  if

(16):  if  𝑘∉𝑇  then  {Computationofthemetricfordirectionselection}

(17):   ∇_𝑘←𝑓_dir(𝐰_Δ,𝐰)

(18):   if  𝜆(𝐰_Δ)>𝜆_min  then

(19):    update of  𝐶_opt and 𝐰_opt  if necessary

(20):   end  if

(21):  end  if

(22): end  for

(23): if  |𝑇|=𝑁  then  {allthevariableareinthetabulist}

(24):   stop

(25): end  if

(26): if  d>0  then   {selectionofthebestsolution}

(27):  𝑗←argmax∇_𝑘

(28):  𝐰(𝑗)←𝐰(𝑗)+1

(29):  if  𝜆(𝐰)>𝜆_min  then

(30):   d←−1 {changeofdirectionif𝜆_minisnowfulfilled}

(31):   𝑇←𝑇∪{𝑗}

(32):  end  if

(33): else

(34):  𝑗←argmin∇_𝑘

(35):  𝐰(𝑗)←𝐰(𝑗)−1

(36):  if  𝜆(𝐰)<𝜆_min  then

(37):    𝑑←1 {changeofdirectionif𝜆_minisnolongerfulfilled}

(38):  end  if

(39):  end  if

(40): end  while

(41): return  𝐰_opt