Showing papers by "Kenneth Steiglitz published in 1966"

Time-Domain Approximation by Iterative Methods

Abstract: An iterative procedure is presented which permits the determination of a rational transfer function in the Laplace transform variable s which is optimal with respect to given input and output time-functions. The optimal system of a particular order is defined as the one whose output when subjected to the known input function is nearest in the time integral square sense to the desired output function. The method is thus applicable to a number of problems involving the minimization of an integral square error. To illustrate the technique, a set of optimal lumped-parameter delay lines is synthesized and their characteristics investigated; the behavior and convergence of the iteration in these problems is also studied. A comparison of other iterative methods applicable to the same problems leads to the conclusion that the proposed procedure has real advantages in computational simplicity and speed of convergence.

Encoding of analog signals for binary symmetric channels

Abstract: Various encoding schemes are examined from the point of view of minimizing the mean magnitude error of a signal caused by transmission through a binary symmetric channel. A necessary property is developed for optimal codes for any binary symmetric channel and any set of quantization levels. The class of optimal codes is found for the case where the probability of error is small but realistic. This class of codes includes the natural numbering and some unit distance codes, among which are the Gray codes.

Transmission of an analog signal over a fixed bit-rate channel

Abstract: The transmission of a nonbandlimited analog signal over a digital channel with a fixed bit-rate is considered. The trade-off between the mean-square error due to quantizing and the mean-square error due to the process of sampling and reconstructing the signal is investigated. Simple approximations to these errors, which are valid in most practical situations, are derived, and simple expressions are obtained from which the optimum sampling interval and number of bits per sample can be calculated. Results for first-, second-, and third-order Butterworth and fiat bandlimited spectra, together with the zero-order hold and the linear point connector, are included. The resulting mean-square error goes to zero with large channel bit-rates in a slower manner than the Shannon limit, which assumes a strictly bandlimited signal and perfect reconstruction.