The computing complexity of the SDVA-DFE can be reduced by proposed double radius constraints, upper radius (UR) and lower radius (LR).
The branch-and-bound algorithm computes the largest simplex by using lower and upper bounds on the radius of the inscribed ball, by which the computation time is reduced by a factor of five in comparison with the brute-force search.
As it shows, L i /K will decrease when the variable E b /N0 increases, which also means the upper bound for the radius of solution space has a self-adaption capability in accordance with E b /N0.
where L i is the upper bound for the radius of this solution space in the current information symbol duration ((i – 1)T f < t < iT f ), and it can be determined by the number of discordant components in these three K-dimensional vectors L i = 3 K − ∑ i = 1 K x 1 i + x 2 i + x 3 i 2. (2.).
The area within the circular window varied in size from zero to some upper limit (a maximum radius of the circular window set in virtue of the proportion of the whole population) specified by the user, never including > 50% of the total population.
In this paper, some new upper bounds on the spectral radius of the Hadamard product of two nonnegative matrices and some upper and lower bounds on the spectral radius of the iterative matrix of a nonsingular M-matrix are given.
According to the above results, we present upper bounds on the spectral radius of weakly symmetric nonnegative tensors and show that the results are sharper than the upper bounds provided by [1, 8, 10 12, 14] in Example 2.
Given a finite set of points on the Euclidean sphere, the worst case quadrature error for functions in Sobolev spaces has recently been shown to provide upper bounds on the covering radius of the point set.
Fig. 10 Mass loading and effective radius of suppressed upper cloud boundary simulation.
Furthermore, we obtain upper bounds for the spectral radius of weakly symmetric nonnegative tensors, which are sharper than existing results.
