Adaptive interference suppression for CDMA systems with a worst-case error criterion

2000 ◽  
Vol 48 (1) ◽  
pp. 284-289 ◽  
Author(s):  
S. Nagaraj ◽  
S. Gollamudi ◽  
S. Kapoor ◽  
Yih-Fang Huang ◽  
J.R. Deller
Keyword(s):  
Interference Suppression ◽  
Error Criterion ◽  
Worst Case ◽  
Cdma Systems ◽  
Adaptive Interference Suppression

Fixed Points- Noncontractive Functions

2001 ◽  
Author(s):  
Krzysztof A. Sikorski
Keyword(s):  
Fixed Points ◽  
Absolute Error ◽  
Small Error ◽  
Homotopy Continuation ◽  
Average Case Analysis ◽  
Error Criterion ◽  
Worst Case ◽  
Average Case ◽  
Worst Case Complexity ◽  
Exponential Complexity

In this chapter we consider the approximation of fixed points of noncontractive functions with respect to the absolute error criterion. In this case the functions may have multiple and/or whole manifolds of fixed points. We analyze methods based on sequential function evaluations as information. The simple iteration usually does not converge in this case, and the problem becomes much more difficult to solve. We prove that even in the two-dimensional case the problem has infinite worst case complexity. This means that no methods exist that solve the problem with arbitrarily small error tolerance for some “bad” functions. In the univariate case the problem is solvable, and a bisection envelope method is optimal. These results are in contrast with the solution under the residual error criterion. The problem then becomes solvable, although with exponential complexity, as outlined in the annotations. Therefore, simplicial and/or homotopy continuation and all methods based on function evaluations exhibit exponential worst case cost for solving the problem in the residual sense. These results indicate the need of average case analysis, since for many test functions the existing algorithms computed ε-approximations with polynomial in 1/ε cost.

Sign in / Sign up

Export Citation Format

Share Document