## Journals

- Advances in Mathematics of Communications
- Big Data & Information Analytics
- Communications on Pure & Applied Analysis
- Discrete & Continuous Dynamical Systems - A
- Discrete & Continuous Dynamical Systems - B
- Discrete & Continuous Dynamical Systems - S
- Evolution Equations & Control Theory
- Inverse Problems & Imaging
- Journal of Computational Dynamics
- Journal of Dynamics & Games
- Journal of Geometric Mechanics
- Journal of Industrial & Management Optimization
- Journal of Modern Dynamics
- Kinetic & Related Models
- Mathematical Biosciences & Engineering
- Mathematical Control & Related Fields
- Mathematical Foundations of Computing
- Networks & Heterogeneous Media
- Numerical Algebra, Control & Optimization
- AIMS Mathematics
- Conference Publications
- Electronic Research Announcements
- Mathematics in Engineering

### Open Access Journals

IPI

It is well known that a matched filter gives the maximum possible output signal-to-noise ratio (

**SNR**) when the input is a scattering signal from a point like radar target in the presence of white noise. However, a matched filter produces unwanted sidelobes that can mask vital information. Several researchers have presented various methods of dealing with this problem. They have employed different kinds of less optimal filters in terms of the output**SNR**from a point-like target than that of the matched filter. In this paper we present a method of designing codes, called perfect and almost perfect pulse compression codes, that do not create unwanted sidelobes when they are convolved with the corresponding matched filter. We present a method of deriving these types of codes from any binary phase radar codes that do not contain zeros in the frequency domain. Also, we introduce a heuristic algorithm that can be used to design almost perfect codes, which are more suitable for practical implementation in a radar system. The method is demonstrated by deriving some perfect and almost perfect pulse compression codes from some binary codes. A rigorous method of comparing the performance of almost perfect codes (truncated) with that of perfect codes is presented.
IPI

FLIPS (Fortran Linear Inverse Problem Solver) is a Fortran 95 module for solving large-scale statistical linear systems. Instead of inverting large matrices, FLIPS transforms the system into a simpler one by using Givens rotations. This simplified system is then solved by FLIPS quickly and efficiently. FLIPS is also capable of calculating the full a posteriori covariance matrix. It is also possible to add or delete measurements and unknowns making it useful in time-dependent problems of the Kalman-filter type. The FLIPS implementation is explained and the advantages of using FLIPS, especially for overdetermined systems, are shown. Plans for future developments are discussed.

IPI

In Bayesian statistical inverse problems the

*a priori*probability distributions are often given as stochastic difference equations. We derive a certain class of stochastic partial difference equations by starting from second-order stochastic partial differential equations in one and two dimensions. We discuss discretisation schemes on uniform lattices of these stationary continuous-time stochastic processes and convergence of the discrete-time processes to the continuous-time processes. A special emphasis is given to an analytical calculation of the covariance kernels of the processes. We find a representation for the covariance kernels in a simple parametric form with controllable parameters: correlation length and variance. In the discrete-time processes the discretisation step is also given as a parameter. Therefore, the discrete-time covariances can be considered as discretisation-invariant. In the two-dimensional cases we find rotation-invariant and anisotropic representations of the difference equations and the corresponding continuous-time covariance kernels.
IPI

We propose a novel framework for studying radar pulse compression with continuous waveforms.
Our methodology is based on the recent developments of the mathematical
theory of comparison of measurements. First we show that a radar
measurement of a time-independent but spatially distributed radar target
is rigorously more informative than another one if the modulus of
the Fourier transform of the
radar code is greater than or equal to the modulus of
the Fourier transform of the second radar
code.
We then motivate the study by spreading a Gaussian pulse into a longer
pulse with smaller peak power and re-compressing the spread pulse into
its original form.
We then review the basic concepts of the theory and pose the conditions for statistically equivalent radar experiments.
We show that such experiments can be constructed by spreading the radar pulses via multiplication of their Fourier transforms by unimodular functions.
Finally, we show by analytical and numerical methods some examples of the spreading and re-compression of certain simple pulses.

IPI

We propose a method to construct perfect pulse-compression codes with autoregressive moving average algorithms. We first show the relation between the study of coding and decoding techniques in radar engineering and the study of unimodular polynomials with constrained coefficients. Then we extend the study to unimodular Fourier series and unimodular rational functions. We use the Fourier series and rational functions as transfer functions in the autoregressive moving average algorithms. We show that by a suitable choice of the coefficients, the autoregressive moving average algorithms are realisable, stable and causal. We show examples of some almost perfect codes, i.e. numerically truncated perfect codes. We end by proposing perfect code design principles for practical radar engineering purposes.

IPI

We propose a new class of Gaussian priors,

The prior distribution is constructed to be essentially independent of the discretization so that the a posteriori distribution will be essentially independent of the discretization grid. The covariance of a discrete correlation prior may be formed by combining the Fisher information of a discrete white noise and different-order difference priors. This is interpreted as a combination of virtual measurements of the unknown. Closed-form expressions for the continuous limits are calculated. Also, boundary correction terms for correlation priors on finite intervals are given.

A numerical example, deconvolution with a Gaussian kernel and a correlation prior, is computed.

*correlation priors*. In contrast to some well-known smoothness priors, they have stationary covariances. The correlation priors are given in a parametric form with two parameters: correlation power and correlation length. The first parameter is connected with our prior information on the variance of the unknown. The second parameter is our prior belief on how fast the correlation of the unknown approaches zero. Roughly speaking, the correlation length is the distance beyond which two points of the unknown may be considered independent.The prior distribution is constructed to be essentially independent of the discretization so that the a posteriori distribution will be essentially independent of the discretization grid. The covariance of a discrete correlation prior may be formed by combining the Fisher information of a discrete white noise and different-order difference priors. This is interpreted as a combination of virtual measurements of the unknown. Closed-form expressions for the continuous limits are calculated. Also, boundary correction terms for correlation priors on finite intervals are given.

A numerical example, deconvolution with a Gaussian kernel and a correlation prior, is computed.

## Year of publication

## Related Authors

## Related Keywords

[Back to Top]