Regressive Structures for Computation of DST-II and Its Inverse

Table 2

Comparison of algorithms for computing DST in terms of addition and multiplication.

Algorithms	Number of addition	Number of multiplication
	𝑁=2^𝑀	𝑁=2^𝑀
Fast DST, [15, 16]	3𝑀𝑁/2−𝑁+1	𝑀𝑁/2+1
[17]	4N + 2	6N
[18]	5N + 2	5N
The proposed design	3N	(N + 1)