DocumentCode
3054689
Title
Trellis decoding of some decomposable codes
Author
Altay, G. ; Yalcin, Siddika Berna Ors ; Ucan, O.N.
Author_Institution
Dept. of Electr. & Electron. Eng., Bahcesehir Univ., Istanbul, Turkey
fYear
2003
fDate
20-22 Nov. 2003
Firstpage
667
Lastpage
669
Abstract
This paper presents a maximum likelihood (ML) soft decision decoding scheme to implement Viterbi Algorithm for some constructed decomposable codes of Hamming distance four and show that the decoding complexity is simple, hence, it may be employed in trellis - based decoders. Bit error rate performances of some decomposable codes that were obtained employing the technique in AWGN channel are also presented.
Keywords
AWGN channels; Hamming codes; Viterbi decoding; error statistics; maximum likelihood decoding; trellis codes; AWGN channel; Viterbi algorithm; bit error rate; decoding complexity; decomposable codes; hamming distance; maximum likelihood soft decision decoding scheme; trellis decoding; trellis-based decoders; AWGN; Art; Bit error rate; Block codes; Iterative decoding; Mathematics; Matrix decomposition; Maximum likelihood decoding; Product codes; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Recent Advances in Space Technologies, 2003. RAST '03. International Conference on. Proceedings of
Conference_Location
Istanbul, Turkey
Print_ISBN
0-7803-8142-4
Type
conf
DOI
10.1109/RAST.2003.1303998
Filename
1303998
Link To Document