"Reducing the complexity of the LPC vector quantizer using the k-d tree ..."

V. Ramasubramanian, Kuldip K. Paliwal (1997)

> Home

Details and statistics

DOI: 10.21437/EUROSPEECH.1997-186

access: open

type: Conference or Workshop Paper

metadata version: 2023-07-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/interspeech/RamasubramanianP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/interspeech/RamasubramanianP97
V. Ramasubramanian, Kuldip K. Paliwal:
Reducing the complexity of the LPC vector quantizer using the k-d tree search algorithm. EUROSPEECH 1997: 1255-1258

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.