Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 161 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 38 tok/s Pro
GPT-4o 79 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 441 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Using Space-Time trellis Codes For AF Relay Channels (1209.0113v1)

Published 1 Sep 2012 in cs.IT and math.IT

Abstract: We consider the analysis and design of space-time trellis codes (STTCs) for a cooperative relay channel operating in amplify-and-forward (AF) mode assuming the source and destination nodes are equipped with multiple antennas but the relay node has single antenna. We derive a pairwise error probability (PEP) expression for the performance of STTCs in this type of channels. A simple upper-bound on PEP is then derived and is maximized to find the optimum STTCs. We show that the designed STTCs based on the derived criterion achieve full diversity in the AF relay channels especially at high signal-to-noise-ratios (SNRs). The maximum achievable diversity in relay channels with single-antenna relay is bounded by $\min(M,N)$ where $M$ and $N$ are respectively the number of antennas in source and destination nodes. Simulation results confirm that the proposed codes achieve the maximum diversity and also provide an appealing coding gain.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (2)

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

Collections

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