Adaptive Karhunen-Loeve Transform for Enhanced Multichannel Audio Coding (bibtex)
by Yang, Dai, Ai, Hongmei, Kyriakakis, Chris and Kuo, C.-C. Jay
Abstract:
A modified MPEG Advanced Audio Coding (AAC) scheme based on the Karhunen-Loeve transform (KLT) to remove inter-channel redundancy, which is called the MAACKL method, has been proposed in our previous work. However, a straightforward coding of elements of the KLT matrix generates about 240 bits per matrix for typical 5 channel audio contents. Such an overhead is too expensive so that it prevents MAACKL from updating KLT dynamically in a short period of time. In this research, we study the de-correlation efficiency of adaptive KLT as well as an efficient way to encode elements of the KLT matrix via vector quantization. The effect due to different quantization accuracy and adaptation period is examined carefully. It is demonstrated that with the smallest possible number of bits per matrix and a moderately long KLT adaptation time, the MAACKL algorithm can still generate a very good coding performance.
Reference:
Adaptive Karhunen-Loeve Transform for Enhanced Multichannel Audio Coding (Yang, Dai, Ai, Hongmei, Kyriakakis, Chris and Kuo, C.-C. Jay), In SPIE, 2001.
Bibtex Entry:
@inproceedings{yang_adaptive_2001,
	address = {San Diego, CA},
	title = {Adaptive {Karhunen}-{Loeve} {Transform} for {Enhanced} {Multichannel} {Audio} {Coding}},
	url = {http://ict.usc.edu/pubs/Adaptive%20Karhunen-Loeve%20Transform%20for%20Enhanced%20Multichannel%20Audio%20Coding.pdf},
	abstract = {A modified MPEG Advanced Audio Coding (AAC) scheme based on the Karhunen-Loeve transform (KLT) to remove inter-channel redundancy, which is called the MAACKL method, has been proposed in our previous work. However, a straightforward coding of elements of the KLT matrix generates about 240 bits per matrix for typical 5 channel audio contents. Such an overhead is too expensive so that it prevents MAACKL from updating KLT dynamically in a short period of time. In this research, we study the de-correlation efficiency of adaptive KLT as well as an efficient way to encode elements of the KLT matrix via vector quantization. The effect due to different quantization accuracy and adaptation period is examined carefully. It is demonstrated that with the smallest possible number of bits per matrix and a moderately long KLT adaptation time, the MAACKL algorithm can still generate a very good coding performance.},
	booktitle = {{SPIE}},
	author = {Yang, Dai and Ai, Hongmei and Kyriakakis, Chris and Kuo, C.-C. Jay},
	year = {2001}
}
Powered by bibtexbrowser