An algorithm is presented for computing the coefficients of a continuous-time bandpass transfer function that was obtained by applying the standard transformation to a normalized low-pass prototype. The method has all the desirable features of a recently described algorithm by S.A. Dyer (1987) while achieving increased computational efficiency through use of a recursion relation.>

An algorithm based on the Binomial Theorem is presented for calculating the coefficients of a continuous-time bandpass transfer function, obtained from a known low-pass prototype. The method is more general than a recently described method, provides more accurate results, and is insensitive to the choice of scaling factor.

A procedure is described for the computation of the discrete cosine transform (DCT) via the use of the arcsine transform. The approach eliminates time-consuming multiplications, the DCT being accomplished with only additions and table lookups. While a fast Fourier transform (FFT) approach to computing the DCT involves on the order of N\log_{2}2N butterfly computations to evaluate all N coefficients, the arcsine method requires only 4N - 1 real additions and 2N table lookups to evaluate each DCT coefficient. Thus, for applications in which M coefficients are desired or when N is reasonably small (say, N \leq 256 ), the arcsine approach is favored over that of the FFT. Some approaches to hardware implementation are presented.