Chaos-based spreading sequences for DS-CDMA have been recently proposed and their performance investigated in an asynchronous environment, with particular emphasis on co-channel interference evaluation and synchronization between spreading and despreading sequences. In many cases this approach to sequence generation resulted in a non-negligible increase in performance with respect to the classical ones. In this paper, a novel lower bound on co-channel interference is derived which is, together with the upper bounds already developed in literature, of particular interest when thinking of performance optimization by sequence selection
Upper and lower performance bounds for chaos-based asynchronous DS-CDMA systems
SETTI, Gianluca;MAZZINI, Gianluca;
1999
Abstract
Chaos-based spreading sequences for DS-CDMA have been recently proposed and their performance investigated in an asynchronous environment, with particular emphasis on co-channel interference evaluation and synchronization between spreading and despreading sequences. In many cases this approach to sequence generation resulted in a non-negligible increase in performance with respect to the classical ones. In this paper, a novel lower bound on co-channel interference is derived which is, together with the upper bounds already developed in literature, of particular interest when thinking of performance optimization by sequence selectionFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
