Please use this identifier to cite or link to this item:
|Title:||Skew circular convolution algorithms over finite integer rings||Authors:||Garg, H.K.||Keywords:||Algorithm theory
Communications & signal processing
Digital signal processing
|Issue Date:||1996||Citation:||Garg, H.K. (1996). Skew circular convolution algorithms over finite integer rings. Electronics Letters 32 (24) : 2213-2214. ScholarBank@NUS Repository.||Abstract:||In recent work, the author has generalised number-theoretic transforms (NTTs) over finite integer rings and derived fast algorithms for computing circular convolution of two discrete sequences. Here, number theoretic results are described and algorithms for computing skew circular convolution over finite integer rings and their complex extensions are developed.||Source Title:||Electronics Letters||URI:||http://scholarbank.nus.edu.sg/handle/10635/81196||ISSN:||00135194|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 12, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.