Cart (Loading....) | Create Account
Close category search window

Fast nearest neighbour searching algorithm using L1 norm

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
$31 $31
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

3 Author(s)
Seongjoon Baek ; Dept. of Electr. Eng., Seoul Nat. Univ., South Korea ; SangKi Kang ; Koeng-Mo Sung

Simple but effective fast codebook searching algorithms for vector quantisation are presented. The Euclidean distance (L2 norm) calculation requires a number of multiplications. The proposed algorithms use the L1 norm between the input vector and codeword to discard many unlikely codewords. Since the proposed algorithms significantly reduce the number of multiplications, a considerable reduction in encoding time is achieved. Simulation results confirm the effectiveness of the proposed algorithms

Published in:

Electronics Letters  (Volume:35 ,  Issue: 24 )

Date of Publication:

25 Nov 1999

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.