DocumentCode :
3275003
Title :
Maximum-likelihood detection of block coded CDMA using the A* algorithm
Author :
Németh, Peter S A ; Rasmussen, Lars K. ; Aulin, Tor M.
Author_Institution :
Dept. of Comput. Eng., Chalmers Univ. of Technol., Goteborg, Sweden
fYear :
2001
fDate :
2001
Firstpage :
88
Abstract :
Maximum-likelihood soft-decision decoding of block coded CDMA using the A* algorithm is considered. Different heuristic functions are considered, applied to coded and uncoded CDMA. The average complexity involved in ML detection for both uncoded and coded CDMA is investigated. The (23,12) Golay code is used in the coded case
Keywords :
Golay codes; code division multiple access; computational complexity; maximum likelihood decoding; maximum likelihood detection; A* algorithm; Golay code; ML detection; average complexity; block coded CDMA; heuristic functions; maximum-likelihood detection; maximum-likelihood soft-decision decoding; uncoded CDMA; AWGN; Additive white noise; Binary phase shift keying; Block codes; Costs; Decorrelation; Gaussian noise; Maximum likelihood detection; Multiaccess communication; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
Type :
conf
DOI :
10.1109/ISIT.2001.935951
Filename :
935951
Link To Document :
بازگشت