A Novel Reduced Complexity Trellis-based MAP Decoding Algorithm for Block Turbo Codes
Publish place: 15th Iranian Conference on Electric Engineering
Publish Year: 1386
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,755
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICEE15_156
تاریخ نمایه سازی: 17 بهمن 1385
Abstract:
In this paper ure present a new reduced complexity trellis-based maximum a posteriori probability (MAP) decoding algorithm for Block Turbo
Codes (BTCs). To reduce the complexity, a simplified trellis is derived at the end of each iteration in which many branches and states are removed. Trellis reduction is accomplished based on the statistical properties of the log-likelihood ratio (LLR) information. The performance of Bose-Chaudhuri-Hocquengham (BCH)-BTC over additive white Gaussian noise (AWGN) channel using the proposed decoding algorithm is evaluated. Simulation results reveal that the innovative strategl of trellis reduction has negligible bit-error rate (BER) degradation in comparison with the full-search log-MAP algorithm.
Keywords:
Authors
Saeed Ghazanfari Rad
Department of Electrical Engineering, Iran University of Science & Technology (IUST) Tehran, Iran
Vahid Tabataba Vakili
Department of Electrical Engineering, Iran University of Science & Technology (IUST) Tehran, Iran
Abolfazl Falahati
Department of Electrical Engineering, Iran University of Science & Technology (IUST) Tehran, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :