scispace - formally typeset
Journal ArticleDOI

On the Eigenvalues of Matrices for the Reconstruction of Missing Uniform Samples

01 May 2010-IEEE Transactions on Signal Processing (IEEE)-Vol. 58, Iss: 5, pp 2896-2900

TL;DR: The relationship between the eigenvalues associated with the matrices of the minimum dimension time-domain and frequency-domain approaches used for reconstructing missing uniform samples and the weighted Toeplitz matrix is derived.

AbstractIn this correspondence, we derive the relationship between the eigenvalues associated with the matrices of the minimum dimension time-domain and frequency-domain approaches used for reconstructing missing uniform samples. The dependency of the eigenvalues of the weighted Toeplitz matrix on positive weights are explored. Simple bounds for the maximum and minimum eigenvalues of the weighted Toeplitz matrix are also presented. Alternative matrices possessing the same nonzero eigenvalues as that of the weighted Toeplitz matrix are provided. We verify the theory by the examples presented.

...read more


Citations
More filters
Proceedings ArticleDOI
13 Mar 2013
TL;DR: This paper presents an educational tool to be used in signal processing interpolation-related subjects that allows its users to apply three error patterns geometry to the signals and test minimum dimension and maximum dimension signal reconstruction algorithms.
Abstract: This paper presents an educational tool to be used in signal processing interpolation-related subjects. Besides the consolidation of acquired theoretical knowledge, the tool allows its users to apply three error patterns geometry to the signals and test minimum dimension and maximum dimension signal reconstruction algorithms. In the specific case of minimum dimension problems it can be solved using different solvers, iterative and direct linear equations methods. The developed tool allows the problem conditioning analysis through the spectral radius of the system matrix, the condition number and others parameters available in some specific methods. This feature gives the possibility to alter the problem definitions to the desired goal before the reconstruction begins and to choose the optimal method, depending on each problem constraints The time unit that measures the algorithms performance is expressed in terms of one Fourier Transform (FFT) calculation time. In this way the data is presented not in an absolute way but in a relative measure independent from the machine's architecture.

Cites methods from "On the Eigenvalues of Matrices for ..."

  • ...We are planning to implement new methods and features namely semi-iterative methods, for example the Steepest Descent and the Conjugate gradient methods, as well other signal reconstruction frequency-domain formulations [14][15]....

    [...]

Journal ArticleDOI
TL;DR: This work presents a newer and more complete version of an educational tool to be used in signal processing interpolation-related subjects and allows now its users to apply three error geometry patterns, test minimum or maximum dimension signal reconstruction algorithms and problem conditioning through the analysis of the matrix spectral radius or the condition number.
Abstract: This work presents a newer and more complete version of an educational tool to be used in signal processing interpolation-related subjects. Besides the consolidation of acquired theoretical knowledge, the tool allows now its users to apply three error geometry patterns, test minimum or maximum dimension signal reconstruction algorithms and problem conditioning through the analysis of the matrix spectral radius or the condition number: these new features gives the possibility to alter the problem definitions to the desired goal before the reconstruction begins. The time unit that measures the algorithms performance is ¶(nlogn) thus independent from the machine’s architecture. A video of the developed tool can be seen in: https://www.dropbox.com/s/t6yiiuy31ramxse/FILME_1.avi.

Cites methods from "On the Eigenvalues of Matrices for ..."

  • ...Reconstr Results ining the limi he tool was pr ome exampl tuations. they were ask test group has elation to the f redundancy SPIEW a car be effective, et al., 1993; tives of the ma “Which overs signals?”...

    [...]

  • ...In this paper a new version of the “Signal Processing Interpolation Educational Tool” (SPIEW) is presented (Costa et al., 2012)....

    [...]

  • ...SPIEW, choo e chosen sign )....

    [...]

  • ...This allows e the results o tructed signals the Papoulis-G mpare the pe he maximum our opinion, oblem conditio al radius of e signals? tion number h ider the tool u uiz done to th of the subje uestion 2, 60 helpful, and s ure Work ersion, SPIEW accessible wa etain and con ithm dimensio lost are also ble and the i lem condition best algorith ser to enhanc alysis is done the user to al btained using are compute erchberg algo rformance of number of iter Modern the worst erro ning which re matrix S is sm as a value of seful?...

    [...]

  • ...Tests an SPIEW wa during its more effec obtained f tested....

    [...]


