Time-Frequency HOP Signals Part I: Coding Based upon the Theory of Linear Congruences

Time-frequency hop codes are developed based upon the theory of linear congruences. These codes can be used for multiuser radar and asynchronous spread spectrum communications systems. A uniform upper bound is placed on the cross-correlation function between any two elements of the code set. The upper bound is minimized by choice of time-bandwidth product and is shown to diminish as 2/N, where N is the number of elements in the code set. The size and position of spurious peaks in the autocorrelation functions are discussed. The results are extended to narrowband ambiguity functions.     

Low sidelobe radar waveforms derived from orthogonal matrices

Novel waveforms are described that have low sidelobes when individual or multiple waveforms are approximately processed. They are related to orthogonal matrices that may be associated with complementary sequences and also with periodic waveforms having autocorrelation functions with constant zero-amplitude sidelobes. Also described are sets of sequences whose cross-correlation functions sum to zero everywhere. A potential application is the elimination of ambiguous range stationary clutter     

Codes cross-correlation analysis and data/pilot code pairs optimization for Galileo E1 OS and GPS L1C

The Galileo E1 open service (OS) and the global positioning system (GPS) L1C are intending to use the multiplexed binary offset carrier (MBOC) modulation in E1/L1 band, including both pilot and data components. The impact of data and pilot codes cross-correlation on the distortion of the discriminator function (i.e., the S-curve) is investigated, when only the pilot (or data) components of MBOC signals are tracked. It is shown that the modulation schemes and the receiver configuration (e.g., the correlator spacing) strongly affect the S-curve bias. In this paper, two methods are proposed to optimize the data/pilot code pairs of Galileo E1 OS and GPS L1C. The optimization goal is to obtain the minimum average S-curve bias when tracking only the pilot components a the specific correlator spacing. Figures of merit, such as S-curve bias, correlation loss and code tracking variance have been adopted for analyzing and comparing the un-optimized and optimized code pairs. Simulation results show that the optimized data/pilot code pairs could significantly mitigate the intra-channel codes cross-correlation, and then improve the code tracking performance of MBOC signals.     

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     

Proposed airborne optical fiber asynchronous CDMA systems usingfully optical orthogonal codes for real-time avionic data distributionsand computer interconnects

We report the design of optical fiber asynchronous code-division multiple-access (CDMA) systems using fully optical orthogonal codes (FOOCs), which can be employed to support future airborne real-time communication services. The use of incoherent optical CDMA (IO-CDMA) can result in lower complexity and more reliable implementation than that of the coherent version, so this makes IO-CDMA more adequate for operation in the severe aircraft environment. When FOOCs are used in the IO-CDMA systems, the peaks of all the cross-correlation functions and all the sidelobes of any auto-correlation function are then limited to “1” (i.e., the minimum correlation constraint for incoherent optical processing) in fully asynchronous transmissions. Moreover, proposed systems can effectively support multi-rate and variable-rate data communications with no violation of the minimum correlation constraint and no change of IO-CDMA encoders/decoders. This characteristic can be used to improve the system flexibility and availability. A basic experiment is also demonstrated to verify the characteristics of FOOCs     

Range Sidelobe Suppression for Barker Codes

The utility of Barker-type phase-reversal codes is extended by the use of sidelobe suppression techniques that can be easily implemented in digital form. It is shown that sidelobe suppression techniques can be found where the tapped delay line used to reduce the sidelobes has only a few distinct tap weights, in which case the complexity of the digital processor is greatly reduced. An example is given where the technique is applied to Barker codes with positive sidelobes, specifically, the 13-element Barker code. If higher pulse compression factors are desired than are obtainable with Barker codes, multistage Barker codes may be used. The sidelobes then may be suppressed for any one or all of the different coding stages.     

General forms and properties of zero cross-correlation radarwaveforms

General forms for both the complementary and noncomplementary zero cross-correlation waveform sets are developed. Various properties of these codes and their relationship to zero sidelobe periodic codes are stated and proved. Some radar applications and practical considerations of using these codes are briefly discussed     

Generalized Feedback Decoding of Convolutional Codes

The use of convolutional codes with feedback decoding is a common error-correction technique in simple communication systems. A drawback of conventional feedback decoding is the limitation to a class of self-orthogonal codes which, in general, are nonoptimum. Based on distance properties of the utilized code and test-error pattern analysis, we propose generalized feedback decoding which does not have the abovementioned limitation. This is minimum distance decoding and can be applied to any convolutional code while still maintaining its simplicity. Therefore, it has the advantage of being easily adopted in existing systems. We can use the relatively complicated Viterbi or sequential decoders in larger terminals and, with the same code, use the proposed decoders in smaller terminals; otherwise, both large and small terminals must utilize the same type of decoder. The proposed decoding scheme could also be used to simplify and speed up sequential decoding. In addition, comparisons of the proposed decoder with other feedback decoders are presented.     

Frequency hop multiple access codes based upon the theory of cubiccongruences

