p-ary unified sequences: p-ary extended d-form sequences with the ideal autocorrelation property

In this paper, for a prime number p, a construction method to generate p-ary d-form sequences with the ideal autocorrelation property is proposed and using the ternary sequences found by Helleseth, Kumar, and Martinsen (2000), ternary d-form sequences with the ideal autocorrelation property are constructed. By combining the methods for generating p-ary extended sequences (a special case of geometric sequences) and p-ary d-form sequences, a construction method of p-ary unified (extended d-form) sequences which also have the ideal autocorrelation property is proposed. This is a very general class of p-ary sequences including the binary and nonbinary extended sequences and the d-form sequences. From the ternary sequences by Helleseth, Kumar, and Martinsen, ternary unified sequences with the ideal autocorrelation property are also generated.     

Class of ternary spreading sequences with zero correlation duration

Novel ternary preferred pairs (TPPs) that have a greater zero correlation duration (ZCD) of (0.75 N+1) for a period N are constructed by applying selected zero padding to binary preferred pairs with ZCD of (0.5 N+1). A chip-shift operation is then performed to derive new ternary ZCD sequences that have superior family size to that of binary ZCD sequences     

Generalized PN sequences (Corresp.)

Multilevel sequences having strictly zero periodic autocorrelation for nonzero shifts are discussed, and combinational admissibility conditions for ternary sequences are formulated. A number of new ternary sequences are constructed.     

一类三元非周期零相关区序列集的构造

该文基于任意两个NN Hadamard矩阵,构造出一类三元非周期零相关区序列集。与Donelan和OFarrell的构造方法相比,该文构造出的序列具有较高的能量效率。又进一步构造出两个相互正交的具有非周期零相关区的三元序列集,这样就可以提供更多的能够在准同步CDMA系统中使用的序列。     

Design of sequence set with group-wise zero correlation window

Zero correlation window (ZCW) or zero correlation zone (ZCZ) sequence can be used in quasi-synchronous code division multiple access (QS-CDMA) system to eliminate multiple access and multipath interferences. However, as the length of ZCW or ZCZ increases, fewer sequences are available. Recently, a new concept, sequence set with group-wise zero correlation window is introduced, which can increase the number of available sequences for a QS-CDMA system. In this article, a new method for generating sequence set with group-wise zero correlation window is presented. This method is based on a Hadamard matrix of size N×N and a pair of Hadamard matrices of size M×M. Compared with previous methods, the proposed sequence set has a group-wise zero correlation window for both periodic and aperiodic cross-correlation functions.     

Construction of zero correlation zone Gaussian integer sequence set

The construction of zero correlation zone (ZCZ) Gaussian integer sequence set was researched.Based on binary orthogonal matrices,ZCZ ternary sequence sets were constructed by adding zeros at first.Then the ternary ZCZ squences were transformed into Gaussian integer sequences by using a perfect Gaussian integer sequence without changing the ideal autocorrelation functions and crosscorrelation functions in the zero correlation zone.The proposed ZCZ Gaussian integer sequence sets are optimal or almost optimal with respect to the Tang-Fan-Matsufuji bound.     

中间多比特量化混沌跳频序列及其性能分析

文章结合伪随机数生成技术，提出了一种具有较好独立性与随机性的混沌跳频序列中间多比特量化方案．不仅减少了序列生成的运算量，同时也大大扩展了跳频序列周期。文章还研究了中间多比特量化方案产生跳频序列的均匀性、跳频间隔和汉明相关性等与跳频通信系统性能相关的因素。结果表明该方案生成的跳频序列复杂度高，具有良好的多址性能。     

Perfect polyphase sequences with small alphabet

New perfect polyphase sequences with a small phase alphabet and some zero elements are proposed. These sequences are derived from pairs of perfect polyphase sequences with zeroes and odd-perfect ternary sequences of the same length N. They have a length of 4N and possess a peak factor close to 1 as N becomes large. The sequences can be used in digital communication, navigation and radar engineering.     

Family of uncorrelated binary ZCZ sequence pairs with mismatched filtering

A family of uncorrelated binary sequence pairs of length N=4(p^m+1) with zero correlation zone (ZCZ) (N/4) -1 and mismatched filtering is proposed. The sequence pairs are derived from almost- perfect binary and ternary sequences and possess energy efficiency close to 1 as N becomes large. They can be used in quasi-synchronous code division multiple access and radar systems to reduce interference.     

