title: On the computational complexity of the LBG and PNN algorithms.
abstract: This correspondence compares the computational complexity of the pair-wise nearest neighbor (PNN) and Linde-Buzo-Gray (LBG) algorithms by deriving analytical expressions for their computational times. It is shown that for a practical codebook size and training vector sequence, the LBG algorithm is indeed more computationally efficient than the PNN algorithm.
authors.affiliation: Dept. of Electr. and Comput. Eng., Wollongong Univ., NSW.
authors.forename: J
authors.initials: J
authors.lastname: Shanbehzadeh
authors.forename: P O
authors.initials: PO
authors.lastname: Ogunbona