𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive reconstruction of sequences from group-delay

✍ Scribed by L.F. Chaparro; Aruna Bayya

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
569 KB
Volume
322
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

A recursive procedure to reconstruct a given sequence ,from its group delay or phase derivative is g&en. The procedure is &used on the relationships between minims, maximum phase sequences and their cepstra, and on the modtjied Ieast squares (MLS) rational approximation. To avoid unwrapping of the phase, the cepstrum of the sequence is calculated from the group delay,~unction. Using a recursive procedure, ~e~ndfrom the cepstrum values a minimum phase sequence with a phase equal to that of the original sequence. The reconstructed sequence is obtained using the MLS procedure to find recursively a rational appro.~imation of the minimum phase sequence. The constraints under which the phase reconstruction is possible are checked with a root distribution algorithm, and we indicate how to modify the sequence when the constraints are not satisfied. Examples illustrate the eficiency of the proposed procedure.

πŸ“œ SIMILAR VOLUMES

Design of 2-D recursive digital filters
Design of 2-D recursive digital filters with constant group delay characteristics
✍ N. Nagamuthu; M.A. Sid-Ahmed; M. Ahmadi πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 599 KB

## In this work a modtjication of a scheme developed previously is presented. The technique uses the McClellan transformation applied to a 1-D zero-phase recursive jlter to obtain a 2-D zero-phase recursive jlter which is unstable. The stabilization process is done through the decomposition of the 2

Efficient Reconstruction of Sequences fr
Efficient Reconstruction of Sequences from Their Subsequences or Supersequences
✍ Vladimir I. Levenshtein πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 176 KB

In the paper two combinatorial problems for the set F n q of sequences of length n over the alphabet F q =[0, 1, ..., q&1] are considered. The maximum size N & q (n, t) of the set of common subsequences of length n&t and the maximum size N + q (n, t) of the set of common supersequences of length n+t

Recursive estimation of discrete-time si
Recursive estimation of discrete-time signals from nonlinear randomly delayed observations
✍ R. Caballero-Águila; A. Hermoso-Carazo; J.D. JimΓ©nez-LΓ³pez; J. Linares-PΓ©rez; S. πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 726 KB

In this paper, one-stage prediction, filtering, and fixed-point smoothing problems are addressed for nonlinear discrete-time stochastic systems with randomly delayed measurements perturbed by additive white noise. The observation delay is modelled by a sequence of independent Bernoulli random variab

Reconstruction of a Radially Symmetric P
Reconstruction of a Radially Symmetric Potential from Two Spectral Sequences
✍ William Rundell; Paul E. Sacks πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 213 KB

We consider the problem of determining a radially symmetric potential in the three-dimensional SchrΓΆdinger equation from eigenvalues associated with two different angular-momentum quantum numbers. This leads to a singular eigenvalue problem for which there are no known general uniqueness results for