Do the Barker Codes End?

A Barker code is a binary code with k^th autocorrelation <= 1 for all nonzero k. At the workshop, the Barker code group split into four non-disjoint subgroups: - An "algebra group", who explored symmetries of the search space that preserve the autocorrelations' magnitude. - A "computing group", who explored methods for quickly finding binary codes with very good autocorrelation properties. - A "statistics group", who explored ways to quantify what has been empirically observed about autocorrelation in the search space S_2^N. - A "continuous group", who explored a non-discrete analogue of the problem of finding sequences with good autocorrelations

Vibroseis encoding

The FM signals, called sweeps, used in the Vibroseis method of seismic exploration show a considerable amount of energy in the sidelobes after correlation detection. These sidelobes represent signal generated noise and if not kept low in amplitude they miggit mask subsequent reflections, thereby reducing the detection capability of the Vibroseis system. The purpose of this research has been to investigate new coded signal design techniques for the use with Vibroseis, in order to achieve sidelobe suppression. Some of the codes examined have already been known to radar and communication theory, whilst some codes are original developments of this research exercise. Binary and quaternary complementary series are found to be especially suitable for a Vibroseis encoding technique. A new and simple algorithm for the generation of quaternary series from known binary complementary sequences is given and the concept of correlation matrices is introduced to complementary series, permitting signal design in the detection window. The encoded Vibroseis input signals were tested on a computer and showed perfect sidelobe suppression a certain distance away from the main compressed pulse, when detected by a matched filter. Field tests with the coded signals were conducted, taking advantage of a computerized Vibroseis field system. The tests showed promising results. However, it became clear that the vibrator control devices will have to be adjusted to the transmission of such sophisti cated signals, in order to allow substantially better results than in the conventional Vibroseis system. A ‘Continuous Vibroseis Transmission System’ is suggested, transmitting energy during the normal listening period. Such a system has been developed witht h help of so-called ‘Mutually-Orthogonal-Complementay Sets of Sequences’ and although not yet practically tested its anticipated advantages and disadvantages are described. Finally, ‘Predistortion’ as a method of Vibroseis signal design is examined. Providing the correct predestortion parameters are chosen, the signal-to-correlation noise ratio an be increased. A spectrum whitening effect observed an addition of selected perdistorted sweeps can be of advantage in a quaternary comlementary coded Viboseis system, permitting an optimal wavelet design in the detection window

Code design and analysis for multiple access communications

This thesis explores various coding aspects of multiple access communications, mainly for spread spectrum multiaccess(SSMA) communications and collaborative coding multiaccess(CCMA) communications. Both the SSMA and CCMA techniques permit efficient simultaneous transmission by several users sharing a common channel, without subdivision in time or frequency. The general principle behind these two multiaccess schemes is that one can find sets of signals (codes) which can be combined together to form a composite signal; on reception, the individual signals in the set can each be recovered from the composite signal. For the CCMA scheme, the isolation between users is based on the code structure; for the SSMA scheme, on the other hand, the isolation between users is based on the autocorrelation functions(ACFs) and crosscorrelation functions (CCFs) of the code sequences. It is clear that, in either case, the code design is the key to the system design.For the CCMA system with a multiaccess binary adder channel, a class of superimposed codes is analyzed. It is proved that every constant weight code of weight w and maximal correlation λ corresponds to a subclass of disjunctive codes of order T 3, the out-of-phase ACFs and CCFs of the codes are constant and equal to √L. In addition, all codes of the same length are mutually orthogonal.2. Maximal length sequences (m-sequences) over Gaussian integers, suitable for use with QAM modulation, are considered. Two sub-classes of m-sequences with quasi-perfect periodic autocorrelations are obtained. The CCFs between the decimated m-sequences are studied. By applying a simple operation, it is shown that some m-sequences over rational and Gaussian integers can be transformed into perfect sequences with impulsive ACFs.3. Frank codes and Chu codes have perfect periodic ACFs and optimum periodic CCFs. In addition, it is shown that they also have very favourable nonperiodic ACFs; some new results concerning the behaviour of the nonperiodic ACFs are derived. Further, it is proved that the sets of combinedFrank/Chu codes, which contain a larger number of codes than either of the two constituent sets, also have very good periodic CCFs. Based on Frank codes and Chu codes, two interesting classes of real-valued codes with good correlation properties are defined. It is shown that these codes have periodic complementary properties and good periodic and nonperiodic ACF/CCFs.Finally, a hybrid CCMA/SSMA coding scheme is proposed. This new hybrid coding scheme provides a very flexible and powerful multiple accessing capability and allows simple and efficient decoding. Given an SSMA system with K users and a CCMA system with N users, where at most T users are active at any time, then the hybrid system will have K . N users with at most T.K users active at any time. The hybrid CCMA/SSMA coding scheme is superior to the individual CCMA system or SSMA system in terms of information rate, number of users, decoding complexity and external interference rejection capability

Code design and analysis for multiple access communications

