A modified approach to determine the most appropriate spreading codes for a DS/CDMA system with exponentially weighted despreading sequences


Crftlikli C., Develi I.

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, cilt.19, ss.1041-1057, 2003 (SCI İndekslerine Giren Dergi) identifier

  • Cilt numarası: 19 Konu: 6
  • Basım Tarihi: 2003
  • Dergi Adı: JOURNAL OF INFORMATION SCIENCE AND ENGINEERING
  • Sayfa Sayıları: ss.1041-1057

Özet

Exponential chip weighting waveform used in a direct sequence/code division multiple access (DS/CDMA) receiver is an effective method to reject multiple access interference (MAI). Recently, we introduced a strategy to determine the most appropriate spreading codes (MASC) which might be used as references in a given code set for a DS/CDMA system employing exponentially weighted despreading sequences. In the strategy it was shown that lower bit error rates might be achieved when the MASC, which were differentiated by the strategy, are used as references. The main limitation of the strategy was the requirement for dividing a code set into sub-sets to distinguish the resultant MASC. In this study, we present a modified approach that eliminates this requirement and also simplifies the determination of the MASC by ignoring one of the calculations, which was taken into consideration in the previous strategy on the features of the spreading codes in a given code set. Numerical results show that the MASC for a given code set can be detected simply and precisely by using the proposed approach.
Exponential chip weighting waveform used in a direct sequence/code division multiple access (DS/CDMA) receiver is an effective method to reject multiple access interference (MAI). It has recently been introduced as a strategy to determine the most appropriate spreading codes (MASC) which might be used as references in a given code set for a DS/CDMA system employing exponentially weighted despreading sequences. In the strategy it was shown that lower bit error rates might be achieved when the MASC, which were differentiated by the strategy, are used as references. The main limitation of the strategy was the requirement for dividing a code set into sub-sets to distinguish the resultant MASC. In this study, we present a modified approach that eliminates this requirement and also simplifies the determination of the MASC by ignoring one of the calculations, which was taken into consideration in the previous strategy on the features of the spreading codes in a given code set. Numerical results show that the MASC for a given code set can be detected simply and precisely by using the proposed approach.