Please use this identifier to cite or link to this item:
|Title:||On skew circular convolution algorithms over finite integer rings||Authors:||Garg, Hari Krishna||Issue Date:||1996||Citation:||Garg, 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.||Abstract:||In 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.||Source Title:||Proceedings - IEEE International Symposium on Circuits and Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/81629||ISSN:||02714310|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 29, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.