Title :
Maximum likelihood decoding with reduced complexity
Author_Institution :
Coll. of Eng., California Univ., Riverside, CA, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
We design maximum-likelihood (ML) decoding, whose complexity has exponential order qnR(1-R)(1+R)/ for virtually all linear q-ary codes of length n and rate R used over any memoryless channel. This exponent reduces up to 3 times the known complexity exponent qn min(R, 1-R) of ML decoding
Keywords :
channel capacity; computational complexity; linear codes; maximum likelihood decoding; memoryless systems; ML decoding; code length; code rate; complexity exponent; exponential order complexity; linear q-ary codes; maximum likelihood decoding; memoryless channel; reduced complexity; Algorithm design and analysis; Design engineering; Educational institutions; Error probability; Linear code; Maximum likelihood decoding; Memoryless systems; Upper bound;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613333
