{'fraction_non_alphanumeric': 0.0136986301369863, 'fraction_numerical': 0.0018264840182648401, 'mean_word_length': 5.485207100591716, '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}}
Finding Optimal Integral Sampling Lattices for a given Frequency Support in Multidimensions

The search for alias-free sampling lattices for a given frequency support, in particular those lattices achieving minimum sampling densities, is a fundamental issue in various applications of signal and image processing. In this paper, we propose an efficient computational procedure to find all alias-free integral sampling lattices for a given frequency support with minimum sampling density. Central to this algorithm is a novel condition linking the alias-free sampling with the Fourier transform of the indicator function defined on the frequency support. We study the computation of these Fourier transforms based on the divergence theorem, and propose a simple closed-form formula for a fairly general class of support regions consisting of arbitrary N-dimensional polytopes, with polygons in 2D and polyhedra in 3D as special cases. The proposed algorithm can be useful in a variety of applications involving the design of efficient acquisition schemes for multidimensional bandlimited signals.