Demo Data from EDBT 2026 / reviewers in the wild / expert
R. F. Lyon
dblp:272/5720
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1976
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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 |
Integrated circuit design · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design
digital arithmetic circuits |
0.0 | 1 | 1976 | Two's Complement Pipeline Multipliers · IEEE Trans. Commun. 1976 |
Integrated circuit design › digital arithmetic circuits › integer multiplier
two's complement multiplier |
0.0 | 1 | 1976 | Two's Complement Pipeline Multipliers · IEEE Trans. Commun. 1976 |
Integrated circuit design › digital arithmetic circuits
booth recoding |
0.0 | 1 | 1976 | Two's Complement Pipeline Multipliers · IEEE Trans. Commun. 1976 |
Methods — techniques the papers use, named apart from their topics
serial data transfer · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1976 | Two's Complement Pipeline MultipliersabstractDigital filters and signal processors when realized in hardware often use serial transfer of data. Multipliers which are capable of accepting variable coefficients and data in sign and magnitude notation and producing serial products of the same length as the input data word have been known for some time. This concise paper addresses the design of multipliers capable of accepting data in 2's complement notation, or both data and coefficients in 2's complement notation. It also considers multiplier recoding techniques, such as the Booth algorithm. Specialized (fixed coefficient) multiplier designs are considered briefly. Finally, multiplier rounding and overflow characteristics are discussed, and a rough comparison is made between the complexity of the various designs. R. F. Lyon |
IEEE Trans. Commun. | 1 |