• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Special Issue on Advances in Channel Coding

      Thumbnail
      View / Download
      973.5 Kb
      Author(s)
      Arikan, E.
      Lentmaier, M.
      Montorsi, G.
      Date
      2015
      Source Title
      Journal of Communications and Networks
      Print ISSN
      1229-2370
      Publisher
      Korean Institute of Communication Sciences
      Volume
      17
      Issue
      4
      Pages
      325 - 327
      Language
      English
      Type
      Editorial
      Item Usage Stats
      206
      views
      210
      downloads
      Abstract
      Since the invention of turbo codes in 1993 there has been an enormous interest and progress in the field of capacity approaching code constructions. Many classical constructions have been replaced by newer, better performing codes with feasible decoding complexity. Most of these modern code constructions, such as turbo codes, Gallager's low-density parity-check (LDPC) codes and their generalizations, can be modeled by sparse graphical models. Spatial coupling of sparse graphical models has in the last years attracted a lot of interest due to the threshold saturation phenomenon, which leads to capacity achieving performance with iterative message passing decoding. Polar codes are a recently discovered class of capacity achieving codes that are formed by an explicit construction based on a phenomenon called channel polarization. These codes, too, have various low-complexity decoding algorithms based on message passing on a sparse graph that has a recursive structure similar to that of fast transforms in signal processing.
      Keywords
      Channel coding
      Iterative decoding
      Signal processing algorithms
      Communication systems
      Algorithm design and analysis
      Permalink
      http://hdl.handle.net/11693/37980
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/JCN.2015.000062
      Collections
      • Department of Electrical and Electronics Engineering 3868
      Show full item record

      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 site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

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