AICE-CRT: The Complex Case
Abstract
The CRT is a fundamental technique widely employed in designing computationally efficient convolution algorithms. In the previous chapter, we presented the AICE-CRT, an extension to the CRT for the case of a ring of polynomials with coefficients defined over a finite integer ring, and developed fast algorithms for computing cyclic and acyclic convolutions. The objective is to generalize NTTs which turn out to be a special case of this extension. This chapter focuses on the extension of the CRT for processing complex valued integer sequences. Once again, the present work generalizes the complex-number-theoretic-transforms (CNTTs).
Fields of Study & Subjects
Digital Filter Design and Implementation
Cryptography and Residue Arithmetic
Mathematical Analysis and Transform Methods
Publication details
- Journal / source
- CRC Press eBooks
- Pages
- 111–130
- Publication date
- 10 February 2026
- Language
- EN
- Document type
- Book chapter