Please use this identifier to cite or link to this item:
Title: Channel Polarization: A Method for Constructing Capacity-Achieving Codes
Authors: Chuai, Jie (揣捷)
Department: Department of Electronic Engineering
Issue Date: 2011
Supervisor: Supervisor: Prof. Li, Ping; Assessor: Dr. Dai, Lin
Subjects: Coding theory.
Description: Nominated as OAPS (Outstanding Academic Papers by Students) paper by Department in 2011-12.
Citation: Chuai, J. (2011). Channel Polarization: A method for constructing capacity‐achieving codes (Outstanding Academic Papers by Students (OAPS)). Retrieved from City University of Hong Kong, CityU Institutional Repository.
Abstract: According to Shannon's Theorem, the possible code rate of a noisy channel is limited by the channel capacity; and there exist coding methods that could achieve the capacity of noisy channels. A method, called channel polarization (or polar coding), proposed by Erdal Arikan, was the first one mathematically proved to be capacity-achieving for symmetric binary-input discrete memoryless channels (B-DMC). In this project, the algorithm of this polar coding method was studied, and a simulation package was produced to evaluate its performance. Channels including Binary Erasure Channel (BEC), Binary Symmetric Channel (BSC) and Additive White Gaussian Noise channel (AWGN) were assumed in the simulation. As shown by the simulation results, for a give coding block length N=2n the polar coding method re-allocated the capacities over the channels, so that the equivalent channel capacities at different bit locations polarized as the coding block length becomes large; and the block error rate obtained in the simulation agreed with the bound given by Erdal Arikan in his paper. These results supported the capacity-achieving performance of the polar coding method.
Appears in Collections:Electronic Engineering - Undergraduate Final Year Projects
OAPS - Dept. of Electronic Engineering

Files in This Item:
File SizeFormat 
fulltext.html147 BHTMLView/Open

Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.