Efficient Modulo-(2^(2n)+1) Arithmetic via Two Parallel n-bit Residue Channels

The proposed complex-number moduli (2^n±j) provide efficient modulo-(2^(2n)+1) arithmetic operations in terms of delay, area, and power consumption compared to the traditional modulo-(2^(2n)+1) approach.