Research Article

High-Level Synthesis under Fixed-Point Accuracy Constraint

Algorithm 2

Mildest-ascent greedy algorithm for WL Optimization.
  𝐰 ← 𝐰 π‘š 𝑀 𝑐
 while   πœ† ( 𝐰 ) < πœ† m i n   do
  for   𝑖 = 0 … 𝑁 𝑔 βˆ’ 1   do
    𝐰 Ξ” ← 𝐰
    𝐰 Ξ” ( 𝐒 ) ← 𝐰 ( 𝑖 ) + 1
    βˆ‡ 𝑖 ← ( ( πœ† ( 𝐰 Ξ” ) βˆ’ πœ† ( 𝐰 ) ) ) / ( ( 𝐢 ( 𝐰 Ξ” ) βˆ’ 𝐢 ( 𝐰 ) ) )
  end  for
   π‘˜ ← a r g m a x 𝑖 ( βˆ‡ 𝑖 )
   𝐰 ( 𝐀 ) ← 𝐰 ( π‘˜ ) + 1
 end  while
  𝐰 𝐦 𝐒 𝐧 = 𝐰