DC FieldValueLanguage
dc.contributor.authorStanković, Radomiren
dc.contributor.authorFalkowski, Bogdanen
dc.date.accessioned2020-05-01T20:29:18Z-
dc.date.available2020-05-01T20:29:18Z-
dc.date.issued1999-12-01en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2139-
dc.description.abstractThis paper explains the fast tabular technique for the generation of Reed-Muller expansions through Digital Signal Processing concepts of FFT and dyadic convolution. Detailed analysis has shown that basic operations used in the tabular technique can be described in terms of basic DSP operations. Various other polynomial expansions of discrete functions can be also analyzed in a similar way.en
dc.relation.ispartofInternational Symposium on IC Technology, Systems and Applicationsen
dc.titleFFT analysis of fast tabular techniques for Reed-Muller expansionsen
dc.typeConference Paperen
dc.relation.conference8th International Symposium on Integrated Circuits, Devices and Systems, ISIC 99; Singapore; Singapore; 8 September 1999 through 10 September 1999-
dc.identifier.scopus2-s2.0-1842678445en
dc.relation.firstpage382en
dc.relation.lastpage385en
dc.relation.volume8en
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.