Design of the Code-book

In the past, the most popular algorithm for the code-book design was the Linde-Buzo-Gray algorithm (LBG) and its variants [154]. However, the LBG algorithm is computationally demanding and in the last decade new methods for the code-book design have been proposed. Most of them are based on competitive learning algorithms [73], [83], [86], [157], [170]. In this chapter we study three such algorithms. Moreover, we discuss the problem of selection of the initial code-book which has a considerable influence on the learning process.