Loading…
Comparison of convolutional and turbo codes for OFDM with antenna diversity in high-bit-rate wireless applications
This letter presents simulation results for the application of turbo coding to an OFDM system with diversity. First, results are presented for convolutional and Reed-Solomon codes. It is shown that even with short constraint lengths, convolutional codes have the potential to outperform Reed-Solomon...
Saved in:
Published in: | IEEE communications letters 2000-09, Vol.4 (9), p.277-279 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This letter presents simulation results for the application of turbo coding to an OFDM system with diversity. First, results are presented for convolutional and Reed-Solomon codes. It is shown that even with short constraint lengths, convolutional codes have the potential to outperform Reed-Solomon codes, provided that sufficient precision is used in the soft decoder. We then evaluate the performance of turbo codes under slow fading conditions and study the effects of varying codeword size. Increasing codeword size theoretically provides better interleaving between the two component codes. However, this advantage is less clear when the fading rate is significantly lower than the symbol rate, which is typical of the high-data-rate systems considered here. Under such conditions, the advantage of using two component convolutional codes in turbo codes is limited. A single convolutional code with a long constraint length may be a better choice. |
---|---|
ISSN: | 1089-7798 1558-2558 |
DOI: | 10.1109/4234.873485 |