Efficient Architectures for the Generation and Correlation of Binary CSS Derived From Different Kernel Lengths
Efficient Architectures for the Generation and Correlation of Binary CSS Derived From Different Kernel Lengths
复制标题
DOI：
10.1109/tsp.2013.2273883
复制
发表时间：
2013-10
影响因子：
5.4
通讯作者：
Enrique García;J. Ureña;J. J. García-J.;M. C. Pérez
中科院分区：
文献类型：
--
作者：
Enrique García;J. Ureña;J. J. García-J.;M. C. Pérez
互补序列集(CS)被用作开发广义正交(GO)序列的基本构件。在实际序列的设计中，期望最佳的相关特性和其对应的相关器的有效实现(即，每个输入样本的操作次数减少)。传统上，K个二进制码流的产生/相关的有效算法被限制在长度L=KN的算法上，其中K≥2和N是非负整数。这意味着许多已知长度的二进制CS不能被有效地生成和关联，从而限制了它们的实际应用。本文提出了一种新的高效结构，用于产生和关联长度为L=(K/2)·2N·10M·26P的N、M和P个非负整数的K个二进制CS。该方案允许高效地生成和关联比以前的高效体系结构能够处理的长度多得多的二进制CS。因此，所提出的架构的使用允许更灵活地选择每个特定应用所需的处理增益。
Complementary Sets of Sequences (CSS) are used as basic building blocks for the development of Generalized Orthogonal (GO) sequences. In the design of practical sequences are desirable both optimal correlation properties and an efficient implementation of their corresponding correlators (i.e., with a reduced number of operations per input sample). Traditionally, the efficient algorithms for the generation/correlation of K binary CSS have been constrained to those of lengths L=KN, where K ≥ 2 and N is a non-negative integer. This constraint implies that many binary CSS of known lengths cannot be generated and correlated efficiently, thus limiting their practical application. This paper proposes novel efficient architectures for the generation and correlation of K binary CSS of length L=(K/2)·2N·10M·26P with N, M and P non-negative integers. The proposal allows the efficient generation and correlation of binary CSS of many more lengths than previous efficient architectures can handle. Therefore, the use of the proposed architectures allows selecting with more flexibility the processing gain needed for each particular application.