activity
20142024
most citedEstimating and related functions under partial RH assumptions

29 citations · 39 across the 8 of their papers we have counts for

collaborators

8 papers

eess.AS2024★ 1 cited

Very Low Complexity Speech Synthesis Using Framewise Autoregressive GAN (FARGAN) with Pitch Prediction

Jean-Marc Valin, Ahmed Mustafa, Jan Büthe

Neural vocoders are now being used in a wide range of speech processing applications. In many of those applications, the vocoder can be the most complex component, so finding lower…

eess.AS2023

NoLACE: Improving Low-Complexity Speech Codec Enhancement Through Adaptive Temporal Shaping

Jan Büthe, Ahmed Mustafa, Jean-Marc Valin +2

Speech codec enhancement methods are designed to remove distortions added by speech codecs. While classical methods are very low in complexity and add zero delay, their effectivene…

eess.AS2023

LACE: A light-weight, causal model for enhancing coded speech through adaptive convolutions

Jan Büthe, Jean-Marc Valin, Ahmed Mustafa

Classical speech coding uses low-complexity postfilters with zero lookahead to enhance the quality of coded speech, but their effectiveness is limited by their simplicity. Deep Neu…

eess.AS2022

Framewise WaveGAN: High Speed Adversarial Vocoder in Time Domain with Very Low Computational Complexity

Ahmed Mustafa, Jean-Marc Valin, Jan Büthe +2

GAN vocoders are currently one of the state-of-the-art methods for building high-quality neural waveform generative models. However, most of their architectures require dozens of b…

eess.AS2022

DRED: Deep REDundancy Coding of Speech Using a Rate-Distortion-Optimized Variational Autoencoder

Jean-Marc Valin, Jan Büthe, Ahmed Mustafa +1

Despite recent advancements in packet loss concealment (PLC) using deep learning techniques, packet loss remains a significant challenge in real-time speech communication. Redundan…

math.NT2015★ 1 cited

An analytic method for bounding

Jan Büthe

In this paper we present an analytic altorithm which calculates almost sharp bounds for the normalized error term for in expected run time $O(x^{1/2+\…

math.NT2014★ 8 cited

A Brun-Titchmarsh inequality for weighted sums over prime numbers

Jan Büthe

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titc…

math.NT2014★ 29 cited

Estimating and related functions under partial RH assumptions

Jan Büthe

The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height in terms of the prime-counting function . This i…