DocumentCode
429928
Title
Reduced complexity of maximum-likelihood decoding
Author
Elengical, S.M. ; Takawira, F. ; Xu, H.
Author_Institution
Sch. of Electr., Electron. & Comput. Eng., Univ. of Kwa-Zulu Natal, Durban
Volume
1
fYear
2004
fDate
17-17 Sept. 2004
Firstpage
217
Abstract
The paper proposes a reduced complexity maximum-likelihood (ML) decoding algorithm for linear block codes based on the Kaneko decoder. The proposed decoding scheme is evaluated over the additive white Gaussian noise (AWGN) channel using binary phase shift keying (BPSK) signalling by simulation. Simulation results show that for negligible performance loss, there is significant improvement in the complexity of decoding
Keywords
AWGN channels; block codes; computational complexity; linear codes; maximum likelihood decoding; phase shift keying; AWGN channel; BPSK; Kaneko decoder; additive white Gaussian noise channel; binary phase shift keying; complexity; linear block codes; maximum-likelihood decoding; AWGN channels; Additive white noise; Africa; Binary phase shift keying; Block codes; Gaussian noise; Iterative decoding; Maximum likelihood decoding; Noise generators; Performance loss;
fLanguage
English
Publisher
ieee
Conference_Titel
AFRICON, 2004. 7th AFRICON Conference in Africa
Conference_Location
Gaborone
Print_ISBN
0-7803-8605-1
Type
conf
DOI
10.1109/AFRICON.2004.1406662
Filename
1406662
Link To Document