Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
2000 character limit reached

An Empirical Study of Irregular AG Block Turbo Codes over Fading Channels (1604.00564v1)

Published 17 Feb 2016 in cs.IT and math.IT

Abstract: This study will present the design, construction and implementation of Algebraic Geometric Irregular Block Turbo Codes (AGIBTCs). Furthermore, we will evaluate its performance over fast fading channels using different modulation schemes (BPSK, QPSK, 16QAM and 64QAM). The idea behind the design of AGIBTC is to overcome the high system complexity of Algebraic Geometric Block Turbo Codes (AGBTCs) while maintaining a high Bit-Error Rate (BER) performance. This design is inspired by the idea of unequal protection of information symbols which is the core of IBTCs. Our experiments conducted over the worst case of fading channels which is the fast fading channels; and this is done in order to show the magnitude of gain in BER or the reduction in system complexity that can be achieved by this design. Our experiments shows that despite a very slight negative gain over BPSK and QPSK modulation schemes the system complexity is significantly reduced. However, when applying higher modulation schemes a gain in both BER and system complexity are achieved.

Citations (12)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)