We extend our previous work into error-free representations of transform basis functions by presentinga novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT)and its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a newalgebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT withoutany intermediate number representation conversions. The resulting architecture is very regular and reduceslatency by 50% compared to a previous error-free design, with virtually the same hardware cost.
展开▼
