【作者】 蒋挺；

【导师】 侯蓝田；

【作者基本信息】 燕山大学 ， 电路与系统， 2003， 博士

【摘要】 本文较为详细地分析综述了几十年来，最佳相关信号的研究成果，它已在现代通信、雷达、声纳、制导、空间测控、以及电子对抗等方面得到了广泛地应用，为工程应用提供更多具有良好相关特性的最佳离散信号是研究最佳离散信号的目的之一。本文在最佳二进阵列偶理论研究的基础上，定义了准最佳和双准最佳二进阵列偶，给出并证明了它们的性质、频谱特性和存在的必要条件，利用这些条件，用计算机搜索出若干小体积的准最佳和双准最佳二进阵列偶。研究了准最佳和双准最佳二进阵列偶的复合构造法；并利用最佳、准最佳和双准最佳二进阵列偶之间的联系，给出了构造最佳二进阵列偶和准最佳二进阵列偶的方法。另一方面，本文提出了一种新的离散信号，即屏蔽二进序列偶和阵列偶，建立了完整的屏蔽二进序列偶和阵列偶的理论体系，它包括最佳屏蔽二进序列偶理论、最佳屏蔽二进阵列偶理论、准最佳和双准最佳屏蔽二进阵列偶理论，以及屏蔽二元互补序列偶理论。定义了屏蔽二进序列偶、最佳屏蔽二进序列偶和奇周期最佳屏蔽二进序列偶，研究了它们的变换性质和存在的组合允许条件，并用这些性质和条件，搜索出若干最佳屏蔽二进序列偶和奇周期最佳屏蔽二进序列偶。给出了利用伪随机二进序列构造最佳屏蔽二进序列偶的方法。研究了最佳二进序列、最佳屏蔽二进序列偶和奇周期最佳二进序列偶之间的关系，给出了最佳屏蔽二进序列偶的周期乘积构造方法，以及利用最佳和奇周期最佳二进序列偶构造新的最佳屏蔽二进序列偶的构造方法。定义了屏蔽二进阵列偶、屏蔽平衡度、最佳屏蔽二进阵列偶和半周期最佳屏蔽二进阵列偶，研究了最佳屏蔽二进阵列偶的变换性质、频谱特性和存在的必要条件，利用这些条件，用计算机搜索出若干最佳屏蔽二进阵列偶。对于最佳屏蔽二进阵列偶的构造，重点研究了二维最佳屏蔽二进阵列偶的构造方法，包括最佳二进阵列与最佳屏蔽二进阵列偶的周期乘积构造法，半周期最佳屏蔽二进阵列偶与最佳屏蔽二进序列偶的直积构造法，以及最佳屏蔽二进阵列偶与最佳屏蔽二进序列偶之间的折叠构造法。定义了准最佳屏蔽二进阵列偶和双准最佳屏蔽二进阵列偶，研究了它们的变换性质和频谱特性，给出了它们存在的组合允许条件，利用这些组合允许条件，有效地搜索出若干准最佳屏蔽二进阵列偶和双准最佳屏蔽二进阵列偶。研究了最佳屏蔽二进阵列偶、准最佳屏蔽二进阵列偶和双准最佳屏蔽二进阵列偶之间的关系，特别是当阵列偶的第一维和第二维的周期均为奇数时，它们之间的相互变换关系。定义了非周期屏蔽二元序列偶的自相关函数、屏蔽二元互补序列偶和最佳屏蔽二元互补序列偶，给出并证明了屏蔽二元互补序列偶的变换性质；和它存在的组合<WP=5>允许条件，用计算机搜索出若干最佳屏蔽二元互补序列偶；给出了屏蔽二元互补序列构造出新的屏蔽二元互补序列偶的四种构造方法；并且，给出了利用不同长度的二元互补序列和屏蔽二元互补序列偶构造出新的屏蔽二元互补序列偶的四种构造方法。更多还原

【Abstract】 The research achievements of perfect correlation signal during decades are particularly surveyed in this paper. These signals have abroad been applied in modern communication, radar, sonar, navigation, space ranging and controlling, and electronic antagonism systems. It is one of objects researching perfect discrete signal for more perfect discrete signals with good correlation character to be obtained for engineering application.Based on the theory research achievements of the perfect binary array pairs, the quasi-perfect binary array pair and the double quasi-perfect binary array pair are defined in this paper. Their properties, Fourier spectrum characters and existing necessary conditions are proved and given out. By means of these conditions, computer searches out many quasi-perfect and double quasi-perfect binary array pairs with small sizes. The composite construction methods for quasi-perfect and double quasi-perfect binary array pairs are studied. And another construction methods for perfect and quasi-perfect binary array pairs are presented with the help of the relationships among the perfect, quasi-perfect and double quasi-perfect binary array pairs. On the other hand, a new kind of discrete signal is presented in this paper, which is the punctured binary sequence pair and the punctured binary array pair. The entire theory systems of the punctured binary sequence pair and the punctured binary array pair are built, which include the perfect punctured binary sequence pair theory, the perfect punctured binary array pair theory, the quasi-perfect and double quasi-perfect binary array pair theory, and the punctured binary complementary sequence pair theory. The punctured binary sequence pair, perfect punctured binary sequence pair and odd-periodic perfect punctured binary sequence pair are defined. Their transform properties and their existing combinatorial admissibility conditions are studied. By means of these properties and conditions, many perfect and odd-periodic perfect binary sequence pairs are searched out. The construction method for the perfect punctured binary sequence pair is presented with the help of the pseudorandom binary sequence. The relationships among perfect binary sequence, perfect and odd-periodic perfect punctured binary sequence pairs are studied. The construction methods for perfect punctured binary sequence pair are presented, one is called the periodic product, and another is with the help of the relationship between perfect and odd-perfect punctured binary sequence pairs. The punctured binary array pair, punctured balance coefficient, perfect and partial periodic perfect punctured binary array pair are defined. The transform properties, Fourier <WP=7>spectrum character and existing necessary combinatorial admissibility conditions of perfect punctured binary array pair are studied. With the help of these properties and conditions, computer searches out many perfect punctured binary array pairs. About the construction methods for perfect punctured binary array pair, we particularly study the methods of constructing perfect punctured binary array pair with two dimension sizes, which include the periodic product between perfect binary array and perfect punctured binary array pair, the kronecker product between the perfect sequence pair and partial periodic perfect punctured binary array pair, and the folding methods between the perfect punctured sequence pair and perfect punctured binary array pair. The quasi-perfect and double quasi-perfect punctured binary array pairs are defined. Their properties and Fourier spectrum characters are studied. The existing combinatorial admissibility conditions are presented. With the help of these conditions, computer efficiently searches out many quasi-perfect and double quasi-perfect punctured binary array pairs. The relationships among perfect punctured binary array pair, quasi-perfect and double quasi-perfect punctured binary array pair is presented. Specially, when first and second dimension period of the punctured binary ar更多还原