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

Robert H. Wilkinson

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

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

Systems, architecture and hardware · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Theoretical computer science
1 paper
Coding theory · 67% Computational geometry · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 44% Processor architecture and microarchitecture · 44% Electronic design automation · 13%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design › analog and mixed-signal circuits
analog circuit design
0.011963
A Method of Generating Functions of Several Variables Using Analog Diode Logic · IEEE Trans. Electron. Comput. 1963
Processor architecture and microarchitecture › computer arithmetic
function generation
0.011963
A Method of Generating Functions of Several Variables Using Analog Diode Logic · IEEE Trans. Electron. Comput. 1963
Computational geometry
combinatorial geometry
0.011964
On the number of regions in input domain of a free distributive lattice · IEEE Trans. Electron. Comput. 1964
Coding theory › lattice theory
distributive lattice
0.011964
On the number of regions in input domain of a free distributive lattice · IEEE Trans. Electron. Comput. 1964
Coding theory
lattice theory
0.011964
On the number of regions in input domain of a free distributive lattice · IEEE Trans. Electron. Comput. 1964
Electronic design automation
logic synthesis
0.011963
A Method of Generating Functions of Several Variables Using Analog Diode Logic · IEEE Trans. Electron. Comput. 1963

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

resistive network · 0.0polyhedral approximation · 0.0distributive lattice · 0.0
YearPublicationVenuePosition
1981 Will the real MEM please stand up?
abstract
The MEM is compared to the classical Fourier method of spectral analysis. The MEM is found to make more assumptions about the source of the data and so has less entropy in this sense than the Fourier method. Four kinds of MEM are identified, one of which is capable of superior resolution under certain conditions.
Robert H. Wilkinson
ICASSP1
1964 On the number of regions in input domain of a free distributive lattice
Robert H. Wilkinson
IEEE Trans. Electron. Comput.1
1963 A Method of Generating Functions of Several Variables Using Analog Diode Logic
abstract
A diode-resistor network technique for simulating functions of any number of variables is described. The function is approximated by a polyhedron, or its N-dimensional equivalent, and this polyhedral model is generated directly by the circuit. The circuit is formed of two cascaded sections: the first, using resistive networks, generates voltages representing each of the faces of the polyhedron; the second section, using analog diode logic, selects the appropriate voltage as the output. The analog diode logic uses basic circuits similar to those used in digital logic. It is shown that the analog logic can be described by a distributive lattice, closely related to Boolean algebra. Methods of logic synthesis are developed. Circuit design is discussed, and it is shown how the effect on the logic section of the finite source impedance of the resistive networks which feed it can be turned to practical advantage. The specific example of the multiplication of two variables is studied in some detail, providing a basis of comparison with the known techniques such as the quarter-squares and log-antilog methods. Finally, test results on a simple three-variable function generator are given. The method is not incremental in nature, and differs from current techniques in this regard. Thus the setting up of a function on a generator is simplified, owing to the noninteraction between segments. Also, the area of the input space to be covered is adjustable to correspond with the input domain of the function.
Robert H. Wilkinson
IEEE Trans. Electron. Comput.1