A Class of Transformations that Polarize Binary-Input Memory less Channels

A generalization of Arikan's polar code construction using transformations of the form G(circle times n) where G is an l x l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is shown that a large class of such transformations polarize binary-input memoryless channels.


Published in:
2009 Ieee International Symposium On Information Theory, Vols 1- 4, 1478-1482
Presented at:
IEEE International Symposium on Information Theory (ISIT 2009), Seoul, SOUTH KOREA, Jun 28-Jul 03, 2009
Year:
2009
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
Laboratories:




 Record created 2010-11-30, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)