作　　者： ; ; ;

机构地区： 汕头大学工学院电子工程系

出　　处： 《通信学报》 2007年第2期134-140,共7页

摘　　要： 以Logistic混沌映射为基础,提出了一种改进的混沌扩频序列产生方法,该方法由给定初值代入混沌映射,然后对每个迭代点进行L比特量化,通过截短得到新的混沌扩频序列。得到的序列与传统混沌扩频码和Gold码作了比较,并在DS-CDMA系统中作了仿真验证。结果表明,该方法减少了迭代次数,加快了运算速度,并且可以产生任意长度的扩频序列,地址数远远大于现有的Gold码。通过实验还得到了最优的二进制量化阶数。 Based on the Logistic-map, an optimized method of generating the spread-spectrum sequences was proposed. An initial value was given and iterated in the Logistic map, then L bit qualification was done to every point, in this way, new spread spectrum sequence would be achieved by shorten. It was compared with conventional chaotic code and Gold code and finally simulated in the DS-CDMA systems. Experiment results show that the iterative times are reduced, the calculating speed is improved, the spread-spectrum sequences can be reshaped with any length and the number of these sequences is larger than Gold sequence in being. The best quantification order is got too.

关 键 词： 映射 混沌扩频序列 量化阶数 序列 相关 同步 异步 误码率

领　　域： [电子电信] [电子电信]