Adaptive Karhunen-Loeve transform for enhanced multichannel audio coding | Zendy

Dai Yang | Zendy; Hongmei Ai | Zendy; Christos Kyriakakis | Zendy; C.C. Jay Kuo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

<title>Adaptive Karhunen-Loeve transform for enhanced multichannel audio coding</title>

Author(s) -

Dai Yang,

Hongmei Ai,

Christos Kyriakakis,

C.C. Jay Kuo

Publication year - 2001

Publication title -

proceedings of spie, the international society for optical engineering/proceedings of spie

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.192

H-Index - 176

eISSN - 1996-756X

pISSN - 0277-786X

DOI - 10.1117/12.449594

Subject(s) - karhunen–loève theorem , computer science , coding (social sciences) , encode , algorithm , decoding methods , quantization (signal processing) , redundancy (engineering) , speech recognition , vector quantization , sub band coding , discrete cosine transform , speech coding , mathematics , artificial intelligence , statistics , biochemistry , chemistry , gene , operating system , image (mathematics)

AmodifledMPEGAdvancedAudioCoding(AAC)schemebasedontheKarhunen-Loevetransform(KLT)toremove inter-channelredundancy,whichiscalledtheMAACKLmethod,hasbeenproposedinourpreviouswork. However, a straightforward coding of elements of the KLT matrix generates about 240 bits per matrix for typical 5 channel audiocontents. SuchanoverheadistooexpensivesothatitpreventsMAACKLfromupdatingKLTdynamicallyin ashortperiodoftime. Inthisresearch,westudythede-correlatione-ciencyofadaptiveKLTaswellasane-cient waytoencodeelementsoftheKLTmatrixviavectorquantization. Theefiectduetodifierentquantizationaccuracy and adaptation period is examined carefully. It is demonstrated that with the smallest possible number of bits per matrixandamoderatelylongKLTadaptationtime,theMAACKLalgorithmcanstillgenerateaverygoodcoding performance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research