20
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Lower Bound on the BER of a Decode-and-Forward Relay Network Under Chaos Shift Keying Communication System

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          This paper carries out the first-ever investigation of the analysis of a cooperative Decode-and-Forward (DF) relay network with Chaos Shift Keying (CSK) modulation. The performance analysis of DF-CSK in this paper takes into account the dynamical nature of chaotic signal, which is not similar to a conventional binary modulation performance computation methodology. The expression of a lower bound bit error rate (BER) is derived in order to investigate the performance of the cooperative system under independently and identically distributed (i.i.d.) Gaussian fading wireless environments. The effect of the non-periodic nature of chaotic sequence leading to a non constant bit energy of the considered modulation is also investigated. A computation approach of the BER expression based on the probability density function of the bit energy of the chaotic sequence, channel distribution, and number of relays is presented. Simulation results prove the accuracy of our BER computation methodology.

          Related collections

          Most cited references14

          • Record: found
          • Abstract: not found
          • Article: not found

          Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            High-Performance Cooperative Demodulation With Decode-and-Forward Relays

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Linear diversity combining techniques

                Bookmark

                Author and article information

                Journal
                18 September 2013
                2013-09-24
                Article
                1309.5802
                dada25a0-00d1-4f81-864c-059dca952581

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                This paper has been accepted for publication and will soon appear in the IET Communications Journal
                cs.IT cs.PF math.IT

                Comments

                Comment on this article