Skip to main content

Table 2 Search space of optimization methods

From: Environment-Adaptable Fast Multi-Resolution (EAF-MR) optimization in large-scale RF-FPGA systems

Optimization

Search space

No. simulations

method

 

per iteration when

  

K=3, C k =3, N(k,l)=7

Exhaustive search

\(O\left (2^{\sum _{l} \sum _{k} N(k, l)}\right)\)

23×3×7=263=9.22×1018

Simulated annealing

\(O\left (2^{\sum _{l} \sum _{k} N(k, l)}\right)\)

≤ 9.22×1018

search

  

Local relaxation search

\( O\left (\sum _{k} 2^{\sum _{l} N(k, l)}\right)\)

3×23×7=6.29×106

EAF optimization

\( O\left (\sum _{k} 2^{\sum _{l} N(k, l)}\right)\)

≤ 3×23×7=6.29×106

Multi-resolution search

\(O\left (\sum _{l} \sum _{k} 2^{N(k, l)}\right)\)

1.15×103

EAF-MR optimization

\(O\left (\sum _{l} \sum _{k} 2^{N(k, l)}\right)\)

≤ 1.15×103