Good Code Sets from Complementary Pairs via Discrete Frequency Chips

It is shown that replacing the sinusoidal chip in Golay complementary code pairs by special classes of waveforms that satisfy two conditions, symmetry/anti-symmetry and quazi-orthogonality in the convolution sense, renders the complementary codes immune to frequency selective fading and also allows for concatenating them in time using one frequency band/channel. This results in a zero-sidelobe region around the mainlobe and an adjacent region of small cross-correlation sidelobes. The symmetry/anti-symmetry property results in the zero-sidelobe region on either side of the mainlobe, while quasi-orthogonality of the two chips keeps the adjacent region of cross-correlations small. Such codes are constructed using discrete frequency-coding waveforms (DFCW) based on linear frequency modulation (LFM) and piecewise LFM (PLFM) waveforms as chips for the complementary code pair, as they satisfy both the symmetry/anti-symmetry and quasi-orthogonality conditions. It is also shown that changing the slopes/chirp rates of the DFCW waveforms (based on LFM and PLFM waveforms) used as chips with the same complementary code pair results in good code sets with a zero-sidelobe region. It is also shown that a second good code set with a zero-sidelobe region could be constructed from the mates of the complementary code pair, while using the same DFCW waveforms as their chips. The cross-correlation between the two sets is shown to contain a zero-sidelobe region and an adjacent region of small cross-correlation sidelobes. Thus, the two sets are quasi-orthogonal and could be combined to form a good code set with twice the number of codes without affecting their cross-correlation properties. Or a better good code set with the same number codes could be constructed by choosing the best candidates form the two sets. Such code sets find utility in multiple input-multiple output (MIMO) radar applications

Classical sampling theorems in the context of multirate and polyphase digital filter bank structures

The recovery of a signal from so-called generalized samples is a problem of designing appropriate linear filters called reconstruction (or synthesis) filters. This relationship is reviewed and explored. Novel theorems for the subsampling of sequences are derived by direct use of the digital-filter-bank framework. These results are related to the theory of perfect reconstruction in maximally decimated digital-filter-bank systems. One of the theorems pertains to the subsampling of a sequence and its first few differences and its subsequent stable reconstruction at finite cost with no error. The reconstruction filters turn out to be multiplierless and of the FIR (finite impulse response) type. These ideas are extended to the case of two-dimensional signals by use of a Kronecker formalism. The subsampling of bandlimited sequences is also considered. A sequence x(n ) with a Fourier transform vanishes for |ω|&ges;Lπ/M, where L and M are integers with L<M, can in principle be represented by reducing the data rate by the amount M/L. The digital polyphase framework is used as a convenient tool for the derivation as well as mechanization of the sampling theorem

An Analysis of Mutually Dispersive Brown Symbols for Non-Linear Ambiguity Suppression

This thesis significantly advances research towards the implementation of optimal Non-linear Ambiguity Suppression (NLS) waveforms by analyzing the Brown theorem. The Brown theorem is reintroduced with the use of simplified linear algebraic notation. A methodology for Brown symbol design and digitization is provided, and the concept of dispersive gain is introduced. Numerical methods are utilized to design, synthesize, and analyze Brown symbol performance. The theoretical performance in compression and dispersion of Brown symbols is demonstrated and is shown to exhibit significant improvement compared to discrete codes. As a result of this research a process is derived for the design of optimal mutually dispersive symbols for any sized family. In other words, the limitations imposed by conjugate LFM are overcome using NLS waveforms that provide an effective-fold increase in radar unambiguous range. This research effort has taken a theorem from its infancy, validated it analytically, simplified it algebraically, tested it for realizability, and now provides a means for the synthesis and digitization of pulse coded waveforms that generate an N-fold increase in radar effective unambiguous range. Peripherally, this effort has motivated many avenues of future research

Statistically optimum pre- and postfiltering in quantization

