Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/96045
Type: Artigo de evento
Title: Reduced-complexity Waveform Coding Via Alphabet Partitioning
Author: Said Amir
Pearlman William A.
Abstract: A method to reduce coding complexity when the source alphabet is large, based on the alphabet partitioning is studied. The advantage of this scheme is that it is normally possible to find partitions that simultaneously allow large reductions in the coding complexity and with very small loss in the compression ratios. This partitioning technique is similar to definition of 'buckets' used for complexity reduction. The set numbers corresponds to the bucket number, and can also be used to simplify context-based coding. However, they have an additional purposes: they allow part of the information to be left uncoded, with obvious advantages in speed and complexity.
Editor: IEEE, Piscataway, NJ, United States
Rights: fechado
Identifier DOI: 
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-0029181851&partnerID=40&md5=eb07ae6158dc50a05024c4ffd69b067a
Date Issue: 1995
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-0029181851.pdf115.59 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.