The need for families of frequency-hop codes which have mutually small auto-ambiguity and cross-ambiguity functions is discussed. Current coding methods are reviewed. A new family of frequency-hop codes based upon the number-theoretic concept of cubic congruences is introduced. It is shown that for about 50% of the prime numbers, families of full codes exist which have at most two coincidences for any time-frequency shift in their auto-ambiguity functions and at most three coincidences in the set of mutual cross-ambiguity functions     

Signal Representation by Prolate Spheroidal Wave Functions

The efficiency for signal representation of the angular prolate spheroidal wave function, particularly the two sets Sol(1, t) and Sol(8, t) is discussed Six signal waveforms are considered: rectangular, triangular, trapezoidal, exponential, Gaussian, and cosine-squared. For each, a representation is made in terms of the two sets above and also the Fourier cosine functions. As the number of terms of the representation increases, the approximation gets better. A measure of the ?goodness? of the approximation is the percentage of the total signal energy represented by the finite expansion, over a fixed, finite time interval. The angular prolate spheroidal wave functions are a very efficient orthogonal set in this sense. Their principal advantage over Fourier cosine functions occurs for cases whereby only a very few terms of the expansion are to be used to approximate a signal shape.     

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

基于非线性函数构造了一类新的认证码,计算出了该认证码替换攻击成功的概率和模仿攻击成功的概率,并与前人所做的认证码进行了比较,分析了所构造认证码的优缺点。     

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     

Optimum Processing of Unequally Spaced Radar Pulse Trains for Clutter Rejection

A train of radar pulses from one resolution cell can be processed coherently to reject echoes from external clutter and detect targets moving radially with respect to the clutter. Optimum methods of signal processing are defined for systems in which the interpulse spacings are multiply staggered to avoid target blind speeds. Likelihood ratio tests are developed for systems in which the target Doppler frequency is known a priori and for systems employing a bank of filters to cover the target Doppler band. To implement such tests, the N pulses in the train are added with complex weights and the amplitude of the sum compared with a detection threshold. The set of weights which maximizes the average signal-to-clutter ratio is also computed for a single-filter system with unknown target Doppler frequency. When the clutter autocorrelation function is exponential, the clutter covariance matrix can be inverted analytically. This latter result is useful for comparing different interpulse-spacing codes for a particular system application.     

Transmit Beamforming for MIMO Radar Systems using Signal Cross-Correlation

Proposed next-generation radar systems will have multiple transmit apertures with complete flexibility in the choice of the signals transmitted at each aperture. Here we propose the use of multiple signals with arbitrary cross-correlation matrix R, and show that R can be chosen to achieve or approximate a desired spatial transmit beampattern. Two specific problems are addressed. The first is the constrained optimization problem of finding the value of R which causes the true transmit beampattern to be close in some sense to a desired beampattern. This is approached using convex optimization techniques. The second is the problem of designing multiple constant-modulus waveforms with given cross-correlation R. The use of coded binary phase shift keyed (BPSK) waveforms is considered. A method for finding the code sequences based on random signaling with a structured correlation matrix is proposed. It is also shown that by restricting the class of admissible waveforms one reduces the set of possible signal correlation matrices.     

Modified Barker and Huffman Sequences in Combination Codes

lt is possible that usable combination codes can be obtained if Barker and Huffman sequences are chosen as the inner and outer codes. lt is shown that an improvement in either energy efficiency or time sidelobe structure will result either from a modification of a Huffman sequence or from a modification of a Barker sequence. Results are given for a combination code of length 91, with inner and outer codes of length 7 and 13.     

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

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

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     

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

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

Poly-phase codes and optimal filters for multiple user ranging

A technique is introduced to select poly-phase codes and optimal filters of a pulse compression system that have specific temporal and frequency characteristics. In the particular problem under study, multiple vehicles are assigned unique codes and receiver filters that have nearly orthogonal signatures. Narrowband users, that act as interference, are also present within the system. A code selection algorithm is used to select codes which have low autocorrelation sidelobes and low cross correlation peaks. Optimal mismatched filters are designed for these codes which minimize the peak values in the autocorrelation and the cross correlation functions. An adjustment to the filter design technique produces filters with nulls in their frequency response, in addition to having low correlation peaks. The method produces good codes and filters for a four-user system with length 34 four-phase codes. There is considerable improvement in cross and autocorrelation sidelobe levels over the matched filter case with only a slight decrease in the signal-to-noise ratio (SNR) of the system. The mismatched filter design also allows the design of frequency nulls at any frequency with arbitrary null attenuation, null width, and sidelobe level, at the cost of a slight decrease in processing gain     

基于辛几何构作一类新的带仲裁的认证码

具有仲裁的认证码既要防止敌手的欺骗,又要防止收方和发方的互相欺骗。利用有限域上辛几何构造了一类具有仲裁的认证码,计算了其容量参数。假设编码规则是按照均匀概率分布选择,给出了敌手模仿攻击、敌手替换攻击、发方模仿攻击、收方模仿攻击和收方替换攻击的成功概率。研究结论表明可用辛几何构作许多带仲裁的认证码。