Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/72822
DC FieldValue
dc.titleOn skew circular convolution algorithms over finite integer rings
dc.contributor.authorGarg, Hari Krishna
dc.date.accessioned2014-06-19T05:12:24Z
dc.date.available2014-06-19T05:12:24Z
dc.date.issued1996
dc.identifier.citationGarg, Hari Krishna (1996). On skew circular convolution algorithms over finite integer rings. Proceedings - IEEE International Symposium on Circuits and Systems 2 : 544-547. ScholarBank@NUS Repository.
dc.identifier.issn02714310
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/72822
dc.description.abstractIn recent work, we have generalized the number-theoretic transforms over finite integer rings and derived fast algorithms for computing convolution of two discrete sequences. In this paper, we describe certain number theoretic results and algorithms that appertain to computing skew circular convolution over finite integer rings and their complex extensions.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleProceedings - IEEE International Symposium on Circuits and Systems
dc.description.volume2
dc.description.page544-547
dc.description.codenPICSD
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


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