从非奇异布尔函数对产生M序列

本文指出一种构造产生Ｍ序列的方法，它是基于圈的合并，给出一个计数公式，并给出一个简单的生成算法，不同的非奇异布尔函数生成不同的Ｍ序列，从而可以生成２＾２ｎ－１－１个ｎ＋１级Ｍ序列。     

一类混合型三重细分法

文章从几何的视角出发,以四点二重插值细分格式的几何解释为基础,对四点三重插值细分格式的几何意义进行分析,改造格式使其融合逼近细分,进而得到一类带参数的混合型三重细分格式.诸多已有的插值型细分和逼近型细分都是该格式的特例,采用生成多项式方法分析了其Ck连续性.得到了一种新的C4连续五点三重曲线细分格式.数值实例表明,利用提出的混合型细分法通过参数的适当选取可以实现对极限曲线的形状控制.     

交织法构造最佳或几乎最佳低零相关区序列集

该文提出一种新的移位序列的构造方法,通过给移位序列赋予不同的值,得到一类新的移位序列。基于这种移位序列,利用交织法得到了一类具有灵活相关区长度并且参数接近甚至达到理论界限的低零相关区序列集,扩大了交织法的应用范围,得到了更多的适用于准同步CDMA系统的扩频序列集。     

基于四阶累量的MUSIC算法对阵元误差的稳健性分析

本文分析了基于四阶累量的ＭＵＳＩＣ算法（记作ＦＯＣ－ＭＵＳＩＣ），在实际阵元存在幅相误差时，对波达方向（ＤＯＡ）的估计性能，给出了大样本情况下的估计方差公式，并与基于协方差矩阵的标准ＭＵＳＩＣ算法作了比较。计算机仿真结果表明，本文给出的方差公式与实验仿真结果十分接近。文中还给出了利用高阶累量的方法可获得阵列有效孔径扩展的新解释。     

New sequences for asynchronous frequency-hopping multiplex

A new method for generating large sets of sequences for frequency-hopping multiplex, when arbitrary or bounded mutual asynchronity is present, is presented. The sequences are of length Q, with elements from GF(Q); Q is prime. The maximal number of sequences in the sets is very close to the theoretical bounds.     

混合进制复制生成序列的相关函数

介绍了以混合进制码为复制信息,用平移复制生成多复数值序列的方法,讨论了复制生成序列的性质和复制生成序列的相关函数,给出了两个生成序列的互相关函数值恒为零的条件,最后给出了一个复制信息的选取准则,根据这个准则可以得到一个两两之间互相关函数值恒为零的序列族.     

Perfect q-ary sequences from multiplicative characters over GF(p)

A new coding rule based on multiplicative characteristics over GF(p) is identified for the construction of perfect q-ary sequences. A subset of these sequences achieves the maximum possible efficiency less than unity. The new coding rule is illustrated by demonstrating that the perfect ternary Ipatov sequences are incorporated in these perfect q-art sequences.<>     

N-shift cross-orthogonal sequences

N-shift cross-orthogonal sequences and a complete complementary code derived from them are defined and discussed. A general method for generating this code is also discussed. A synchronous multiple-user spread-spectrum multiple system is proposed that uses N-shift cross-orthogonal sequences     

High-speed m sequence generation: a further note

A method of generating maximal-length sequences by employing delay lines in place of shift-register elements is described. Speed of operation is limited only by the rise and fall times of the modulo-2 adder employed.     

产生2k元伪随机序列的准混沌Mealy型有限状态机方法

该文利用m状态序列稳定的长周期，以及混沌序列流的高线性复杂度，研究了一种将m状态序列作为准混沌Mealy型有限状态机输入的2k元伪随机序列产生方法，分析了系统的周期待性，进行了序列流随机性的测试，介绍了系统作为跳频码发生器在FPGA的仿真和综合结果．     

产生2k元伪随机序列的准混沌Mealy型有限状态机方法

该文利用m状态序列稳定的长周期,以及混沌序列流的高线性复杂度,研究了一种将m状态序列作为准混沌Mealy型有限状态机输入的 2k元伪随机序列产生方法,分析了系统的周期特性,进行了序列流随机性的测试,介绍了系统作为跳频码发生器在FPGA的仿真和综合结果。