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

Dessislava Nikolova

dblp:54/5420 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0003-4970-5258ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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 · 67% Electronic design automation · 33%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis › arithmetic-level optimization
bit-width optimization
0.512021
Bitwidth-Optimized Energy-Efficient FFT Design via Scaling Information Propagation · DAC 2021
Integrated circuit design
digital signal processing circuits
0.512021
Bitwidth-Optimized Energy-Efficient FFT Design via Scaling Information Propagation · DAC 2021
Integrated circuit design
low-power circuit design
0.512021
Bitwidth-Optimized Energy-Efficient FFT Design via Scaling Information Propagation · DAC 2021
Image and video coding
video compression
0.112021
Bitwidth-Optimized Energy-Efficient FFT Design via Scaling Information Propagation · DAC 2021

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

scaling information propagation · 1.0fixed-point scaling · 1.0
YearPublicationVenuePosition
2022 Automatic Classification of Wood Species Using Deep Learning
abstract
Wood identification can be done by image recognition or classification. The main idea is that the proposed model is independent in terms of number of input features and / or images. We use a texture analysis and convolutional neural network. The number of source classes depend on the selection and availability of a sufficient (and equal) number of representative samples for each class used in the training phase. We build a model, which perform a reliable classification of tree types of species: Tropical, Diffuse Porous and Ring Porous, obtaining 89.94% accuracy.
Nicole Christoff, Nikolai Bardarov, Dessislava Nikolova
INISTA3
2021 Bitwidth-Optimized Energy-Efficient FFT Design via Scaling Information Propagation
abstract
The Fast Fourier Transform (FFT) is an efficient algorithm widely used in digital signal processing to transform between the time domain and the frequency domain. For fixed-point VLSI implementations, dynamic range growth inevitably occurs at each stage of the FFT operation. However, current methods either waste bitwidth or consume excessive resources when dealing with the dynamic range growth issue. To address this issue, we propose an efficient scaling method called Scaling Information Propagation (SIP) to alleviate the problem of dynamic range growth, which makes full use of bitwidth with much less extra area consumed than the state-of-the-art solutions. In two consecutive transform operations, the SIP method extracts scaling information and makes scaling decisions in the former transform, then executes those in the latter one. We implement the FFT’s VLSI architecture in the orthogonal frequency division multiplexing (OFDM) and the holographic video compression (HVC) systems to verify the SIP method. Compared to the state-of-the-art, experimental results after VLSI synthesis show that our method achieves 9.38% energy reduction and 8.36% area savings when requiring 1.02 × 10-7bit error ratio (BER) of the OFDM system, and 33.47% energy reduction and 30.98% area savings when requiring 20dB signal-to-noise ratio (SNR) of the HVC system, respectively.
Fupeng Chen, Raees Kizhakkumkara Muhamad, David Blinder, Dessislava Nikolova, Peter Schelkens, Francky Catthoor, Yajun Ha
DAC5
2011 Bonded deficit round robin scheduling for multi-channel networks
Dessislava Nikolova, Chris Blondia
Comput. Networks1