Sampling theorems and bases in a Hilbert space
dc.contributor.author | Beutler, Frederick J. (Frederick Joseph) | en_US |
dc.date.accessioned | 2006-04-13T14:57:09Z | |
dc.date.available | 2006-04-13T14:57:09Z | |
dc.date.issued | 1961-09 | en_US |
dc.identifier.citation | Beutler, Frederick J. (1961/09)."Sampling theorems and bases in a Hilbert space." Information and Control 4(2-3): 97-117. <http://hdl.handle.net/2027.42/32353> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B7MFM-4DX4DTM-1/2/254fde697d302b2f2f1341ca4ccdda5b | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/32353 | |
dc.description.abstract | A unified approach to sampling theorems for (wide sense) stationary random processes rests upon Hilbert space concepts. New results in sampling theory are obtained along the following lines: recovery of the process [chi](t) from nonperiodic samples, or when any finite number of samples are deleted; conditions for obtaining [chi](t) when only the past is sampled; a criterion for restoring [chi](t) from a finite number of consecutive samples; and a minimum mean square error estimate of [chi](t) based on any (possibly nonperiodic) set of samples.In each case, the proofs apply not only to the recovery of [chi](t), but are extended to show that (almost) arbitrary linear operations on [chi](t) can be reproduced by linear combinations of the samples. Further generality is attained by use of the spectral distribution function F([middle dot]) of [chi](t), without assuming F([middle dot]) absolutely continuous. | en_US |
dc.format.extent | 1005864 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Sampling theorems and bases in a Hilbert space | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Science (General) | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Aeronautical and Astronautical Engineering, The University of Michigan, Ann Arbor, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/32353/1/0000424.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/S0019-9958(61)80001-6 | en_US |
dc.identifier.source | Information and Control | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.