### Abstract

A direct sum codebook (DSC) has the potential to reduce both memory and computational costs of vector quantization. A DSC consists of several sets or stages of vectors. An equivalent code vector is made from the direct sum of one vector from each stage. Lattice based DSC quantizers are designed to be optimal under a residual encoding by avoiding entanglement. Experimental results show that DSC quantizers based on cubical lattices perform as well as exhaustive search quantizers on a scalar source. Performance increases with vector dimension on sources with memory, though not quite as much as with an exhaustive search. Additional savings in rate are obtainable by using variable length code vectors.

Original language | English (US) |
---|---|

Number of pages | 1 |

Journal | Data Compression Conference Proceedings |

State | Published - 1995 |

Event | Proceedings of the 5th Data Compression Conference - Snowbird, UT, USA Duration: Mar 28 1995 → Mar 30 1995 |

### ASJC Scopus subject areas

- Computer Networks and Communications

## Fingerprint Dive into the research topics of 'Lattice-based designs of direct sum codebooks for vector quantization'. Together they form a unique fingerprint.

## Cite this

*Data Compression Conference Proceedings*.