By Topic

Systolic codebook generation [speech recognition]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
B. Beresford-Smith ; Australian Nat. Univ., Camberra, ACT, Australia ; J. Breckling ; H. Schroder ; P. Summons

Two systolic codebook generators which are based on finding clusters in a multidimensional space with a suitable dissimilarity measure are presented. They are implemented on two novel VLSI architectures. For segments of speech represented by a sequence of k linear-predictive-coding vectors, the first version finds r large clusters in time O(rk), and the second version finds the maximal r clusters in time O(r log k)

Published in:

IEEE Transactions on Speech and Audio Processing  (Volume:1 ,  Issue: 2 )