Ambiguity properties of quadratic congruential coding

The ambiguity characteristics of multiple access frequency hop codes based on standard quadratic congruences are investigated in the light of results obtained for codes based on Costas arrays and extended quadratic congruences. While the autoambiguity properties are found to be very similar to those of Costa codes, i.e. nearly ideal, the cross-ambiguity properties of quadratic congruential codes are much better. These results are valid across the whole class of code sets considered, but they are obtained at some expense in the pulse compression characteristics of the codes. A uniform upper bound is placed on the entire cross-ambiguity function surface, and bounds are placed on the amplitude of spurious peaks in the autoambiguity function. These bounds depend on the time-bandwidth product and code length exclusively and lead naturally to a discussion of the design tradeoffs for these two parameters. Examples of typical autoambiguity and cross-ambiguity functions are given to illustrate the performance of quadratic congruential coding with respect to Costas coding     

Time-frequency hop codes based upon extended quadratic congruences

Time-frequency hop codes are developed that can be used for coherent multiuser echolocation and asynchronous spread spectrum communication systems. They represent a compromise between Costas codes, which have nearly ideal autoambiguity but not so good cross-ambiguity properties, and linear congruential codes, which have nearly ideal cross-ambiguity but unattractive autoambiguity properties. Extended quadratic congruential code words are shown to have reasonably good autoambiguity and cross-ambiguity properties across the whole class of code sets considered. A uniform upper bound is placed on the entire cross-ambiguity function surface, and bounds are placed on the position and amplitude of spurious peaks in the autoambiguity function. These bounds depend on the time/bandwidth product and code length exclusively and lead naturally to a discussion of the design tradeoffs for these two parameters. Examples of typical autoambiguity and cross-ambiguity functions are given to illustrate the performance of the new codes     

Sets of One and Higher Dimensional Welti Codes and Complementary Codes

A Welti code is a binary sequence with an impulse-like autocorrelation function. A set of such codes may possess vanishing cross-correlation functions. The elements of Welti codes must be members of a set of at least two orthogonal vectors or subcodes. First, methods for synthesizing sets of one-dimensional Welti codes with vanishing cross-correlation functions, and conditions upon their existence are discussed. Then, construction methods of sets of two and higher dimensional Welti codes are presented. Based on these constructions, further sets of mutually orthogonal complementary codes in one or more dimensions can be derived. The use of such signals relates to various topics such as communication, radar and navigation systems, measuring and identification in one or higher dimensional systems, synchronization and spatial alignment, or coded aperture imaging.     

Reciprocal radar waveforms

Digitally coded radar waveforms can be used to obtain large time-bandwidth products (pulse compression ratios). It is demonstrated that periodic radar waveforms with zero sidelobes or almost zero sidelobes can be defined. A perfect periodic code is a periodic code whose autocorrelation function has zero sidelobes and whose amplitude is uniform (maximum power efficiency=1). An asymptotically perfect periodic code has the property that as the number of elements in the code goes to infinity the autocorrelation function of the code has zero sidelobes and its power efficiency is one. The authors introduce a class of radar waveforms that are either perfect or asymptotically perfect codes. These are called reciprocal codes because they can be derived through a linear transformation of known codes. The aperiodic performance of the reciprocal code is examined     

Periodic ambiguity functions of EQC-based TFHC

The time-frequency hop codes based upon extended quadratic congruences (TFHC-EQC) were developed previously (1988, 1991). The known results about the ambiguity functions of the TFHC-EQC are extended from aperiodic cases to periodic cases. Precisely, the following new results are proved: (1) The tight upper bound for the periodic auto-ambiguity function of the TFHC-EQC is 6; (2) the periodic cross-ambiguity upper bound of the TFHC-EQC is at least (N-1)/2; (3) there exists a subset TFHC-EQC of volume (N-1)/2 such that its periodic cross-ambiguity is tightly upper bounded by 8     

扩频系统中伪码防错锁技术研究

针对扩频系统中出现的伪码错锁问题,分析了产生伪码错锁的原因,根据伪码自相关性和互相关性特点,从伪码捕获策略、错锁自动判决策略等角度研究了伪码防错锁措施：选择自相关性和互相关性尽可能好的码;合理设置捕获门限;减小多普勒捕获范围;采用并行伪码捕获方法,并在捕获过程中防止载波错捕现象发生;单独建立验证通道,进行相关值比较判决等。实践表明,采用文中方法可提高正确捕获概率,缩短捕获时间,从硬件设计上有效解决了伪码错锁问题。     

