کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6879806 | 1443156 | 2014 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A modified Min Sum decoding algorithm based on LMMSE for LDPC codes
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
A new modified Min Sum decoding algorithm based on parameter estimation theory for Low Density Parity Check (LDPC) codes is presented in this paper. First, Linear Minimum Mean Square Error (LMMSE) estimate criterion is used to model the magnitude of check-to-variable message and calculate estimated parameters, furthermore the golden section search algorithm is used to speed up getting the boundary, with which the parameters can be determined. Then, the parameters are modified further on the basis of the relationship between the iteration number and the estimated parameters. Finally, the same estimated parameters are used for different signal to noise ratio (SNR) to ensure the decoding performance and reduce the hardware complexity. The simulation results show that a gain of 0.3-0.5Â dB can be achieved in comparison with other kinds of modified Min Sum algorithms, which is very close to that of BP algorithm. What's more, the algorithm has the following characteristics: low computation complexity, small decoding delay, easiness of calculation for estimated parameters, and simplicity in hardware implementation.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: AEU - International Journal of Electronics and Communications - Volume 68, Issue 10, October 2014, Pages 994-999
Journal: AEU - International Journal of Electronics and Communications - Volume 68, Issue 10, October 2014, Pages 994-999
نویسندگان
Zijing Wu, Kaixiong Su, Liting Guo,