作者: AN SltODRAS , CA Christopoulos , None
DOI: 10.1080/00207219308925854
关键词:
摘要: Abstract An extension of an existing fast algorithm for the computation discrete cosine transform is presented. The proposed has a structure similar to split-radix used FFT, same computational complexity as direct algorithms and high regularity which facilitates its implementation in VLSI technology. A comparison on different computer architectures shows that superior terms execution time.