Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm

Simple item page
dc.creatorChen, Ning
dc.creatorYan, Zhiyuan
dc.date2007-10-10
dc.date2008-10-23
dc.date.accessioned2026-07-07T10:12:14Z
dc.date.available2026-07-07T10:12:14Z
dc.descriptionIn this paper, we first propose a novel common subexpression elimination (CSE) algorithm for matrix-vector multiplications over characteristic-2 fields. As opposed to previously proposed CSE algorithms, which usually focus on complexity savings due to recurrences of subexpressions, our CSE algorithm achieves two types of complexity reductions, differential savings and recurrence savings, by taking advantage of the cancelation property of characteristic-2 fields. Using our CSE algorithm, we reduce the additive complexities of cyclotomic fast Fourier transforms (CFFTs). Using a weighted sum of the numbers of multiplications and additions as a metric, our CFFTs achieve smaller total complexities than previously proposed CFFTs and other FFTs, requiring both fewer multiplications and fewer additions in many cases.
dc.description11 pages, submitted to IEEE Transactions on Signal Processing
dc.identifierhttps://arxiv.org/abs/0710.1879
dc.identifierhttp://arxiv.org/abs/0710.1879
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172119
dc.subjectInformation Theory
dc.subjectComputational Complexity
dc.subjectCombinatorics
dc.titleCyclotomic FFTs with Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm
dc.typetext

Files

Collections

arXiv