On the Reversibility of Discretization

Abstract

“Discretization” usually denotes the operation of mapping continuous functions to infinite or finite sequences of discrete values. It may also mean to map the operation itself from one that operates on functions to one that operates on infinite or finite sequences. Advantageously, these two meanings coincide within the theory of generalized functions. Discretization moreover reduces to a simple multiplication. It is known, however, that multiplications may fail. In our previous studies, we determined conditions such that multiplications hold in the tempered distributions sense and, hence, corresponding discretizations exist. In this study, we determine, vice versa, conditions such that discretizations can be reversed, i.e., functions can be fully restored from their samples. The classical Whittaker-Kotel’nikov-Shannon (WKS) sampling theorem is just one particular case in one of four interwoven symbolic calculation rules deduced below.

Keywords

• regularization
• localization
• truncation
• cutoff
• finitization
• entirization