Efficient exhaustive search for optimal-peak-sidelobe binary codes

The work presented here describes an exhaustive search for minimum peak sidelobe level (PSL) binary codes, combining several devices for efficiency. These include combinatoric tree search techniques, the use of PSL-preserving symmetries to reduce search space, data representations and operations for fast sidelobe computation, and a partitioning scheme for parallelism. All balanced 64-bit minimum PSL codes are presented, and the upper limit on known consecutive lengths to have PSL = 4 codes is extended to 70. In addition, a technique for determining balance properties of a code for given PSL-preserving transformations is developed.     

基于三类非线性函数的认证码的构造

为了将高度非线性函数应用于认证码构造理论．讨论了非线性函数的度量，给出了由三类非线性函数构造的Cartesian认证码，并且当编码规则按等概率分布选取时，分别计算了三类认证码的模仿攻击和欺骗攻击成功的概率。结果表明，第二类认证码模仿攻击成功的概率达到了下界。在n取值相同的条件下，第一类认证方案模仿攻击成功的概率比第三类的大。     

数据库应用系统中关键代码属性的设置原则

数据库应用系统中的绝大多数关键属性均以代码形式出现,其设置的规范性和设置的方法对系统的性能有很大影响。对代码属性、主文件及代码文件进行了详细的分类,对不同类型的代码给出了通用的设置原则和各自的设计规范。针对经常出现的分级代码,给出了两类设置原则。实践表明,这些原则可有效保证代码关键属性的正确设置。     

基于纠删码的遥测链路丢帧恢复技术

针对遥测系统在恶劣天气条件、航天器姿态调整、天线指向偏离、脉冲干扰等各种因素影响下出现的遥测信号闪断以至接收机丢帧问题,提出一种适用于闪断信道的纠删码技术,用于恢复丢失的数据帧.首先介绍LDPC（低密度奇偶校验）纠删码的编译码算法,然后构造一种以短码长的随机码为外码、IRA（不规则重复累积）LDPC码为内码的级联纠删码,最后给出纠删码的应用策略和实现纠删码所需的CCSDS（空间数据系统咨询委员会）协议扩展.通过仿真实验和分析,得到了LDPC纠删码和级联纠删码的纠删性能,得出级联纠删码与LDPC纠删码均可获得接近理想的纠删性能的结论,且级联纠删码的构造更为灵活,可适应不同的应用环境,对CCSDS协议进行适当扩展后即可支持纠删码在CCSDS遥测链路中的应用.     

Acquisition of Pseudonoise Codes in FH Systems

Acquisition schemes for acquiring pseudonoise (PN) signals in a frequency hopping (FH), spread spectrum (SS) system are presented. For the purpose of acquiring the PN code the received signal is modeled by an autoregressive (AR) process. The parameters of the AR process are determined by identifying a related set of parameters called the partial correlation coefficients. The power spectrum of the received signal and hence the PN code is estimated from the identified AR parameters. The high accuracy of the estimated PN codes permits the use of a simple error correcting logic to accelerate the acquisition process.     

Synthesis of Ambiguity Functions for Prescribed Responses

The synthesis of radar ambiguity functions is approached using burst-pulse time-frequency waveform coding. Noting that the parameters that define the central response of the ambiguity function for these code classes also define the waveform code, a statistical decision procedure based upon the central response is employed to obtain Bayes-type codes. The selection of the code parameters is subject to restrictions imposed by the noncentral response of the ambiguity function. Three classes of random time-frequency codes are treated: 1) uniform amplitude, uniform pulsewidth matched codes; 2) uniform amplitude, nonuniform pulsewidth matched codes; and 3) uniform amplitude, uniform pulsewidth with receiver amplitude mismatch.     

Coupling of macroscopic and small scale phenomena

