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

Gaylord K. Huth

dblp:41/252 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
0since 2021 · last 1988
—ORCID · none

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

Computer networks · 5 · 1 first-authorTheory of computation · 2 · 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.

Theoretical computer science
3 papers
Coding theory · 100%
Computer networks
5 papers
Physical-layer communications · 98% Vehicular, aerial and satellite networks · 2%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › error probability analysis
bit error probability bounds
0.011988
Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code · IEEE Trans. Inf. Theory 1988
Coding theory › error-correcting codes
cyclic codes
0.011988
Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code · IEEE Trans. Inf. Theory 1988
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding
0.011988
Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code · IEEE Trans. Inf. Theory 1988
Coding theory › error-correcting codes
reed-solomon codes
0.011988
Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code · IEEE Trans. Inf. Theory 1988
Physical-layer communications
spread spectrum
0.031982
Differentially Coherent Detection of QASK for Frequency-Hopping Systems-Part I: Performance in the Presence of a Gaussian Noise Environment · IEEE Trans. Commun. 1982
Spread Spectrum Acquisition and Tracking Performance for Shuttle Communication Links · IEEE Trans. Commun. 1978
Optimization of Coded Spread Spectrum System Performance · IEEE Trans. Commun. 1977
Physical-layer communications › spread spectrum
frequency hopping
0.021982
Differentially Coherent Detection of QASK for Frequency-Hopping Systems-Part I: Performance in the Presence of a Gaussian Noise Environment · IEEE Trans. Commun. 1982
Optimization of Coded Spread Spectrum System Performance · IEEE Trans. Commun. 1977
Physical-layer communications › signal detection › noncoherent detection
differentially coherent detection
0.011982
Differentially Coherent Detection of QASK for Frequency-Hopping Systems-Part I: Performance in the Presence of a Gaussian Noise Environment · IEEE Trans. Commun. 1982
Physical-layer communications
modulation and detection
0.011982
Differentially Coherent Detection of QASK for Frequency-Hopping Systems-Part I: Performance in the Presence of a Gaussian Noise Environment · IEEE Trans. Commun. 1982
Coding theory › error-correcting codes › decoding
hard-decision decoding
0.011988
Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code · IEEE Trans. Inf. Theory 1988
Physical-layer communications › synchronization › code synchronization
code acquisition and tracking
0.011978
Spread Spectrum Acquisition and Tracking Performance for Shuttle Communication Links · IEEE Trans. Commun. 1978
Physical-layer communications › synchronization › carrier synchronization
costas loop
0.011978
False Lock Performance of Shuttle Costas Loop Receivers · IEEE Trans. Commun. 1978
Physical-layer communications › synchronization › carrier synchronization
false lock
0.011978
False Lock Performance of Shuttle Costas Loop Receivers · IEEE Trans. Commun. 1978
Physical-layer communications
receiver design
0.011978
False Lock Performance of Shuttle Costas Loop Receivers · IEEE Trans. Commun. 1978
Coding theory
error-correcting codes
0.011977
Optimization of Coded Spread Spectrum System Performance · IEEE Trans. Commun. 1977
Coding theory › error-correcting codes
convolutional codes
0.011976
Minimum weight convolutional codewords of finite length (Corresp.) · IEEE Trans. Inf. Theory 1976
Coding theory › error-correcting codes › convolutional codes
minimum average weight per branch
0.011976
Minimum weight convolutional codewords of finite length (Corresp.) · IEEE Trans. Inf. Theory 1976
Physical-layer communications › synchronization
carrier synchronization
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Physical-layer communications
channel coding
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Physical-layer communications › synchronization › phase-locked loop
costas loop tracking
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Physical-layer communications › channel coding › convolutional decoding
sequential decoding
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Vehicular, aerial and satellite networks
satellite communication
0.011978
Spread Spectrum Acquisition and Tracking Performance for Shuttle Communication Links · IEEE Trans. Commun. 1978
Physical-layer communications
synchronization
0.011978
False Lock Performance of Shuttle Costas Loop Receivers · IEEE Trans. Commun. 1978
Physical-layer communications
interference and jamming
0.011977
Optimization of Coded Spread Spectrum System Performance · IEEE Trans. Commun. 1977
Physical-layer communications › modulation
demodulation
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973

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

