z-logo
open-access-imgOpen Access
Performance Analysis of Turbo-Coded Decode-and-Forward Relay Channels with Middleton Class-A Impulsive Noise
Author(s) -
Mihaela Andrei,
Lucian Trifina,
Daniela Tărniceriu
Publication year - 2014
Publication title -
advances in electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 23
eISSN - 1844-7600
pISSN - 1582-7445
DOI - 10.4316/aece.2014.04006
Subject(s) - relay , turbo code , computer science , turbo , noise (video) , decoding methods , turbo equalizer , telecommunications , electronic engineering , speech recognition , engineering , power (physics) , physics , low density parity check code , error floor , artificial intelligence , quantum mechanics , automotive engineering , image (mathematics)
Relays are used to improve wireless network performances. In this paper, the decode-and-forward relaying technique is used to achieve spatial diversity. We considered a system with a symmetric turbo coded relay and its three channels (source-relay, source-destination and relay-destination) affected by impulsive noise. The statistic model used for noise was Middleton additive white Class-A. The performances are evaluated by investigating the system behavior when at destination the traditional iterative decoder and the heuristically modified iterative decoder proposed by Huynh are used. The simulations were made for different parameter values of the noise model and they showed that in high impulsive noise conditions, the relay system offers better performance than the direct link. However, when the source-destination channel is weak, the traditional iterative decoder assures an additional gain than the heuristically modified one. When the Gaussian component is dominant, the relay system ensures better performances, but only at high values of Signal-to-Noise Ratio. In this case, the heuristically modified decoder, with conveniently chosen value for alpha, is better than the traditional one in terms of bit error rate

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here