Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Stephen D. Huffman

dblp:75/2499 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1987
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Vehicular, aerial and satellite networks · 77% Routing and switching · 23%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks › satellite networks
satellite network architecture
0.011987
Crosslink architectures for a multiple satellite system · Proc. IEEE 1987
Routing and switching › packet switching
packet-switched networks
0.011987
Crosslink architectures for a multiple satellite system · Proc. IEEE 1987
YearPublicationVenuePosition
1987 Crosslink architectures for a multiple satellite system
abstract
Several candidate crosslink communications architectures are described for a packet-switched, low-altitude, multiple satellite system (MSS). One architecture represents a frequency-division approach, in which a cellular concept is combined with dynamic time-domain allocation within a cell. A second architecture uses an unsynchronized space-time division approach consisting of directional antennas and random accessing. A third architecture uses toroiclal antennas with unsynchronized random accessing. The recommended architecture uses a synchronized space-time division approach, consisting of directional antennas and contention-based pair-wise scheduling. This architecture, called PRS (Pseudo-random Scheduling) is found to have significantly reduced power and bandwidth requirements relative to the other approaches.
Richard Binder, Stephen D. Huffman, Itzhak Gurantz, Peter A. Vena
Proc. IEEE2
1981 On leakage reduction associated with spectral power domain averaging to improve estimate quality
abstract
In Fourier analysis when estimating the power spectrum of a stochastic process from a sample function when the time-measurement resolution bandwidth product is large, typically transform lengths are selected which correspond closely to the desired measurement bandwidth and then time integration is used to increase the degrees of freedom of the spectral estimate. From the standpoint of estimation error an equally valid approach is to increase the time window associated with each transform and average across adjacent narrowband power estimates within the desired measurement bandwidth. This approach can be practical and offers some inherent leakage reduction which can be directly related to the data time window function characteristics. This paper uses an often overlooked result of spectral estimation to illustrate the relationship between the data time window and leakage associated with bandwidth averaging. Results associated with some commonly used window modification functions are presented.
Ernest G. Baxa Jr., Stephen D. Huffman
ICASSP2
1980 Adaptive linear estimation based on time domain orthogonality
abstract
A method for adaptive linear estimation is proposed based on a Time Domain Orthogonality condition. This algorithm arises naturally from the criterion used rather than through the application of a numerical analysis method as in the derivation of the LMS Gradient Algorithm. However, in addition to being a new and potentially useful algorithm, the resulting recursive method is suprisingly similar to the LMS Gradient Algorithm. With the addition of certain simplifying assumptions, the TDO algorithm reduces to the LPIS Gradient Algorithm except that a data dependent term replaces the constant parameter µ found In the LMS Gradient Method. In fact, it is shown that this data dependent term is an estimate of the optimum µ for maximum rate of convergence.
Stephen D. Huffman, Loren W. Nolte
ICASSP1
1979 A fixed-point iteration algorithm for adaptive linear estimation applied to spectral line enhancement
abstract
An Adaptive Linear Estimation Algorithm which can be applied to the Spectral Line Enhancement problem is proposed. Through computer simulation, the rate of convergence of the proposed method is found to be significantly better than that of the LMS Gradient Algorithm for the problem considered. Also, this increased performance is obtained with only a modest increase in computational complexity.
Stephen D. Huffman, Loren W. Nolte
ICASSP1