DocumentCode :
1190353
Title :
Designing DS-CDMA spreading sequences via a low-complexity deterministic approach
Author :
Dyer, Justin S. ; Natarajan, Balasubramaniam
Author_Institution :
Dept. of Stat., Stanford Univ., CA
Volume :
6
Issue :
1
fYear :
2007
Firstpage :
302
Lastpage :
312
Abstract :
This paper presents a novel deterministic technique for the generation of DS-CDMA signature sequences with a wide range of correlation properties that is based on a trellis structure and a trellis-exploration algorithm. A low-complexity implementation of the algorithm is then derived by decomposing the calculation of the metric used to generate the codeset. This approach provides a fast method of generating binary or polyphase codes with no inherent constraints on code length or size of the codeset. In addition, the algorithm is iterative and provides increasingly better codes in terms of average mean-square aperiodic correlation properties as the number of iterations increases. The algorithm is shown to outperform existing complex-code design techniques and provides codes with similar correlation properties to well-known codesets while using significantly fewer unique phases
Keywords :
binary codes; code division multiple access; computational complexity; correlation methods; iterative methods; mean square error methods; spread spectrum communication; DS-CDMA spreading sequences; binary codes; complex-code design techniques; low-complexity deterministic approach; mean-square aperiodic correlation properties; polyphase codes; trellis structure; trellis-exploration algorithm; Algorithm design and analysis; Autocorrelation; Bit error rate; Character generation; Frequency; Interferometry; Iterative algorithms; Multiaccess communication; Multiple access interference; Statistics;
fLanguage :
English
Journal_Title :
Wireless Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
1536-1276
Type :
jour
DOI :
10.1109/TWC.2007.05216
Filename :
4114280
Link To Document :
بازگشت