{'fraction_non_alphanumeric': 0.017077798861480076, 'fraction_numerical': 0.0, 'mean_word_length': 5.0, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An approximation for discrete B-splines in time domain

A simple discrete version of B-splines defined as a multifold discrete convolution of sampled rectangles is proposed in the analogy of B-splines being multifold convolution integrals of rectangular functions. Then it is proven that its staircase interpolation tends to the B-spline when the sampling interval goes to zero. This version can be regarded as an approximation for the discrete B-splines established in the literature, and it is faster in numerical evaluation.