TY - GEN
T1 - General behavior of sampling-based signal and system representation
AU - Boche, Holger
AU - Mönich, Ullrich J.
PY - 2008
Y1 - 2008
N2 - We analyze sampling representations for translation invariant, linear and bounded systems, operating on bandlimited signals. First, we characterize suitable kernels for reconstruction processes with and without oversampling. Then, we investigate the convergence behavior of general approximation processes, operating only on the samples and not on the whole continuoustime signal, for translation invariant, linear and bounded systems and signals in the Paley-Wiener space PW1π. Recently, Habib analyzed similar questions for a larger space of functions, namely the Zakai class, but for a considerably smaller class of systems, not including the Hilbert transformation and the ideal lowpass filter. We show that for important systems there exists no approximation process that is uniformly convergent for all functions in PW1π. Surprisingly, oversampling and the design of special kernels does not improve the convergence behavior in this case. Furthermore, a simple criterion is given for checking whether a certain approximation process is convergent for a given system or not.
AB - We analyze sampling representations for translation invariant, linear and bounded systems, operating on bandlimited signals. First, we characterize suitable kernels for reconstruction processes with and without oversampling. Then, we investigate the convergence behavior of general approximation processes, operating only on the samples and not on the whole continuoustime signal, for translation invariant, linear and bounded systems and signals in the Paley-Wiener space PW1π. Recently, Habib analyzed similar questions for a larger space of functions, namely the Zakai class, but for a considerably smaller class of systems, not including the Hilbert transformation and the ideal lowpass filter. We show that for important systems there exists no approximation process that is uniformly convergent for all functions in PW1π. Surprisingly, oversampling and the design of special kernels does not improve the convergence behavior in this case. Furthermore, a simple criterion is given for checking whether a certain approximation process is convergent for a given system or not.
KW - Convergence
KW - Reconstruction process
KW - Sampling
KW - System representation
KW - Uniform approximation
UR - http://www.scopus.com/inward/record.url?scp=52349090419&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2008.4595429
DO - 10.1109/ISIT.2008.4595429
M3 - Conference contribution
AN - SCOPUS:52349090419
SN - 9781424422579
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2439
EP - 2443
BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -