当前位置: X-MOL 学术Int. J. Commun. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Efficient method for constructing optimized long binary spreading sequences
International Journal of Communication Systems ( IF 2.1 ) Pub Date : 2021-01-04 , DOI: 10.1002/dac.4719
Sabrina Boukerma 1 , Khaled Rouabah 2 , SalahEddine Mezaache 2 , Salim Atia 2
Affiliation  

In this paper, we propose an efficient method for generating two types of novel optimized long binary spreading sequences (OLBSS) with improved autocorrelation function (ACF) properties. The first type is constructed from concatenated short binary subsequences belonging to the same code family, such as Walsh Hadamard and Gold subsequences, provided that their cross‐correlation functions (CCFs) have good properties. The second category uses the same subsequences but which are rather interlaced. Here, the number and size of the subsequences are related to the chosen length of the final constructed long sequence and the desired performances. The realization of the OLBSSs is achieved using two different optimization techniques, namely, the genetic algorithms (GAs) and particle swarm optimization (PSO) method. The simulation results, based on MATLAB tool, have shown that the proposed long sequences, composed of Walsh–Hadamard subsequences and optimized by the GA, have better ACF properties compared to the original Gold, Weil, and random sequences of the same length.

中文翻译:

构造优化的长二进制扩频序列的有效方法

在本文中,我们提出了一种有效的方法,用于生成具有改进的自相关函数(ACF)属性的两种新型优化长二进制扩展序列(OLBSS)。第一种类型是由属于同一代码族的级联短二进制子序列(例如Walsh Hadamard和Gold子序列)构成的,前提是它们的互相关函数(CCF)具有良好的性能。第二类使用相同的子序列,但它们是交错的。在此,子序列的数量和大小与最终构建的长序列的选定长度和所需性能有关。OLBSS的实现是使用两种不同的优化技术实现的,即遗传算法(GA)和粒子群优化(PSO)方法。仿真结果
更新日期:2021-02-03
down
wechat
bug