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

Herbert L. Groginsky

dblp:133/9697 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1970
—ORCID · none

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

Theory of computation · 2 · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 50% Processor architecture and microarchitecture · 50%
Theoretical computer science
2 papers
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › signal processing accelerator
FFT processor
0.011970
A Pipeline Fast Fourier Transform · IEEE Trans. Computers 1970
Processor architecture and microarchitecture › computer arithmetic
pipelined arithmetic
0.011970
A Pipeline Fast Fourier Transform · IEEE Trans. Computers 1970
Processor architecture and microarchitecture › pipelining
pipeline design
0.011970
A Pipeline Fast Fourier Transform · IEEE Trans. Computers 1970
Hardware accelerators and domain-specific architectures
signal processing accelerator
0.011970
A Pipeline Fast Fourier Transform · IEEE Trans. Computers 1970
Information theory › hypothesis testing › signal detection
adaptive detection
0.011966
Adaptive detection of statistical signals in noise · IEEE Trans. Inf. Theory 1966
Information theory › hypothesis testing › signal detection
nonparametric detection
0.011966
Adaptive detection of statistical signals in noise · IEEE Trans. Inf. Theory 1966
Information theory › hypothesis testing
signal detection
0.011966
Adaptive detection of statistical signals in noise · IEEE Trans. Inf. Theory 1966
Information theory
signal processing
0.011962
Effects of phase errors on pulse-compression systems (Corresp.) · IRE Trans. Inf. Theory 1962

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

sparse fourier transform · 0.0serial storage · 0.0ranking · 0.0pulse-compression systems · 0.0nonparametric statistics · 0.0correlator · 0.0
YearPublicationVenuePosition
1970 A Pipeline Fast Fourier Transform
abstract
This paper describes a novel structure for a hardwired fast Fourier transform (FFT) signal processor that promises to permit digital spectrum analysis to achieve throughput rates consistent with extremely wide-band radars. The technique is based on the use of serial storage for data and intermediate results and multiple arithmetic units each of which carries out a sparse Fourier transform. Details of the system are described for data sample sizes that are binary multiples, but the technique is applicable to any composite number.
Herbert L. Groginsky, George A. Works
IEEE Trans. Computers1
1966 Adaptive detection of statistical signals in noise
abstract
This paper deals with the forms and properties of a detector operating in an environment in which little statistical information about either the signal or noise field is or can be available. An adaptive detector based on the theory of nonparametric statistics has been designed for this purpose. The detector uses amplitude samples taken from two distinct receivers, only one of which may contain signals from a target. The detector maintains a constant false alarm rate despite any nonstationarity of the noise. The theory of nonparametric statistics suggests that the data from the two sources be ranked in order of amplitude, that a linear weighting (a correlator) be applied to the ranking, and the result be applied to a threshold. In this study, we have considered an adaptive detector of this form. The adaptation mechanism selects the weight (correlating) function on the basis of the past observed data. This class of adaptive detectors is shown to have excellent performance in terms of signal detectability for signals of adequate strength. However, for a given detector design, signals weaker than a certain critical threshold cannot be detected regardless of the amount of data available. Thus, in contrast to the kind of signal suppression effect which characterizes conventional passive detection schemes, the adaptive detector has a sharp minimum detectable signal threshold.
Herbert L. Groginsky, L. R. Wilson, David Middleton
IEEE Trans. Inf. Theory1
1962 Effects of phase errors on pulse-compression systems (Corresp.)
Herbert L. Groginsky, L. R. Wilson
IRE Trans. Inf. Theory1