References
More filters
Book
01 Jan 1985
TL;DR: In this article, the authors present results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrate their importance in a variety of applications, such as linear algebra and matrix theory.
Abstract: Linear algebra and matrix theory are fundamental tools in mathematical and physical science, as well as fertile fields for research. This new edition of the acclaimed text presents results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrates their importance in a variety of applications. The authors have thoroughly revised, updated, and expanded on the first edition. The book opens with an extended summary of useful concepts and facts and includes numerous new topics and features, such as: - New sections on the singular value and CS decompositions - New applications of the Jordan canonical form - A new section on the Weyr canonical form - Expanded treatments of inverse problems and of block matrices - A central role for the Von Neumann trace theorem - A new appendix with a modern list of canonical forms for a pair of Hermitian matrices and for a symmetric-skew symmetric pair - Expanded index with more than 3,500 entries for easy reference - More than 1,100 problems and exercises, many with hints, to reinforce understanding and develop auxiliary themes such as finite-dimensional quantum systems, the compound and adjugate matrices, and the Loewner ellipsoid - A new appendix provides a collection of problem-solving hints.

23,959 citations

Journal ArticleDOI
TL;DR: In this paper, the authors apply the theory developed in the preceding paper to a number of questions about timelimited and bandlimited signals, and find the signals which do the best job of simultaneous time and frequency concentration.
Abstract: The theory developed in the preceding paper1 is applied to a number of questions about timelimited and bandlimited signals. In particular, if a finite-energy signal is given, the possible proportions of its energy in a finite time interval and a finite frequency band are found, as well as the signals which do the best job of simultaneous time and frequency concentration.

2,382 citations

Journal ArticleDOI
TL;DR: In this article, Toeplitz forms are used for the trigonometric moment problem and other problems in probability theory, analysis, and statistics, including analytic functions and integral equations.
Abstract: Part I: Toeplitz Forms: Preliminaries Orthogonal polynomials. Algebraic properties Orthogonal polynomials. Limit properties The trigonometric moment problem Eigenvalues of Toeplitz forms Generalizations and analogs of Toeplitz forms Further generalizations Certain matrices and integral equations of the Toeplitz type Part II: Applications of Toeplitz Forms: Applications to analytic functions Applications to probability theory Applications to statistics Appendix: Notes and references Bibliography Index.

2,279 citations

Book
01 Jan 1984
TL;DR: In this paper, Toeplitz forms are used for the trigonometric moment problem and other problems in probability theory, analysis, and statistics, including analytic functions and integral equations.
Abstract: Part I: Toeplitz Forms: Preliminaries Orthogonal polynomials. Algebraic properties Orthogonal polynomials. Limit properties The trigonometric moment problem Eigenvalues of Toeplitz forms Generalizations and analogs of Toeplitz forms Further generalizations Certain matrices and integral equations of the Toeplitz type Part II: Applications of Toeplitz Forms: Applications to analytic functions Applications to probability theory Applications to statistics Appendix: Notes and references Bibliography Index.

1,561 citations


"On the Eigenvalues of Matrices for ..." refers background in this paper

  • ...The eigenvalues of are the nonzero eigenvalues of , or ....

    [...]

Journal ArticleDOI
TL;DR: A computational procedure is devised which must reduce a defined ‘error energy’ which is implicit in the truncated spectrum and it is demonstrated that by so doing, resolution well beyond the diffraction limit is attained.
Abstract: A new view of the problem of continuing a given segment of the spectrum of a finite object is presented. Based on this, the problem is restated in terms of reducing a defined ‘error energy’ which is implicit in the truncated spectrum. A computational procedure, which is readily implemented on general purpose computers, is devised which must reduce this error. It is demonstrated that by so doing, resolution well beyond the diffraction limit is attained. The procedure is shown to be very effective against noisy data.

1,027 citations