arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1211.1340cs.DS
收藏

基于Galois理论的快速DCT算法的代数推导

Derivation of fast DCT algorithms using algebraic technique based on Galois theory

Maxim Vashkevich, Alexander Petrovsky

摘要:

提出了一种快速离散余弦变换(DCT)算法的代数推导方法。该技术是基于代数信号处理理论(ASP)。在ASP中,DCT与多项式代数C[x]/p(x)相关联。通过对C[x]/p(x)的逐步分解,得到了一种快速算法。为了揭示快速DCT算法的推导与伽罗瓦理论之间的联系,我们定义了有理数域Q上的多项式代数来代替复数C。Q[x]/p(x)的分解需要将基域Q扩张到多项式p(x)的分裂域E。利用伽罗瓦理论寻找多项式p(x)分解的中间子域L_i。在此基础上推导出快速DCT算法。

英文摘要:

The paper presents an algebraic technique for derivation of fast discrete cosine transform (DCT) algorithms. The technique is based on the algebraic signal processing theory (ASP). In ASP a DCT associates with a polynomial algebra C[x]/p(x). A fast algorithm is obtained as a stepwise decomposition of C[x]/p(x). In order to reveal the connection between derivation of fast DCT algorithms and Galois theory we define polynomial algebra over the field of rational numbers Q instead of complex C. The decomposition of Q[x]/p(x) requires the extension of the base field Q to splitting field E of polynomial p(x). Galois theory is used to find intermediate subfields L_i in which polynomial p(x) is factored. Based on this factorization fast DCT algorithm is derived.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