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 complexity algorithms can lead to significant practical benefits. In this work, we propose FARGAN, an autoregressive vocoder that takes advantage of long-term pitch prediction to synthesize high-quality speech in small subframes, without the need for teacher-forcing. Experimental results show that the proposed 600~MFLOPS FARGAN vocoder can achieve both higher quality and lower complexity than existing low-complexity vocoders. The quality even matches that of existing higher-complexity vocoders.
Original | FARGAN Baseline |
FARGAN w/o Pitch Prediction |
FARGAN w/o Autoregression |
---|---|---|---|
This part shows how FARGAN perfoms compared to other models when reconstructing out-of-domain samples such as singing and noisy speech.
All models were not trained on any singing or noisy speech datasets.
The original version of the following demo samples were obtained from the free datasets defined in the following references:
Original | FARGAN | HiFi-GAN (V1) | CARGAN | LPCNet | HiFi-GAN (V3) |
---|---|---|---|---|---|
@ARTICLE{10632624,
author={Valin, Jean-Marc and Mustafa, Ahmed and Büthe, Jan},
journal={IEEE Signal Processing Letters},
title={Very Low Complexity Speech Synthesis Using Framewise Autoregressive GAN (FARGAN) With Pitch Prediction},
year={2024},
volume={31},
pages={2115-2119},
doi={10.1109/LSP.2024.3440956}}