基于RM码的拟最佳二元周期序列

本文基于Ｒｅｅｄ－Ｍｕｌｅｒ码利用最佳二次型构造了一类相关性能近似于Ｇｏｌｄ码的二元周期序列，指出了文献［１］中的序列族是本文所构造序列族的子类，最后给出了最佳二次型的充分必要条件。     

具有二值自相关特性的p元伪随机序列族的构造

具有二值自相关特性的伪随机序列在扩频通信、流密码、雷达和声纳等领域中具有重要的应用。本文首先基于d-型序列的思想，给出了具有二值自相关特性的p元伪随机序列的构造表达式。此外，基于已有的具有二值自相关函数序列，本文提出了构造具有同样自相关特性的伪随机序列的方法。可以用来构造具有最佳Hamming相关特性的跳频序列族。     

非线性扩频序列的三项式特性

讨论了三类非线性扩频序列(GMW序列、No序列和Kasami序列)的三项式特性，利用这三类序列的迹表示，证明了GMW序列、No序列和Kasami序列均具有正则三项式对。     

具有良好相关特性的实序列

本文利用正(余)弦函数的特性构造出了几类新型的具有良好相关特性的实序列。与已知的FZC序列和A、B型的Alltop序列相比较,文中新序列的相关特性更好,容量更大。此外新序列在实数中取直,因此更加实用。FZC序列和Alltop序列的广泛应用保证了新序列具有很大的实用价值。     

序列偶循环相关函数及其界的研究

根据提出的序列偶的周期互相关及其自相关函数的概念,进一步讨论了序列偶间的互相关函数的变换关系。在此基础之上定义了相应的偶相关函数量值,并推导形成了有关序列偶的界的理论估计。     

一种改进型交织ZCZ序列族的设计

本文提出了一族长ZCZ区间序列构造方法,此方法在已有基于交织方法构造ZCZ序列基础之上,通过m次递归构造,在保持序列数目M不变的条件下,序列的零相关区宽度和序列长度都变成了原序列的Mm倍,相比于以往方法得到的序列在零相关区宽度和序列长度上都得到了扩展.这些序列族可用于近乎同步CDMA系统中.     

GMW序列和WG序列及WG序列间的互相关特性

对于奇数n,研究了Gordon-Mills-Welch（GMW）序列与Welch-Gong（WG）序列（及其某一采样序列）间的互相关函数以及WG序列间的互相关函数。研究表明：GMW序列与WG序列（及其某一采样序列）间的互相关函数以及WG序列间的互相关函数最终均与m-序列与其采样序列间的互相关函数相关;并且在一定条件下,WG序列间的互相关函数可为3-值或5-值的。另外,给出了GMW序列与WG序列间互相关函数的最大峰值。     

m序列复合码的一种快速相关算法

在直扩系统中,PN码的快速捕获十分重要。由于m序列的优选对有限,故在实际应用中采用复合码作为PN 码。常用的复合码主要有Gold序列和Kasami小集合序列。本文提出了一种利用快速沃尔什变换(FWT)实现对复合码进行快速相关的算法。这种算法适用于由两个m序列模2加形成的复合码,并原则上可以推广到Kasami大集合序列的捕获上。分析表明,我们提出的算法与传统相关算法相比,降低了算法的时间复杂度。     

一类新型二元序列族的相关函数研究

扩频序列设计是直接序列扩频通信系统的关键课题之一。本文在一类具有二值自相关函数的二相序列基础上，构造了一类新的二相序列族，计算了新序列族的相关函数，结论表明：该二相序列族在Welch界意义下是最佳的，可适用于直接序列CDMA通信系统中。     

二值映射相关Barker码研究

给出了二相序列非周期二值映射相关函数的定义，在该定义的基础上定义了二值映射相关Ｂａｒｋｅｒ码（简称二值加权Ｂａｒｋｅｒ码），并指出经典的二相序列的非周期相关函数和Ｂａｒｋｅｒ码是本文新定义的相关函数和Ｂａｒｋｅｒ码的特例。新定义的Ｂａｒｋｅｒ码比原意义的Ｂａｒｋｅｒ码多５个码字，而且对原意义下的Ｂａｒｋｅｒ码经加权处理后，可提高主副峰比（长为７的Ｂａｒｋｅｒ码提高２．５ｄＢ，长为１１的Ｂａｒｋｅｒ码提高１．５７ｄＢ），计算机搜索结果证明长度大于１３、小于３１的二值加权Ｂａｒｋｅｒ码是不存在的。     

非线性扩频序列的Hamming相关特性

本文讨论了两类非线性扩频序列（Ｎｏ序列和Ｋａｓａｍｉ序列）的Ｈａｍｍｉｎｇ相关特性,求出了这两类扩频序列的Ｈａｍｍｉｎｇ相关函数值,就Ｈａｍｍｉｎｇ相关特性而言,这两类序列不具有最佳相关性能。     

Performance of SCHT Sequences in Asynchronous CDMA System

