Demo Data from EDBT 2026 / reviewers in the wild / expert
Gihan J. Mendis
dblp:192/9882 · also Gihan Janith Mendis
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-3949-9641ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Computer networks · 1 · 1 since 2021
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 · 61% High-performance computing · 30% Reconfigurable computing and FPGAs · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design › digital circuit design
arithmetic circuit design |
0.3 | 1 | 2017 | DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures · IEEE Trans. Computers 2017 |
Integrated circuit design
digital circuit design |
0.3 | 1 | 2017 | DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures · IEEE Trans. Computers 2017 |
High-performance computing
fast fourier transform |
0.3 | 1 | 2017 | DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures · IEEE Trans. Computers 2017 |
Reconfigurable computing and FPGAs
FPGA implementation |
0.1 | 1 | 2017 | DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI Architectures · IEEE Trans. Computers 2017 |
Methods — techniques the papers use, named apart from their topics
gauss-eisenstein integer representation · 0.3final reconstruction step · 0.3expansion factor · 0.3addition-aware quantization · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | DDLPF: A Practical Decentralized Deep Learning Paradigm for Internet-of-Things ApplicationsabstractIn recent years, it has been observed the exponential growth of the Internet of Things (IoT) in different application fields, such as manufacturing and energy industry. To effectively fuse and process the tremendous amount of IoT sensing data timely, there is an urgent need to shift from a conventional centralized computing to a decentralized computing. However, there remain some essential technical challenges to develop effective decentralized computing methods in the context of IoT applications, including 1) the timely response, sufficient privacy preservation, and high security are normally required in IoT-related applications and 2) the biases and non-independent identically distributed (IID) properties potentially presented in the IoT sensing data. To address these challenges, in this article, we propose a decentralized deep learning paradigm with privacy-preservation and fast few-shot learning (DDLPF) by exploiting federated learning, metalearning, and blockchain techniques. In the simulation section, we evaluate the performance of our proposed DDLPF paradigm in different scenarios and compare it with other existing techniques. Yifu Wu, Gihan J. Mendis |
IEEE Internet Things J. | 2 |
| 2017 | DFT Computation Using Gauss-Eisenstein Basis: FFT Algorithms and VLSI ArchitecturesabstractA joint numerical representation based on both Gaussian and Eisenstein integers is proposed. This Gauss-Eisenstein representation maps complex numbers into four-tuples of integers with arbitrarily high precision. The representation furnishes the computation of the 3-, 6-, and 12-point discrete Fourier transform (DFT) at any desired accuracy. The associated fast algorithms based on the Gauss-Eisenstein integers are error-free up to the final reconstruction step, which can be realized in hardware as a multiplierless implementation. The introduced methods are compared with competing algorithms in terms of arithmetic complexity. We propose three FRS architectures based on the following methods: Dempster-McLeod representation, expansion factor, and addition aware quantization. The Gauss-Eisenstein 12-point DFT is physically realized on a Xilinx Virtex 6 FPGA device with maximum clock frequency of 302 MHz for the expansion factor FRS with real-time throughput of 3:62 × 109 coefficients/s. The FPGA verified digital designs were synthesized, mapped, placed and finally routed for 0:18mm CMOS technology assuming a 1.8 V DC supply employing Austria Micro Systems (AMS) standard-cell library (hitkit version 4.11). The routed ASIC is predicted to operate at a maximum frequency of 505 MHz for the expansion factor FRS with potential real-time throughput of 6:06 × 109coefficients/s. Diego F. G. Coelho, Renato J. Cintra, Nilanka T. Rajapaksha, Gihan J. Mendis, Arjuna Madanayake, Vassil S. Dimitrov |
IEEE Trans. Computers | 4 |