Publica
Hier finden Sie wissenschaftliche Publikationen aus den FraunhoferInstituten. Iterative algorithm for finding optimal resource allocations in symbolasynchronous CDMA channels with different SIR requirements
 Matthews, M.B. ; Naval Postgraduate School, Monterey/Calif.: ThirtySixth Asilomar Conference on Signals, Systems & Computers 2002. Conference record. Vol.2 : November 3  November 6, 2002, Pacific Grove, California Piscataway, NJ: IEEE Operations Center, 2002 ISBN: 0780375769 pp.19091913 
 Asilomar Conference on Signals, Systems and Computers <36, 2002, Pacific Grove/Calif.> 

 English 
 Conference Paper 
 Fraunhofer HHI () 
Abstract
We consider the problem of admissibility in a symbolasynchronous CDMA (ACDMA) channel with random signal delays and different SIR requirements. We say that users are admissible in a CDMA channel with the power constraints if one can assign sequences to the users and control their power so that each user meets its SIR requirement. The problem is shown to be equivalent to minimizing the spectral radius of a certain primitive matrix with respect to all sequence sets. Since a closed form solution is notoriously difficult to obtain, we propose an iterative algorithm that is shown to monotonically converge to a local minimum.