We consider the optimization of pre- and postfilters surrounding a quantization system. The goal is to optimize the filters such that the mean square error is minimized under the key constraint that the quantization noise variance is directly proportional to the variance of the quantization system input. Unlike some previous work, the postfilter is not restricted to be the inverse of the prefilter. With no order constraint on the filters, we present closed-form solutions for the optimum pre- and postfilters when the quantization system is a uniform quantizer. Using these optimum solutions, we obtain a coding gain expression for the system under study. The coding gain expression clearly indicates that, at high bit rates, there is no loss in generality in restricting the postfilter to be the inverse of the prefilter. We then repeat the same analysis with first-order pre- and postfilters in the form 1+αz-1 and 1/(1+γz^-1 ). In specific, we study two cases: 1) FIR prefilter, IIR postfilter and 2) IIR prefilter, FIR postfilter. For each case, we obtain a mean square error expression, optimize the coefficients α and γ and provide some examples where we compare the coding gain performance with the case of α=γ. In the last section, we assume that the quantization system is an orthonormal perfect reconstruction filter bank. To apply the optimum preand postfilters derived earlier, the output of the filter bank must be wide-sense stationary WSS which, in general, is not true. We provide two theorems, each under a different set of assumptions, that guarantee the wide sense stationarity of the filter bank output. We then propose a suboptimum procedure to increase the coding gain of the orthonormal filter bank

Nonlinear Suppression of Range Ambiguity in Pulse Doppler Radar

Coherent pulse train processing is most commonly used in airborne pulse Doppler radar, achieving adequate transmitter/receiver isolation and excellent resolution properties while inherently inducing ambiguities in Doppler and range. First introduced by Palermo in 1962 using two conjugate LFM pulses, the primary nonlinear suppression objective involves reducing range ambiguity, given the waveform is nominally unambiguous in Doppler, by using interpulse and intrapulse coding (pulse compression) to discriminate received ambiguous pulse responses. By introducing a nonlinear operation on compressed (undesired) pulse responses within individual channels, ambiguous energy levels are reduced in channel outputs. This research expands the NLS concept using discrete coding and processing. A general theory is developed showing how NLS accomplishes ambiguity surface volume removal without requiring orthogonal coding. Useful NLS code sets are generated using combinatorial, simulated annealing optimization techniques - a general algorithm is developed to extended family size, code length, and number of phases (polyphase coding). An adaptive reserved code thresholding scheme is introduced to efficiently and effectively track the matched filter response of a target field over a wide dynamic range, such as normally experienced in airborne radar systems. An evaluation model for characterizing NLS clutter suppression performance is developed - NLS performance is characterized using measured clutter data with analysis indicating the proposed technique performs relatively well even when large clutter cells exist

Graph Signal Processing: Overview, Challenges and Applications

Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing. We then summarize recent developments in developing basic GSP tools, including methods for sampling, filtering or graph learning. Next, we review progress in several application areas using GSP, including processing and analysis of sensor network data, biological data, and applications to image processing and machine learning. We finish by providing a brief historical perspective to highlight how concepts recently developed in GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE

Wavelets and Subband Coding

First published in 1995, Wavelets and Subband Coding offered a unified view of the exciting field of wavelets and their discrete-time cousins, filter banks, or subband coding. The book developed the theory in both continuous and discrete time, and presented important applications. During the past decade, it filled a useful need in explaining a new view of signal processing based on flexible time-frequency analysis and its applications. Since 2007, the authors now retain the copyright and allow open access to the book

Multibeam radar system based on waveform diversity for RF seeker applications

Existing radiofrequency (RF) seekers use mechanically steerable antennas. In order to improve the robustness and performance of the missile seeker, current research is investigating the replacement of mechanical 2D antennas with active electronically controlled 3D antenna arrays capable of steering much faster and more accurately than existing solutions. 3D antenna arrays provide increased radar coverage, as a result of the conformal shape and flexible beam steering in all directions. Therefore, additional degrees of freedom can be exploited to develop a multifunctional seeker, a very sophisticated sensor that can perform multiple simultaneous tasks and meet spectral allocation requirements. This thesis presents a novel radar configuration, named multibeam radar (MBR), to generate multiple beams in transmission by means of waveform diversity. MBR systems based on waveform diversity require a set of orthogonal waveforms in order to generate multiple channels in transmission and extract them efficiently at the receiver with digital signal processing. The advantage is that MBR transmit differently designed waveforms in arbitrary directions so that waveforms can be selected to provide multiple radar functions and better manage the available resources. An analytical model of an MBR is derived to analyse the relationship between individual channels and their performance in terms of isolation and phase steering effects. Combinations of linear frequency modulated (LFM) waveforms are investigated and the analytical expressions of the isolation between adjacent channels are presented for rectangular and Gaussian amplitude modulated LFM signals with different bandwidths, slopes and frequency offsets. The theoretical results have been tested experimentally to corroborate the isolation properties of the proposed waveforms. In addition, the practical feasibility of the MBR concept has been proved with a radar test bed with two orthogonal channels simultaneously detecting a moving target