Vlsi Array Architectures for Pyramid Vector Quantization

  • Authors:
  • Bongjin Jung;Wayne P. Burleson

  • Affiliations:
  • Digital Semiconductor Co., 77 Reed Road, HLO2-3/D11, Hudson MA 01749;Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003

  • Venue:
  • Journal of VLSI Signal Processing Systems - Special issue on future directions in the design and implementations of DSP systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present parallel algorithms and array architectures for pyramidvector quantization (PVQ) [1] for use in image coding in low-power wirelesssystems. PVQ presents an alternative to other quantization methods which isespecially suitable for symmetric peer-to-peer communications likevideo-conferencing. But, both the encoding and decoding algorithms havedata-dependent iteration bounds and data-dependent dependencies whichprevent efficient parallelization of the algorithms for either hardware orsoftware implementations. We perform an algorithmic transformation [2] toconvert the data-dependent regular algorithms to equivalent data-independentalgorithms. The resulting regular algorithms exhibit modular and regularstructures with minimal control overhead; hence, they are well suited forVLSI array implementation in ASIC or FPGA technologies. Based on ourparallel algorithms and systematic design methodologies [3], we developlinear array architectures. Both encoder and decoder architectures consistof L identical processors with local interconnections and provide O(L)speed-up over a sequential implementation, where L is the dimension of avector. The architectures achieve 100% processor utilization andpermit power savings through early completion. A combined encoder-decoderarchitecture is also presented.