Reflection Reduction on DDR3 High-Speed Bus by Improved PSO

Algorithm 1

Pseudocode for the position update procedure.

Procedure

  Assume 𝑥^𝑛_{𝑖_𝑘}=𝑥^𝑛_𝑖[𝑚]; // according to formula (20)

  if (1≤𝑛≤8)

   𝑥^𝑛_{𝑖_𝑘+1}=𝑥^𝑛_{𝑖_𝑘}+𝑣^𝑛_{𝑖_𝑘+1};

  end if

  else if (

       (9≤𝑛≤12 && 𝑣^𝑛_{𝑖_𝑘+1}=0)(𝑚=0&&𝑣^𝑛_{𝑖_𝑘+1}=−1)

       (𝑚=1&&(𝑛=9or10)&&𝑣^𝑛_{𝑖_𝑘+1}=1)

       (𝑚=3 && (𝑛=11 or 12) && 𝑣^𝑛_{𝑖_𝑘+1}=1)

    )

    𝑥^𝑛_{𝑖_𝑘+1}=𝑥^𝑛_{𝑖_𝑘};

  end if

  else if (9≤𝑛≤12 && 𝑣^𝑛_{𝑖_𝑘+1}=1)

    𝑥^𝑛_{𝑖_𝑘+1}=𝑥^𝑛_𝑖[𝑚+1];

  end if

  else if (9≤𝑛≤12 && 𝑣^𝑛_{𝑖_𝑘+1}=−1)

    𝑥^𝑛_{𝑖_𝑘+1}=𝑥^𝑛_𝑖[𝑚−1];

  end if

end procedure