Presentation 2009-12-01
Channel polarization and polar codes
Toshiyuki TANAKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A new family of codes, called polar codes, has recently been proposed by Arikan, as an answer to the problem of constructing a channel coding method with low-complexity encoding and decoding, along with the capacity-achieving property. The computational complexity is O(N log N) for encoding as well as decoding of polar codes, where N is the codelength. Polar codes are also proved to asymptotically saturate symmetric capacity of an arbitrary binary-input memoryless channel. We discuss basic properties of polar codes, including channel polarization, which is the basis of polar codes and their capacity-achieving property, and review research activities of polar codes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) polar code / channel polarization / channel coding / channel capacity
Paper # IT2009-50
Date of Issue

Conference Information
Committee IT
Conference Date 2009/11/24(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Channel polarization and polar codes
Sub Title (in English)
Keyword(1) polar code
Keyword(2) channel polarization
Keyword(3) channel coding
Keyword(4) channel capacity
1st Author's Name Toshiyuki TANAKA
1st Author's Affiliation ()
Date 2009-12-01
Paper # IT2009-50
Volume (vol) vol.109
Number (no) 314
Page pp.pp.-
#Pages 8
Date of Issue