Computationally efficient implementation of AMR speech coder

KJ Byun; Hee Bum Jung; Minsoo Hahn; KS Kim

doi:10.1109/ISPA.2003.1296953

Computationally efficient implementation of AMR speech coder

KJ Byun^*, Hee Bum Jung, Minsoo Hahn, KS Kim

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

6 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	ISPA 2003: proceedings of the 3rd international symposium on image and signal processing and analysis, pts 1 and 2
Editors	S Loncaric, A Neri, H Babic
Place of Publication	Zagreb,Croatia
Publisher	UNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE
Pages	528-531
Number of pages	4
ISBN (Print)	953-184-061-X
DOIs	https://doi.org/10.1109/ISPA.2003.1296953
Publication status	Published - Sept 2003
Externally published	Yes
Event	3rd International Symposium on Image and Signal Processing and Analysis (ISPA) - Rome, Italy Duration: 18 Sept 2003 → 20 Sept 2003

Conference

Conference	3rd International Symposium on Image and Signal Processing and Analysis (ISPA)
Country/Territory	Italy
City	Rome
Period	18/09/03 → 20/09/03

Access to Document

10.1109/ISPA.2003.1296953

Cite this

Byun, KJ., Jung, H. B., Hahn, M., & Kim, KS. (2003). Computationally efficient implementation of AMR speech coder. In S. Loncaric, A. Neri, & H. Babic (Eds.), ISPA 2003: proceedings of the 3rd international symposium on image and signal processing and analysis, pts 1 and 2 (pp. 528-531). UNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE. https://doi.org/10.1109/ISPA.2003.1296953

@inproceedings{ee4d346080184d79b827eacf59c9bc3f,

title = "Computationally efficient implementation of AMR speech coder",

abstract = "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.",

author = "KJ Byun and Jung, {Hee Bum} and Minsoo Hahn and KS Kim",

year = "2003",

month = sep,

doi = "10.1109/ISPA.2003.1296953",

language = "English",

isbn = "953-184-061-X",

pages = "528--531",

editor = "S Loncaric and A Neri and H Babic",

booktitle = "ISPA 2003: proceedings of the 3rd international symposium on image and signal processing and analysis, pts 1 and 2",

publisher = "UNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE",

note = "3rd International Symposium on Image and Signal Processing and Analysis (ISPA) ; Conference date: 18-09-2003 Through 20-09-2003",

}

Byun, KJ, Jung, HB, Hahn, M & Kim, KS 2003, Computationally efficient implementation of AMR speech coder. in S Loncaric, A Neri & H Babic (eds), ISPA 2003: proceedings of the 3rd international symposium on image and signal processing and analysis, pts 1 and 2. UNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE, Zagreb,Croatia, pp. 528-531, 3rd International Symposium on Image and Signal Processing and Analysis (ISPA), Rome, Italy, 18/09/03. https://doi.org/10.1109/ISPA.2003.1296953

Computationally efficient implementation of AMR speech coder. / Byun, KJ; Jung, Hee Bum; Hahn, Minsoo et al.
ISPA 2003: proceedings of the 3rd international symposium on image and signal processing and analysis, pts 1 and 2. ed. / S Loncaric; A Neri; H Babic. Zagreb,Croatia: UNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE, 2003. p. 528-531.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Computationally efficient implementation of AMR speech coder

AU - Byun, KJ

AU - Jung, Hee Bum

AU - Hahn, Minsoo

AU - Kim, KS

PY - 2003/9

Y1 - 2003/9

N2 - 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.

AB - 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.

U2 - 10.1109/ISPA.2003.1296953

DO - 10.1109/ISPA.2003.1296953

M3 - Conference proceeding contribution

SN - 953-184-061-X

SP - 528

EP - 531

BT - ISPA 2003: proceedings of the 3rd international symposium on image and signal processing and analysis, pts 1 and 2

A2 - Loncaric, S

A2 - Neri, A

A2 - Babic, H

PB - UNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE

CY - Zagreb,Croatia

T2 - 3rd International Symposium on Image and Signal Processing and Analysis (ISPA)

Y2 - 18 September 2003 through 20 September 2003

ER -

Byun KJ, Jung HB, Hahn M, Kim KS. Computationally efficient implementation of AMR speech coder. In Loncaric S, Neri A, Babic H, editors, ISPA 2003: proceedings of the 3rd international symposium on image and signal processing and analysis, pts 1 and 2. Zagreb,Croatia: UNIV ZAGREB, FACULTY MECHANICAL ENGINEERING & NAVAL ARCHITECTURE. 2003. p. 528-531 doi: 10.1109/ISPA.2003.1296953

Computationally efficient implementation of AMR speech coder

Abstract

Conference

Access to Document

Fingerprint

Cite this