jmspeex (jmspeex) wrote,

Code-Excited Lapped Transform (CELT), Part 1: Overview

Here's a bit more info on the CELT experimental codec I just released. First, the goals. For the past two years, Monty and I have been discussing what the next generation free audio codec would be. Monty's goal is to basically be better than Vorbis in terms of quality vs compression. My main goal, on the other hand is to have a high-quality codec with very low latency, even if it means being less efficient. So, we're trying to combine both into the Ghost codecs. Whether that'll succeed or we have to go with two separate codecs is still an open question. For now, I'm working on CELT, which I hope to be both a low-latency codec, and a noise encoder to be used in a lower bit-rate Ghost codec like Monty wants.

Below is an overview of how CELT works:

It may look a bit hairy, but it's actually a relatively simple idea. The four main ideas are:

  • We use a lapped transform (here an MDCT) on very short windows (128-256 samples)

  • The spectrum is divided in bands and the energy in each band is encoded and kept constant

  • We use a time-domain pitch predictor, with frequency-domain gains

  • The residual is encoded using a pulse codebook

I'll address each of these (and more) in later posts.
Tags: celt, codecs, ghost

  • RNNoise: Noise Suppression with Deep Learning

    (my blog has moved this is just a copy of this post) This demo presents the RNNoise project, showing how deep learning can be applied to…

  • Opus 1.2 is out!

    Opus gets another major upgrade with the release of version 1.2. This release brings quality improvements to both speech and music, while…

  • Opus 1.2-alpha is out!

    We just released Opus 1.2-alpha. It's an alpha release for the upcoming Opus 1.2. It includes many quality improvements for low-bitrate speech and…

  • Post a new comment


    default userpic

    Your reply will be screened

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.