Admitting coefficients that are sums of powers of 2, two multiplierless designs of digital MF receivers are proposed. Design 1. requires 22 additions per set of six output values. Design 2 requires 11 additions per set of three output values, but there is a strict requirement that the input be a valid MF sequence.

When the FFT is employed for nonrecursive digital filtering, the time required to process one block of input data, N samples long, is often approximately of the form N(logr (N) + Q), where Q ≥ 0. Earlier results on determining optimum N have assued Q ≥0, becauese it has long been informally observed that typically little is to be gained by taking the value of Q > 0 into account, and because the assumption that Q = 0 permits determination of N without reference to machine dependent parameters

An algorithm for generating Hilbert's space-filling curve in a byte-oriented manner is presented. In the context of one application of space-filling curves, the algorithm may be modified so that the results are correct for continua rather than for quantized spaces.