We note that because the complexity is fixed with such a detector, the exposed optimizations guarantee a performance gain for a given neighborhood size or a reduction of the neighborhood size for a given bit error rate (BER) target.
In order to see that, we note that because, the right-hand side (RHS) of (6l) is less than or equal to the RHS of (6g), and for any, the left-hand side (LHS) of (6l) is greater than the LHS of (6g).
Then and hence, by Theorem 2.13, we obtain Next, we note that is solution of (3.2) because (3.3).
Then and hence, by Theorem 2.13, we obtain Next, we note that is solution of (3.2) because (3.3) (ii) Define and since we have.
We note that, because the mapping in Lemma 3.2 belongs to.
However, we note that, because the Hessian matrix depends on the nonlinear model parameters as well as GGD noise parameters, maximization of the Fisher Information Matrix constitutes high variance bounds.
We note that, because of the steep monotonic rise of the solution, the oscillations are manifested as a sequence of inflection points rather than as a sequence of extrema.
We note that because the PML condition is applied only once, during the last of the iterations (see Eq. 19), the additional cost of introducing the PML is negligibly small.
First, we note that, because the integration range is larger than the region y min ′ ≤ Δ t j E i α j ≤ y max ′, the approximations (1) and (21) can not be used to simplify (29).
Finally, we note that because the reference lattice contains 14 site locations in each unit cell where measurements are taken, it is highly unlikely that we could be forcing one of the sites (such as a systematic 2a distortion) to be at an incorrect location.
