Recursive reconstruction of sequences from group-delay
A recursive procedure to reconstruct a given sequence from its group delay or phase derivative is given. The procedure is based on the relationships between minimum, maximum phase sequences and their cepstra, and on the modified least squares (MLS) rational approximation. To avoid unwrapping of the phase, the cepstrum of the sequence is calculated from the group delay function. Using a recursive procedure, we find from 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 approximation 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 efficiency of the proposed procedure.
- An algorithm for signal reconstruction from its phase based upon least square criteria
- The reconstruction of a multidimensional sequence from the phase or magnitude of its Fourier transform
- Reconstruction of signals from phase: Efficient algorithms, segmentation, and generalizations
- Non-iterative reconstruction of signals from signed Fourier transform magnitude
- A new approximation of constant group delay in the discrete domain
- scientific article; zbMATH DE number 3577138 (Why is no real title available?)
- Iterative techniques for minimum phase signal reconstruction from phase or magnitude
- Reconstruction of signals from phase: Efficient algorithms, segmentation, and generalizations
- Signal reconstruction from phase or magnitude
This page was built for publication: Recursive reconstruction of sequences from group-delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081583)