Kenneth Steiglitz

Learn More
We consider the problem of picking (buying) an inexpensive <i>s -- t</i> path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner only. We study the problem of finding <i>frugal mechanisms</i> for this task, <i>i.e.</i> we investigate the payments the buyer must make in order to buy a path.First,(More)
In personal communications applications, users communicate via wireless with a wireline network. The wireline network tracks the current location of the user, and can therefore route messages to a user regardless of the user’s location. In addition to its impact on signaling within the wireline network, mobility tracking requires the expenditure of wireless(More)
A quad tree for representing a picture is a tree in which successively deeper levels represent successively finer subdivisions of picture area. An algorithm is given for superposing N quad trees in time proportional to the total number of nodes in the trees. Warnock-type algorithms are then presented for building the quad tree for the picture of the(More)
Full-duplex data communications over a multi-input/multi-output linear time-invariant channel is considered. The minimum mean square error (MMSE) linear equalizer is derived in the presence of both nearand far-end crosstalk and independent additive noise, assuming correlated data, and colored noise. The MMSE equalizer is completely specified in terms of the(More)
a digital signal processing primer with applications to digital signal processing primer with applications to digital signal processing primer with applications to a digital signal processing primer with applications to a digital signal processing primer with applications to digital signal processing the computer laboratory digital signal processing the(More)
We investigate the evaluation of an (n-1)st degree polynomial at a sequence of n points. It is shown that such an evaluation reduces directly to a simple convolution if and only if the sequence of points is of the form b, ba, ba2, ., ba for complex numbers a and b (the so-called "chirp transform"). By more complex reductions we develop an O(n log n)(More)
Abstrucf-We show that some kind of meaningful computation can be embedded in very simple, microscopically homogeneous, one-dimensional automata-filter automata with a parity next-state rule. A systematic procedure is given for generating moving, periodic structures (“particles”). These particles exhibit solitonlike properties; that is, they often pass(More)
AbstructWe consider transmission of data over multiple coupled channels, such as bundles of twisted-pair copper wires in the local subscriber loop, and between central offices in the public switched telephone network. Transceiver designs for such channels typically treat the crosstalk between adjacent twisted pairs as random noise uncorrelated with the(More)