scispace - formally typeset
Search or ask a question

Showing papers by "Kenneth Steiglitz published in 1982"


Journal ArticleDOI
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Abstract: This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more All chapters are supplemented by thoughtprovoking problems A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering Mathematicians wishing a self-contained introduction need look no further—American Mathematical Monthly 1982 ed

7,221 citations


Journal ArticleDOI
TL;DR: A method is presented for computing an orthonormal set of eigenvectors for the discrete Fourier transform (DFT) based on a detailed analysis of the eigenstructure of a special matrix which commutes with the DFT.
Abstract: A method is presented for computing an orthonormal set of eigenvectors for the discrete Fourier transform (DFT). The technique is based on a detailed analysis of the eigenstructure of a special matrix which commutes with the DFT. It is also shown how fractional powers of the DFT can be efficiently computed, and possible applications to multiplexing and transform coding are suggested.

243 citations


Journal ArticleDOI
TL;DR: An algorithm for the numerical factorization of very high degree but well-conditioned polynomials is developed and is used to factor the z-transform of finite-length signals, and the zeros are used to calculate the unwrapped phase.
Abstract: An algorithm for the numerical factorization of very high degree but well-conditioned polynomials is developed. This is used to factor the z-transform of finite-length signals, and the zeros are used to calculate the unwrapped phase. The method has been tested on signals up to 512 points in length. A complete Fortran 77 program is given for the case of a real-valued signal. Two related analytical issues are treated. First, the interpretation of phase unwrapping as an interpolation problem is discussed. Second, an explanation is given for the observed numerical difficulties in the method of phase unwrapping using adaptive integration of the phase derivative. The trouble is due to the clustering of the zeros of high degree polynomials near the unit circle.

91 citations


01 Jan 1982
TL;DR: It is shown that, asymptotically, the area required for power distribution actually dominates the rest of the area for a wide class of structures.
Abstract: A class of completely-pipelined VLSI architectures is defined. Two topologies are then described: leaf-connected trees and mesh-connected trees. The leaf-connected tree structure is used to construct a completely-pipelined bit-serial multiplier and a word-serial, bit-serial completely-pipelined convolver. The mesh-connected tree structure is used to implement completely-pipelined bit-parallel multiplication and completely-pipelined word-parallel, bit-parallel convolution. Layouts are described that are within log factors of asymptotic optimality. It is shown that, asymptotically, the area required for power distribution actually dominates the rest of the area for a wide class of structures. 20 references.

11 citations


Journal ArticleDOI
TL;DR: This work considers the complexity of finding optimal fixed- or variable-length unambiguous address codes for the nodes of a packet radio network and some suboptimal heuristic algorithms are proposed.
Abstract: We consider the complexity of finding optimal fixed- or variable-length unambiguous address codes for the nodes of a packet radio network. For fixed-length codes this problem is proved to be NP-complete, and its complexity for variable-length codes is still unknown. Some suboptimal heuristic algorithms are proposed.

2 citations