A maximum likelihood decoding algorithm for wireless channels

Babalis, PG; Trakadas, PT; Capsalis, CN

dc.contributor.author	Babalis, PG	en
dc.contributor.author	Trakadas, PT	en
dc.contributor.author	Capsalis, CN	en
dc.date.accessioned	2014-03-01T01:17:21Z
dc.date.available	2014-03-01T01:17:21Z
dc.date.issued	2002	en
dc.identifier.issn	0929-6212	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14481
dc.subject	Block codes	en
dc.subject	Maximum-likelihood-decoding	en
dc.subject	Probability of error	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Algorithms	en
dc.subject.other	Approximation theory	en
dc.subject.other	Block codes	en
dc.subject.other	Coding errors	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Computational complexity	en
dc.subject.other	Computer simulation	en
dc.subject.other	Decoding	en
dc.subject.other	Maximum likelihood estimation	en
dc.subject.other	Probability	en
dc.subject.other	Satellite communication systems	en
dc.subject.other	Linear block codes	en
dc.subject.other	Maximum likelihood decoding algorithm	en
dc.subject.other	Satellite channels	en
dc.subject.other	Tanaka-Kakigahara algorithm	en
dc.subject.other	Wireless channels	en
dc.subject.other	Wireless telecommunication systems	en
dc.title	A maximum likelihood decoding algorithm for wireless channels	en
heal.type	journalArticle	en
heal.identifier.primary	10.1023/A:1021155124503	en
heal.identifier.secondary	http://dx.doi.org/10.1023/A:1021155124503	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	A new maximum likelihood decoding (MLD) algorithm for linear block codes is proposed. The new algorithm uses the algebraic decoder in order to generate the set of candidate codewords. It uses the exact probability for each codeword as a new likelihood metric and a method to generate the appropriate set of codewords similar to Kaneko, et al., and Tanaka-Kakigahara algorithms. The performance of the proposed algorithm is the same as that of MLD as it is proved theoretically and verified by simulation results. The comparison with these similar algorithms shows that the new one always requires less average decoding complexity than those of the other algorithms. Finally, we compare the algorithms for terrestrial and satellite channels.	en
heal.publisher	KLUWER ACADEMIC PUBL	en
heal.journalName	Wireless Personal Communications	en
dc.identifier.doi	10.1023/A:1021155124503	en
dc.identifier.isi	ISI:000179358400004	en
dc.identifier.volume	23	en
dc.identifier.issue	2	en
dc.identifier.spage	283	en
dc.identifier.epage	295	en