The adaptive multi-rate speech codec consists of eight source codecs with bit rates from 4.75 to 12.2 kbit/s. This paper presents an AMR implementation especially focused on reducing the computational complexity. In order to reduce the computational load, we propose the fast codebook search method that is simply modified version of the depth first tree search method used in algebraic codebook search in the AMR codec. For the AMR implementation we designed the 16 bit fixed-point DSP based on the TeakLite DSP core, which was tailored for the AMR implementation. The implemented AMR codec requires only 19.6 MIPS of computation for the highest complexity mode of the AMR by using the fast search method and exploiting the DSP architecture and managing the memory structure efficiently. It is verified with all the test vectors provided by 3GPP, and stable operation on the real-time testing board was also confirmed.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Computationally efficient implementation of AMR speech coder


    Beteiligte:
    Kyung Jin Byun, (Autor:in) / Hee Bum Jung, (Autor:in) / Minsoo Hahn, (Autor:in) / Kyung Soo Kim, (Autor:in)


    Erscheinungsdatum :

    2003-01-01


    Format / Umfang :

    284334 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Computationally Efficient Implementation of AMR Speech Coder

    Byun, K. J. / Jung, H. B. / Hahn, M. et al. | British Library Conference Proceedings | 2003


    Computationally efficient stochastic coding of speech

    Veeman,D.E. / Mazor,B. / GTE Lab.,US | Kraftfahrwesen | 1990




    Computationally Efficient Control Allocation

    Durham, W. / AIAA | British Library Conference Proceedings | 1999