Reducing the complexity of the LPC vector quantizer using the k-d tree search algorithm

V. Ramasubramanian, Kuldip K. Paliwal. Reducing the complexity of the LPC vector quantizer using the k-d tree search algorithm. In George Kokkinakis, Nikos Fakotakis, Evangelos Dermatas, editors, Fifth European Conference on Speech Communication and Technology, EUROSPEECH 1997, Rhodes, Greece, September 22-25, 1997. pages 1255-1258, ISCA, 1997. [doi]

Authors

V. Ramasubramanian

This author has not been identified. Look up 'V. Ramasubramanian' in Google

Kuldip K. Paliwal

This author has not been identified. Look up 'Kuldip K. Paliwal' in Google