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

William J. Hurd

dblp:10/5836 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 1990
—ORCID · none

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

Computer networks · 3 · 1 first-authorTheory of computation · 3 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-author

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
3 papers
Physical-layer communications · 100%
Theoretical computer science
3 papers
Coding theory · 85% Information theory · 15%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › synchronization
carrier and timing recovery
0.011990
An estimator-predictor approach to PLL loop filter design · IEEE Trans. Commun. 1990
Physical-layer communications › spread spectrum
code acquisition
0.011990
Spread-spectrum code acquisition in the presence of Doppler shift and data modulation · IEEE Trans. Commun. 1990
Physical-layer communications › signal detection
detection and estimation
0.011990
An estimator-predictor approach to PLL loop filter design · IEEE Trans. Commun. 1990
Physical-layer communications › receiver design › RF impairment compensation
doppler compensation
0.011990
Spread-spectrum code acquisition in the presence of Doppler shift and data modulation · IEEE Trans. Commun. 1990
Physical-layer communications
spread spectrum
0.011990
Spread-spectrum code acquisition in the presence of Doppler shift and data modulation · IEEE Trans. Commun. 1990
Physical-layer communications › synchronization › phase synchronization
phase tracking
0.011988
A method to dramatically improve subcarrier tracking · IEEE Trans. Commun. 1988
Physical-layer communications
synchronization
0.011988
A method to dramatically improve subcarrier tracking · IEEE Trans. Commun. 1988
Physical-layer communications › synchronization
phase-locked loop
0.011988
A method to dramatically improve subcarrier tracking · IEEE Trans. Commun. 1988
Coding theory
linear feedback shift register
0.011974
Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers · IEEE Trans. Computers 1974
Coding theory › sequences
pseudorandom sequences
0.011974
Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers · IEEE Trans. Computers 1974
Coding theory › sequences › linear recurrence sequences
shift register sequences
0.011974
Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers · IEEE Trans. Computers 1974
Coding theory
channel coding
0.011968
Spacecraft demonstration of sequential decoding using Lunar Orbiter V (Corresp.) · IEEE Trans. Inf. Theory 1968
Information theory › signal processing
correlation function
0.011967
Correlation function of quantized sine wave plus Gaussian noise · IEEE Trans. Inf. Theory 1967
Coding theory › source coding
quantization
0.011967
Correlation function of quantized sine wave plus Gaussian noise · IEEE Trans. Inf. Theory 1967
Coding theory › error-correcting codes › decoding
sequential decoding
0.011968
Spacecraft demonstration of sequential decoding using Lunar Orbiter V (Corresp.) · IEEE Trans. Inf. Theory 1968
Information theory
signal processing
0.011967
Correlation function of quantized sine wave plus Gaussian noise · IEEE Trans. Inf. Theory 1967
Cryptographic primitives and cryptanalysis
pseudorandom generators
0.011974
Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers · IEEE Trans. Computers 1974

Methods — techniques the papers use, named apart from their topics

