Abstract
Many DSP applications involve linear transforms whose coefficients are fixed at design time. Examples of such transforms include DCT, IDCT and color space conversion kernels such RGB-to-YUV. Since the coefficients are fixed, the flexibility of a multiplier is not necessary and an efficient implementation of such transforms can be obtained using adders and shifters. This chapter presents techniques for area efficient implementation of fixed coefficient 1-D and 2-D linear transforms.
Keywords
Register Allocation High Level Synthesis Data Flow Graph Signal Flow Graph Coefficient Representation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer Science+Business Media New York 2001