In this letter, the performance of a new set of spreading sequences for a direct sequence (DS) code division multiple access (CDMA) system is examined. These new sequences are derived from sequency-ordered complex Hadamard transform (SCHT). Various correlation properties are presented and the performance of the new sequence is analyzed by comparing it with the other well-known existing spreading sequences, such as UCHT, WHT, Gold, small set of Kasami and m-sequences. According to the simulation results, it is shown that the SCHT sequences provide smaller mean square cross correlation values and offer better average bit error rate for an asynchronous CDMA system over the multipath fading channel.     

New family of bipolar sequences and its correlation spectrum

Based on a class of bipolar sequences with two-values autocorrelation functions, a new family of bipolar sequences is constructed and its correlation spectrum is calculated. It is shown that the new family is optimal with respect to Welch‘s bound and is different from the small set of Kasami sequences, while both of them have the same correlation properties.     

CDMA通信中多址序列相关性的研究及仿真

扩频序列设计和选择是码分多址(CDMA) 扩频通信的关键技术之一,扩频码序列的设计就是构造不同结构的具有良好相关性的伪随机序列来满足CDMA 系统的要求.现主要研究了应用于CDMA通信中的m序列、Gold序列和Kasami序列的原理、性能和构造方法,且基于MATLAB软件M语言编程以上序列的实现和相关性分析,并比较了其各自特点分析了其在不同环境下的适用性.     

UCHT-based complex sequences for asynchronous CDMA system

The use of orthogonal spreading codes has attracted much attention due to their ability to suppress interference from other users, compared with the nonorthogonal sequences in the synchronous case. In this paper, new sets of orthogonal sequences derived from the unified complex Hadamard transforms (UCHTs) are investigated. Various correlation properties of the sequences are mathematically derived and analyzed. It is shown that some UCHT sequences provide better autocorrelation properties than orthogonal Walsh-Hadamard sequences. Performance comparisons between UCHT sequences, Gold, small set of Kasami, and m-sequences show that some UCHT sequences outperform these well-known spreading sequences under simulation of systems in the presence of multiple access interference and additive white Gaussian noise.     

Bent-function sequences

In this paper we construct a new family of nonlinear binary signal sets which achieve Welch's lower bound on simultaneous cross correlation and autocorrelation magnitudes. Given a parameternwithn=0 pmod{4}, the period of the sequences is2^{n}-1, the number of sequences in the set is2^{n/2}, and the cross/auto correlation function has three values with magnitudesleq 2^{n/2}+1. The equivalent linear span of the codes is bound above bysum_{i=1}^{n/4}left(stackrel{n}{i} right). These new signal sets have the same size and correlation properties as the small set of Kasami codes, but they have important advantages for use in spread spectrum multiple access communications systems. First, the sequences are "balances," which represents only a slight advantage. Second, the sequence generators are easy to randomly initialize into any assigned code and hence can be rapidly "hopped" from sequence to sequence for code division multiple access operation. Most importantly, the codes are nonlinear in that the order of the linear difference equation satisfied by the sequence can be orders of magnitude larger than the number of memory elements in the generator that produced it. This high equivalent linear span assures that the code sequence cannot be readily analyzed by a sophisticated enemy and then used to neutralize the advantages of the spread spectrum processing.     

Generalized Kasami Sequences: The Large Set

In this correspondence, new binary sequence families F^k of period 2ⁿ-1 are constructed for even n and any k with gcd(k,n)=2 if n/2 is odd or gcd(k,n)=1 if n/2 is even. The distribution of their correlation values is completely determined. These families have maximum correlation 2^n/2+1 and family size 2^3n/2 + 2^n/2 for odd n/2 or 2^3n/2+2^n/2-1 for even n/2. The proposed families include the large set of Kasami sequences, where the k is taken as k=n/2+1.     

Bit error rate performance of Haar wavelet based scale‐code division multiple access (HW/S‐CDMA) over the asynchronous AWGN channel

In this paper, we study a recently proposed multirate system, called wavelet based scale‐code division multiple access (W/S‐CDMA). W/S‐CDMA depends on the code, time and scale orthogonality introduced by pseudo‐noise (PN) sequences, and wavelets. In this system, the channel is partitioned into different scales, and each scale into time slots. In addition, the PN sequences are used in each scale to identify multiple users. In W/S‐CDMA, each user is assigned a specific scale and PN sequence, and transmits its successive information symbols with its PN sequence and the wavelets in that scale. More symbols are transmitted in finer scales. We analyse the bit error rate performance of Haar wavelet based S‐CDMA (HW/S‐CDMA) over an asynchronous additive white Gaussian noise (AWGN) channel by using a conventional detector for deterministic PN sequences. The performance of the system is compared to that of an equivalent multirate CDMA (MR‐CDMA) system for Gold and Kasami PN sequences. Results show that HW/S‐CDMA outperforms MR‐CDMA. In addition, because of its suitable format HW/S‐CDMA is also capable of employing the optimal PN sequence families with limited number of sequences such as Kasami, Bent, etc. repeatedly in different scales. Copyright © 2006 John Wiley & Sons, Ltd.