Lossless Source Coding with Polar Codes

In this paper lossless compression with polar codes is considered. A polar encoding algorithm is developed and a method to design the code and compute the average compression rate for finite lengths is given. It is shown that the scheme achieves the optimal compression rate asymptotically. Furthermore, the proposed scheme has a very good performance at finite lengths. Both the encoding and decoding operations can be accomplished with complexity O(N logN) where N denotes the length of the code.


Published in:
2010 Ieee International Symposium On Information Theory, 904-908
Presented at:
2010 IEEE International Symposium on Information Theory, Austin, TX, Jul 13, 2010
Year:
2010
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-6960-4
Keywords:
Laboratories:




 Record created 2011-12-16, last modified 2018-09-13


Rate this document:

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