EURASIP Journal on Wireless Communications and Networking

Table 3 Complexity comparison of decoding algorithms per decoding step

From: Reduced complexity Log-MAP algorithm with Jensen inequality based non-recursive max∗ operator for turbo TCM decoding

Algorithm	Overall number	Reduction wrt
	of operations	Log-MAP
Log-MAP	1,606	—
AvN Log-MAP	946	41.1%
Linear Log-MAP	1,606	0%
Average Log-MAP	1,354	15.7%
Shift Log-MAP	1,564	2.6%
Max-Log-MAP	706	56%

For parallel TTCM scheme in software implementation – overall number of operations.

Back to article page