• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Applied Schools
      • School of Applied Technology and Management
      • Computer Technology and Information Systems
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Applied Schools
      • School of Applied Technology and Management
      • Computer Technology and Information Systems
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Exact expression and tight bound on pairwise error probability for performance analysis of turbo codes over Nakagami-m fading channels

      Thumbnail
      View / Download
      200.7 Kb
      Author(s)
      Ali, S. A.
      Kambo, N. S.
      İnce, E. A.
      Date
      2007
      Source Title
      IEEE Communications Letters
      Print ISSN
      1089-7798
      Electronic ISSN
      1558-2558
      Publisher
      IEEE
      Volume
      11
      Issue
      5
      Pages
      399 - 401
      Language
      English
      Type
      Article
      Item Usage Stats
      223
      views
      371
      downloads
      Abstract
      This letter presents derivation for an exact and efficient expression on pairwise error probability over fully interleaved Nakagami-m fading channels under ideal channel state information at the decoder. As an outcome, this derivation also leads to a tight upper bound on pairwise error probability which is close to the exact expression. Pairwise error probability plots for different values of Nakagami parameter m along with an already existing numerically computable expression are provided. As an application of pairwise error probability, average union upper bounds for turbo codes having (1, 7/5, 7/5) and (1, 5/7, 5/7) generator polynomials employing transfer function approach are presented to illustrate the usefulness of the new efficient results. © 2007 IEEE.
      Keywords
      Average union upper bound
      Ideal channel state information
      Nakagami-m fading channel
      Pairwise error probability
      Turbo codes
      Channel state information
      Decoding
      Fading channels
      Polynomials
      Transfer functions
      Average union upper bound
      Nakagami parameter
      Pairwise error probability
      Turbo codes
      Permalink
      http://hdl.handle.net/11693/23463
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/LCOMM.2007.070082
      Collections
      • Computer Technology and Information Systems 70
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Performance analysis of turbo codes over Rician fading channels with impulsive noise 

        Ali, Syed Amjad; Ince, E.A. (IEEE, 2007)
        The statistical characteristics of impulsive noise differ greatly from those of Gaussian noise. Hence, the performance of conventional decoders, optimized for additive white Gaussian noise (AWGN) channels is not promising ...
      • Thumbnail

        Upper bounds on the capacity of deletion channels using channel fragmentation 

        Rahmati, M.; Duman, T. M. (Institute of Electrical and Electronics Engineers Inc., 2015)
        We study memoryless channels with synchronization errors as defined by a stochastic channel matrix allowing for symbol drop-outs or symbol insertions with particular emphasis on the binary and non-binary deletion channels. ...
      • Thumbnail

        Tree-based channel assignment schemes for multi-channel wireless sensor networks 

        Terzi, C.; Korpeoglu, I. (John Wiley & Sons Ltd., 2016)
        Many sensor node platforms used for establishing wireless sensor networks (WSNs) can support multiple radio channels for wireless communication. Therefore, rather than using a single radio channel for whole network, multiple ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the User and Access Services. Phone: (312) 290 1298
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy