High rate data hiding in ACELP speech codecs

Author

Geiser, Bernd ; Vary, Peter

Author_Institution

Inst. of Commun. Syst. & Data Process. (ind), RWTH Aachen Univ., Aachen

fYear

2008

fDate

March 31 2008-April 4 2008

Firstpage

4005

Lastpage

4008

Abstract

A new method for hiding digital data in the bitstream of an ACELP speech codec is proposed in this paper. The key element of our method is an alternative search strategy for the ACELP codebook which allows for joint data hiding and speech coding. The concept has been examplarily applied to the AMR speech codec (12.2 kbit/s mode) and it is shown that steganographic data can be reliably transmitted at a rate of up to 2 kbit/s both with a negligible effect on the subjective quality of the coded speech and with reasonable computational complexity. Apart from data hiding, it is further pointed out that our method can also be exploited to reduce the codec bit rate.

Keywords

computational complexity; data compression; data encapsulation; speech codecs; speech coding; watermarking; ACELP codebook; ACELP speech codecs; AMR speech codec; computational complexity; digital data hiding; joint data hiding; speech coding; steganographic data; watermarking; Bit rate; Computational complexity; Data encapsulation; Data processing; Digital communication; Robustness; Speech codecs; Speech coding; Steganography; Watermarking; ACELP speech coding; data hiding; steganography; watermarking;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on

Conference_Location

Las Vegas, NV

ISSN

1520-6149

Print_ISBN

978-1-4244-1483-3

Electronic_ISBN

1520-6149

Type

conf

DOI

10.1109/ICASSP.2008.4518532

Filename

4518532