EURASIP Journal on Advances in Signal Processing

Table 1 Computation complexity of additions and multiplications in conventional DFT [[1]], reciprocal-orthogonal parametric [[10]], EIJT [[18]] N =3×2^r, and proposed PROJT with N =2^r+1 matrix size, where r ≥2

From: Fast parametric reciprocal-orthogonal jacket transforms

	Conventional	ROP[13]	EIJT[18]	Proposed
	DFT[1]	N=2^r+1	N=3×2^r	N=2^r+1
Parameters	1 (fixed)	3N/2	2N−1	$\frac{9}{4} N$
Additions	(N−1)N	N l o g ₂ N	3N l o g₂N	N+N l o g₂N
Multiplications	N ²	3N/2	N l o g ₂ N	3N

Back to article page