recursive estimation · 0.0noncoherent detection · 0.0fast fourier transform · 0.0estimation theory · 0.0windowing · 0.0variance analysis · 0.0simulation · 0.0transform method · 0.0maximum-likelihood decoding · 0.0gaussian noise approximation · 0.0biorthogonal code · 0.0
YearPublicationVenuePosition
1990 Spread-spectrum code acquisition in the presence of Doppler shift and data modulation
abstract
A spread-spectrum code acquisition technique for a direct-sequence (DS) system in the presence of Doppler effect and data modulation is investigated. Both the carrier-frequency offset and code-frequency offset due to severe Doppler effect are considered. The code-chip slipping during the correlation process caused by code-frequency offset can degrade the acquisition performance significantly. However, this issue can be alleviated by compensating code-frequency offset in an appropriate manner. Results are presented for the cases with and without data modulation. Coherent detection is considered when there is no data modulation. If data modulation is present, the authors partition the correlation time into subintervals and the integration results in these subintervals are square-law noncoherently combined for detection. The implementation of this code acquisition technique using the fast Fourier transform (FFT) algorithm is described. The use of theoretical results to estimate the hardware complexity of an actual system is illustrated step by step, showing that implementation is feasible with existing technology. The tradeoff between hardware complexity and acquisition performance is discussed.>
Unjeng Cheng, William J. Hurd, Joseph I. Statman
IEEE Trans. Commun.2
1990 An estimator-predictor approach to PLL loop filter design
abstract
The design of digital phase locked loops (DPLL) using estimation theory concepts in the selection of a loop filter is presented. The key concept, that the DPLL closed-loop transfer function is decomposed into an estimator and a predictor, is discussed. The estimator provides recursive estimates of phase, frequency, and higher-order derivatives, and the predictor compensates for the transport lag inherent in the loop.>
Joseph I. Statman, William J. Hurd
IEEE Trans. Commun.2
1989 Degradation of signal-to-noise ratio due to amplitude distortion
abstract
The effect of filtering on the signal-to-noise ratio (SNR) of a coherently demodulated band-limited signal is determined in the presence of worst-case amplitude ripple. The problem is formulated as an optimization in the Hilbert space L/sub 2/. The form of the worst-case amplitude ripple is specified, and the degradation in the SNR is derived in closed form. It is shown that, when the maximum passband amplitude ripple is 2 delta (peak-to-peak), the SNR is degraded by at most (1- delta /sup 2/), even when the ripple is unknown or uncompensated. For example, an SNR loss of less than 0.01 dB due to amplitude ripple can be assured by keeping the amplitude ripple under 0.42 dB.>
Ramin Sadr, Mehrdad Shahshahani, William J. Hurd
IEEE Trans. Inf. Theory3
1988 A method to dramatically improve subcarrier tracking
abstract
A method is presented for achieving a considerable improvement in phase tracking of square-wave subcarriers or other square waves. The amplitude of the phase quadrature reference signal is set to zero, except near the zero crossings of the input signal. Without changing the loop bandwidth, the variance of the phase error can be reduced by approximately W sigma /sub 0//sup 2/ where sigma /sub 0//sup 2/ is the phase error variance without windowing and W is the fraction of cycle in which the reference signal has a nonzero value. Simulation results confirm the results of the analysis and establish minimum W versus SNR (signal-to-noise ratio). Typically, the window can be made so narrow as to achieve a phase error variance of 1.5 sigma /sub 0//sup 4/.>
William J. Hurd, Sergio Aguirre
IEEE Trans. Commun.1
1974 Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
abstract
Some new algorithms are presented for efficiently generating pseudorandom noise both in hardware and software. In software, a new word of pseudorandom bits can be generated about every 12 machine cycles, and hardware implementations can generate pseudo Gaussian noise with bandwith of 20 MHz or more. The algorithms generate binary maximal-length linear recursive sequencies of high degree and with many nonzero terms. The ability to efficiently implement high-degree recursions is important because the number of consecutive bits which can be guaranteed to be both linearly and statistically independent is equal to the degree of the recursion. The implementations are by interconnection of several short shift registers in a linear manner in such a way that different widely spaced phase shifts of the same p-n sequence appear in the stages of the several registers. Some specific algorithms have been subjected to extensive statistical evaluation, with no evidence found to distinguish the sequences from purely random binary sequences.
William J. Hurd
IEEE Trans. Computers1
1968 Spacecraft demonstration of sequential decoding using Lunar Orbiter V (Corresp.)
abstract
The performance of a sequential decoder on data transmitted on a spacecraft link was demonstrated on February 26, 1968, culminating a series of experiments utilizing Lunar Orbiter V and the Deep Space Net (DSN) Echo station. It was demonstrated that sequential decoding can perform on a spacecraftlink as well as was predicted by theoretical results and laboratory experiments. Performance is significantly better than that of practical block codes. For example, an erasure probability of10^{-4}can be attained using sequential decoding with2dB less signal-to-noise ratio than required to attain an error probability of10^{-4}using a(32,6)biorthogonal code and maximum-likelihood decoding.
William J. Hurd
IEEE Trans. Inf. Theory1
1967 Correlation function of quantized sine wave plus Gaussian noise
abstract
The output correlation function is derived for anN-step, symmetric amplitude quantizer when the input is the sum of a sine wave and stationary, zero mean, Gaussian noise. The derivation, which follows the transform method of Rice, Bennett, and Middleton, is perfectly general in that there are no restrictions on the quantizer characteristic or the signal or noise powers. Results of previous studies are restricted to quantizers with uniform steps or to cases in which the rms amplitude of the input is small compared to the amplitude range covered by the quantizer. For low signal-to-noise ratios, approximations can be made which greatly simplify the calculations. These approximations are described, and graphical results are presented for two, three, and four bit linear quantizers when the input noise spectrum is rectangular narrow-band and the SNR is small.
William J. Hurd
IEEE Trans. Inf. Theory1