DocumentCode
3301610
Title
Adaptive recursive MLD using ordered statistics for low rate codes
Author
Yokoyama, Ryuhei ; Kusaka, Takuya ; Fujiwara, Toru
Author_Institution
Dept. of Commun. Network Eng., Okayama Univ., Okayama, Japan
fYear
2010
fDate
17-20 Oct. 2010
Firstpage
772
Lastpage
777
Abstract
A new adaptive recursive maximum likelihood decoding algorithm using ordered statistics is proposed. The average computational complexity of the algorithm is considerably small compared with the known algorithms. Preliminary simulation results for the (64,22,16) Reed-Muller code and the (64,24,16) extended BCH code are shown. The average number of additions and comparisons on soft-decision values becomes smaller than that for recursive MLD at SN ratios higher than or equal to Eb/N0 1[dB].
Keywords
BCH codes; Reed-Muller codes; maximum likelihood decoding; BCH code; Reed Muller code; adaptive recursive MLD; adaptive recursive maximum likelihood decoding algorithm; low rate code; soft decision; Computational complexity; Correlation; Decoding; Encoding; Iterative decoding; Simulation; Tin;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and its Applications (ISITA), 2010 International Symposium on
Conference_Location
Taichung
Print_ISBN
978-1-4244-6016-8
Electronic_ISBN
978-1-4244-6017-5
Type
conf
DOI
10.1109/ISITA.2010.5649626
Filename
5649626
Link To Document