کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4976098 | 1365606 | 2012 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Linear-constant log-map, a fast accurate algorithm for map decoding
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper proposes a new approximation to be used for the correction function in the turbo decoding algorithm, called Linear-Constant-log Map. Max-log Map, Linear-log Map and Constant-log Map are the well known simplified versions of Jacobi-log Map (Maximum a Posteriori) algorithm already in use but they cannot meet a proper performance in term of output BER and clock consumption of the CPU decoding encoded bits. The proposed algorithm first breaks the correction function domain of the Jacobi logarithm to three subsections by determining the border points between these sections and then uses a linear function and two constant values as an approximation of this function. Using an AWGN channel model, simulation results show that the new algorithm is almost more than six times faster than Jacobi-log Map algorithm with a Bit Error Rate (BER) very close to it.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of the Franklin Institute - Volume 349, Issue 5, June 2012, Pages 1721-1733
Journal: Journal of the Franklin Institute - Volume 349, Issue 5, June 2012, Pages 1721-1733
نویسندگان
Hamid Samadian, Amir Mousavie Nia,