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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computationally efficient implementation of AMR speech coder


    Contributors:


    Publication date :

    2003-01-01


    Size :

    284334 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    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 | Automotive engineering | 1990



    Coder suspension

    Engineering Index Backfile | 1959


    Computationally Efficient Multibody Simulations

    Ramakrishnan, J. / Kumar, M. / National Aeronautics and Space Administration | British Library Conference Proceedings | 1994