This thesis explores various coding aspects of multiple access communications, mainly for spread spectrum multiaccess(SSMA) communications and collaborative coding multiaccess(CCMA) communications. Both the SSMA and CCMA techniques permit efficient simultaneous transmission by several users sharing a common channel, without subdivision in time or frequency. The general principle behind these two multiaccess schemes is that one can find sets of signals (codes) which can be combined together to form a composite signal; on reception, the individual signals in the set can each be recovered from the composite signal. For the CCMA scheme, the isolation between users is based on the code structure; for the SSMA scheme, on the other hand, the isolation between users is based on the autocorrelation functions(ACFs) and crosscorrelation functions (CCFs) of the code sequences. It is clear that, in either case, the code design is the key to the system design.For the CCMA system with a multiaccess binary adder channel, a class of superimposed codes is analyzed. It is proved that every constant weight code of weight w and maximal correlation λ corresponds to a subclass of disjunctive codes of order T 3, the out-of-phase ACFs and CCFs of the codes are constant and equal to √L. In addition, all codes of the same length are mutually orthogonal.2. Maximal length sequences (m-sequences) over Gaussian integers, suitable for use with QAM modulation, are considered. Two sub-classes of m-sequences with quasi-perfect periodic autocorrelations are obtained. The CCFs between the decimated m-sequences are studied. By applying a simple operation, it is shown that some m-sequences over rational and Gaussian integers can be transformed into perfect sequences with impulsive ACFs.3. Frank codes and Chu codes have perfect periodic ACFs and optimum periodic CCFs. In addition, it is shown that they also have very favourable nonperiodic ACFs; some new results concerning the behaviour of the nonperiodic ACFs are derived. Further, it is proved that the sets of combinedFrank/Chu codes, which contain a larger number of codes than either of the two constituent sets, also have very good periodic CCFs. Based on Frank codes and Chu codes, two interesting classes of real-valued codes with good correlation properties are defined. It is shown that these codes have periodic complementary properties and good periodic and nonperiodic ACF/CCFs.Finally, a hybrid CCMA/SSMA coding scheme is proposed. This new hybrid coding scheme provides a very flexible and powerful multiple accessing capability and allows simple and efficient decoding. Given an SSMA system with K users and a CCMA system with N users, where at most T users are active at any time, then the hybrid system will have K . N users with at most T.K users active at any time. The hybrid CCMA/SSMA coding scheme is superior to the individual CCMA system or SSMA system in terms of information rate, number of users, decoding complexity and external interference rejection capability

A study of correlation of sequences.

by Wai Ho Mow.Thesis (Ph.D.)--Chinese University of Hong Kong, 1993.Includes bibliographical references (leaves 116-124).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Spread Spectrum Technique --- p.2Chapter 1.1.1 --- Pulse Compression Radars --- p.3Chapter 1.1.2 --- Spread Spectrum Multiple Access Systems --- p.6Chapter 1.2 --- Definitions and Notations --- p.8Chapter 1.3 --- Organization of this Thesis --- p.12Chapter 2 --- Lower Bounds on Correlation of Sequences --- p.15Chapter 2.1 --- Welch's Lower Bounds and Sarwate's Generalization --- p.16Chapter 2.2 --- A New Construction and Bounds on Odd Correlation --- p.23Chapter 2.3 --- Known Sequence Sets Touching the Correlation Bounds --- p.26Chapter 2.4 --- Remarks on Other Bounds --- p.27Chapter 3 --- Perfect Polyphase Sequences: A Unified Approach --- p.29Chapter 3.1 --- Generalized Bent Functions and Perfect Polyphase Sequences --- p.30Chapter 3.2 --- The General Construction of Chung and Kumar --- p.32Chapter 3.3 --- Classification of Known Constructions ...........； --- p.34Chapter 3.4 --- A Unified Construction --- p.39Chapter 3.5 --- Desired Properties of Sequences --- p.41Chapter 3.6 --- Proof of the Main Theorem --- p.45Chapter 3.7 --- Counting the Number of Perfect Polyphase Sequences --- p.49Chapter 3.8 --- Results of Exhaustive Searches --- p.53Chapter 3.9 --- A New Conjecture and Its Implications --- p.55Chapter 3.10 --- Sets of Perfect Polyphase Sequences --- p.58Chapter 4 --- Aperiodic Autocorrelation of Generalized P3/P4 Codes --- p.61Chapter 4.1 --- Some Famous Polyphase Pulse Compression Codes --- p.62Chapter 4.2 --- Generalized P3/P4 Codes --- p.65Chapter 4.3 --- Asymptotic Peak-to-Side-Peak Ratio --- p.66Chapter 4.4 --- Lower Bounds on Peak-to-Side-Peak Ratio --- p.67Chapter 4.5 --- Even-Odd Transformation and Phase Alphabet --- p.70Chapter 5 --- Upper Bounds on Partial Exponential Sums --- p.77Chapter 5.1 --- Gauss-like Exponential Sums --- p.77Chapter 5.1.1 --- Background --- p.79Chapter 5.1.2 --- Symmetry of gL(m) and hL(m) --- p.80Chapter 5.1.3 --- Characterization on the First Quarter of gL(m) --- p.83Chapter 5.1.4 --- Characterization on the First Quarter of hL(m) --- p.90Chapter 5.1.5 --- Bounds on the Diameters of GL(m) and HL(m) --- p.94Chapter 5.2 --- More General Exponential Sums --- p.98Chapter 5.2.1 --- A Result of van der Corput --- p.99Chapter 6 --- McEliece's Open Problem on Minimax Aperiodic Correlation --- p.102Chapter 6.1 --- Statement of the Problem --- p.102Chapter 6.2 --- A Set of Two Sequences --- p.105Chapter 6.3 --- A Set of K Sequences --- p.110Chapter 7 --- Conclusion --- p.113Bibliography --- p.12

Cross Z-Complementary Pairs for Optimal Training in Spatial Modulation Over Frequency Selective Channels

The contributions of this article are twofold: Firstly, we introduce a novel class of sequence pairs, called “cross Z-complementary pairs (CZCPs),” each displaying zero-correlation zone (ZCZ) properties for both their aperiodic autocorrelation sums and crosscorrelation sums. Systematic constructions of perfect CZCPs based on selected Golay complementary pairs (GCPs) are presented. Secondly, we point out that CZCPs can be utilized as a key component in designing training sequences for broadband spatial modulation (SM) systems. We show that our proposed SM training sequences derived from CZCPs lead to optimal channel estimation performance over frequency-selective channels