The discrete-time bounded-real lemma in digital filtering

The Lossless Bounded-Real lemma is developed in the discrete-time domain, based only on energy balance arguments. The results are used to prove a discrete-time version of the general Bounded-Real lemma, based on a matrix spectral-factorization result that permits a transfer matrix embedding process. Some applications of the results in digital filter theory are finally outlined

Novel relations and new properties of confluent Heun's functions and their derivatives of arbitrary order

The present article reveals important properties of the confluent Heun's functions. We derive a set of novel relations for confluent Heun's functions and their derivatives of arbitrary order. Specific new subclasses of confluent Heun's functions are introduced and studied. A new alternative derivation of confluent Heun's polynomials is presented.Comment: 8 pages, no figures, LaTeX file, final versio

Tetrahedron Reflection Equation

Reflection equation for the scattering of lines moving in half-plane is obtained. The corresponding geometric picture is related with configurations of half-planes touching the boundary plane in 2+1 dimensions. This equation can be obtained as an additional to the tetrahedron equation consistency condition for a modified Zamolodchikov algebra.Comment: 10 pages, LaTe

Single-ion versus exchange anisotropy in calculating anisotropic susceptibilities of thin ferromagnetic Heisenberg films within many-body Green's function theory

We compare transverse and parallel static susceptibilities of in-plane uniaxial anisotropic ferromagnetic Heisenberg films calculated in the framework of many-body Green's function theory using single-ion anisotropies with the previously investigated case of exchange anisotropies. On the basis of the calculated observables (easy and hard axes magnetizations and susceptibilities) no significant differences are found, i. e. it is not possible to propose an experiment that might decide which kind of anisotropy is acting in an actual ferromagnetic film.Comment: 16 pages, 8 figure

Structure of A = 7 - 8 nuclei with two- plus three-nucleon interactions from chiral effective field theory

We solve the ab initio no-core shell model (NCSM) in the complete Nmax = 8 basis for A = 7 and A = 8 nuclei with two-nucleon and three-nucleon interactions derived within chiral effective field theory (EFT). We find that including the chiral EFT three-nucleon interaction in the Hamiltonian improves overall good agreement with experimental binding energies, excitation spectra, transitions and electromagnetic moments. We predict states that exhibit sensitivity to including the chiral EFT three-nucleon interaction but are not yet known experimentally.Comment: 10 pages, 6 figures, updated references and corrected a typ

Theory of optimal orthonormal subband coders

The theory of the orthogonal transform coder and methods for its optimal design have been known for a long time. We derive a set of necessary and sufficient conditions for the coding-gain optimality of an orthonormal subband coder for given input statistics. We also show how these conditions can be satisfied by the construction of a sequence of optimal compaction filters one at a time. Several theoretical properties of optimal compaction filters and optimal subband coders are then derived, especially pertaining to behavior as the number of subbands increases. Significant theoretical differences between optimum subband coders, transform coders, and predictive coders are summarized. Finally, conditions are presented under which optimal orthonormal subband coders yield as much coding gain as biorthogonal ones for a fixed number of subbands

Orthonormal and biorthonormal filter banks as convolvers, and convolutional coding gain

Convolution theorems for filter bank transformers are introduced. Both uniform and nonuniform decimation ratios are considered, and orthonormal as well as biorthonormal cases are addressed. All the theorems are such that the original convolution reduces to a sum of shorter, decoupled convolutions in the subbands. That is, there is no need to have cross convolution between subbands. For the orthonormal case, expressions for optimal bit allocation and the optimized coding gain are derived. The contribution to coding gain comes partly from the nonuniformity of the signal spectrum and partly from nonuniformity of the filter spectrum. With one of the convolved sequences taken to be the unit pulse function,,e coding gain expressions reduce to those for traditional subband and transform coding. The filter-bank convolver has about the same computational complexity as a traditional convolver, if the analysis bank has small complexity compared to the convolution itself

Effects of Multirate Systems on the Statistical Properties of Random Signals

In multirate digital signal processing, we often encounter time-varying linear systems such as decimators, interpolators, and modulators. In many applications, these building blocks are interconnected with linear filters to form more complicated systems. It is often necessary to understand the way in which the statistical behavior of a signal changes as it passes through such systems. While some issues in this context have an obvious answer, the analysis becomes more involved with complicated interconnections. For example, consider this question: if we pass a cyclostationary signal with period K through a fractional sampling rate-changing device (implemented with an interpolator, a nonideal low-pass filter and a decimator), what can we say about the statistical properties of the output? How does the behavior change if the filter is replaced by an ideal low-pass filter? In this paper, we answer questions of this nature. As an application, we consider a new adaptive filtering structure, which is well suited for the identification of band-limited channels. This structure exploits the band-limited nature of the channel, and embeds the adaptive filter into a multirate system. The advantages are that the adaptive filter has a smaller length, and the adaptation as well as the filtering are performed at a lower rate. Using the theory developed in this paper, we show that a matrix adaptive filter (dimension determined by the decimator and interpolator) gives better performance in terms of lower error energy at convergence than a traditional adaptive filter. Even though matrix adaptive filters are, in general, computationally more expensive, they offer a performance bound that can be used as a yardstick to judge more practical "scalar multirate adaptation" schemes