Institute of Information Theories and Applications FOI ITHEA
We extend our previous work into error-free representations of transform basis functions by presenting
a 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 new
algebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT without
any intermediate number representation conversions. The resulting architecture is very regular and reduces
latency by 50% compared to a previous error-free design, with virtually the same hardware cost.