Searcharxiv⌕ Search

arXiv subjects

Jan C Olivier

Publications and source records attributed to Jan C Olivier.

3 recordsLinked to original sources

Finite-range Lattice Momentum Operators for Quantum Field Theory

We propose a Z-transform framework for the analysis and synthesis of finite range lattice momentum operators in quantum field theory. In this formulation, translation-invariant lattice operators are represented as functions of the complex variable $z$ in the unit circle, allowing their spectral properties to be analyzed using tools from digital signal processing and rational approximation theory. Within this framework, the fermion doubling problem is reinterpreted as the appearance of unwanted zeros of the discrete momentum operator on the unit circle --- an aliasing phenomenon in the sense of the Nyquist sampling theorem --- and the conditions for ghost suppression are expressed as precise constraints on the zero structure of the operator's transfer function. It is proven that no rational function can satisfy all required conditions simultaneously, motivating the finite impulse response approach developed here. This reframing naturally suggests a class of finite-range momentum operators, constructed by solving a least-squares approximation problem in the frequency domain. The resulting finite impulse response (FIR) operator approximates the continuum derivative across the full Brillouin zone, with ghost suppression achieved through the accuracy of the spectral approximation rather than through the addition of a symmetry-breaking Wilson term or the infinite-range nonlocal SLAC derivative. Numerical investigation confirms that near $θ= π$ only plane waves propagate coherently, and these exhibit group velocities far exceeding the speed of light, further distinguishing them from physical low-energy excitations. No ghost wave packet solutions exist near $θ= π$.

eess.SP↗

Hidden Markov Model Decoding for LDPC Codes

The paper proposes an iterative Hidden Markov Model (HMM) for decoding a Low Density Parity Check (LDPC) code. It is demonstrated that a first-order HMM provides a natural framework for the decoder. The HMM is time-homogeneous with a fixed transition matrix and is based on a random walk through the encoded frame bits. Each hidden state contains a pair of two encoded bits, and parity checks are naturally incorporated into the observation model. The paper shows that by implementing a forward-backward smoothing estimator for the hidden states, decoding is efficient and requires only a small number of iterations in most cases. The results show that the LDPC decoding threshold is significantly improved compared to belief propagation (BP) on a Tanner graph. Numerical results are presented showing that LDPC codes under the proposed decoder yield a frame error rate (FER) and decoding threshold comparable to that of a Polar code where Successive Cancellation List (SCL) - Cyclic Redundancy Check (CRC) decoding is deployed. This is shown to be achieved even if the frame length is short (on the order of $512$ bits or less) and a regular LDPC code is used. 1

eess.SP↗

Minimum Phase Linear Antenna Array Design

The paper considers the design of minimum phase discrete linear arrays. The paper introduces recent advances for the design of minimum phase Finite Impulse Response filters, as applied to the design of minimum phase linear arrays. The minimum phase linear array is demonstrated to require the least number of elements of all linear arrays that are able to achieve a given magnitude pattern specification. Three example designs are presented and compared to results from the literature.

eess.SP↗