Cart (Loading....) | Create Account
Close category search window

Practical polar code construction over parallel channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chen, K. ; Key Laboratory of Universal Wireless Communications, Ministry of Education Beijing University of Posts and Telecommunications, Beijing 100876, People's Republic of China ; Niu, K. ; Lin, J.-R.

Channel polarisation results are extended to the case of communications over parallel channels, where the channel state information is known to both the encoder and decoder. Given a set of parallel binary-input discrete memoryless channels (B-DMCs), by performing the channel polarising transformation over independent copies of these component channels, we obtain a second set of synthesised binary-input channels. Similar to the single-channel case, we prove that as the size of the transformation goes infinity, some of the resulting channels tend to completely noised, and the others tend to noise-free, where the fraction of the latter approaches the average symmetric capacity of the underlying component channels. For finite-length polar coding over parallel channels, performance is found to be relied heavily on the specific channelmapping scheme. To avoid exhaustive searching, an empirically good scheme that is called equal-capacity partition channel mapping is proposed and numerical results show that the proposed scheme significantly outperforms random mapping. Further, utilising the above results, a polar coding method for arbitrary code length is proposed, which has potential applications in practical systems.

Published in:

Communications, IET  (Volume:7 ,  Issue: 7 )

Date of Publication:

May 1 2013

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.