Skip to main content
Log in

On the Application of Digital Signal Processing Theory to Solving Combinatorial Problems in Statistics

  • Published:
Circuits, Systems and Signal Processing Aims and scope Submit manuscript

Abstract

This paper shows (in tutorial fashion) how a particular problem in combinatorial mathematics and statistics may be easily solved when it is reformulated (using ztransforms) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Desmond C. McLernon.

Rights and permissions

Reprints and permissions

About this article

Cite this article

McLernon, D. On the Application of Digital Signal Processing Theory to Solving Combinatorial Problems in Statistics. Circuits Syst Signal Process 22, 405–422 (2003). https://doi.org/10.1007/s00034-004-7040-2

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00034-004-7040-2

Keywords

Navigation