By Topic

Most Dispersed and Greedy Tree Growing Algorithm for Designing LBG Initial Codebook

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 $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)
Yanxia Liang ; Broadband Wireless Commun. Lab., Xidian Univ., Xi''an, China ; Jiawei Yang ; Ye Li ; Wei Liu

The codebook generated by LBG algorithm depends on an initial codebook, thus a new LBG initial codebook generation algorithm was developed on the basis of Greedy Tree Growing Algorithm (GTGA) and Most Dispersed Codewords in Initialization (MDCI) algorithm. A fundamental codebook was generated by GTGA first, and then an initial codebook was obtained from this fundamental codebook by MDCI algorithm. The computation of this new algorithm is lower than usual Split algorithm, and the run time decreases too. Compared with these too basic algorithms, both the Average Distortion and Average Spectral Distortion are reduced.

Published in:

Vehicular Technology Conference (VTC Spring), 2011 IEEE 73rd

Date of Conference:

15-18 May 2011