University of Victoria (Canada)
Constructing Polar Codes Using Iterative Bit-Channel Upgrading
Abstract
dc:description.abstractThe definition of polar codes given by Arikan is explicit, but the construction complexity is an issue. This is due to the exponential growth in the size of the output alphabet of the bit-channels as the codeword length increases. Tal and Vardy recently presented a method for constructing polar codes which controls this growth. They approximated each bit-channel with a “better” channel and a “worse” channel while reducing the alphabet size. They constructed a polar code based on the “worse” channel and used the “better” channel to measure the distance from the optimal channel. This thesis considers the knowledge gained from the perspective of the “better” channel. A method is presented using iterative upgrading of the bit-channels which successively results in a channel closer to the original one. It is shown that this approach can be used to obtain a channel arbitrarily close to the original channel, and therefore to the optimal construction of a polar code.
Degree
thesis:*- Level thesis:degree_level
- Master of Applied Science M.A.Sc.
- Department thesis:degree_department
- Department of Electrical and Computer Engineering
- Year dc:date.issued
- 2013
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Ghayoori, Arash
- Advisor dc:contributor.supervisor
-
- Gulliver, T. Aaron
Subjects
dc:subject × 8Rights
dc:rights- Statement dc:rights
-
- Available to the World Wide Web
- Language dc:language.iso
- en, English
Identifiers
dc:identifier.*- Dc Identifier Citation
-
A. Ghayoori, T. A. Gulliver, "Constructing Polar Codes Using Iterative Bit-Channel Upgrading," Available: http://arxiv.org/abs/1302.5153
A. Ghayoori, T. A. Gulliver, "Upgraded Approximation of Non-Binary Alphabets for Polar Code Construction," Available: http://arxiv.org/abs/1304.1790