Showing papers by "Kenneth Steiglitz published in 1972"
TL;DR: This paper proposes terminology for use in papers and texts on digital signal processing which it is felt is self-consistent, and which is in reasonably good agreement with current practices.
Abstract: The committee on Digital Signal Processing of the IEEE Group on Audio and Electroacoustics has undertaken the project of recommending terminology for use in papers and texts on digital signal processing. The reasons for this project are twofold. First, the meanings of many terms that are commonly used differ from one author to another. Second, there are many terms that one would like to have defined for which no standard term currently exists. It is the purpose of this paper to propose terminology which we feel is self-consistent, and which is in reasonably good agreement with current practices. An alphabetic index of terms is included at the end of the paper.
65 citations
TL;DR: The conclusion is that D- charts are in one technical sense more restrictive than general flowcharts, but not if one allows the introduction of additional variables which represent a history of control flow.
Abstract: This paper discusses the expression of algorithms by flowcharts, and in particular by flowcharts without explicit go-to's (D-charts). For this purpose we introduce a machine independent definition of algorithm which is broader than usual. Our conclusion is that D- charts are in one technical sense more restrictive than general flowcharts, but not if one allows the introduction of additional variables which represent a history of control flow. The term "algorithm" is used in many different ways. Sometimes we speak of an algorithm as a process in the abstract, without reference to a particular computer. It is in this sense, for example, that we speak of the "radix exchange sort algorithm," or the "simplex algorithm." Often we identify an algorithm with a particular se- quence of instructions for a particular computer. In this paper we shall present a new definition of algorithm which emphasizes the sequence of commands associated with a particular "input." We then define the notion "expression" of algorithms by general flowcharts and flowcharts without explicit go-to's (D-charts). Some theorems are given which exhibit some of the rela- tionships between algorithms, flowcharts, and D-charts.
39 citations
TL;DR: A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' pattern search.
Abstract: A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' [1] pattern search. Experimental results for a variety of functions indicate that the random pattern search is more effective than the corresponding deterministic method for a class of problems with hard constraints.
35 citations
TL;DR: In this article, it was shown that Markov chains with circulant transition matrices can be used to generate random processes whose spectral densities are of a particularly simple form.
Abstract: This paper is concerned with the class of Markov chains with circulant transition matrices. We show that such chains generate random processes whose spectral densities are of a particularly simple form, and that they provide a partial solution to the problem of synthesizing Markov chains that generate processes with given spectral densities.
9 citations