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

Driss Guerchi

dblp:41/4273 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 1

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
Parallel and multicore computing · 33% High-performance computing · 33% Hardware accelerators and domain-specific architectures · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Environmental and earth informatics · 100%

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

TopicWeightPapersLastEvidence papers
Hardware accelerators and domain-specific architectures › many-core accelerator
cell broadband engine
0.112011
Performance Evaluation of Convolution on the Cell Broadband Engine Processor · IEEE Trans. Parallel Distributed Syst. 2011
High-performance computing › tensor computation
convolution
0.112011
Performance Evaluation of Convolution on the Cell Broadband Engine Processor · IEEE Trans. Parallel Distributed Syst. 2011
Parallel and multicore computing
parallel algorithms
0.112011
Performance Evaluation of Convolution on the Cell Broadband Engine Processor · IEEE Trans. Parallel Distributed Syst. 2011
Environmental and earth informatics › geophysical imaging
seismic imaging
0.012011
Performance Evaluation of Convolution on the Cell Broadband Engine Processor · IEEE Trans. Parallel Distributed Syst. 2011

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

vectorization strategies · 0.2parallelization · 0.2
YearPublicationVenuePosition
2011 Performance Evaluation of Convolution on the Cell Broadband Engine Processor
abstract
Convolution represents a major computational load for many scientific and engineering applications, including seismic surface simulations and seismic imaging. Since convolution presents a heavy computational load, increasing its efficiency can significantly enhance the performance of associated applications. In this work, we present an in-depth analysis of the convolution algorithm and its complexity in order to develop adequate parallel algorithms. The implementation of these algorithms and their evaluation on the IBM Cell Broadband Engine (BE) processor reveals the gains and losses achieved by parallelizing the direct convolution. The performance results show that despite the complexity of the convolution processing, a speedup gain of at least 71.4 is obtained. The parallel vectorized algorithm requires the development effort of considering three independent vectorization strategies. Given the wide availability of Cell processors, the proposed parallelization approach can be widely adopted by any convolution-based application.
Leila Ismail, Driss Guerchi
IEEE Trans. Parallel Distributed Syst.2
2007 Voicing-based codebook in low-rate wideband CELP coding
Driss Guerchi, Tamer Rabie, Abdelrhani Louzi
INTERSPEECH1
2002 On improving the performance of analysis-by-synthesis coding using a multi-magnitude algebraic code-book excitation signal
Omar Halmi, Hesham Tolba, Driss Guerchi, Douglas D. O'Shaughnessy
INTERSPEECH3
2000 Pitch-synchronous linear-prediction analysis by synthesis with reduced pulse densities
abstract
An important step toward achieving a high-quality 4 kb/s speech codec is reducing the coding-rate of the stochastic codebook component to near 2 kb/s. The increased reconstruction error in the residual that such low-rate quantization implies motivates the search for techniques that reduce the perceptibility of the errors in the reconstructed signal. Pitch-synchronous estimation of the linear-prediction filter and pitch-synchronous updating of the adaptive codebook reduce the coefficient-estimation error and increase the relative contribution of the adaptive codebook component to the synthesized signal, thereby reducing audible noise. However, pitch synchronous analysis normally results in a variable-rate coder. To obtain a fixed-rate representation, we introduce an efficient representation of the stochastic codebook component using a pulse density of one pulse per 2 ms and signed magnitudes specified by 2 bits per pulse-pair. The resulting reconstructions are evaluated for CELP coders corresponding to classical and generalized-pitch-predictor designs. In both cases speech quality comparable to 8 kb/s G.729 is achieved.
Driss Guerchi, Yasheng Qian, Paul Mermelstein
ICASSP1