The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use of the FHT, discrete cosine transforms (DCT) and discrete Fourier transforms (DFT) can be obtained. The recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher order FHT from two identical lower order FHT's. In practice, this recursive relationship offers flexibility in programming different sizes of transforms, while the orderly structure of its signal flow-graphs indicates an ease of implementation in VLSI.

This paper presents a theoretical analysis and computational technique for constrained least squares image restoration using spline basis functions. A realistic continuous–discrete physical imaging model has been adopted throughout the formulation. The optical system is assumed to be incoherent, and the general problem of image restoration with space-variant or space-invariant point-spread function degradations has been studied.

The uniform loading theory [1] has been approximated and used to analyze a class of interconnection problems usually encountered in the design of high-speed circuit packaging and memory arrays in today's computers. The uniform loads are, for example, IC gates and via holes on multilayered printed circuit board and cross-coupling capacitance in memory arrays. They are treated as discrete loads along smooth transmission lines. The input and output transfer function, impulse response, unit step response, and propagation delay are calculated. To a first-order approximation, the pure resistive loaded line impedance and voltage reflection coefficient can be easily derived. Matching conditions and some experimental results are included. Oscillation due to second-order effects is also discussed.