On the application of digital signal processing theory to solving combinatorial problems in statistics

摘要

This paper shows (in tutorial fashion) how a particular problem in combinatorial mathematics and statistics may be easily solved when it is reformulated (using z-transforms) in a way amenable to solution using digital signal processing (DSP) theory. DSP also allows insights into the nature of the solution and other properties that at first might not be apparent to engineers attempting a mathematician's non-DSP approach via generating functions, etc-although both methods are essentially the same, differing only in name and nomenclature. [References: 10]