Computer Science – Information Theory
Scientific paper
2008-02-16
Computer Science
Information Theory
5 pages, 4 figures, Proceedings of the 42nd Conference on Information Sciences and Systems, Princeton, USA, March 19-21, 2008
Scientific paper
It is known that the frame error rate of turbo codes on quasi-static fading channels can be accurately approximated using the convergence threshold of the corresponding iterative decoder. This paper considers quasi-static fading channels and demonstrates that non-iterative schemes can also be characterized by a similar threshold based on which their frame error rate can be readily estimated. In particular, we show that this threshold is a function of the probability of successful frame detection in additive white Gaussian noise, normalized by the squared instantaneous signal-to-noise ratio. We apply our approach to uncoded binary phase shift keying, convolutional coding and turbo coding and demonstrate that the approximated frame error rate is within 0.4 dB of the simulation results. Finally, we introduce performance evaluation plots to explore the impact of the frame size on the performance of the schemes under investigation.
Carrasco Rolando
Chatzigeorgiou Ioannis
Wassell Ian J.
No associations
LandOfFree
On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-248316