Sentence examples for negligible computational complexity from inspiring English sources

The performance of the proposed equalizer is also evaluated for sparse channels and it is shown that its performance in sparse channels is superior to its performance in equivalent dense, or nonsparse, channels, (equivalent dense channels will be explained in Section 7) with a negligible computational complexity increase.

Using the step size following the diminishing step size policy as in (21), this subgradient method above can be used to calculate the optimal (boldsymbol {Z}_{2}^) with negligible (linear) computational complexity [33].

To go further, with (47), a stochastic power and time allocation algorithm with negligible (linear) computational complexity can be brought forward to approach the global solution, shown in Algorithm 1.

The HNN MLSE equalizer was evaluated for sparse channels and it was shown that its performance was better compared to its performance in equivalent dense channels, with a negligible increase in computational complexity.

Simultaneously, these methods should aim at achieving reasonable computational complexity, negligible performance degradation of the SU transmission, and low energy costs.

Numerical results demonstrate that our proposed AUHP algorithm enables a lower computational complexity with negligible spectral efficiency performance degradation.

Experimental results show that the proposed algorithm can reduce about 66% computational complexity with negligible rate-distortion (RD) performance loss in comparison with the original 3D-HEVC encoder.

It will be demonstrated in Section 5 through numerical simulations that such an approximation results in negligible performance loss while reducing the computational complexity significantly.

Given those faulty cipher texts, the computational complexity of attacks is negligible.

In other words, the computational complexity of inversion operation is negligible.

Simulation results show that the proposed scheduling algorithm with a new pilot scheme reduces computational complexity and pilot overhead with negligible performance degradation compared to the exhaustive scheduling with a conventional pilot scheme.