Collisionless microscopic phenomena such as anomalous resistivity, particle acceleration and heat conduction have been successfully treated by particle simulations. Such simulations are usually restricted to volume elements and time scales that are small compared to global scales or even the space and time steps in macroscopic codes. Despite the recent code advances and increases in computing power, it remains necessary to determine the effect of macroscopic dynamics on small scale phenomena and vice versa. The sensitivity of microscopic simulation results to macroscopic boundary conditions is demonstrated. Macroscopic codes, on the other hand, are examined for their dependence on microscopic details. The consequences for the design and analysis of simulation experiments in space physics are discussed. Combining macroscopic and microscopic aspects in a single simulation, despite the usual disparity of scales, will remain a challenging problem.     

Reduction of sidelobe self-interference in an agile beam radar

In an agile beam phased array radar, the beam is often multiplexed over several angular positions, and “listens” in each position only over an instrumented range that may be a fraction of the unambiguous range as determined by the pulse repetition period in each position. After transmitting a pulse in a given direction, the beam is switched, essentially instantaneously, to another position, after the instrumented range delay. In this second position, echoes from the first position, from multiple trips of the instrumented range, enter the one-way angular sidelobes of the first position. This interference is compounded if there are several beam positions in a pulse repetition period. The author proposes a method of phase coding the pulses in such a way that the pulse-to-pulse phase variation in each direction is orthogonal to every other phase code in the other directions. The codes are Walsh functions. These are sets of binary valued (+1 or -1) functions such that all of the functions in the set are mutually orthogonal. Not every possible number N of pulses in each direction and number K of beam positions can be accommodated, but a large variety of such combinations can be accommodated. Several examples are given. The combination of low one-way sidelobes and orthogonality (or near orthogonality) of the phase codes should provide for very stringent sidelobe self interference rejection     

A New Class of Polyphase Pulse Compression Codes and Techniques

A new class of symmetric radar pulse compression polyphase codes is introduced which is compatible with digital signal processing. These codes share many of the useful properties of the Frank polyphase code. In contrast with the Frank code, the new codes are not subject to mainlobe to sidelobe ratio degradation caused by bandlimiting prior to sampling and digital pulse compression. It is shown that bandlimiting the new codes prior to pulse compression acts as a waveform amplitude weighting which has the effect of increasing the mainlobe to sidelobe ratios.     

Design Principles of MIMO Radar Detectors

This paper considers the problem of multiple-input multiple-output (MIMO) radars employing space-time coding (STC) to achieve diversity. To this end, after briefly outlining the model of the received echo, a suitable detection structure is derived, and its performance is expressed in closed form as a function of the clutter statistical properties and of the space-time code matrix. Interestingly, this receiver requires prior knowledge of the clutter covariance, but the detection threshold is functionally independent thereof. At the transmitter design stage, we give two criteria for code construction: the first is based on the classical Chernoff bound, the second is an information-theoretic criterion. Interestingly, the two criteria lead to the same condition for code optimality, which in turn specializes, under the assumption of uncorrelated clutter and square code matrix, in some well-known full-rate space-time codes. A thorough performance assessment is also given, so as to establish the optimum achievable performance for MIMO radar systems.     

Quasi-Complementary Sequences

A method of constructing digital phase reversal codes which have few nonzero sidelobes and which are available in frequent lengths is given. This is particularly important in the area of longer codes. The codes are a form of combined sequence and, hence, have the desirable property of bandwidth reduction for the outer code. However, only two member codes are required. A major usage of these codes may be in addressing.     

Range-time-sidelobe reduction technique for FM-derived polyphase PCcodes

A simple, easy to implement technique is presented that can significantly reduce the range-time-sidelobes of a class of polyphase pulse compression codes. This technique reduces the highest sidelobes to only one code element magnitude independent of effective pulse compression ratio. The codes considered are polyphase codes that are derived from the step-approximation-to-linear-frequency-modulation and linear-frequency-modulation waveforms such as the P1, P3, P4, and the Frank codes. The characteristics of these codes that make this possible are explained     

跨音速三维多升力面气动设计

发展了一种跨音速多升力面的气动设计方法和设计程序,它基于已成功应用于亚、跨音速机翼设计和亚音速双翼面设计的"余量修正迭代"概念.当升力面上出现超音速区和激波时自动引用迎风格式对控制方程进行修正.开发了一系列接口程序,包括目标压力设计程序.由此气动设计程羊、TAU程序以及相应的接口程序建立了跨音速多升力面气动反设计软件系统.用两个鸭翼-机翼构型验证了设计方法和设计程序,结果表明在高跨音速下设计迭代有很好的收敛性.