upper bound derivation · 0.0performance optimization · 0.0error probability analysis · 0.0pareto fit · 0.0delay lock loop comparison · 0.0computer simulation · 0.0closed-form analysis · 0.0
YearPublicationVenuePosition
1988 Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code
abstract
An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2/sup l/) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF
Unjeng Cheng, Gaylord K. Huth
IEEE Trans. Inf. Theory2
1982 Differentially Coherent Detection of QASK for Frequency-Hopping Systems-Part I: Performance in the Presence of a Gaussian Noise Environment
abstract
In this paper the concept of differentially coherent detection of differentially phase-encoded QASK signals (DQASK) is described, and a receiver structure proposed. The remainder of the paper analyzes the performance of DQASK in the presence of a Gaussian noise environment with comparisons made to coherent detection of QASK.
Marvin K. Simon, Gaylord K. Huth, Andreas Polydoros
IEEE Trans. Commun.2
1978 Spread Spectrum Acquisition and Tracking Performance for Shuttle Communication Links
abstract
The spread spectrum acquisition and tracking performance for the ShuttleS-band andKu-band communication links are analyzed and compared to test results. TheS-band link requirements are more severe than those of theKu-band links, hence, different despreader designs were developed for the two systems. TheS-band despreader acquires pseudonoise code lock by examining all possible code phases in half chip steps while theKu-band despreader acquires pseudonoise code lock by continuously sweeping a tau-jitter loop. Both despreaders employ a tau-jitter loop for code tracking. The code tracking performance is computed for the tau-jitter loop and compared to that of the more complex delay lock loop.
Waddah K. Alem, Gaylord K. Huth, Jack K. Holmes, Sergei Udalov
IEEE Trans. Commun.2
1978 False Lock Performance of Shuttle Costas Loop Receivers
abstract
The false (sideband) lock problem in Shuttle Costas loop receivers, in the presencse of noise, is assessed in this paper. False lock margin is defined depending on symbol signal-to-noise ratio rather than in the absence of noise as reported earlier in [4], [5]. Closed form results are given when the arm filters of the Costas loop are one-pole Butterworth filters as used in the Shuttle receivers. However, the approach taken is also general enough to cover filters of arbitrary characteristics. As part of the development of the false lock margin, it is shown that the false lock phenomenon of the squaring loop is identical to that of the Costas loop.
Kai T. Woo, Gaylord K. Huth, William C. Lindsey, Jack K. Holmes
IEEE Trans. Commun.2
1977 Optimization of Coded Spread Spectrum System Performance
abstract
Error correction coding techniques significantly improve performance of spread spectrum communication systems in environments containing jamming, multipath, and unregulated multiple access. This paper investigates the optimization of spread spectrum system performance for time-varying unknown interference. Noncoherent frequency hopping (FH) spread spectrum modulation, and hybrid FH-PN incorporating a direct sequence PN modulation on each hopped frequency are studied. For FH or FH-PN, the data modulations considered are differential phase-shift-keying (DPSK), differential quadriphase-quadriphase-shift-keying (DQPSK), and multiple-frequency-multiple-frequency-shift-keying (MFSK). Both block and convolutional error correction coding techniques are studied as a means of improving the spread spectrum performance.
Gaylord K. Huth
IEEE Trans. Commun.1
1976 Minimum weight convolutional codewords of finite length (Corresp.)
abstract
For convolutional codes, thc variation of the minimum distance between nonmerging codewords with the lengths of those codewords is considered for all finite lengths. This is carried out in terms of a new distance parameter for convolutional codes do, the minimum average weight per branch over all cycles. Upper and lower bounds on do for binary convolutional codes of rate1/nare presented. The tradeoff betweend_{o}and the free distanced_{free}is obtained for small memory length codes.
Gaylord K. Huth, Charles L. Weber
IEEE Trans. Inf. Theory1
1973 Simulation of Sequential Decoding with Phase-Locked Demodulation
abstract
Convolutional encoding with biphase modulation is an attractive combination of modulation/coding for the Gaussian channel, but a means of tracking carrier phase must be provided. The performance of combined sequential decoding and suppressed carrier (Costas loop) tracking in the receiver is difficult to analyze but can be obtained by computer simulations. Results of such simulations are presented in the form of a Pareto fit to the computation distributions for various tracking loop bandwidths and demodulator quantization (soft decisions). These distributions are applied to predict probability of error performance for typical decoder parameters (buffer size, speed factor). The anticipated advantage of quantized demodulation is observed. However, narrow tracking bandwidths are required, with sufficient interleaving to overcome effects of correlated phase perturbations due to noise.
Charles R. Cahn, Gaylord K. Huth, C. R. Moore
IEEE Trans. Commun.2