Journal
IEEE COMMUNICATIONS LETTERS
Volume 13, Issue 7, Pages 519-521Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LCOMM.2009.090428
Keywords
Channel polarization; polar codes; code construction; belief propagation; density evolution
Categories
Funding
- MEXT, Japan [18079010]
- Grants-in-Aid for Scientific Research [18079010] Funding Source: KAKEN
Ask authors/readers for more resources
Polar coding, proposed by Arikan, makes it possible to construct capacity-achieving codes for symmetric binary-input discrete memoryless channels, with low encoding and decoding complexity. Complexity of the originally proposed code construction method, however, grows exponentially in the blocklength unless a channel is the binary erasure channel. Recently, the authors have proposed a new capacity-achieving code construction method with linear complexity in the blocklength for arbitrary symmetric binary-input memoryless channels. In this letter, we evaluate performance of polar codes designed with the new construction method, and compare it with that of the codes constructed with another heuristic method with linear complexity proposed by Arikan.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available