Rapid prototyping of field programmable gate array-based discrete cosine transform approximations (Q1886908)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rapid prototyping of field programmable gate array-based discrete cosine transform approximations |
scientific article; zbMATH DE number 2116993
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rapid prototyping of field programmable gate array-based discrete cosine transform approximations |
scientific article; zbMATH DE number 2116993 |
Statements
Rapid prototyping of field programmable gate array-based discrete cosine transform approximations (English)
0 references
19 November 2004
0 references
Summary: A method for the rapid design of field programmable gate array (FPGA)-based discrete cosine transform (DCT) approximations is presented that can be used to control the coding gain, mean square error (MSE), quantization noise, hardware cost, and power consumption by optimizing the coefficient values and datapath wordlengths. Previous DCT design methods can only control the quality of the DCT approximation and estimates of the hardware cost by optimizing the coefficient values. It is shown that it is possible to rapidly prototype FPGA-based DCT approximations with near optimal coding gains that satisfy the MSE, hardware cost, quantization noise, and power consumption specifications.
0 references
DCT
0 references
low-power
0 references
FPGA
0 references
binDCT
0 references